OctoInformBeta

OpenAI preprint, September 2026 · §4. Two models at the prescribed endpoint

Theorem 4.5: One over the base order ω1×lexℚ\omega_1 \times_{\mathrm{lex}} \mathbb{Q} with endpoint colors as bits, one over ℚ\mathbb{Q} with all bits 00

Under the continuum hypothesis, KK has two nonisomorphic models at ℶω2\beth_{\omega_2}..

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The continuum hypothesis (CH) is the hypothesis 2ℵ0=ℵ12^{\aleph_0} = \aleph_1.✦ Under it the Hanf number h(ℵ0)h(\aleph_0) is ℶω2\beth_{\omega_2}, the endpoint. The class KK is a class of structures in a countable relational vocabulary with a strong substructure relation ≤K\le_K, and its models are presented by normal forms. Theorem 4.5 settles whether, under CH, any two models of KK of cardinality ℶω2\beth_{\omega_2} are isomorphic.

These notes define the normal forms and the class KK, then the two normal forms the theorem is about.

Normal Forms

A tuple from a set II is an injective map tt from {0,…,n}\{0, \dots, n\} into II, for some n∈ℕn \in \mathbb{N}✦; its subsequences are the composites t∘et \circ e with order embeddings e:{0,…,m}→{0,…,n}e \colon \{0, \dots, m\} \to \{0, \dots, n\}.✦

A normal form M=(I,B,<,a)M = (I, B, <, a) consists of a nonempty index set II; a nonempty dense linear order (B,<)(B, <) without endpoints, the base order, in which every closed interval [x,y][x, y] is countable; and a bit a(t,n,b)∈{0,1}a(t, n, b) \in \{0, 1\} for every tuple tt from II, every n∈ℕn \in \mathbb{N} and every b∈Bb \in B.✦ Its points are of six kinds: an index point for each element of II, a base point for each element of BB, the finite subsets of BB, the finite subsets of ℕ\mathbb{N}, the rows (t,n,s)(t, n, s) and the columns (t,b,v)(t, b, v), where tt is a tuple from II, n∈ℕn \in \mathbb{N}, b∈Bb \in B, and s⊆Bs \subseteq B and v⊆ℕv \subseteq \mathbb{N} are finite.✦ The cardinality ∥M∥\|M\| of a normal form MM is the number of its points. The bit of a row (t,n,s)(t, n, s) and a column (t,b,v)(t, b, v) with the same tuple is a(t,n,b)+1b∈s+1n∈vmod⁡2.a(t, n, b) + 1_{b \in s} + 1_{n \in v} \bmod 2.(1)✦

The points of MM form the universe of a structure in the array language, a countable relational vocabulary. Its unary symbols pick out the index points, the base points, the finite subsets of BB, the finite subsets of ℕ\mathbb{N}, the rows with a given length of tuple and a given nn, the columns with a given length of tuple, and each single finite subset of ℕ\mathbb{N}. Its other symbols project a row onto the index points of its tuple and a column onto its base point and the index points of its tuple, and interpret the order of BB, the membership of a base point in a finite subset of BB, the bit (1) being 11, symmetric difference of finite sets, and the translations (t,n,s)↦(t,n,s△u)(t, n, s) \mapsto (t, n, s \triangle u) of rows and (t,b,v)↦(t,b,v△w)(t, b, v) \mapsto (t, b, v \triangle w) of columns by finite sets u⊆Bu \subseteq B and w⊆ℕw \subseteq \mathbb{N}.

A presentation of a structure RR in the array language is a normal form MM together with a bijection of the points of MM onto the universe of RR under which each relation holds in RR exactly where it holds in MM.✦

The palette S=2ω/=*S = 2^\omega/{=^*} is the set of binary sequences modulo equality outside a finite set✦, and [a]∈S[a] \in S is the color of the sequence aa.✦ The color of a tuple tt from II at a point bb of BB is ct(b)=[a(t,⋅,b)]c_t(b) = [a(t, \cdot, b)].✦

Diagrams, Tests and Objects

A label on a set AA of positions is a pair (J,i)(J, i) with JJ a nonempty finite subset of AA and i∈ℕi \in \mathbb{N}✦; the root of a position aa is ({a},0)(\{a\}, 0).✦ A diagram (E,R,ρ)(E, R, \rho) on AA consists of binary relations EE and RR on the labels on AA and a tag ρ(l)∈ω1\rho(l) \in \omega_1 for each label ll.✦ A diagram (E,R,ρ)(E, R, \rho) is valid when EE is an equivalence relation, RR and ρ\rho are invariant under EE, ρ(l)<ρ(l′)\rho(l) < \rho(l') whenever lRl′l \mathrel{R} l', labels with the same RR-predecessors are EE-equivalent, and positions with EE-equivalent roots are equal.✦ The restriction d↾ed{\restriction}e of a diagram dd on A′A' along an injection e:A→A′e \colon A \to A' is the diagram on AA that relates and tags each label (J,i)(J, i) as dd relates and tags (e[J],i)(e[J], i).✦

Under CH, a fixed injection d↦⌜d⌝d \mapsto \ulcorner d \urcorner of the diagrams on {0,…,n}\{0, \dots, n\}, over all n∈ℕn \in \mathbb{N}, into SS is given, and ⌜d⌝\ulcorner d \urcorner is the code of the diagram dd.✦ A tuple tt of length n+1n + 1 from a set II then passes the test for an assignment cc of colors to the tuples from II when there is a diagram dd on {0,…,n}\{0, \dots, n\} such that, for every order embedding e:{0,…,m}→{0,…,n}e \colon \{0, \dots, m\} \to \{0, \dots, n\}, the restriction d↾ed{\restriction}e is valid and ⌜d↾e⌝=c(t∘e).\ulcorner d{\restriction}e \urcorner = c(t \circ e).(2)✦ A normal form MM is an object when, for every tuple tt from II, the set {b∈B:t fails the test for s↦cs(b)}\{\, b \in B : t \text{ fails the test for } s \mapsto c_s(b) \,\}(3)✦ is countable.

The Class KK

A map hh of normal forms from MM to NN, where IMI_M, BMB_M and aMa_M denote the index set, the base order and the bits of MM, and likewise for NN, consists of an embedding ff of IMI_M into INI_N, an order embedding gg of BMB_M into BNB_N, and finite sets σ(t,n)⊆BN\sigma(t, n) \subseteq B_N and τ(t,b)⊆ℕ\tau(t, b) \subseteq \mathbb{N}, for tt a tuple from IMI_M, n∈ℕn \in \mathbb{N} and b∈BMb \in B_M, such that the bits agree: aN(f∘t,n,g(b))+1g(b)∈σ(t,n)+1n∈τ(t,b)≡aM(t,n,b)(mod⁡2).a_N(f \circ t, n, g(b)) + 1_{g(b) \in \sigma(t, n)} + 1_{n \in \tau(t, b)} \equiv a_M(t, n, b) \pmod 2.(4) On points, hh acts by ff on index points and by gg on base points and on finite subsets of BMB_M, fixes finite subsets of ℕ\mathbb{N}, and sends a row (t,n,s)(t, n, s) to (f∘t,n,σ(t,n)△g[s])(f \circ t, n, \sigma(t, n) \triangle g[s]) and a column (t,b,v)(t, b, v) to (f∘t,g(b),τ(t,b)△v)(f \circ t, g(b), \tau(t, b) \triangle v).✦

Under CH, a map hh of normal forms from MM to NN is strong when g[BM]g[B_M] is convex in BNB_N and, at every b∈BN\g[BM]b \in B_N \setminus g[B_M], every tuple tt from IMI_M passes the test (2) for the colors along hh, which give a tuple ss from IMI_M the color [n↦aN(f∘s,n,b)+1b∈σ(s,n)mod⁡2][\, n \mapsto a_N(f \circ s, n, b) + 1_{b \in \sigma(s, n)} \bmod 2 \,].✦ The class KK consists of the structures in the array language that have a presentation by an object. For structures MM and NN in KK, the strong substructure relation M≤KNM \le_K N holds when MM and NN have presentations by objects joined by a strong map under which each point and its image present the same element.✦ Two structures MM and NN in the array language are isomorphic, M≅NM \cong N, when some bijection of their universes preserves every relation in both directions. The cardinality ∥M∥\|M\| of a structure MM is the cardinality of its universe.

The Two Normal Forms

The set DD is a copy of the von Neumann stage Vω2V_{\omega_2}, the sets of rank below ω2\omega_2, with the membership relation of the sets it copies✦; the rank rk⁡(x)\operatorname{rk}(x) of x∈Dx \in D is the rank of the set xx copies, an ordinal below ω2\omega_2.✦ For a nonempty finite X⊆DX \subseteq D, the countable closure DXD_X is the union of the stages X0=XX_0 = X and Xk+1=Xk∪{w(x,y):x,y∈Xk}X_{k+1} = X_k \cup \{ w(x, y) : x, y \in X_k \}, where the witness w(x,y)w(x, y) of distinct xx and yy is an element of DD that is a member of exactly one of them.✦ The enumeration of DXD_X is a map dX:ℕ→DXd_X \colon \mathbb{N} \to D_X that takes a point of XX at 00 and then runs through a fixed surjection of ℕ\mathbb{N} onto DXD_X.✦

The functions fα:ω1→ω1f_\alpha \colon \omega_1 \to \omega_1 of Lemma 4.1, for α<ω2\alpha < \omega_2, are defined by recursion on α\alpha: with eαe_\alpha a fixed injection of α\alpha into ω1\omega_1, for every β<ω1\beta < \omega_1, fα(β)=sup⁡{fγ(β)+1:γ<α,eα(γ)<β}.f_\alpha(\beta) = \sup \{\, f_\gamma(\beta) + 1 : \gamma < \alpha,\ e_\alpha(\gamma) < \beta \,\}.(5)✦

For a tuple tt from DD of length n+1n + 1, the entry of a label l=(J,i)l = (J, i) on {0,…,n}\{0, \dots, n\} is xl=dX(i)x_l = d_X(i), where X=t[J]X = t[J].✦ The diagram of tt at a tag β<ω1\beta < \omega_1 is the diagram (E,R,ρ)(E, R, \rho) on {0,…,n}\{0, \dots, n\} with lEl′⇔xl=xl′,lRl′⇔xl∈xl′,ρ(l)=frk⁡(xl)(β).l \mathrel{E} l' \iff x_l = x_{l'}, \qquad l \mathrel{R} l' \iff x_l \in x_{l'}, \qquad \rho(l) = f_{\operatorname{rk}(x_l)}(\beta).(6)✦ Under CH, the endpoint color χt(β)∈S\chi_t(\beta) \in S of tt at β\beta is the code of this diagram.✦

Let π\pi be a fixed bijection of the lexicographic product ω1×lexℚ\omega_1 \times_{\mathrm{lex}} \mathbb{Q}, ordered by the first coordinate and then the second, onto ω1\omega_1, and rχ∈2ωr_\chi \in 2^\omega a fixed representative of each color χ∈S\chi \in S.✦ Under CH, the endpoint normal form MendM_{\mathrm{end}} has index set DD, base order ω1×lexℚ\omega_1 \times_{\mathrm{lex}} \mathbb{Q}, and bits a(t,n,b)=rχt(π(b))(n).a(t, n, b) = r_{\chi_t(\pi(b))}(n).(7)✦ For an infinite cardinal μ\mu, the normal form NμN_\mu has as index set the ordinals below the initial ordinal of μ\mu, as base order ℚ\mathbb{Q}, and all bits 00.✦

The Claim

Theorem 1. Assume CH. Then there are models MM and NN of KK with ∥M∥=∥N∥=ℶω2andM≆N.\|M\| = \|N\| = \beth_{\omega_2} \quad \text{and} \quad M \not\cong N.(8)✦ Moreover, Mend is an object,M_{\mathrm{end}} \text{ is an object},(9)✦ ∥Mend∥=ℶω2,\|M_{\mathrm{end}}\| = \beth_{\omega_2},(10)✦ and, for every infinite cardinal μ\mu, Nμ is an object.N_\mu \text{ is an object}.(11)✦ Without assuming CH, the order ω1×lexℚ\omega_1 \times_{\mathrm{lex}} \mathbb{Q} satisfies (12), for all its elements xx and yy the closed interval [x,y][x, y] satisfies (13), and for every infinite cardinal μ\mu we have (14). |ω1×lexℚ|=ℵ1,|\omega_1 \times_{\mathrm{lex}} \mathbb{Q}| = \aleph_1,(12)✦ the closed interval [x,y] is countable,\text{the closed interval } [x, y] \text{ is countable},(13)✦ ∥Nμ∥=μ.\|N_\mu\| = \mu.(14)✦

In the paper, the result reads: KK has two nonisomorphic models of cardinality ℶω2\beth_{\omega_2}, one with an order sort of cardinality ℵ1\aleph_1 and one with a countable order sort, the order sort being the paper’s name for the base order.

What Is Checked

The claim is stated over CH, the endpoint ℶω2\beth_{\omega_2}, the class KK of structures presented by objects with its relation ≤K\le_K, and the normal forms MendM_{\mathrm{end}}, built from the diagrams of tuples from DD and the functions fαf_\alpha, and NμN_\mu. About these constructions the library also proves that membership separates the points of DD: for any two distinct elements of DD, some element of DD is a member of exactly one of them.✦