Cardinal Arithmetic, Exponentiation, and Hierarchy

Core Idea

Cardinal addition and multiplication of infinite cardinals collapse: for any infinite cardinal κ, κ + κ = κ and κ · κ = κ. Cardinal exponentiation 2^κ is the cardinality of P(κ), always strictly larger than κ by Cantor's theorem. This creates an infinite hierarchy: κ < 2^κ < 2^{2^κ} < ...

How It's Best Learned

Verify collapse laws: |ℕ| + |ℕ| = |ℕ|, |ℕ| · |ℕ| = |ℕ|. Prove 2^ℵ₀ > ℵ₀ by Cantor's diagonal argument. Build the beth hierarchy to see increasingly larger infinities via exponentiation.

Common Misconceptions

• Assuming κ + κ ≠ κ for infinite κ based on finite intuition. - Thinking 2^κ is just 'slightly larger' than κ. - Confusing cardinal and ordinal arithmetic operations and properties.

Explainer

You already know the aleph hierarchy: ℵ₀ is the cardinality of the natural numbers, ℵ₁ is the next uncountable cardinal, and so on. You also know that two sets have the same cardinality when there is a bijection between them. With those tools in hand, cardinal arithmetic — addition, multiplication, and exponentiation of infinite cardinals — can be defined precisely, and the results are startling from the perspective of finite arithmetic.

Cardinal addition and multiplication collapse for infinite cardinals. For any infinite cardinal κ, κ + κ = κ and κ · κ = κ. These are provable bijections, not handwaving: you already know that ℕ ∪ ℕ bijects with ℕ (interleave the two copies), and that ℕ × ℕ bijects with ℕ (the Cantor pairing function). The same argument scales to any infinite cardinal using the well-ordering of cardinals and a transfinite version of the pairing argument. This means infinite cardinal arithmetic for addition and multiplication is *trivial*: any finite sum or product of copies of κ is still κ. The infinite destroys the additive and multiplicative structure we expect from finite numbers.

Cardinal exponentiation is the exception where new cardinals genuinely appear. 2^κ is defined as the cardinality of the set of all functions from κ into {0, 1} — equivalently, the cardinality of P(κ), the power set of κ. Cantor's theorem (which you know) states that |P(A)| > |A| for any set A, so 2^κ > κ strictly. This gives the beth hierarchy: ℶ₀ = ℵ₀, ℶ₁ = 2^ℶ₀ = 2^ℵ₀ (the cardinality of the reals), ℶ₂ = 2^ℶ₁, and so on. Each beth is strictly larger than the previous, and each is obtained by taking the power set of the last. The beth hierarchy grows *much* faster than the aleph hierarchy via successor steps, though the relationship between specific alephs and beths (e.g., is 2^ℵ₀ = ℵ₁?) is the content of the Continuum Hypothesis, which is independent of ZFC.

The hierarchy 2^κ < 2^{2^κ} < 2^(2^{2^κ}) < ... is an infinite strictly ascending sequence of cardinals, all produced by iterated exponentiation starting from any infinite κ. This tower grows faster than any cardinal-successor operation can reach: even ℵ_ω (the limit of ℵ₀, ℵ₁, ℵ₂, ...) might be much smaller than 2^ℵ₀ under some set-theoretic assumptions. Cardinal exponentiation is the engine of infinity-generation in set theory: it is the one operation that always produces something genuinely new, and its behavior is where set theory's deep independence results — including the Continuum Hypothesis — are concentrated.