This is homework 3, due Monday, October 17, at the beginning of lecture.

Recall the Baire category theorem: The intersection of countably many dense open sets in a complete metric space is dense. Recall that a set is one that can be written as the intersection of countably many open sets.

Show that in a complete metric space, the intersection of countably many dense sets is again a dense set. Is the union of two sets again a set?

Show that is not a subset of .

Since is countable, we can enumerate it as . For let

Note that each is open, that for each , that , and that (for each ) the sum of the lengths of the intervals that make up is at most .

Does this mean that ? If yes, please provide a proof. If not, describe as concretely as possible an irrational number that belongs to this intersection.

Recall that a nowhere dense set is a set whose closure has empty interior: . A set is meager (or of the first category) iff it is the union of countably many nowhere dense sets. Given sets and in , we say that iff their symmetric difference is meager. For example, the Cantor set is nowhere dense.

Show that is an equivalence relation.

Show that if is meager, then any subset of is also meager. Show that the union of countably many meager sets is again meager.

Show that the Baire category theorem implies that any nonempty open subset of is non-meager.

Show that if is open, or closed, or a set, or a set (a countable union of closed sets), then there is an open set such that .

The Cantor-Bendixson derivative of a closed set is defined by

Since is closed, . We can iterate this operation, and form , Note we have

We can go even further, by letting and then continuing, by setting , etc.

Give examples of closed subsets of such that but , or but , or or but . Can be the first empty “derivative”? How about ?

Check that if and are compact, then so is as a subset of .

Show that if is a subset of that is both open and closed, and , then it must be the case that .

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Friday, October 7th, 2011 at 4:18 pm 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.

Craig: For a while, there was some research on improving bounds on the number of variables or degree of unsolvable Diophantine equations. Unfortunately, I never got around to cataloging the known results in any systematic way, so all I can offer is some pointers to relevant references, but I am not sure of what the current records are. Perhaps the first pape […]

Yes. Consider, for instance, Conway's base 13 function $c$, or any function that is everywhere discontinuous and has range $\mathbb R$ in every interval. Pick continuous bijections $f_n:\mathbb R\to(-1/n,1/n)$ for $n\in\mathbb N^+$. Pick a strictly decreasing sequence $(x_n)_{n\ge1}$ converging to $0$. Define $f$ by setting $f(x)=0$ if $x=0$ or $\pm x_n […]

(1) Patrick Dehornoy gave a nice talk at the Séminaire Bourbaki explaining Hugh Woodin's approach. It omits many technical details, so you may want to look at it before looking again at the Notices papers. I think looking at those slides and then at the Notices articles gives a reasonable picture of what the approach is and what kind of problems remain […]

The description below comes from József Beck. Combinatorial games. Tic-tac-toe theory, Encyclopedia of Mathematics and its Applications, 114. Cambridge University Press, Cambridge, 2008, MR2402857 (2009g:91038). Given a finite set $S$ of points in the plane $\mathbb R^2$, consider the following game between two players Maker and Breaker. The players alternat […]

Yes. This is a consequence of the Davis-Matiyasevich-Putnam-Robinson work on Hilbert's 10th problem, and some standard number theory. A number of papers have details of the $\Pi^0_1$ sentence. To begin with, take a look at the relevant paper in Mathematical developments arising from Hilbert's problems (Proc. Sympos. Pure Math., Northern Illinois Un […]

It is easy to see without choice that if there is a surjection from $A$ onto $B$, then there is an injection from ${\mathcal P}(B)$ into ${\mathcal P}(A)$, and the result follows from Cantor's theorem that $B

Only noticed this question today. Although the selected answer is quite nice and arguably simpler than the argument below, none of the posted answers address what appeared to be the original intent of establishing the inequality using the Arithmetic Mean-Geometric Mean Inequality. For this, simply notice that $$ 1+3+\ldots+(2n-1)=n^2, $$ which can be easily […]

First of all, $f(z)+e^z\ne 0$ by the first inequality. It follows that $e^z/(f(z)+e^z)$ is entire, and bounded above. You should be able to conclude from that.

Yes. The standard way of defining these sequences goes by assigning in an explicit fashion to each limit ordinal $\alpha$, for as long as possible, an increasing sequence $\alpha_n$ that converges to $\alpha$. Once this is done, we can define $f_\alpha$ by diagonalizing, so $f_\alpha(n)=f_{\alpha_n}(n)$ for all $n$. Of course there are many possible choices […]

I disagree with the advice of sending a paper to a journal before searching the relevant literature. It is almost guaranteed that a paper on the fundamental theorem of algebra (a very classical and well-studied topic) will be rejected if you do not include mention on previous proofs, and comparisons, explaining how your proof differs from them, etc. It is no […]