OctoInformBeta

OpenAI preprint, September 2026 · §5. A bound on uncountable base orders and categoricity on a tail

Theorem 5.10: From Λ\Lambda on, where an object with μ≥Λ\mu \ge \Lambda points has μ\mu index points and a countable base order

Under the continuum hypothesis the class KK is categorical on a tail.

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 statement 2ℵ0=ℵ12^{\aleph_0} = \aleph_1.✦ Under CH, KK is a class of structures in a countable relational language, with a strong substructure relation ≤K\le_K, whose structures are read off from normal forms: an index set, a base order and an array of bits.

Put ξ=2ℵ1\xi = 2^{\aleph_1}. The tail threshold is Λ=ℶξ+,\Lambda = \beth_{\xi^+},(1)✦ the beth function at the initial ordinal of the successor cardinal ξ+\xi^+. The question is what KK looks like in a cardinal μ≥Λ\mu \ge \Lambda: how many models of cardinality μ\mu it has up to isomorphism, and how the number of points of a normal form, the elements of the structure it presents, is shared between its index set and its base order. A second question is whether KK has a model in every infinite cardinality.

Colors, Diagrams and Tests

A binary sequence is a map a:ℕ→{0,1}a : \mathbb{N} \to \{0, 1\}, and 2ω2^\omega is the set of binary sequences.✦ Two sequences aa and bb are equal outside a finite set, a=*ba =^* b, when a(n)≠b(n)a(n) \ne b(n) for only finitely many nn.✦ The palette of colors is the quotient S=2ω/=*,S = 2^\omega / {=^*},(2)✦ and the color [a]∈S[a] \in S of a sequence aa is its class.✦

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 the label ({a},0)(\{a\}, 0)✦, and an injection ee of AA into a set A′A' sends a label (J,i)(J, i) on AA to the label (e[J],i)(e[J], i) on A′A'.✦ A diagram D=(E,R,ρ)D = (E, R, \rho) on AA consists of binary relations EE and RR on the labels on AA and a map ρ\rho assigning to each label a tag in ω1\omega_1.✦ The diagram DD is valid when EE is an equivalence relation, RR and ρ\rho respect EE, ρ(x)<ρ(y)\rho(x) < \rho(y) whenever xRyx \mathrel{R} y, any two labels with the same RR-predecessors are EE-equivalent, and the roots of distinct positions are not EE-equivalent.✦

For a diagram DD on A′A' and an injection ee of AA into A′A', the restriction D↾eD{\restriction}e is the diagram on AA in which two labels are related by EE, or by RR, exactly when their images under ee are so related in DD, and each label has the tag of its image.✦ Under CH, code\mathrm{code} is a fixed injection from the diagrams on the sets {0,…,n}\{0, \dots, n\}, n∈ℕn \in \mathbb{N}, taken together, into SS.✦

A tuple from a set II is an injective map t:{0,…,n}→It : \{0, \dots, n\} \to I, of length n+1n + 1.✦ Its subsequences are the composites t∘et \circ e with order embeddings e:{0,…,m}→{0,…,n}e : \{0, \dots, m\} \to \{0, \dots, n\}✦, and for an injection ff of II into a set JJ, the composite f∘tf \circ t is a tuple from JJ.✦

Assume CH, and let cc assign a color c(s)∈Sc(s) \in S to every tuple ss from II. A tuple tt from II of length n+1n + 1 passes the test for cc when some diagram DD on {0,…,n}\{0, \dots, n\} satisfies, for every m∈ℕm \in \mathbb{N} and every order embedding e:{0,…,m}→{0,…,n}e : \{0, \dots, m\} \to \{0, \dots, n\}, D↾e is validandcode(D↾e)=c(t∘e);D{\restriction}e \text{ is valid} \quad \text{and} \quad \mathrm{code}(D{\restriction}e) = c(t \circ e);(3)✦ otherwise tt fails the test for cc.

Normal Forms

A normal form M=(I,B,<,a)M = (I, B, <, a) consists of a nonempty index set II, a nonempty set BB with a linear order <<, the base order, 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.✦ In a normal form the base order is required to be dense, to have no least and no greatest element, and to be locally countable: every closed interval [x,y][x, y] of BB is countable. The color of a tuple tt from II at a point b∈Bb \in B is ct(b)=[n↦a(t,n,b)]∈S.c_t(b) = [\, n \mapsto a(t, n, b) \,] \in S.(4)✦

The points of MM 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), for tt a tuple from II, n∈ℕn \in \mathbb{N}, b∈Bb \in B, ss a finite subset of BB and vv a finite subset of ℕ\mathbb{N}.✦ For a normal form MM, ∥M∥\|M\| is the number of points of MM.

The points carry a structure in a countable relational language. The language has unary relations that pick out each of the first four kinds of points, for each kk and nn the rows (t,n,s)(t, n, s) with tt of length k+1k + 1, for each kk the columns (t,b,v)(t, b, v) with tt of length k+1k + 1, and, for each finite subset vv of ℕ\mathbb{N}, the point vv alone. Its binary relations are the order << on base points, incidence b∈sb \in s between a base point and a finite subset of BB, and the bit relation, which holds of a row (t,n,s)(t, n, s) and a column (t′,b,v)(t', b, v) when t=t′t = t' and a(t,n,b)+1b∈s+1n∈v≡1(mod⁡2).a(t, n, b) + 1_{b \in s} + 1_{n \in v} \equiv 1 \pmod 2.(5) Its ternary relations are symmetric difference w=s△s′w = s \mathbin{\triangle} s', on the finite subsets of BB and on those of ℕ\mathbb{N}, and the actions of these two groups, relating a row (t,n,s)(t, n, s) and a finite subset uu of BB to (t,n,s△u)(t, n, s \mathbin{\triangle} u), and a column (t,b,v)(t, b, v) and a finite subset uu of ℕ\mathbb{N} to (t,b,v△u)(t, b, v \mathbin{\triangle} u). The row projection for kk and nn, of arity k+2k + 2, holds of a row (t,n,s)(t, n, s) with tt of length k+1k + 1 followed by the index points t(0),…,t(k)t(0), \dots, t(k); the column projection for kk, of arity k+3k + 3, holds of a column (t,b,v)(t, b, v) with tt of length k+1k + 1 followed by the base point bb and the index points t(0),…,t(k)t(0), \dots, t(k).

A structure RR in this language is presented by a normal form MM when there is a bijection from the points of MM onto the universe of RR such that each relation holds in RR of the images of some points exactly when it holds of those points in MM.✦

The Class KK

Assume CH. A normal form M=(I,B,<,a)M = (I, B, <, a) is an object when every tuple tt from II passes the test for the coloring s↦cs(b)s \mapsto c_s(b) at all but countably many b∈Bb \in B: {b∈B:t fails the test for s↦cs(b)} is countable.\{\, b \in B : t \text{ fails the test for } s \mapsto c_s(b) \,\} \text{ is countable}.(6)✦ The models of KK are the structures presented by an object.✦

For normal forms M=(IM,BM,<,aM)M = (I_M, B_M, <, a_M) and N=(IN,BN,<,aN)N = (I_N, B_N, <, a_N), a map from MM to NN consists of an injection f:IM→INf : I_M \to I_N, an order embedding g:BM→BNg : B_M \to B_N, a row shift assigning a finite subset u(t,n)u(t, n) of BNB_N to each tuple tt from IMI_M and each n∈ℕn \in \mathbb{N}, and a column shift assigning a finite subset v(t,b)v(t, b) of ℕ\mathbb{N} to each such tt and each b∈BMb \in B_M, under which the bits agree: for all tt, nn and bb, aN(f∘t,n,g(b))+1g(b)∈u(t,n)+1n∈v(t,b)≡aM(t,n,b)(mod⁡2).a_N(f \circ t, n, g(b)) + 1_{g(b) \in u(t, n)} + 1_{n \in v(t, b)} \equiv a_M(t, n, b) \pmod 2.(7) A map from MM to NN as above sends an index point ii to f(i)f(i), a base point bb to g(b)g(b), a finite subset ss of BMB_M to g[s]g[s], a finite subset of ℕ\mathbb{N} to itself, a row (t,n,s)(t, n, s) to (f∘t,n,u(t,n)△g[s])(f \circ t, n, u(t, n) \mathbin{\triangle} g[s]) and a column (t,b,w)(t, b, w) to (f∘t,g(b),v(t,b)△w)(f \circ t, g(b), v(t, b) \mathbin{\triangle} w).

Given a map from MM to NN with data ff, gg, uu, vv as above, the color of a tuple tt from IMI_M at a point b∈BNb \in B_N along the map is ctf(b)=[n↦aN(f∘t,n,b)+1b∈u(t,n)mod⁡2].c^f_t(b) = [\, n \mapsto a_N(f \circ t, n, b) + 1_{b \in u(t, n)} \bmod 2 \,].(8) A map from MM to NN is strong when the image of gg is convex in BNB_N and, at every point bb of BNB_N outside that image, every tuple tt from IMI_M passes the test for s↦csf(b)s \mapsto c^f_s(b). For structures RR and TT, R≤KTR \le_K T when they are presented by objects MM and NN joined by a strong map from MM to NN that induces the inclusion of RR in TT: each point of MM and its image present the same element.✦

Let İ(μ,K)\dot I(\mu, K) be the number of models of KK of cardinality μ\mu up to isomorphism. The class KK is categorical in a cardinal μ\mu when İ(μ,K)=1\dot I(\mu, K) = 1.✦

The Claim

Theorem 1.

  • Assume CH. For every cardinal μ≥Λ\mu \ge \Lambda, İ(μ,K)=1.\dot I(\mu, K) = 1.(9)✦

  • Assume CH. For every infinite cardinal μ\mu, İ(μ,K)≥1.\dot I(\mu, K) \ge 1.(10)✦

  • Let μ≥Λ\mu \ge \Lambda be a cardinal and M=(I,B,<,a)M = (I, B, <, a) a normal form with ∥M∥=μ\|M\| = \mu. Then |I|=μ.|I| = \mu.(11)✦

  • Assume CH. Let μ≥Λ\mu \ge \Lambda be a cardinal and M=(I,B,<,a)M = (I, B, <, a) an object with ∥M∥=μ\|M\| = \mu. Then |B|≤ℵ0.|B| \le \aleph_0.(12)✦

What Is Checked

The claim is stated over the class KK defined under CH, with its models presented by objects and its strong substructure relation, over normal forms with their points, colors and tests and the coding of diagrams by colors, and over the threshold Λ\Lambda of (1). About these constructions, the library proves that equality outside a finite set, =*=^*, is an equivalence relation on 2ω2^\omega.