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 is the least normal tail filter
Statement
In ZFC, the club filter on regular uncountable is normal and is contained in every proper normal filter on that contains all tails.
Facts & Assumptions
The diagonal intersection of clubs is club: Diagonal intersections of kappa many clubs are club.
Normality is equivalent to positive pressing down: Normal proper tail filters satisfy positive pressing down.
The club filter and nonstationary ideal: The club filter contains every set containing a club.
Proof
Given: The objects and hypotheses in the statement.
For a sequence of club-filter members choose a witnessing club inside each. Their diagonal is a club contained in the diagonal of the original members, so that diagonal belongs to the club filter. Tails are clubs, giving normality and tail containment.
Let be a proper normal tail-containing filter and a club. If , then is positive: intersecting a positive set with a filter member preserves positivity, as every further filter intersection remains in . On put . At a successor this is below ; at a nonzero limit equality would put in the closed . Hence is regressive.
For any , take above . A point has , so the fibre of is bounded by and is disjoint from a tail in . All fibres are small, contradicting positive pressing down. Thus , and upward closure includes the entire club filter in .
Depends on
Used by
Nothing in the library uses this result yet.
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
- Williams, Exercise 37 and Exercise 40, pp.11–12, with explicit tail hypothesis (standard reference, not scraped)