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 club filter and nonstationary ideal
Definition
In ZFC, assume . The club filter is . A set is stationary if it meets every club. It is nonstationary if disjoint from some club; these sets form .
A proper filter contains the ambient set, excludes the empty set, is upward closed, and is closed under finite intersections. These hold for : the ambient set is club, clubs are nonempty, and the small-intersection theorem gives a club inside each finite intersection. In fact it is closed under intersections of fewer than members: in ZFC choose a witnessing club for each member, then intersect them.
An ideal contains the empty set, is downward closed and closed under finite unions. Here iff , so complements give these axioms and closure under unions of fewer than members. The filter contains all supersets of clubs, which need not themselves be closed.
Depends on
Used by
- The club filter is never an ultrafilter Corollary
- The club filter is the least normal tail filter Corollary
- Cofinality strata, trace, and reflection Definition
- Normal filters on a regular cardinal Definition
- Stationary antichains modulo the nonstationary ideal Definition
- Basic stationary-set calculus Proposition
- Fodor’s pressing-down lemma Theorem
- Stationarity characterized by elementary initial segments Theorem
Dependency tree · two levels
4 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, Definition 5.7 and Lemma 5.6, pp.40–41 (standard reference, not scraped)
- Vasey, Definitions 14.6 and 14.12; Corollary 14.7, pp.80–81 (standard reference, not scraped)