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.
Intersections of fewer than the cofinality many clubs
Statement
In ZFC, let and let be clubs of , with . Then is club, taking the empty intersection to be . In particular fewer than clubs intersect to a club on regular uncountable .
Facts & Assumptions
Closure points form a club: Nondecreasing maps on an ordinal of uncountable cofinality have club many closure points.
; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained: Fewer than the cofinality many ordinals below theta have supremum below theta.
Closed unbounded subsets of ordinals: A club contains all its nonzero limit points below the ambient ordinal.
Proof
Given: The objects and hypotheses in the statement.
For , the intersection is , which is closed and unbounded in itself. For , let and . The supremum is below , and is nondecreasing and strictly above its argument.
The nonzero closure points of are unbounded by the closure lemma. For every and , . Thus is unbounded in ; is a nonzero limit and belongs to each . This proves unboundedness of the intersection.
If is a nonzero limit point of the intersection, it is a limit point of each , hence lies in each. This proves closure; the case is included. Specializing gives the last assertion.
Depends on
- Closure points form a club
- Closed unbounded subsets of ordinals
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
Used by
Dependency tree · two levels
22 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
- Lietz, Lemma 5.6, pp.40–41 (standard reference, not scraped)
- Vasey, Theorems 14.5 and 14.8, pp.80–81 (standard reference, not scraped)