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.
Splitting turns an uncountable branch into an antichain
Statement
In ZFC, a splitting -tree with a cofinal branch has an antichain of cardinality . Normality is not additionally required. Here -tree has the meaning of κ-trees and the tree property.
Facts & Assumptions
Given: A splitting -tree and a cofinal branch .
Splitting gives at least two immediate successors of every node whose successor height is below the tree height. Normal and splitting trees
Every node has a unique predecessor of each smaller height; common predecessors are comparable, and strict order strictly increases height. Tree predecessors and compatibility
Assume AC, used to select off-branch successors at all levels simultaneously. The Axiom of Choice
Proof
For each , cofinality gives of height at least . If its height is greater, let be its unique predecessor of height ; otherwise set . Every is comparable with : if , use common-predecessor comparability, and if , use . Maximality of therefore puts in . Distinct nodes of the same height cannot both belong to a chain. Thus there is a unique for every . For , comparability and height give .
The node is an immediate successor of , since an intermediate node would have height strictly between and . Conversely every immediate successor of has height : if its height were larger, its predecessor at would lie strictly between and . Since , splitting makes nonempty. AC gives for every .
If , then . Were and comparable, their different heights would force . The two distinct nodes of height would then be predecessors of , contradicting uniqueness at that height. Thus are incomparable.
Consequently is an antichain. Its indexing is injective because , so it has cardinality . The argument includes and adjacent levels; all successor levels used remain below .
Depends on
Used by
Dependency tree · two levels
8 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
- Karagila, Axiomatic Set Theory, Exercise 9.6, printed p44 (local proof with splitting explicit) (standard reference, not scraped)