Alphabeta Math
Pipeline-generated
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.

Permutation Models and Transfer to ZF: Examples and Counterexamples

1 · Prerequisites

2 · Summary

Three support calculations make the permutation method concrete: a transposition forces a supported atom subset to be finite or cofinite, a fresh sock swap defeats a proposed choice graph, and every order automorphism fixes the dense order relation while moving any unsupported enumeration.

The false statement records why ZFA is not literally ZF: two distinct atoms have the same empty membership extension. Its pure kernel is a ZF model, and bounded Jech–Sochor transfer can move selected statements to ZF, but neither fact erases the atoms from the ambient permutation model.

3 · Logical flowchart

4 · Definitions, theorems and proofs

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Finite support forces a finite-or-cofinite atom subset

Statement

A subset of the basic Fraenkel atoms supported by E is contained in E or contains every atom outside E.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

The basic Fraenkel model gives the full permutation action and finite-support rule.

Proof

1.1

Let BA be supported by finite E. If some aE lies in B, then for every bE the transposition (a b) fixes E and hence B, so bB. Thus AEB and B is cofinite.

F1
2.1

If no such a exists, then BE and B is finite. This includes the vacuous case AE=, although it cannot occur when A is infinite and E finite.

F1step 1.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

The unsupported sock swap

Statement

In the second Fraenkel system with the full group of permutations preserving each atom pair setwise, a pair outside a proposed choice function's finite support admits the permutation that swaps exactly its two atoms and fixes every other atom. It fixes every input pair but changes the chosen output.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

Proof

1.1

Write Pn={an,bn}. If E is a finite atom support, choose the least n with PnE=. The permutation π interchanging an,bn and fixing all other atoms is allowed, fixes E, and satisfies πPk=Pk for every k.

F1
2.1

If c were supported by E and c(k)Pk, then πc=c, so graph evaluation gives c(n)=π(c(n)). But π has no fixed point in Pn, contradiction.

F1step 1.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

The ordered Mostowski relation has empty support

Statement

The dense order on the atoms is fixed by every allowed permutation and has empty support, although no well-order of the atoms is symmetric.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

The ordered Mostowski model defines the order-automorphism group and proves non-well-orderability.

Proof

1.1

For the relation R<={(a,b):a<b} and every allowed π, order preservation gives (a,b)R< iff (πa,πb)R<, hence πR<=R<. Its stabilizer is the whole group, so supports it.

F1
2.1

In contrast, if a well-order had finite support E, an order automorphism fixing E could move its least atom in AE, contradicting invariance. Thus “linearly ordered” and “well-orderable” separate in this model.

F1
False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A ZFA model is a ZF model

False statement

A ZFA model is a ZF model.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

ZFA universes, atoms, pure sets, and the kernel distinguishes atoms from sets and identifies the pure kernel.

[F2]

Jech–Sochor first embedding theorem gives a bounded atom-to-set simulation when the ZFA permutation model is presented inside an ambient ZFA+AC model.

Counterexample

1.1

In a ZFA model with distinct atoms ab, both have no members. Unrestricted ZF Extensionality would conclude a=b, so the whole ZFA universe is not a ZF model.

F1
2.1

The valid repairs are narrower: F1 says the pure kernel is a ZF model, and F2 transfers a prescribed power-iterate segment into a symmetric ZF model under its explicit ambient ZFA+AC premise. Neither identifies the entire atom universe with a ZF universe.

F1F2

5 · Examples, counterexamples and false statements

None yet.

Sources