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.
The indexed delta-system lemma
Statement
In ZFC, for any family of finite sets, there are an uncountable and a finite set such that whenever are distinct. The sets may repeat.
Facts & Assumptions
Given: The indexed family above; assume AC, including countable choice.
The finite delta-system theorem applies to a family of distinct finite sets at regular uncountable . The finite delta-system lemma at a regular uncountable cardinal
Under countable choice a countable union of countable sets is countable. Countable unions of at most countable sets, assuming
Under countable choice no countable subset of is cofinal in it. Assuming countable choice: every at most countable subset of is bounded below , so no at most countable subset of is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable
The indexed delta condition allows repeated values. Delta systems and roots
Assume AC. The Axiom of Choice
Proof
If some finite set has uncountable fiber , put . For distinct one has . This includes the case .
Otherwise every fiber is countable. Let . If were countable, enumerate its values and apply F2 to their countable fibers; their union is all of , which is uncountable. Hence is uncountable. The map injects into , so . AC supplies the countable choice used in F2; the least-index map itself needs no choices.
Every ordinal below is countable; F3 therefore excludes every cofinal subset of cardinality below . Thus is regular, and F1 gives an uncountable delta subsystem with finite root . Set . The map is injective, so is uncountable, and distinct indices in represent distinct members of , whose intersection is . Together with the repeated-value alternative this proves the indexed assertion.
Depends on
- The finite delta-system lemma at a regular uncountable cardinal
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- Assuming countable choice: every at most countable subset of $\omega_1$ is bounded below $\omega_1$, so no at most countable subset of $\omega_1$ is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable
- Delta systems and roots
- The Axiom of Choice
Used by
Dependency tree · two levels
25 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Monk, Set theory following Jech (2024), Theorem 9.20, printed pp77–78; indexed repetition argument supplied locally (standard reference, not scraped)