Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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 Ftf is principal. In particular, the tail-flip symmetric model has no free ultrafilter on ω.

Facts & Assumptions

Given: An ultrafilter U on ω in Ftf.

[F1]

Every prime ideal on the power set of omega is principal in the tail-flip symmetric model proves that every prime ideal of P(ω) in the model is principal.

[F2]

Ultrafilter defines U as a maximal proper filter and defines principal and free ultrafilters.

Proof

technique · direct Boolean complementation duality
1.1F2

First, maximality makes U decide every A⊆ω: if neither A nor ω∖A belonged to U, then every B∈U would meet A (otherwise upward closure would put ω∖A in U), so the filter generated by U∪{A} would be a proper strict extension, contradicting F2. Thus exactly one of A and its complement lies in U, since a proper filter cannot contain both.

2.1F2step 1.1

Define I={A⊆ω:ω∖A∈U}. Complementation converts upward closure to downward closure and intersections to unions, so I is a proper ideal. If A∩B∈I, then (ω∖A)∪(ω∖B)∈U. Were neither complement in U, step 1.1 would put both A and B in U, and then A∩B∈U, a contradiction. Hence A∈I or B∈I, so I is prime.

3.1F1F2step 2.1∎

By F1 the ideal I is generated by some C⊆ω, so I={A⊆ω:A⊆C}. Propriety gives C≠ω. Choose k∈ω∖C. Since I is prime and {k}∩(ω∖{k})=∅∈I, while {k}⊈C, we have ω∖{k}∈I and hence ω∖{k}⊆C. Together with k∉C, this gives C=ω∖{k} and therefore I={A⊆ω:k∉A}. For every B⊆ω, it follows that B∈U iff ω∖B∈I iff k∈B. Thus U is the principal ultrafilter at k in the sense of F2. Since U 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