OctoInformBeta

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

Lemma 4.4: The diagram Dt,βD_{t,\beta} commutes with restriction, and at tags good for tt it is valid and tt passes the test

Each tuple fails the test at only countably many tags.

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

Fix the set DD, a copy of the von Neumann stage Vω2V_{\omega_2}, and a tag β\beta, a countable ordinal. To every finite injective sequence tt of points of DD the library attaches a diagram Dt,βD_{t,\beta} on the positions of tt. Its labels, defined below, name points of the countable closures, also defined below, of the sets of members of tt, and it records equality and membership among them, with a countable ordinal for each point computed from its rank and from β\beta. Under the continuum hypothesis (CH), 2ℵ0=ℵ12^{\aleph_0} = \aleph_1, the diagram of a tuple tt is coded by a color, an element of a palette SS defined below. Lemma 4.4 asks how these diagrams behave on the subsequences of tt, called its subtuples, and at how many tags the colors of the subtuples of tt fail the test defined below.

Closures and Tags

The copy DD of Vω2V_{\omega_2} is a set whose points correspond one to one to the sets of rank below ω2\omega_2.✦ A point aa of DD is a member of a point bb, written a∈ba \in b, when the set that aa stands for is an element of the set that bb stands for✦, and the rank rk⁡(a)\operatorname{rk}(a) of aa is the rank of the set it stands for, an ordinal below ω2\omega_2✦.

A witness for two distinct points of DD is a point that is a member of exactly one of them, and ww is a fixed map on pairs of points of DD that sends two distinct points to a witness for them. The countable closure DXD_X of a nonempty finite set X⊆DX \subseteq D is the union of the stages X0=X,Xr+1=Xr∪{w(a,b):a,b∈Xr},X_0 = X, \qquad X_{r+1} = X_r \cup \{w(a, b) : a, b \in X_r\},(1) and its enumeration dX:ℕ→DXd_X : \mathbb{N} \to D_X is a surjection whose first term dX(0)d_X(0) lies in XX✦.

For each α<ω2\alpha < \omega_2, eαe_\alpha is a fixed injection of the set of ordinals below α\alpha into ω1\omega_1✦, and the functions fα:ω1→ω1f_\alpha : \omega_1 \to \omega_1 of Lemma 4.1 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)✦

The local tag of a point aa of DD at a tag β\beta is frk⁡(a)(β)f_{\operatorname{rk}(a)}(\beta).✦ A tag β\beta is good for a nonempty finite set X⊆DX \subseteq D when local tags at β\beta strictly increase along membership in DXD_X: frk⁡(a)(β)<frk⁡(c)(β)for all a,c∈DX with a∈c.f_{\operatorname{rk}(a)}(\beta) < f_{\operatorname{rk}(c)}(\beta) \quad \text{for all } a, c \in D_X \text{ with } a \in c.(3)✦

Diagrams, Colors and the Test

A label on a set PP of positions is a pair (J,i)(J, i) with JJ a nonempty finite subset of PP and i∈ℕi \in \mathbb{N}.✦ The root of a position p∈Pp \in P is the label ({p},0)(\{p\}, 0).✦ An injection ee of a set P′P' of positions into PP sends a label (J,i)(J, i) on P′P' to the label (e[J],i)(e[J], i) on PP.✦ A diagram Δ\Delta on PP is a triple (E,R,ρ)(E, R, \rho) of binary relations EE and RR on the labels on PP and a map ρ\rho from these labels to the tags.✦ The restriction Δ↾e\Delta \restriction e of a diagram Δ\Delta on PP along an injection ee of P′P' into PP is the diagram on P′P' in which two labels are related by EE, or by RR, when their images under ee are, and each label has the tag of its image.✦

A diagram Δ=(E,R,ρ)\Delta = (E, R, \rho) on a set PP of positions is valid when EE is an equivalence relation, RR and ρ\rho respect EE, ρ(l)<ρ(l′)\rho(l) < \rho(l') for all labels l,l′l, l' with lRl′l \mathrel{R} l', two labels with the same RR-predecessors are EE-equivalent, and the roots of distinct positions of PP are not EE-equivalent.✦

Let tt be a finite injective sequence of points of DD on the positions 0,…,k−10, \dots, k - 1. For a nonempty J⊆{0,…,k−1}J \subseteq \{0, \dots, k - 1\}, t[J]t[J] is the set of the points t(j)t(j) with j∈Jj \in J✦, and the entry of a label l=(J,i)l = (J, i) is the point xl=dt[J](i)x_l = d_{t[J]}(i) of the closure of t[J]t[J]✦. The diagram Dt,βD_{t,\beta} of tt at a tag β\beta is the diagram on the positions of tt given by 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).(4)✦

A tuple tt from a set II is an injective map from {0,…,n}\{0, \dots, n\} into II, for some n∈ℕn \in \mathbb{N}; it is the same as a finite injective sequence of points of II on the positions 0,…,n0, \dots, n.✦ The subtuple of tt along an order embedding e:{0,…,m}→{0,…,n}e : \{0, \dots, m\} \to \{0, \dots, n\} is the tuple t∘et \circ e.✦ For a tuple tt from DD, XtX_t is the set of its members.

Under CH, fix an injection code\operatorname{code} of the disjoint union over n∈ℕn \in \mathbb{N} of the sets of diagrams on {0,…,n}\{0, \dots, n\} into the palette S=2ω/=*S = 2^\omega/{=^*} of binary sequences modulo equality outside a finite set; the elements of SS are called colors.✦ The coloring cβc_\beta at a tag β\beta gives a tuple tt from DD on {0,…,n}\{0, \dots, n\} the color cβ(t)=code⁡(n,Dt,β)∈S.c_\beta(t) = \operatorname{code}(n, D_{t,\beta}) \in S.(5)✦

Assume CH. A family ss that assigns a color s(e)∈Ss(e) \in S to every order embedding ee of some {0,…,m}\{0, \dots, m\} into {0,…,n}\{0, \dots, n\} passes when there is a diagram Δ\Delta on {0,…,n}\{0, \dots, n\} such that, for every such ee, Δ↾e is valid and code⁡(m,Δ↾e)=s(e).\Delta \restriction e \text{ is valid and } \operatorname{code}(m, \Delta \restriction e) = s(e).(6)✦ For a coloring cc of the tuples from II by colors in SS, the test Tc(t)T_c(t) of a tuple tt from II holds when the family of the colors c(t∘e)c(t \circ e) of its subtuples passes.✦

The Claim

Theorem 1. (i) Let tt be a finite injective sequence of points of DD on the positions 0,…,k−10, \dots, k - 1, let ee be an injection of the positions 0,…,m−10, \dots, m - 1 into {0,…,k−1}\{0, \dots, k - 1\}, and let β\beta be a tag. Then Dt∘e,β=Dt,β↾e.D_{t \circ e, \beta} = D_{t,\beta} \restriction e.(7)✦

(ii) Let tt be a tuple from DD and β\beta a tag good for XtX_t. Then Dt,β is valid.D_{t,\beta} \text{ is valid.}(8)✦

(iii) Assume CH. Let tt be a tuple from DD and β\beta a tag good for XtX_t. Then Tcβ(t) holds.T_{c_\beta}(t) \text{ holds.}(9)✦

(iv) Assume CH. For every tuple tt from DD, {β<ω1:Tcβ(t) fails} is countable.\{\beta < \omega_1 : T_{c_\beta}(t) \text{ fails}\} \text{ is countable.}(10)✦

In the paper, the result reads: for every tuple tt, the quotient QDt,βQ_{D_{t,\beta}} of Dt,βD_{t,\beta} by EE is DXD_X with membership; (i) Dt,β↾J=Dt↾J,βD_{t,\beta} \restriction J = D_{t \restriction J,\beta}; (ii) if β∉FX\beta \notin F_X, every Dt↾J,βD_{t \restriction J,\beta} is valid; hence, for β∉FX\beta \notin F_X, the colors st↾J,βs_{t \restriction J,\beta} pass the full test; there XX is XtX_t, t↾Jt \restriction J is the subtuple of tt on a set JJ of its positions, st↾J,βs_{t \restriction J,\beta} is its color cβ(t↾J)c_\beta(t \restriction J), and β∉FX\beta \notin F_X says that β\beta is good for XX.

What Is Checked

The claim is stated over the copy DD of Vω2V_{\omega_2} with membership and rank, the closures DXD_X with their enumerations, the functions fαf_\alpha of (2) and the goodness of tags (3), the diagrams Dt,βD_{t,\beta} of (4) with restriction and validity, and, under CH, the coloring cβc_\beta of (5) and the test built on (6).

Beside the claim, the library proves that membership separates the points of DD: any two distinct points of DD have a witness.✦