blackroad-os/simulation-theory
9
0
Fork 0
mirror of https://github.com/blackboxprogramming/simulation-theory.git synced 2026-03-17 00:57:19 -05:00
Code Issues Packages Projects Releases Wiki Activity

Update infinite-infinities.md

Browse Source 
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
This commit is contained in:
Alexa Amundson
2026-02-27 11:54:51 -06:00
committed by GitHub
parent 7cade1c311
commit aefe2d43cc
1 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
proofs/infinite-infinities.md
View File

@@ -59,11 +59,15 @@ No function A → P(A) is surjective. Therefore |P(A)| > |A|. **□**
**Proof:**
ℵ₀ = |ℕ|. By Lemma 1, |P(ℕ)| > ℵ₀. Define ℵ₁ = the least cardinal greater than ℵ₀
(its existence follows from the Well-Ordering Theorem / Axiom of Choice).
ℵ₀ = |ℕ|. By Lemma 1, |P(ℕ)| > ℵ₀. Working in ZF, there is a least uncountable
ordinal, usually denoted ω₁; its cardinality is the first uncountable cardinal,
which we call ℵ₁.
By induction: given ℵ_α, define ℵ_{α+1} = the least cardinal greater than ℵ_α.
At limit ordinals λ: ℵ_λ = sup_{α<λ} ℵ_α.
More generally, define the alephs as initial ordinals: given ℵ_α, let ℵ_{α+1} be
the least ordinal whose cardinality is strictly greater than |ℵ_α|; at limit
ordinals λ, set ℵ_λ = sup_{α<λ} ℵ_α. (If we assume the Axiom of Choice, every
set can be well-ordered, and every infinite cardinal is the cardinality of a
unique initial ordinal, so the sequence (ℵ_α)_α enumerates all infinite cardinals.)
The sequence ℵ₀, ℵ₁, ℵ₂, ... is strictly increasing. **□**