OctoInformBeta

OpenAI preprint, September 2026 · §5. Assembling a self-dual matroid

Lemma 5.2: For any rank model, sets AāŠ†ZA \subseteq Z in E0E_0 with AA not upper and ZZ not lower have an admissible set between them

An admissible set lies between nested lower and upper sets.

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 countable set DD is the set of pairs (m,f)(m, f) of a natural number mm and a Boolean function f:{0,1}m→{0,1}f : \{0,1\}^m \to \{0,1\} of mm inputs.✦ The doubled set E0=DƗ{false,true}E_0 = D \times \{\mathrm{false}, \mathrm{true}\} is the disjoint union LāŠ”RL \sqcup R of two copies of DD: the pairs with second entry false form LL, and those with second entry true form RR.✦ The slices of a subset XX of E0E_0 are the subsets XLX_L and XRX_R of DD given by XL={d∈D:(d,false)∈X},XR={d∈D:(d,true)∈X}.X_L = \{d \in D : (d, \mathrm{false}) \in X\}, \qquad X_R = \{d \in D : (d, \mathrm{true}) \in X\}.(1)✦

Rank Models

The continuum index set is the set of ordinals below š” \mathfrak c, the continuum taken as its initial ordinal; it has cardinality š” \mathfrak c.✦

An ideal š’¦\mathcal K on a set α\alpha is a family of subsets of α\alpha that contains the empty set, is closed under subsets and under unions of two members, and is proper: Ī±āˆ‰š’¦\alpha \notin \mathcal K.✦ For subsets XX and YY of α\alpha, XX is contained in YY modulo š’¦\mathcal K, written XāŠ†š’¦YX \subseteq_{\mathcal K} Y, when X\Yāˆˆš’¦X \setminus Y \in \mathcal K.✦

A rank model on a set α\alpha is a triple (š’¦,š’°,ρ)(\mathcal K, \mathcal U, \rho) of an ideal š’¦\mathcal K on α\alpha, an ultrafilter š’°\mathcal U on α\alpha disjoint from š’¦\mathcal K, and a rank ρ\rho from the subsets of α\alpha to the continuum index set, with two properties. A subset of α\alpha is large when it belongs to š’°\mathcal U. The rank is antitone modulo š’¦\mathcal K on large sets, ρ(Y)≤ρ(X)for all X,Yāˆˆš’° with XāŠ†š’¦Y,\rho(Y) \le \rho(X) \quad \text{for all } X, Y \in \mathcal U \text{ with } X \subseteq_{\mathcal K} Y,(2) and it admits rank-raising thinning: for every large set XX, every set sāŠ†Xs \subseteq X that is not large and every γ<š” \gamma < \mathfrak c, there is a large set uu with sāŠ†uāŠ†X,ρ(u)>γ.s \subseteq u \subseteq X, \qquad \rho(u) > \gamma.(3)✦

The Zones

Fix a rank model (š’¦,š’°,ρ)(\mathcal K, \mathcal U, \rho) on DD. A subset XX of E0E_0 is upper when XLāˆˆš’°andρ(XL)≤ρ(D\XR) whenever D\XRāˆˆš’°.X_L \in \mathcal U \quad \text{and} \quad \rho(X_L) \le \rho(D \setminus X_R) \text{ whenever } D \setminus X_R \in \mathcal U.(4)✦

Dually, a subset XX of E0E_0 is lower when its complement E0\XE_0 \setminus X is upper.✦

A subset XX of E0E_0 is admissible when one of two cases holds: {XLāˆˆš’°,D\XRāˆˆš’° and ρ(D\XR)<ρ(XL),orXLāˆ‰š’°,D\XRāˆ‰š’° and ρ(XR)<ρ(D\XL).\begin{cases} X_L \in \mathcal U,\ D \setminus X_R \in \mathcal U \text{ and } \rho(D \setminus X_R) < \rho(X_L), & \text{or}\\ X_L \notin \mathcal U,\ D \setminus X_R \notin \mathcal U \text{ and } \rho(X_R) < \rho(D \setminus X_L). \end{cases}(5)✦

The Claim

Theorem 1. Let (š’¦,š’°,ρ)(\mathcal K, \mathcal U, \rho) be a rank model on DD, and let AāŠ†ZA \subseteq Z be subsets of E0E_0.

(i) If AA is lower and ZZ is upper, there is an admissible set BB with AāŠ†BāŠ†Z.A \subseteq B \subseteq Z.(6)✦

(ii) If AA is not upper and ZZ is not lower, there is again an admissible set BB with AāŠ†BāŠ†Z.A \subseteq B \subseteq Z.(7)✦

In the paper, the result reads: if AāŠ†ZāŠ†E0A \subseteq Z \subseteq E_0 with AA lower and ZZ upper, there is an admissible set BB with AāŠ†BāŠ†ZA \subseteq B \subseteq Z.

What Is Checked

The claim is stated over an arbitrary rank model on DD and subsets AāŠ†ZA \subseteq Z of E0E_0, with the upper, lower and admissible sets of (4) and (5) read off the slices (1).