Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Finite bit flips cannot defeat a free ultrafilter

Statement

Let U be a free ultrafilter on ω. If XY is finite, then

XUYU.

Consequently a finite-bit flip cannot produce Feferman's ultrafilter contradiction; the infinite tail-complement flip is essential.

Facts & Assumptions

Given: A free ultrafilter U on ω and subsets X,Yω with finite symmetric difference.

[F1]

Ultrafilter defines freeness as failure to be principal at every point and includes the proper-filter intersection and upward-closure laws.

[F2]

Characterisation of ultrafilters: every set or its complement says an ultrafilter contains exactly one member of every complementary pair.

Proof

technique · direct calculation on the cofinite agreement set
1.1

No finite set F belongs to U. Otherwise, since U is not principal, no singleton {n} belongs to U; F2 then puts every ω{n} in U. Intersecting these complements for the finitely many nF puts ωF in U, so propriety is contradicted by F(ωF)=. This includes F=, which is excluded directly by propriety. By F2, every cofinite set therefore belongs to U.

F1F2
2.1

Put D=ω(XY). By F3 this is exactly the set on which X and Y agree, and it is cofinite by the Given hypothesis; hence DU by step 1.1. If XU, then XDU, while agreement gives XDY, so upward closure gives YU. Exchanging X and Y proves the reverse implication. Thus the displayed equivalence holds, including X=Y, X=, and X=ω.

F1F3step 1.1
3.1

A flip of only finitely many bits replaces X by some Y with finite XY, so step 2.1 preserves its membership status in U and supplies no contradiction. Feferman's automorphism instead sends the selected real to a finite modification of ωX: invariance then transfers its membership to the complement, which conflicts with F2. The distinction is between a finite flip and an infinite tail flip, not between two descriptions of the same automorphism.

F2F3step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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