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
- Binary Operations, Monoids, Groups and Subgroups
- Boolean Algebras, Stone Duality, and the Prime Ideal Theorem
- Cardinal Arithmetic, Cofinality and the Alephs
- Construction of the Natural Numbers
- Countability and Uncountability
- Filters and Ultrafilters
- Forcing Orders, Names, and Generic Extensions
- Formal Set-Theoretic Syntax, Structures, and Satisfaction
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Permutation Models and Transfer to ZF
- Reflection, Absoluteness, and Elementary Submodels
- Relations, Functions, and Quotients
- The Forcing Theorem and Formal Consistency Transfer
- The ZFC Axioms and the Basic Set Constructions
- Weak Choice Principles and Sierpiński's Theorem
- Well-Founded Relations, Rank, and the Cumulative Hierarchy
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
Finite support forces a finite-or-cofinite atom subset
Statement
A subset of the basic Fraenkel atoms supported by is contained in or contains every atom outside .
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
The basic Fraenkel model gives the full permutation action and finite-support rule.
Proof
Let be supported by finite . If some lies in , then for every the transposition fixes and hence , so . Thus and is cofinite.
If no such exists, then and is finite. This includes the vacuous case , although it cannot occur when is infinite and finite.
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.
The second Fraenkel model has countable pairs without a choice function fixes the paired atoms and group.
Proof
Write . If is a finite atom support, choose the least with . The permutation interchanging and fixing all other atoms is allowed, fixes , and satisfies for every .
If were supported by and , then , so graph evaluation gives . But has no fixed point in , contradiction.
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.
The ordered Mostowski model defines the order-automorphism group and proves non-well-orderability.
Proof
For the relation and every allowed , order preservation gives iff , hence . Its stabilizer is the whole group, so supports it.
In contrast, if a well-order had finite support , an order automorphism fixing could move its least atom in , contradicting invariance. Thus “linearly ordered” and “well-orderable” separate in this model.
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.
ZFA universes, atoms, pure sets, and the kernel distinguishes atoms from sets and identifies the pure kernel.
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
In a ZFA model with distinct atoms , both have no members. Unrestricted ZF Extensionality would conclude , so the whole ZFA universe is not a ZF model.
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.
5 · Examples, counterexamples and false statements
None yet.