Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Jech–Sochor first embedding theorem

Statement

Let M be a transitive model of ZFA+AC with atom set A and pure kernel K, and let V=HSFM be a permutation submodel given by a normal group/filter system on A. Fix an ordinal α of M. Use ambient AC to choose a pure set AK equipotent to A and a regular cardinal κ above Pα(A) and A, and put P=Fn<κ((A×κ)×κ,2)K. In any outer universe containing a K-generic filter for this P, there is a symmetric ZF extension W of K and AW such that Pα(A)V and Pα(A)W are membership-isomorphic, respecting all lower iterates. The ambient AC hypothesis supplies the cardinal comparison and a pure coordinate copy of A; no AC is asserted in V or W.

Facts & Assumptions

Given: The ambient ZFA+AC model M, its atom set and pure kernel, the normal permutation system defining V, the ordinal α, and a K-generic filter for the displayed pure forcing in an outer universe.

[F1]

Fraenkel–Mostowski permutation-model theorem verifies that the supplied M-internal normal group/filter presentation defines the transitive permutation model V used here.

[F2]

Forcing theorem supplies definability and truth for the forcing relation; equivariance under the transported automorphisms is checked below.

[F3]

Generic extensions satisfy ZF and preserve ground-model Choice supplies the ZF generic ambient model; only its ZF branch is inherited by the symmetric submodel.

[F4]

ZFA universes, atoms, pure sets, and the kernel identifies the pure kernel as a ZF model and says that ambient AC restricts to it.

[F5]

The Axiom of Choice supplies ambient well-orders, cardinal bounds, and the bijection between the atom set and a pure set.

Proof

1.1

Work first in M. By [F5], the choices stated above can be made with A a pure ordinal and a bijection j:AA. The ordinal κ and the set A belong to K; regularity of κ in M implies regularity in K, since any shorter cofinal sequence in K would also belong to M. By [F4], K satisfies ZFC. Work in the specified K-generic outer universe for the poset PK of partial binary functions of size <κ on (A×κ)×κ. The pure coordinate set ensures that P, unlike a poset indexed directly by atoms, belongs to K; regularity makes it <κ-closed. Moreover, every M-set sequence of pure conditions and every M-set of pure conditions is itself pure and therefore belongs to K; closure and genericity apply to the ambient enumerations used below. For each (a,ξ), use the coordinate (j(a),ξ) to name a generic subset xaξ of κ, put a={xaξ:ξ<κ}, and A={a:aA}. Recursively translate atoms to a and sets to the set of translations of their members.

F2F4F5
2.1

Transport each original atom permutation through j to the blocks {j(a)}×κ of the pure coordinate set, allowing arbitrary within-block permutations. Generate a normal filter from the transported original filter and finite pointwise stabilizers. The coordinate names, each a, and A are hereditarily symmetric. For the transported automorphism π, the atomic forcing clauses commute with pπp and x˙πx˙: a common strengthening or subname witness is carried bijectively to one on the other side. Simultaneous induction on name ranks and then on formula complexity (including the existential name witness) gives pφ(τ) iff πpφ(πτ). This derives the equivariance used below from F2's definable forcing clauses, without assuming it as an extra theorem. A further simultaneous induction on rank proves xy iff xy and x=y iff x=y; distinct coordinate generics make the atom case injective.

F1F2step 1.1
3.1

The translation of x is hereditarily symmetric exactly when xV. For the reverse implication, take a least-rank counterexample and a symmetric name forced equal to its translation. A permutation from the original support filter moving x can be lifted so that it fixes the finite coordinate support and moves the forcing condition to a compatible one, producing contradictory forced equalities.

F1F2step 2.1
3.2

Let W be the interpretations of the hereditarily symmetric (HS) names for the lifted group and filter. These values are transitive and contain every pure check name. We establish almost universality relative to K[G] without choosing simultaneous HS representatives. If an ambient set xK[G] has xW, take a K-name x˙ for it. For each (τ,p)dom(x˙)×P, let r(τ,p) be the least rank of an HS name σ such that pτ=σ, or 0 if none exists. The forcing relation and HS predicate are definable in K; Replacement there bounds these ranks by one ordinal γ. For ux, choose one pair (τ,p)x˙ with pG and τG=u, and one HS name σ evaluating to u. The truth lemma yields a common qG below p forcing τ=σ; hence r(τ,q)<γ and u has an HS name below γ.

F2F3step 2.1
3.3

For a,wW and any bounded formula φ(u,w), use HS names a˙,w˙ and the subname {(τ,p)dom(a˙)×P:pτa˙φ(τ,w˙)}. Its immediate subnames are HS; forcing equivariance makes the finite intersection of the parameter stabilizers fix it. Bounded absoluteness between the transitive W and K[G], followed by the truth lemma, identifies its value with the desired cut of a. Thus W has Δ0-Separation.

F2step 2.1
4.1

Let S be the ground set of all HS names of rank below γ and form the value-collecting name y˙={σ,p:σS and pP}.

F2step 3.2
5.1

Its value is {σG:σS} because G is nonempty. Automorphisms preserve S and all of P, so y˙ is fixed; its immediate subnames are HS. Thus y˙ is itself HS and its value is a W-set containing x.

F2F3step 2.1step 3.2step 4.1
6.1

Now apply Jech's transitive-class criterion inside the ambient transitive ZF model K[G]. For W-parameters, each of its eight Gödel-operation outputs—unordered pair, difference, product, domain, the membership relation restricted to a square, and the three permutations of triple coordinates—is an ambient set whose members already lie in W: construct unordered and Kuratowski pairs first, then the remaining outputs in that order. Almost universality puts each output inside a W-set, and its bounded defining formula cuts it out by step 3.3. Hence W is closed under all eight operations. Jech's formula-complexity induction from transitivity, almost universality, and this closure supplies full Comprehension, including unbounded quantifiers; the criterion also yields Pairing, Union, internal Power Set, Infinity, and Replacement. Thus W is a symmetric ZF model between the kernel and the full generic extension. This argument uses no AC in W.

F2F3step 2.1step 3.3step 4.1step 5.1
7.1

Induct through βα to prove surjectivity onto Pβ(A)W. At β=0 this is the explicit bijection aa from step 2.1. At a limit β, both power-set hierarchies are the unions of their lower stages, so the compatible earlier identifications give the result. At a successor stage, the earlier members retain their translations. Put x=Pβ1(A)V, and let y=y˙GW be a subset of the translated image x. By the truth lemma choose p0G forcing y˙x˙. The ambient M-cardinality bound x<κ from step 1.1 supplies an enumeration xi:i<λ with λ<κ. Its translated pure-name sequence, together with y˙, is a K-set by step 1.1. For each i<λ the conditions deciding x˙iy˙ are dense. Starting below any pp0, recursively choose one stronger decider for each i and take a lower bound at limit stages below λ, using <κ-closure. This pure recursion lies in K, so the set D of conditions below p0 deciding every listed membership is a K-dense set below p0. Since G is K-generic and contains p0, choose qGD. Define in M the ground subset z={xi:i<λ, qx˙iy˙}. The decisions and qy˙x˙ give qz˙=y˙; in particular z=y in the chosen generic extension. By the reverse HS criterion of step 3.1, the symmetric name y˙ forced equal to the translation below q implies zV. The dense-set/genericity step is essential: a lower bound deciding all memberships outside G would not determine the actual y. Thus translation is a membership isomorphism at every lower iterate. If A=, the coordinate forcing is trivial and W=K, so the same identification includes the empty-atom endpoint. Ambient AC in M supplies the well-order of Pα(A), the regular cardinal κ, and the atom-to-pure-coordinate bijection; the pure kernel inherits AC for the closure recursion, while W need not satisfy AC.

F2F3F4F5step 1.1step 2.1step 3.1step 3.2

Depends on

Used by

Dependency tree · two levels

18 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