Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

A countably incomplete ultrapower need not be well-founded

Statement refuted

The assertion that every universe ultrapower is well-founded fails, conditional on a free ultrafilter U on omega. In ZF with that supplied U, the Scott classes of

gm(n)=max(nm,0)(m,nω)

form an infinite descending membership chain of internal naturals in the universe ultrapower. No existence of a free ultrafilter is asserted in ZF.

Facts & Assumptions

Given: ZF with a supplied free ultrafilter. Calculated the exact cofinite truth sets for truncated-subtraction functions and exhibited their nonminimal Scott range without additional choice.

[F1]

Scott coding and set-likeness of ultrapower membership: Scott membership is exactly U-large coordinate membership, and its representatives are sets in ZF.

Counterexample

1.1

A free ultrafilter on omega contains no finite set: if a finite union of singletons belonged to U, the ultrafilter complement decision and finite intersections would force one singleton to belong, making it principal. Hence each cofinite tail Bm={n:n>m} belongs to U. Their countable intersection is empty, explicitly witnessing failed countable completeness.

F1
2.1

For n>m, gm(n)=nm>0 and gm+1(n)=nm1<gm(n). Since these are finite von Neumann ordinals, this is exactly gm+1(n)gm(n). F1 therefore gives [gm+1]U E [gm]U. Also every g_m(n) belongs to omega, so every displayed class belongs to [c_omega], the internal natural-number set. For n<=m both functions in the comparison are zero, so membership fails there; the truth set is exactly B_m, not just an unspecified large set.

F1step 1.1
3.1

Replacement forms the nonempty set {[gm]U:mω}. Each member has its next displayed class as an E-predecessor in this set, so the set has no E-minimal member and the relation is not well-founded. All functions and classes were explicitly defined; no choice of representatives and no additional AC were used.

F1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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