How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Assuming the Axiom of Choice, an infinite family E generates at most |E|^aleph-zero sets
Statement
Assume the Axiom of Choice. Let be infinite and put . Then
Facts & Assumptions
Given: The Axiom of Choice and an infinite family of cardinality .
Generated sigma-algebras are exhausted by the complement and countable-union stages below (Assuming countable choice, a generated sigma-algebra is obtained in omega-one stages of complements and countable unions).
Cardinal exponentiation is available under the Axiom of Choice; it is monotone in the base, monotone in the exponent for nonzero base, and satisfies (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations, Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into ).
For every infinite cardinal , (Hessenberg: for every infinite cardinal , proved in ZF from the canonical well-order of ), and smaller nonzero cardinals are absorbed by addition and multiplication with (Absorption: for cardinals with infinite and , , and when ).
Under the Axiom of Choice, is the cardinality of and is strictly larger than (Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: ).
The Axiom of Choice provides choice functions for arbitrary families of nonempty sets (The Axiom of Choice).
The ordinal is a cardinal and is the least uncountable ordinal ( is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF).
Proof
Put . Since , [L2] and [L4] give under [L5]; the minimality in [L6] therefore gives . Also is infinite.
Transfinite induction on the stages in [L1] gives . At the base, sending each member of to its constant sequence injects into . At a successor, complements contribute at most sets and sequences contribute at most by [L2] and [L3]. At a limit below , the predecessor set is countable by [L6], and [L5] chooses stagewise injections into ; hence the union has size at most by [L3].
Using [L5] to choose one injection of each stage into , the union of the stages has cardinal at most by step 1.1 and [L3]. By [L1] this union is , proving the bound.
Depends on
- Assuming countable choice, a generated sigma-algebra is obtained in omega-one stages of complements and countable unions
- The Axiom of Choice
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- Commutativity, associativity, distributivity and monotonicity of $\oplus$ and $\otimes$, the unit laws, the two exponent laws, and $\kappa \le \lambda$ if and only if $\kappa$ injects into $\lambda$
- Assuming the Axiom of Choice, $2^{\kappa} = \lvert \mathcal{P}(\kappa) \rvert$, and Cantor's theorem in cardinal form: $\kappa < 2^{\kappa}$
- Hessenberg: $\kappa \otimes \kappa = \kappa$ for every infinite cardinal $\kappa$, proved in ZF from the canonical well-order of $\kappa \times \kappa$
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- $\omega_1$ is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 104 results over 29 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- T. Tao, An Introduction to Measure Theory, Exercise 1.4.16 (standard reference, not scraped)