This set is due Monday, September 16, at the beginning of lecture.

Recall that . Given a sequence of nonnegative real numbers, for a finite subset of , the expression

has what is hopefully the obvious meaning: If is the increasing enumeration of the elements of , then

,

with the (standard) convention that if is empty, then .

For an arbitrary subset of (so may be finite or infinite), define

provided that the supremum exists. There is a small ambiguity here, in that if is finite, we have defined in two potentially conflicting ways.

1. Show that both definitions coincide if is finite.

2. Give an example of a sequence and a set such that is not defined. Show that for any and any , if is not defined, then neither is .

3. Show that, if is defined, then

.

More generally, show that, as long as is defined, then

and that, if this supremum exists, then so does , and the displayed equality holds.

4. Fix a positive integer . Show that if is such that, for every , has the form where then, for any , is defined, and is a number in the interval .

5. Show that for every and every positive integer there is some as in item 4. such that Describe as precisely as possible all the quadruples such that is an integer, , are sequences as in 4., and yet

Hopefully it is clear that all we are describing is the base representation of any number .

6. Indicate how to extend the above so any real has a base representation (for any ).

7. Given , let be the sequence with -th term for all . Show that is the only value of such that there are with Describe all such pairs . Show that for all there is some as in 4., with the same “failure of injectivity” property.

The above gives us that in the sense that there is an injection .

8. Make this explicit, that is, give an example of such an injection , hopefully related to these sums we are considering.

One can also show that and in fact there is a bijection between these two sets, though you do not need to do this here.

As indicated in item 7., when the function given by is not an injection.

9. For this , show that the collection of sets such that there is a set with is countable. Show that if is countable, then there is a bijection between and so, in particular, even allows us to verify that .

This entry was posted on Thursday, September 5th, 2013 at 11:21 am and is filed under 414/514: Analysis I. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

The technique of almost disjoint forcing was introduced in MR0289291 (44 #6482). Jensen, R. B.; Solovay, R. M. Some applications of almost disjoint sets. In Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968), pp. 84–104, North-Holland, Amsterdam, 1970. Fix an almost disjoint family $X=(x_\alpha:\alpha

At the moment most of those decisions come from me, at least for computer science papers (those with a 68 class as primary). The practice of having proceedings and final versions of papers is not exclusive to computer science, but this is where it is most common. I've found more often than not that the journal version is significantly different from the […]

The answer is no in general. For instance, by what is essentially an argument of Sierpiński, if $(X,\Sigma,\nu)$ is a $\sigma$-finite continuous measure space, then no non-null subset of $X$ admits a $\nu\times\nu$-measurable well-ordering. The proof is almost verbatim the one here. It is consistent (assuming large cardinals) that there is an extension of Le […]

I assume by $\aleph$ you mean $\mathfrak c$, the cardinality of the continuum. You can build $D$ by transfinite recursion: Well-order the continuum in type $\mathfrak c$. At stage $\alpha$ you add a point of $A_\alpha$ to your set, and one to its complement. You can always do this because at each stage fewer than $\mathfrak c$ many points have been selected. […]

Stefan, "low" cardinalities do not change by passing from $L({\mathbb R})$ to $L({\mathbb R})[{\mathcal U}]$, so the answer to the second question is negative. More precisely: Assume determinacy in $L({\mathbb R})$. Then $2^\omega/E_0$ is a successor cardinal to ${\mathfrak c}$ (This doesn't matter, all we need is that it is strictly larger. T […]

Yes, by the incompleteness theorem. An easy argument is to enumerate the sentences in the language of arithmetic. Assign to each node $\sigma $ of the tree $2^{

A simple example is the permutation $\pi$ given by $\pi(n)=n+2$ if $n$ is even, $\pi(1)=0$, and otherwise $\pi(n)=n−2$. It should be clear that $\pi$ is computable and has the desired property. By the way, regarding the footnote: if a bijection is computable, so is its inverse, so $\pi^{-1}$ is computable as well. In general, given a computable bijection $\s […]

The question is asking to find all polynomials $f$ for which you can find $a,b\in\mathbb R$ with $a\ne b$ such that the displayed identity holds. The concrete numbers $a,b$ may very well depend on $f$. A priori, it may be that for some $f$ there is only one pair for which the identity holds, it may be that for some $f$ there are many such pairs, and it may a […]

The reflection principle is a theorem schema in ZFC, meaning that for each formula $\phi(\vec x)$ we can prove in ZFC a version of the principle for $\phi$. In particular, it gives us that if $\phi$ holds (in the universe of sets) then there is some ordinal $\alpha$ such that $V_\alpha\models \phi$. It follows from this that (assuming its consistency) $\math […]

All proofs of the Bernstein-Cantor-Schroeder theorem that I know either directly or with very little work produce an explicit bijection from any given pair of injections. There is an obvious injection from $[0,1]$ to $C[0,1]$ mapping each $t$ to the function constantly equal to $t$, so the question reduces to finding an explicit injection from $C[0,1]$ to $[ […]

I’ve posted the TeX file for the homework, in case it is useful.

Note that on problem , is it implied that .

E.g.

For , , if we say , , we have

Oh, yes, that question came up not as intended. Thanks for noticing it. I’ve fixed the text.

Thank you!