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 tail-flip symmetric model has no free ultrafilter on omega
Statement
Every ultrafilter on in is principal. In particular, the tail-flip symmetric model has no free ultrafilter on .
Facts & Assumptions
Given: An ultrafilter on in .
Every prime ideal on the power set of omega is principal in the tail-flip symmetric model proves that every prime ideal of in the model is principal.
Ultrafilter defines as a maximal proper filter and defines principal and free ultrafilters.
Proof
First, maximality makes decide every : if neither nor belonged to , then every would meet (otherwise upward closure would put in ), so the filter generated by would be a proper strict extension, contradicting F2. Thus exactly one of and its complement lies in , since a proper filter cannot contain both.
Define . Complementation converts upward closure to downward closure and intersections to unions, so is a proper ideal. If , then . Were neither complement in , step 1.1 would put both and in , and then , a contradiction. Hence or , so is prime.
By F1 the ideal is generated by some , so . Propriety gives . Choose . Since is prime and , while , we have and hence . Together with , this gives and therefore . For every , it follows that iff iff . Thus is the principal ultrafilter at in the sense of F2. Since was arbitrary, no free ultrafilter on exists in the model.
Depends on
Used by
Dependency tree · two levels
10 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
- Solomon Feferman, Some applications of the notions of forcing and generic sets, Theorem 4.12, printed p. 343 (standard reference, not scraped)