OctoInformBeta

OpenAI preprint, September 2026 · §7. Typed data channels · §7

The forbidden configuration and two data channels: Odd observation paths and even proof paths through feasible product profiles

Fixed data channels and quantifier routes.

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 P=(S,𝒜,ℛ)P=(S,\mathcal A,\mathcal R) be a pure type specification, with arbitrary axiom relation 𝒜⊆S×S\mathcal A\subseteq S\times S and product-rule relation ℛ⊆S×S×S\mathcal R\subseteq S\times S\times S.✦ Dependent products may have several sort witnesses. The setting for typed data channels retains labelled terms along signed paths and uses feasible sort profiles to specify routes for formula quantifiers.

Pure type system terms are variables, sort constants, applications MNM\,N, annotated abstractions λx:A.M\lambda x:A.M, and dependent products Πx:A.B\Pi x:A.B.✦ Variables have de Bruijn indices, with zero referring to the nearest binder; displayed bound names are named notation. Contexts are finite lists in newest-first order.

A labelled term MM is a term with a label attached to each application, abstraction and product.✦ The modes are data d\mathrm d and proof p\mathrm p.✦ A label records its argument and result modes: dddd has modes (d,d)(\mathrm d,\mathrm d), dpdp has (d,p)(\mathrm d,\mathrm p), and pppp has (p,p)(\mathrm p,\mathrm p). Write dom⁡(ℓ)\operatorname{dom}(\ell) and res⁡(ℓ)\operatorname{res}(\ell) for these two modes. A labelled term MM is data-only when every labelled constructor in it has label dddd.✦ The label erasure |M||M| of a labelled term MM is the underlying term obtained by deleting all labels.✦

Renaming by ρ:ℕ→ℕ\rho:\mathbb N\to\mathbb N replaces index nn by ρ(n)\rho(n). Simultaneous substitution by σ\sigma replaces index nn by σ(n)\sigma(n). Both operations fix sorts and act recursively, preserving labels when present. Under a binder, renaming fixes zero and sends n+1n+1 to ρ(n)+1\rho(n)+1; substitution fixes zero and shifts every free index of σ(n)\sigma(n) by one at index n+1n+1. The single-variable substitution determined by aa sends zero to aa and n+1n+1 to variable nn. The instantiation b[a]b[a] of a term bb by a term aa is the term obtained by applying the single-variable substitution determined by aa to bb, in either syntax.

Full β\beta reduction contracts (λx:A.b)a(\lambda x:A.b)\,a to b[a]b[a] and is closed under every term component, including annotations and binder bodies.✦ Labelled β\beta reduction additionally requires the application and abstraction in a head contraction to have the same label.✦ In each syntax, β\beta convertibility is the equivalence relation generated by its reduction relation.

For a context Γ\Gamma, the typing judgement Γ⊢M:A\Gamma\vdash M:A assigns an expected type AA to a subject MM. Its rules are the axiom, variable, weakening, dependent product, abstraction, application and conversion rules for PP. Context extension shifts free indices in the variable and weakening rules. A product uses a triple (s1,s2,s3)∈ℛ(s_1,s_2,s_3)\in\mathcal R sorting its domain, codomain and product; an abstraction requires its product type to have a sort. Application instantiates the codomain, and conversion requires the new expected type to have a sort. Labelled typing uses the same rules, retains the product’s label in abstraction and application, and uses labelled convertibility.✦

A mode environment γ:ℕ→{d,p}\gamma:\mathbb N\to\{\mathrm d,\mathrm p\} assigns modes to variables. For a mode environment γ\gamma and a mode mm, the extended mode environment γ[m]\gamma[m] is the map assigning mm to zero and γ(n)\gamma(n) to n+1n+1.✦ The mode discipline gives variable nn mode γ(n)\gamma(n) and every sort data mode. An application with label ℓ\ell requires its function to have mode res⁡(ℓ)\operatorname{res}(\ell) and its argument mode dom⁡(ℓ)\operatorname{dom}(\ell); its result has mode res⁡(ℓ)\operatorname{res}(\ell). An abstraction requires a data annotation and a body of result mode under γ[dom⁡(ℓ)]\gamma[\operatorname{dom}(\ell)]. A product has data mode and requires a data domain and a data codomain under that same extension.

Profiles and Witnesses

A valid unlabelled context Γ\Gamma is a finite list obtained from the empty context by extensions from Δ\Delta to A,ΔA,\Delta whenever Δ⊢A:s\Delta\vdash A:s for some sort ss.✦

A term MM is β\beta-normal when it has no one-step reduct.✦ A weakly normalizing term TT is a term that reaches a normal term in finitely many steps; T#T^{\#} denotes its chosen full β\beta-normal form.

For a context Γ\Gamma, a weakly normalizing term TT, and subsets II and JJ of SS, the normal form sort profile πΓ(T)\pi_\Gamma(T) and the product output profile Out⁡(I,J)\operatorname{Out}(I,J) are the subsets of SS defined in (1). πΓ(T)={s∈S∣Γ⊢T#:s},Out⁡(I,J)={c∈S∣∃a∈I∃b∈J,(a,b,c)∈ℛ}.\begin{aligned} \pi_\Gamma(T)&=\{s\in S\mid\Gamma\vdash T^{\#}:s\},\\ \operatorname{Out}(I,J)&= \{c\in S\mid\exists a\in I\;\exists b\in J,\ (a,b,c)\in\mathcal R\}. \end{aligned}(1) A feasible sort profile I⊆SI\subseteq S is a nonempty subset of SS equal to πΔ(T)\pi_\Delta(T) for some valid unlabelled context Δ\Delta and normal term TT.✦ A feasible product profile triple (I,J,K)(I,J,K) consists of feasible profiles with K=Out⁡(I,J)K=\operatorname{Out}(I,J).✦

For a labelled context Γ\Gamma, sorting a labelled term AA at a profile II means Γ⊢A:s\Gamma\vdash A:s for every s∈Is\in I; further sorting judgements are permitted.✦ A fixed feasible witness family W=(TI,vI)I⊆SW=(T_I,v_I)_{I\subseteq S} in (Γ,γ)(\Gamma,\gamma) is a family of pairs of labelled terms such that, at every feasible II, TIT_I is data-only, |TI||T_I| is normal, and TIT_I is sorted at II in Γ\Gamma. Its value satisfies Γ⊢vI:TI\Gamma\vdash v_I:T_I, and both TIT_I and vIv_I have data mode under γ\gamma.

Retained Paths

Let 𝒲S\mathcal W_S be the proof wrapper syntax over SS: finite expressions generated by the identity id\mathrm{id} and positive and negative extensions R+(A)R^+(A) and R−(A)R^-(A), each adjoining a fixed labelled term AA to a preceding wrapper RR.✦ The wrappers and their annotations remain fixed under substitution of inputs and enlargement of their sorting profiles.

Fix a witness family WW and a collection 𝒞⊆𝒫(S)\mathcal C\subseteq\mathcal P(S) of profiles. A proof wrapper path Path⁡W,𝒞ε(I,J;R)\operatorname{Path}^{\varepsilon}_{W,\mathcal C}(I,J;R) relates source profile II to target profile JJ with wrapper R∈𝒲SR\in\mathcal W_S and parity ε∈{0,1}\varepsilon\in\{0,1\}. The proof wrapper path relation Path⁡W,𝒞ε(I,J;R)\operatorname{Path}^{\varepsilon}_{W,\mathcal C}(I,J;R) is the least relation given by (2), with subscripts W,𝒞W,\mathcal C suppressed and the word “feasible” denoting a feasible product profile triple. Path⁡0(I,I;id),Path⁡ε(I,J;R)K⊆JPath⁡ε(I,K;R),Path⁡ε(I,J;R)(L,J,K) feasiblePath⁡ε(I,K;R+(TL)),Path⁡ε(I,J;R)(J,L,K) feasibleJ,K∈𝒞Path⁡1−ε(I,K;R−(TL)).\begin{gathered} \operatorname{Path}^{0}(I,I;\mathrm{id}),\\[2pt] \frac{\operatorname{Path}^{\varepsilon}(I,J;R)\quad K\subseteq J} {\operatorname{Path}^{\varepsilon}(I,K;R)},\\[5pt] \frac{\operatorname{Path}^{\varepsilon}(I,J;R)\quad (L,J,K)\text{ feasible}} {\operatorname{Path}^{\varepsilon}(I,K;R^+(T_L))},\\[5pt] \frac{\operatorname{Path}^{\varepsilon}(I,J;R)\quad (J,L,K)\text{ feasible} \quad J,K\in\mathcal C} {\operatorname{Path}^{1-\varepsilon}(I,K;R^-(T_L))}. \end{gathered}(2)✦

A positive data path L∈𝒟S+L\in\mathcal D^+_S is a finite path generated by the identity and extensions retaining two fixed labelled terms, an annotation and its original dummy argument.✦ A data path tail τ∈𝒯S\tau\in\mathcal T_S is a tuple (s,L,Renc,Rdec)(s,L,R_{\mathrm{enc}},R_{\mathrm{dec}}) with s∈Ss\in S, L∈𝒟S+L\in\mathcal D^+_S, and encoding and decoding wrappers Renc,Rdec∈𝒲SR_{\mathrm{enc}},R_{\mathrm{dec}}\in\mathcal W_S.✦

A retained data path D∈𝒟SεD\in\mathcal D_S^{\varepsilon} is a finite path generated by an even identity, positive extensions retaining two fixed labelled terms, and negative extensions retaining a data path tail. Positive extensions preserve parity and negative extensions reverse it. The values zero and one denote even and odd parity, respectively.

The Definition

Definition 1. An observation channel cc over SS is a triple of odd retained data paths, with logical, raw and predicate components as in (3). c=(Dlog,Draw,Dpred)∈𝒟S1×𝒟S1×𝒟S1.c=(D_{\mathrm{log}},D_{\mathrm{raw}},D_{\mathrm{pred}}) \in\mathcal D_S^1\times\mathcal D_S^1\times\mathcal D_S^1.(3)✦

A double channel dd over SS is an ordered pair of odd retained data paths as in (4). d=(D1,D2)∈𝒟S1×𝒟S1.d=(D_1,D_2)\in\mathcal D_S^1\times\mathcal D_S^1.(4)✦

A common probe pp over SS is the tuple of fixed syntax in (5), where ss is its seed sort and ε\varepsilon its initial parity. p=(s,ε,Dinit,Draw,Dback,Dfun,L,τ),s∈S,ε∈{0,1},Dinit∈𝒟Sε,Draw,Dback∈𝒟S1,Dfun∈𝒟S0,L∈𝒟S+,τ∈𝒯S.\begin{gathered} p=(s,\varepsilon,D_{\mathrm{init}},D_{\mathrm{raw}},D_{\mathrm{back}},D_{\mathrm{fun}},L,\tau),\\ s\in S,\quad\varepsilon\in\{0,1\},\quad D_{\mathrm{init}}\in\mathcal D_S^{\varepsilon},\quad D_{\mathrm{raw}},D_{\mathrm{back}}\in\mathcal D_S^1,\\ D_{\mathrm{fun}}\in\mathcal D_S^0,\quad L\in\mathcal D^+_S,\quad\tau\in\mathcal T_S. \end{gathered}(5)✦

Fix PP, a labelled context Γ\Gamma, a mode environment γ\gamma, a feasible witness family WW in (Γ,γ)(\Gamma,\gamma), and a collection 𝒞\mathcal C of profiles. A quantifier wrapper route rr for base profile bb and domain profile II is a choice of codomain and product profiles and even proof wrapper paths satisfying (6). r=(J,K,Rin,Rout),(I,J,K) is a feasible product profile triple,Path⁡W,𝒞0(b,J;Rin),Path⁡W,𝒞0(K,b;Rout).\begin{gathered} r=(J,K,R_{\mathrm{in}},R_{\mathrm{out}}),\qquad (I,J,K)\text{ is a feasible product profile triple},\\ \operatorname{Path}^{0}_{W,\mathcal C}(b,J;R_{\mathrm{in}}),\qquad \operatorname{Path}^{0}_{W,\mathcal C}(K,b;R_{\mathrm{out}}). \end{gathered}(6)✦

A universal quantifier code qq over SS is a pair of fixed input and output proof wrappers as in (7). q=(Rin,Rout)∈𝒲S×𝒲S.q=(R_{\mathrm{in}},R_{\mathrm{out}})\in\mathcal W_S\times\mathcal W_S.(7)✦

What Is Checked

The definitions concern labelled syntax over arbitrary sort collections and, for quantifier wrapper routes, a pure type specification with a fixed feasible witness family in a labelled context, a mode environment and a collection of sort profiles.