When $2^\alpha = 2^\beta$ implies $\alpha=\beta$ ($\alpha,\beta$ cardinals)

Question

Sorry if this is a silly question. I was wondering, under what axioms of set theory is it true that if $\alpha$,$\beta$ are cardinals, and $2^\alpha=2^\beta$, then $\alpha=\beta$? Do people use these conditions to prove interesting results?

This question is prompted from a recent perusing of Johnson's "Topics in the Theory of Group Presentations", where in the first few pages he "proves" free groups of different rank are non-isomorphic: the number of mappings from a free group of rank $\omega$ to the group $\mathbb{Z}/2\mathbb{Z}$ is $2^\omega$, which would be invariant under isomorphism; and then he assumes the topic of my question: $2^\alpha=2^\beta$ implies $\alpha=\beta$.

But I remember reading something a few years ago about a student of R.L. Moore (I only remember his last names was Jones) "proving" the Moore Space conjecture, and using that $\alpha > \beta$ implied $2^\alpha > 2^\beta$, but that this was incorrect.

Anyway, I realized I don't know anything about when this is true or false, so I thought I'd ask.

Answer 1

François gives the correct affirmative answer. For the negative side, the usual method of proving that the negation of the Continuum Hypothesis is consistent with ZFC is to use the method of forcing to add Aleph₂ many Cohen reals, so that 2^ω = ω₂ in the forcing extension V[G]. In this model V[G], it is also true that 2^ω₁ = ω₂. Thus, this model shows that it is not necessarily true that different-sized sets have different sized power sets. The case of symmetric groups is likely more interesting than free groups, because in this model, the symmetric groups S_ω and S_ω1 have the same cardinality ω₂. Nevertheless, these two groups are not isomorphic, as explained in this MO question.

The general answer about what can be true for the continuum function κ --> 2^κ is exactly provided by Easton's Theorem. This remarkable theorem states that if you have any class function E, defined on the regular cardinals κ, with the properties that

• κ ≤ λ implies E(κ) ≤ E(λ)
• κ < E(κ)
• κ < Cof(E(κ))

then there is a forcing extension V[G] in which 2^κ = E(κ) for all regular cardinal κ. In particular, this shows that the sizes of the power sets (on regular cardinals) are restricted to obey only and exactly the hypotheses listed explicitly above. Each of these properties corresponds to a well-known fact about cardinal exponententiation.

Using Easton's theorem, we can build models of set theory where 2^κ = κ⁺⁺ for all regular κ. The added power of the Woodin/Foreman result mentioned by François is that they also get this for singular cardinals.

The point now is that there are innumerable examples provided by Easton's theorem that satisfy your hypothesis that the continuum function is one-to-one. If one begins with a model of GCH and selects any injective Easton function E, then the resulting model of set theory V[G] will have E as it's continuum function κ --> 2^κ = E(κ) for regular κ, and the GCH will continue to hold at singular κ, preserving injectivity. So one is quite free to satisfy your hypothesis while having any kind of crazy failures of GCH.

Answer 2

The Generalized Continuum Hypothesis, i.e. $2^\kappa = \kappa^+$ for every infinite cardinal $\kappa$, implies the desired result, but it can hold in other circumstances. For example, Woodin has shown that it is relatively consistent with the existence of a supercompact cardinal that $2^\kappa = \kappa^{++}$ for every infinite cardinal $\kappa$. (See Foreman and Woodin, The generalized continuum hypothesis can fail everywhere, Annals of Mathematics 133, 1991, 1-35.)

The statement $2^{\aleph_0} < 2^{\aleph_1}$ is known as the Weak Diamond Principle. This principle was introduced by Devlin and Shelah (A weak version of $\diamondsuit$ which follows from $2^{\aleph_{0}}<2^{\aleph_{1}}$, Israel J. Math. 29, 1978, 239-247). This principle has been very useful as a substitute for stronger enumeration principles such as the Continuum Hypothesis and Jensen's Diamond Principle $\diamondsuit$. I think the Weak Diamond Principle was inspired by Shelah's work on the Whitehead Problem (which may be related to your group theoretic application).

Answer 3

One thing that is made very easy by assuming that $2^\alpha < 2^\beta$ whenever $\alpha <\beta$ is showing that for sets $S_1$ and $S_2$ of different cardinalities, the Banach spaces $\ell_\infty(S_1)$ and $\ell_\infty(S_2)$ are not isomorphic. This follows immediately from the fact that for an infinite set $S$, the smallest possible cardinality of a dense subset of $\ell_\infty(S)$ is $2^{|S|}$.

If one does not assume that $2^\alpha = 2^\beta$ implies $\alpha =\beta$, then one must revert to some other argument. I have not thought about this problem at length, so there may be much simpler reasons why $\ell_\infty(S_1)$ and $\ell_\infty(S_2)$ cannot be isomorphic when $S_1$ and $S_2$ have different cardinalities (without assuming $2^\alpha = 2^\beta\Rightarrow\alpha =\beta$), but one way is to instead consider the least possible cardinality of a norm dense subset of an arbitrary weakly compact subset of $\ell_\infty(S)$. In this case, a result of Haskell Rosenthal asserts that for $S$ infinite and a weakly compact set $W \subseteq \ell_\infty (S)$, $W$ admits a norm dense subset of cardinality no greater than $|S|$. On the other hand, a standard argument shows that $\ell_2 (S)$ (in fact, any Banach space of density character not exceeding $|S|$) is isomorphic to a subspace of $\ell_\infty (S)$ (generalise the standard argument that every separable Banach space embeds into $\ell_\infty$). Thus, if $\alpha$ and $\beta$ are cardinals with $\alpha <\beta$, then $\ell_2 (\beta )$ is isomorphic to a subspace of $\ell_\infty (\beta )$, but not to a subspace of $\ell_\infty (\alpha)$. Hence $\ell_\infty (\alpha )$ and $ \ell_\infty (\beta)$ are not isomorphic.

The result of Rosenthal cited above is from his paper "On injective Banach spaces and the spaces $L_\infty (\mu )$ for finite measures $\mu$".

Answer 4

François's and Joel's answers to the general question are correct.

As for the "dimension of a free group is uniquely determined, even if it's infinite", there's a better argument. Let G be a free group on two sets of generators x and y; we wish to show |x| = |y|. First let A = G_ab be the free abelian group on generators x and y; then let V = A ⊗_Z F₂ be the vector space over F₂ with bases x and y, so that |V| = 2^|x| = 2^|y| (strike that, it's false for infinite cardinalities). (We could use any field here, but the argument is more intricate.)

If |V| is finite, then |x| = |y| follows immediately. So suppose |V| is infinite, so that |x| and |y| are infinite. Each element of x is the sum of finitely many elements of y, and every element of y must show up in at least one such sum (why?). This means |y| ≤ |x|•ℵ₀ = |x| (cardinal arithmetic). Similarly |x| ≤ |y|, so |x| = |y|.