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.
Every prime ideal on the power set of omega is principal in the tail-flip symmetric model
Statement
In , every prime ideal of the internal Boolean algebra is principal.
Facts & Assumptions
Given: A prime proper ideal of in , represented by an HS name .
The tail-complement automorphism fixes finitely supported names says that, after choosing with , a coordinate- tail flip can be chosen to fix any given finite condition and the name while complementing modulo a finite set.
Boolean ideals, filters, prime ideals and ultrafilters gives downward and finite-union closure, propriety, and the prime implication or .
The difference , the symmetric difference , and the complement relative to a set fixes the finite modification relation used below.
Forcing theorem supplies the truth lemma used to obtain one condition forcing the actual prime-ideal decision.
Symmetry lemma for forcing automorphisms transports forced formulas and their names under a forcing automorphism.
Proof
Suppose for contradiction that is not principal. For each , primality applied to puts one of the two factors in . If , downward closure and propriety give , the principal prime ideal generated by that coatom. Thus for every , and finite-union closure puts every finite subset of in .
Since is HS, choose with , as in F1. Put , which belongs to because its canonical name is supported by . Since , F2 yields either or . Let denote the member selected by these two exhaustive cases, and let be the corresponding canonical name.
By F4 choose a finite in the actual generic which forces . Apply F1 with the support bound , condition , and coordinate . Its tail automorphism fixes both and . By F5, forces . Hence both and belong to in the actual extension.
If , then F1 gives finite. If , automorphisms commute with Boolean complementation and F1 gives finite. Thus in either case differs finitely from . By step 1.1 the finite difference belongs to ; since , F2 puts in .
Step 2.1 gives and step 3.1 gives its complement in . Finite-union closure then puts in , contradicting propriety. Therefore the assumption in step 1.1 was false, and every prime ideal is principal. Both decisions in step 1.2 lead to the same contradiction, and every finite-modification use was derived from the finite singletons rather than assumed.
Depends on
- The tail-complement automorphism fixes finitely supported names
- Forcing theorem
- Symmetry lemma for forcing automorphisms
- Boolean ideals, filters, prime ideals and ultrafilters
- The difference $a \setminus b$, the symmetric difference $a \triangle b$, and the complement $X \setminus a$ relative to a set $X$
Used by
Dependency tree · two levels
18 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 and complete proof, printed pp. 343–344 (standard reference, not scraped)