This set is due Feb. 8 at the beginning of lecture. Of course, let me know if more time is needed or anything like that.

0. During lecture I have sometimes skipped some arguments or not given as much detail as you may have wanted. If there was a result that in particular required of you some effort to complete in detail, please state it here and show me how you filled in the gaps left in lecture. Also, if there is a result for which you do not see how to fill in the details, let me know as well, as I may have overlooked something and it may be worth going back over it in class.

1. Give an example of a bounded set for which

does not exist.

2. Compute .

3. From the book, solve exercises 1.1.3, 1.1.5, 1.1.6, and 1.1.15.

[To get you started on 1.1.3: First verify in that assigns value 0 to any point. For this, use monotonicity and translation invariance, arguing first that for any . Then find that in terms of , and use this to find for any box with rational coordinates. Use this to compute for any box, and conclude by analyzing arbitrary elementary sets.

Note we essentially solved 1.1.15 in class, but under the assumption that 1.1.6 holds.]

4. From the book, solve Exercises 1.1.7-10. Make sure to explain in 1.1.9 why Tao’s definition of compact convex polytopes coincides with what should be our intuitive definition. Please also verify that convex polytopes are indeed convex.

(For a nice argument verifying that indeed , at least for even values of , see the paper “On the volumes of balls” by Blass and Schanuel, available here.)

5. From the book, solve exercise 1.1.11.

(If you are not comfortable with linear algebra beyond size , at least argue in the plane and in .)

6. From the book, solve exercise 1.1.13.

7. From the book, solve exercise 1.1.17.

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Wednesday, January 25th, 2012 at 1:08 pm and is filed under 515: Analysis II. 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 […]

R. Solovay proved that the provably $\mathbf\Delta^1_2$ sets are Lebesgue measurable (and have the property of Baire). A set $A$ is provably $\mathbf\Delta^1_2$ iff there is a real $a$, a $\Sigma^1_2$ formula $\phi(x,y)$ and a $\Pi^1_2$ formula $\psi(x,y)$ such that $A=\{t\mid \phi(t,a)\}=\{t\mid\psi(t,a)\}$, and $\mathsf{ZFC}$ proves that $\phi$ and $\psi$ […]

Yes, the suggested rearrangement converges to 0. This is a particular case of a result of Martin Ohm: For $p$ and $q$ positive integers rearrange the sequence $$\left(\frac{(−1)^{n-1}} n\right)_{n\ge 1} $$ by taking the ﬁrst $p$ positive terms, then the ﬁrst $q$ negative terms, then the next $p$ positive terms, then the next $q$ negative terms, and so on. Th […]

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 […]

(I have added a missing prime in the hint on question 3.) Thanks to Tara for noticing it.