OctoInformBeta

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

The bad sets F_X and the diagrams D_{t,β}: Under the continuum hypothesis a tuple’s color at β<ω1\beta < \omega_1 codes equality and membership among its entries xx, tagged by frank⁡x(β)f_{\operatorname{rank} x}(\beta)

Tagged membership diagrams of tuples from Vω2V_{\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

Let DD be a copy of the von Neumann stage Vω2V_{\omega_2}, the set of all sets of rank below ω2\omega_2✦: a set whose points correspond one to one to the elements of Vω2V_{\omega_2}, each point standing for the set it copies.✦ For points aa and bb of DD, a∈ba \in b holds when the set that aa stands for is an element of the set that bb stands for✦, and the rank rank⁡a\operatorname{rank} a of aa is the rank of its set, an ordinal below ω2\omega_2.✦ A tuple from DD is an injective map tt from {0,…,n}\{0, \dots, n\} into DD, for some n∈ℕn \in \mathbb{N}.✦

The item turns a tuple tt from DD and a countable ordinal β\beta into a diagram, defined below, that records equality and membership among the points of the countable closures of parts of tt, each point tagged by a countable ordinal read off its rank at β\beta. Under the continuum hypothesis (CH), 2ℵ0=ℵ12^{\aleph_0} = \aleph_1, the diagrams are coded by the colors of the palette SS defined below.

Closures, Tags and Diagrams

A binary relation on a set AA separates points when any two distinct points xx and yy of AA have a witness, a point that the relation relates to exactly one of them. Fix such a relation and a witness map ww on pairs of points of AA that picks a witness w(x,y)w(x, y) for any distinct xx and yy. The closure Z¯\overline{Z} of a subset ZZ of AA under witnesses is the union of its stages ZnZ_n, defined by recursion on n∈ℕn \in \mathbb{N}: Z0=Z,Zn+1=Zn∪{w(x,y):x,y∈Zn},Z¯=⋃n∈ℕZn.Z_0 = Z, \qquad Z_{n+1} = Z_n \cup \{ w(x, y) : x, y \in Z_n \}, \qquad \overline{Z} = \bigcup_{n \in \mathbb{N}} Z_n.(1)✦

A seed in AA is a nonempty finite subset of AA.✦ The enumeration of the closure X¯\overline{X} of a seed XX is a sequence (xn)n∈ℕ(x_n)_{n \in \mathbb{N}} of points of X¯\overline{X} in which x0x_0 is a point chosen in XX and n↦xn+1n \mapsto x_{n+1} is a surjection of ℕ\mathbb{N} onto X¯\overline{X}.✦ For membership on DD and a seed XX in DD, the closure is the countable set DXD_X, and its enumeration is dX:ℕ→DXd_X\colon \mathbb{N} \to D_X.

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

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}.✦ A diagram on AA is a triple (E,R,ρ)(E, R, \rho) in which EE and RR are binary relations on the labels on AA and ρ\rho assigns to each label a tag, an element of ω1\omega_1; Diag⁡(A)\operatorname{Diag}(A) denotes the set of diagrams on AA.✦

The palette S=2ω/=*S = 2^\omega/{=^*} is the set of binary sequences modulo equality outside a finite set, and its elements are the colors.✦ If CH holds, the code of diagrams by colors is an injection ι:⨆n∈ℕDiag⁡({0,…,n})↪S.\iota\colon \bigsqcup_{n \in \mathbb{N}} \operatorname{Diag}(\{0, \dots, n\}) \hookrightarrow S.(3)✦

The Claim

Definition 1. Let tt be an injective map from the set P={0,…,k−1}P = \{0, \dots, k-1\} of positions into DD, for some k∈ℕk \in \mathbb{N}, and for a nonempty finite J⊆PJ \subseteq P let XJ={t(j):j∈J}X_J = \{t(j) : j \in J\}, the seed of the members of tt at the positions JJ.✦ The entry of tt at a label (J,i)(J, i) on PP is qt(J,i)=dXJ(i).q_t(J, i) = d_{X_J}(i).(4)✦ For β<ω1\beta < \omega_1, the tag of a point xx of DD at β\beta is τβ(x)=frank⁡x(β).\tau_\beta(x) = f_{\operatorname{rank} x}(\beta).(5)✦ The diagram Dt,β=(E,R,ρ)D_{t,\beta} = (E, R, \rho) of tt at β\beta is the diagram on PP given, for labels ℓ\ell and ℓ′\ell' on PP, by ℓEℓ′⇔qt(ℓ)=qt(ℓ′),ℓRℓ′⇔qt(ℓ)∈qt(ℓ′),ρ(ℓ)=τβ(qt(ℓ)).\ell \mathrel{E} \ell' \iff q_t(\ell) = q_t(\ell'), \qquad \ell \mathrel{R} \ell' \iff q_t(\ell) \in q_t(\ell'), \qquad \rho(\ell) = \tau_\beta(q_t(\ell)).(6)✦ For a seed XX in DD, an ordinal β<ω1\beta < \omega_1 is good for XX when the tags increase along membership in DXD_X, τβ(y)<τβ(x)for all x,y∈DX with y∈x,\tau_\beta(y) < \tau_\beta(x) \quad \text{for all } x, y \in D_X \text{ with } y \in x,(7)✦ and bad for XX otherwise. For every seed XX in DD, {β<ω1:β is bad for X} is countable,\{\beta < \omega_1 : \beta \text{ is bad for } X\} \text{ is countable},(8)✦ and for every seed YY in DD with X⊆YX \subseteq Y, {β<ω1:β is good for Y}⊆{β<ω1:β is good for X}.\{\beta < \omega_1 : \beta \text{ is good for } Y\} \subseteq \{\beta < \omega_1 : \beta \text{ is good for } X\}.(9)✦ If CH holds, the color of a tuple tt from DD of length n+1n + 1 at β<ω1\beta < \omega_1 is st,β=ι(n,Dt,β)∈S.s_{t,\beta} = \iota(n, D_{t,\beta}) \in S.(10)✦

In the paper, the result reads: the bad set FXF_X is the union of the countable sets Erank⁡y,rank⁡xE_{\operatorname{rank} y, \operatorname{rank} x} over the membership edges y∈xy \in x in DXD_X, the diagram Dt,βD_{t,\beta} has the equality and membership of the entries qt(J,i)=dXJ(i)q_t(J, i) = d_{X_J}(i) and the tags frank⁡qt(ℓ)(β)f_{\operatorname{rank} q_t(\ell)}(\beta), and st,β=ιk(Dt,β)s_{t,\beta} = \iota_k(D_{t,\beta}), the paper’s ιk\iota_k being the page’s code ι\iota.

What Is Checked

The claim is stated over the copy DD of Vω2V_{\omega_2} with its membership and ranks, the closures DXD_X of seeds under witnesses with their enumerations dXd_X, the functions fαf_\alpha built from the injections eαe_\alpha, labels and diagrams on sets of positions, tuples from DD, and, under CH, the code ι\iota of diagrams by colors in the palette SS.

Beside the claim, the library proves that membership separates the points of DD: any two distinct points of DD have a witness, a point of DD that is a member of exactly one of them.✦