The last kiss

April 27, 2008

I do not really have much to say about this movie; I found it kind of mediocre. It presents itself as more than it ends up being, and rather than having characters that face their problems in interesting or challenging ways, it felt dissapointing, a bit cliched. It is not a bad movie, though. I suppose there are worst ways of spending two hours. 


God grew tired of us

April 27, 2008

This is an excellent documentary about a horrible ongoing tragedy. But there is a lot of hope in the story; John Bul Dau, one of the “lost boys of Sudan” the movie is about, is inspirational, a great leader. In the midst of all their suffering, I could not believe how much energy and optimism he displayed. He is truly an admirable person.

Part of the documentary follows several kids that are relocated to the States (thanks to Catholic Charities International). I found particularly interesting to see the culture clash that the group suffers, arriving to and having to survive in the States with what looks like very little assistance.  

Although they are very grateful, we learn that the older ones have to hold one or two jobs in order to pay back the cost of their move. Of course, the jobs they find are not particularly appealing or well paid, plus they have to face discrimination and ignorance. The younger ones, on the other hand, get to go to school and several of them try very quickly to absorb the American life style, leaving behind their roots and traditions, which leads to an interesting clash with people like John Bul Dau, who makes every effort to keep their memory and connections alive.

I highly recommend this moving and sobering documentary.


116c- Lecture 8

April 24, 2008

We defined infinite sums and products and showed that if \max{2,\kappa_i}\le\lambda_i for all i\in I, then \sum_{i\in I}\kappa_i\le\prod_{i\in I}\lambda_i.

We also showed that if (\kappa_i:i<\mbox{cf}(\kappa)) is an increasing sequence of cardinals cofinal in \kappa, then \prod_{i\in\mbox{\small cf}(\kappa)}\kappa_i=\kappa^{\mbox{\small cf}(\kappa)}. In particular, \prod_n\aleph_n=\aleph_\omega^{\aleph_0}.

We defined singular cardinals and showed that (with choice) all successor cardinals are regular and all limit cardinals \aleph_\alpha are singular unless \alpha=\aleph_\alpha. We showed that, indeed, there are fixed points of the aleph function, as a particular case of a result about normal functions. We defined (weakly) inaccessible cardinals as the regular limit cardinals (thus, regular fixed points of the aleph function).

Correction. I believe during lecture I mixed two arguments by mistake, making one of the proofs come out unnecessarily confusing, so I will present the correct argument here, for clarity.

In lecture we showed that if F is a normal function, then it has a proper class of fixed points. Thus, we can enumerate them in increasing order. Let G be this enumeration.

Claim. G was also normal.

Proof. We need to check that G is continuous. Let \gamma be a limit ordinal and suppose that \tau=\sup_{\beta<\gamma}G(\beta). We need to show that G(\gamma)=\tau.

By definition, this means that:

  1. \tau is a fixed point of F, and
  2. \tau is the \gamma-th fixed point of F.

But, clearly, if \tau is a fixed point, then it must be the \gamma-th one, since we have already enumerated \gamma fixed points below \tau, and any fixed point below \tau is below some G(\beta) with \beta<\gamma, so it is not even the \beta-th one.

So we only need to check that F(\tau)=\tau. But \tau=\sup_{\beta<\gamma}G(\beta) and each G(\beta) is a fixed point of F (again, by definition of G), so \tau=\sup_{\beta<\gamma}F(G(\beta))=F(\sup_{\beta<\gamma}G(\beta))=F(\tau), where the previous to last equality is by continuity of F. {\sf QED}

It follows that G itself has a proper class of fixed points. It is also the case that there is a proper class of fixed points of F that are limits of fixed points of F: Simply notice that the argument above shows that any limit of fixed points of F is itself a fixed point. Thus, we have:

Corollary. The function H:{\sf ORD}\to{\sf ORD} enumerating the limit points of G (i.e., the fixed points of F that are themselves limit of fixed points) is normal.

I believe during lecture I mixed at some point H and G (although I never explicitly mentioned H). Hopefully the above clarifies the argument. For the particular case of F(\alpha)=\aleph_\alpha, we have that G enumerates the ordinals \alpha such that \alpha=\aleph_\alpha, so G(0) is the first such cardinal. The function H enumerates the limit points of G, so H(0)=G(\omega). Notice that \mbox{cf}(H(0))=\mbox{cf}(G(\omega))=\omega. One can easily see that if \kappa is a weakly inaccessible cardinal, then \kappa is a fixed point of F, G and H.

In fact, define F_0(\alpha)=\aleph_\alpha for all \alpha, let F_{\beta+1} be the enumeration of the fixed points of F_\beta, and let F_\gamma (for \gamma limit) enumerate the ordinals \kappa that are simultaneously fixed points of all the F_\beta for \beta<\gamma. Then, if \kappa is weakly inaccessible, then F_\alpha(\kappa)=\kappa for all \alpha<\kappa.

Remark.

  1.  We did not prove that weakly inaccessible cardinals exist. The examples given in lecture of fixed points of the aleph function have cofinality \omega and, similarly, we can produce fixed points of arbitrarily large cofinality, but the argument falls short of finding regular fixed points (in fact, we can show that each F_\alpha as defined above is normal, but the argument does not show that we can “diagonalize” to obtain a \kappa fixed for all F_\alpha with \alpha<\kappa). In fact, it is consistent with {\sf ZFC} that all limit cardinals are singular. However, it is the general consensus among set theorists that the existence of inaccessible cardinals is one of the axioms of set theory that the original list {\sf ZFC} somehow missed.
  2. We defined normal functions as proper classes; however, we can as well define for any ordinal \alpha a function F:\alpha\to{\sf ORD} to be normal iff it is strictly increasing and continuous. The same argument as in lecture (or above) then shows that if \mbox{cf}(\kappa)>\omega and F:\kappa\to\kappa is normal, then there is a closed and unbounded subset of \kappa consisting of fixed points of F. It turns out that closed unbounded sets are very important in infinitary combinatorics, and we will study them in more detail in subsequent lectures.

116c- Lecture 7

April 22, 2008

We presented the proof that “k-trichotomy” implies choice. The following is still open:

Question. ({\sf ZF}) Assume that X is non-well-orderable. Is there a countably infinite family of pairwise size-incomparable sets?

We mentioned a few (familiar) statements that fail in the absence of choice, like the existence of bases for any vector space, Tychonoff’s theorem, or the “surjective” version of the Schröder-Bernstein theorem.

We defined addition, multiplication and exponentiation of cardinals, and verified that addition and multiplication are trivial. We stated the continuum hypothesis {\sf CH}, and the generalized continuum hypothesis {\sf GCH}.

We want to prove (in subsequent lectures) a few non-trivial results about the behavior of exponentiation. In order to do this, we need the key notion of cofinality. We proved a few basic facts about cofinality and defined regular cardinals.


116c- Homework 3

April 22, 2008

Homework 3.

Update. Now due Wednesday, April 30 at 2:30 pm.

Corrections. (Thanks to Fedor Manin for noticing these.)

  • On Exercise 2.(c), assume in addition that (\lambda,\alpha) satisfies the conditions of (\alpha,\beta) in item 2.(a); this should really be all that is needed of 2.(c) for later parts of the exercise.
  • On Exercise 2.(f), we also need n>0.

Update. Here is a quick sketch of the proof of the Milner-Rado paradox.

First notice that the result is clear if \kappa=\omega, since we can write any \alpha<\omega_1 as a countable union of singletons. So we may assume that \kappa is uncountable.

Notice that |\kappa^{\cdot\rho}|=\kappa. This can be checked either by induction on \rho<\kappa^+, or by using the characterization of ordinal exponentiation in terms of functions of finite support.

Notice that the function \alpha\mapsto\omega^{\cdot \alpha} is normal. By the above, it follows that \omega^{\cdot\lambda}=\lambda for all uncountable cardinals \lambda. In particular, it suffices to prove the result for ordinals \alpha that are an ordinal power of \kappa, since these ordinals are cofinal in \kappa^+, and a representation as desired for an ordinal gives (by restriction) such a representation for any smaller ordinal.

By the above, \kappa^{\cdot\rho}=\omega^{\cdot\kappa\cdot\rho} for any \rho. It is easy to see that for any \delta, if \alpha<\omega^{\cdot\delta}, then the interval \null[\alpha,\omega^{\cdot\delta}) is order isomorphic to \omega^{\cdot\delta}; this can be proved by a straightforward induction on \delta.

For any \alpha<\kappa^+, we can write \kappa^{\cdot\alpha+1}=\bigcup_{\nu<\kappa}A_\nu, where A_\nu=[\kappa^{\cdot \alpha}\cdot\nu,\kappa^{\cdot\alpha}\cdot(\nu+1)) so it has order type \kappa^{\cdot\alpha}.

Also, if \alpha is a limit ordinal below \kappa^+, then we can write \alpha=\sup_{\nu<\mbox{\small cf}(\alpha)}\beta_\nu for some strictly increasing continuous sequence (\beta_\nu:\nu<\mbox{cf}(\alpha)) cofinal in \alpha. Let A_0=\kappa^{\cdot\beta_1} and A_\nu=[\kappa^{\cdot\beta_\nu},\kappa^{\cdot\beta_{\nu+1}}) for 0<\nu<\mbox{cf}(\alpha). Then \kappa^{\cdot\alpha}=\bigcup_\nu A_nu and each A_\nu has order type \kappa^{\cdot\beta_{\nu+1}}.

[That the sequence \beta_\nu is continuous (at limits) ensures that the A_\nu cover \kappa^{\cdot \alpha}. That they have the claimed order type follows from the “straightforward inductive argument” three paragraphs above.]

So we have written each \kappa^{\cdot\rho} as an increasing union of \sigma many intervals whose order types are ordinal powers of \kappa, and \sigma is either \kappa or \mbox{cf}(\rho). Now proceed by induction. We may assume that each ordinal below \kappa^{\cdot\rho} can be written as claimed in the paradox. In particular, each A_\nu, having order type an ordinal smaller than \kappa^{\cdot\rho}, can be written that way, say A_\nu=\bigcup_n A_{\nu,n} where \mbox{ot}(A_{\nu,n})<\kappa^{\cdot n}. If \sigma=\omega, this immediately gives the result for \kappa^{\cdot\rho}: Take X_0=\emptyset and X_{2^m(2n+1)}=A_{m,n}. Clearly their union is \kappa^{\cdot\rho} and they have small order type as required. If \sigma>\omega, take X_0=X_1=\emptyset and X_{n+2}=\bigcup_\nu A_{\nu,n}. Again, their union is \kappa^{\cdot\rho}, and \mbox{ot}(X_{n+2}) is at most the order type of concatenating \kappa many copies of \kappa^{\cdot n} [it is here that we use that A_\nu<A_\mu for \nu<\mu], so \mbox{ot}(X_{n+2})\le\kappa^{\cdot n+1}.


116c- Lecture 6

April 18, 2008

We revisited the proof of the Schröder-Bernstein theorem and showed how arguments using recursion can provide explicit fixed points for the required map. Recall that if f:A\to B and g:B\to A are injective, we consider the monotone map \pi:{\mathcal P}(A)\to{\mathcal P}(A) given by \pi(X)=A\setminus g[B\setminus f[X]], since if X is a  fixed point of \pi, then A\setminus X=g[B\setminus f[X]], and we obtain a bijection h:A\to B by setting h(x)=f(x) if x\in X and h(x)=g^{-1}(x) if x\in A\setminus X.

We also presented a combinatorial proof considering “paths” along the graphs of f and g (surely folklore, but apparently first recorded by Paul Cohen) and Cantor’s original argument (using choice).

We then started the proof of the equivalence (in {\sf ZF}) of several versions of choice:

  1. The well-ordering principle (our official version of {\sf AC}).
  2. The existence of choice functions f:{\mathcal P}(X)\setminus\{\emptyset\}\to X for any set X.
  3. Zorn’s lemma.
  4. Trichotomy: Given any sets A and B, one of them injects into the other. (Called trichotomy as it gives that either |A|=|B|, |A|<|B| or |B|<|A|.)
  5. k-trichotomy (for a fixed 2\le k\in\omega): Given any k sets, at least one of them injects into another.

(The proof that (5) implies (1) will be given in Tuesday.)


116c- Homework 2

April 16, 2008

Homework 2.

Due Tuesday, April 22 at 2:30 pm.