OctoInformBeta

OpenAI preprint, September 2026 Β· Β§8. Relational coding of the diagonal argument

Lemma 47: Two signed markers distinguish tags while predicate observations retain comparison of their payloads

Tagged observations separate the three copies.

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

Consider data terms reencoded through two successive double data channels. Their observations include marker formulas and tests against predicates on the original carrier. The comparison of two such terms is a formula in the ambient logical calculus.

Fix a pure type specification P=(S,π’œ,β„›)P=(S,\mathcal A,\mathcal R) with arbitrary axiom and product-rule relations, a context Ξ“\Gamma, and an assignment Ξ³\gamma of data and proof modes to its variables. Terms have annotated abstractions and dependent products, with labels dddd, dpdp, and pppp specifying data-to-data, data-to-proof, and proof-to-proof arguments and results. Typing is written Ξ“βŠ’M:A\Gamma\vdash M:A. The mode discipline gives variables their declared modes and sorts data mode; an application has its label’s result mode when its function has that mode and its argument has the label’s argument mode. An abstraction has its label’s result mode when its annotation has data mode and its body has the result mode under the corresponding binder extension; a dependent product has data mode when its domain and codomain have data mode, with the codomain checked under that extension. Named bound variables below correspond to de Bruijn indices, with contexts ordered newest first. Substitution is capture-avoiding, and full Ξ²\beta reduction includes annotations and binder bodies. For ordinary terms, Ξ²\beta convertibility is the smallest equivalence relation containing one-step Ξ²\beta reduction. For labelled terms, labelled Ξ²\beta convertibility is the smallest equivalence relation containing labelled Ξ²\beta reduction.

Write Mβˆˆπ’ŸAM\in\mathcal D_A when Ξ“βŠ’M:A\Gamma\vdash M:A and MM has data mode under Ξ³\gamma. A formula FF is inhabited in proof mode, written ⊩F\Vdash F, when there is a term pp with Ξ“βŠ’p:F\Gamma\vdash p:F and pp has proof mode.✦ A typed open transformer from FF to GG is a proof-mode term of type GG in the context extended by a temporary proof-mode input of type FF.✦ For formulas FF and GG, formula equivalence F≑pGF\equiv_{\mathrm p}G is the relation given by proof-mode terms that transform a temporary proof-mode input of either formula into a term of the other formula.✦

A sort profile is the set of all sorts typing a chosen normal form of a type.✦ A feasible profile is a nonempty set of sorts typing a normal type in a context obtained from the empty context by adjoining types that have a sort.✦ For profiles A,BA,B, the product output Out⁡(A,B)\operatorname{Out}(A,B) is the set of all sorts cc for which some a∈Aa\in A and b∈Bb\in B satisfy (a,b,c)βˆˆβ„›(a,b,c)\in\mathcal R✦; a feasible product profile triple (A,B,C)(A,B,C) is a triple of feasible profiles satisfying C=Out⁡(A,B)C=\operatorname{Out}(A,B).✦

A term MM is weakly normalizing when some β\beta normal form is reachable from MM by zero or more β\beta steps.✦

The signed primary graph has positive edges Aβ†’BA\to B for proper inclusions B⊊AB\subsetneq A of feasible profiles; each feasible product profile triple (A,B,D)(A,B,D) also gives a negative edge Aβ†’DA\to D and a positive edge Bβ†’DB\to D, and these are its only edges.✦ Positive reachability in a signed graph means a finite, possibly empty path all of whose edges are positive.✦

A fixed feasible witness family chooses, at each feasible sort profile, a type using only data syntax, in data mode, whose underlying unlabelled term is in normal form and which is sorted at every sort in that profile, together with a data-mode inhabitant.✦ For a collection CC of profiles, a formed proof path starts with identity at its source profile and permits restriction of its target to any subset; a feasible triple (A,J,K)(A,J,K) extends a path ending at JJ positively to KK using the chosen type at AA, while (J,B,K)(J,B,K) extends it negatively using the chosen type at BB when J,K∈CJ,K\in C.✦ Positive steps preserve parity and negative steps reverse it. Let LL be an ambient logical calculus with collection CC of profiles and domain, base and product profiles d,b,k∈Cd,b,k\in C forming a feasible product profile triple, falsity βŠ₯\bot equal to its chosen witness type at bb, and even proof paths Uin:bβ†’dU_{\mathrm{in}}:b\to d and Uout:kβ†’bU_{\mathrm{out}}:k\to b. For the collection CC of profiles of the ambient logical calculus LL, a logical terminal profile BB is a profile admitting a feasible product profile triple (A,B,D)(A,B,D) with A,D∈CA,D\in C✦; converters connect the chosen types at any two such profiles. Relative to CC, an observation layer is a profile positively reachable in the primary graph from a nonempty axiom profile Ax⁡(s)\operatorname{Ax}(s), the set of sorts tt with (s,t)βˆˆπ’œ(s,t)\in\mathcal A, where {s}∈C\{s\}\in C.✦ A direct observation layer is an observation layer AA admitting a feasible product profile triple (A,B,D)(A,B,D) with B,D∈CB,D\in C.✦ The calculus LL supplies at every direct observation layer a quantifier route, a pair of inward and outward proof paths for forming the universal quantifier. Proof wrapping U[F]U[F] leaves FF unchanged at identity, adds a data-to-proof arrow from the retained domain at a positive step, and adds a proof-to-proof arrow into the retained codomain at a negative step.✦ The logical operations and a universal quantifier with proof paths Kin,KoutK_{\mathrm{in}},K_{\mathrm{out}} are defined by (1). Fβ‡’G=Uout[Uin[F]β†’ppG],Β¬F=(Fβ‡’βŠ₯),⊀=(βŠ₯β‡’βŠ₯),F∧G=Β¬(Fβ‡’Β¬G),F∨G=Β¬(Β¬F∧¬G),F↔G=(Fβ‡’G)∧(Gβ‡’F),βˆ€a:AKF(a)=Kout[Ξ dpa:A.Kin[F(a)]].\begin{aligned} F\Rightarrow G &=U_{\mathrm{out}}[U_{\mathrm{in}}[F]\to_{pp}G], &\neg F&=(F\Rightarrow\bot), &\top&=(\bot\Rightarrow\bot),\\ F\wedge G&=\neg(F\Rightarrow\neg G), &F\vee G&=\neg(\neg F\wedge\neg G),\\ F\leftrightarrow G&=(F\Rightarrow G)\wedge(G\Rightarrow F), &\forall^K_{a:A}F(a) &=K_{\mathrm{out}}[\Pi_{dp}a:A.K_{\mathrm{in}}[F(a)]]. \end{aligned}(1)The biconditional in (1) is a formula, whereas ≑p\equiv_{\mathrm p} is equivalence by typed open transformers. Fix quantifier routes KYK_Y and KPK_P for the logical and predicate carriers used below. Existential quantification βˆƒa:AKF(a)\exists^K_{a:A}F(a) is the formula Β¬βˆ€a:AKΒ¬F(a)\neg\forall^K_{a:A}\neg F(a).✦ Guarded universal quantification of F(a)F(a) by G(a)G(a) over AA is βˆ€a:AK(G(a)β‡’F(a))\forall^K_{a:A}(G(a)\Rightarrow F(a)), requiring a uniform typed proof transformer from the guard to the body at each bound element.✦

A retained data path is a finite path generated by identity, positive extensions with a fixed domain and dummy argument, and negative extensions with a data tail.✦ Its parity counts negative extensions modulo two. A formed data tail ending at profile BB has a sort ss with {s}∈C\{s\}\in C and nonempty axiom profile Ax⁡(s)\operatorname{Ax}(s), a positive data path from Ax⁡(s)\operatorname{Ax}(s) to BB, and even encoding and decoding proof paths from the logical base to {s}\{s\} and back, respectively; the decoding path contains a negative step.✦ For a retained path UU and a data type TT, write U[T]U[T] for its wrapped data type, BU(T;Q)B_U(T;Q) for its builder with open formula body QQ, and ⟨w,a⟩U,T\langle w,a\rangle_{U,T} for its observation of a wrapped data term ww against a data term aa of type TT. Positive extensions add data arrows with fixed domains; negative extensions add data arrows into the tail carrier. A positive path has the associated constant annotated abstractions as injections and evaluation at its fixed dummy arguments as projections. For odd retained data paths U,VU,V and a wrapped data term xx along UU, wrapper reencoding is the term in (2), where aa is the distinguished free variable of the open formula. EU,V(T,x)=BV(T;⟨x,a⟩U,T).E_{U,V}(T,x)=B_V\bigl(T;\langle x,a\rangle_{U,T}\bigr).(2)✦

The carrier of a data tail with sort ss and positive path VV is the positive wrapped type V[s]V[s].✦ Data-tail decoding of ww first projects along the tail’s positive data path and then applies its decoding proof path.✦ Data-tail encoding of a formula FF first applies the encoding proof path and then injects along the positive data path.✦

Let RR be formed relational coding with common probe type TT, odd logical path UU, odd raw path VV, and odd predicate path WW. Its uniform probe abstracts a wrapped type parameter and a single-bundle argument. The probe’s initial path has its fixed parity and runs from its singleton seed profile to kk, its odd raw and return paths run from kk through pp back to kk, its even function path runs from gg to JJ, and its positive lifting path runs from the seed’s nonempty axiom profile to II. Its product profiles are (I,J,k)(I,J,k) and (p,n,g)(p,n,g), and its tail ends at nn. The logical path runs from kk to jj, and the predicate path from pp to hh.

For a base type AA, the logical and raw channel types are U[A]U[A] and V[A]V[A], and the predicate channel type is W[V[A]]W[V[A]]✦; channel evaluation Ev⁡A(p,y)\operatorname{Ev}_A(p,y) observes pp along WW against the raw reencoding of yy.✦ The encoded predicate Pred⁡A(Q)\operatorname{Pred}_A(Q) is the builder along WW over V[A]V[A] whose body applies the open predicate QQ to the logical reencoding of its fresh raw input.✦ The source observational relation Rel⁡A,G(y,z)\operatorname{Rel}_{A,G}(y,z) is guarded universal quantification over the predicate channel type, with guard G(p)G(p) and body Ev⁡A(p,y)↔Ev⁡A(p,z)\operatorname{Ev}_A(p,y)\leftrightarrow\operatorname{Ev}_A(p,z).✦ The channel roundtrip at AA is raw reencoding followed by logical reencoding✦; the roundtrip invariance formula of pp over AA universally quantifies over the logical channel type and asserts Ev⁡A(p,y)↔Ev⁡A(p,Round⁡A(y))\operatorname{Ev}_A(p,y)\leftrightarrow\operatorname{Ev}_A(p,\operatorname{Round}_A(y)).✦ The admissible predicate condition with supplied condition Q(p)Q(p) conjoins roundtrip invariance of pp with Q(p)Q(p).✦

The equivalence class predicate of yy over AA with guard GG is the encoded predicate whose value at aa is Rel⁡A,G(a,y)\operatorname{Rel}_{A,G}(a,y).✦ The class union predicate of y,zy,z over AA with guard GG is the encoded predicate whose value at aa is Rel⁡A,G(a,y)∨Rel⁡A,G(a,z)\operatorname{Rel}_{A,G}(a,y)\vee\operatorname{Rel}_{A,G}(a,z).✦ For a query family QQ on seven tags and class index t∈{0,1,2}t\in\{0,1,2\}, the class query of yy applies query Qt+1Q_{t+1} to the equivalence class predicate of yy.✦ The tagged edge predicate of kind bb from yy to zz conjoins the class query placing yy in class 00, the class query placing zz in class 22 when b=1b=1 and class 11 otherwise, and query Q5Q_5 when b=1b=1 or Q4Q_4 otherwise applied to the class union predicate of y,zy,z.✦ The pair membership formula for predicate pp and element aa at zz is the disjunction of an existentially quantified logical element with a false-kind tagged edge to zz satisfying pp by channel evaluation, and the true-kind tagged edge from aa to zz, with the same carrier, guard and query family throughout.✦ The pair predicate of pp and aa is the encoded predicate whose value at zz is their pair membership formula.✦

Tagged Observations

A double data channel D=(D1,D2)D=(D_1,D_2) is a pair of odd retained paths; its carrier is D[T]=D2[D1[T]]D[T]=D_2[D_1[T]]. Its signed embedding, bit test, and signed recovery are given in (4), using polarity selection and logical conditional as specified in (3). sgn⁡b(F)={Fb=1,Β¬Fb=0,if⁡L(G,F,H)=(G∧F)∨(Β¬G∧H).\operatorname{sgn}_b(F)= \begin{cases}F&b=1,\\ \neg F&b=0,\end{cases} \qquad \operatorname{if}_L(G,F,H)=(G\wedge F)\vee(\neg G\wedge H).(3) emb⁡Db(T,u)=BD2(D1[T];sgn⁡b(⟨a,u⟩D1,T)),ev⁡D(T,v;Q)=⟨v,BD1(T;Q)⟩D2,D1[T],bit⁡D(T,v)=ev⁡D(T,v;⊀),rec⁡D(T,v;Q)=if⁡L(bit⁡D(T,v),ev⁡D(T,v;Q),Β¬ev⁡D(T,v;Q)).\begin{aligned} \operatorname{emb}_D^b(T,u) &=B_{D_2}\bigl(D_1[T]; \operatorname{sgn}_b(\langle a,u\rangle_{D_1,T})\bigr),\\ \operatorname{ev}_D(T,v;Q) &=\langle v,B_{D_1}(T;Q)\rangle_{D_2,D_1[T]},\\ \operatorname{bit}_D(T,v)&=\operatorname{ev}_D(T,v;\top),\\ \operatorname{rec}_D(T,v;Q) &=\operatorname{if}_L\bigl(\operatorname{bit}_D(T,v), \operatorname{ev}_D(T,v;Q),\neg\operatorname{ev}_D(T,v;Q)\bigr). \end{aligned}(4)

Double-channel evaluation ev⁡D(T,v;Q)\operatorname{ev}_D(T,v;Q) observes vv along the second path against the first path’s builder with body QQ.✦

The iterated carrier D(n)[A]D^{(n)}[A] is AA at depth zero and applies DD to the preceding carrier at each successor depth✦; the fourfold carrier is D(4)[A]D^{(4)}[A].✦ Iterated signed embedding along a finite bit string leaves the payload unchanged for the empty string and, for a first bit bb followed by bsbs, applies the embedding selected by bb to the recursively embedded payload over D(|bs|)[A]D^{(|bs|)}[A].✦ The query tagged embedding for q∈{0,…,8}q\in\{0,\ldots,8\} is the iterated signed embedding along the four-bit string consisting of binary digits zero through three of qq, in that order.✦ The iterated recovery predicate at depth zero is the original predicate body; at depth n+1n+1 it performs one signed recovery over D(n)[A]D^{(n)}[A] with the depth-nn recovery predicate as its test.✦ The tag predicate for the empty bit string is truth; for a first bit bb followed by bsbs, it conjoins the signed marker selected by bb with signed recovery of the tag predicate for bsbs, over D(|bs|)[A]D^{(|bs|)}[A].✦

The predicate code type over AA is D1[D(4)[A]]D_1[D^{(4)}[A]].✦ The bottom predicate code over AA is the first path’s builder at the fourfold carrier of AA with constant body βŠ₯\bot.✦ Wrapping the predicate code type over AA along the second path gives the double-channel parameter type over AA.✦ The dummy observation over AA is the second path’s builder at the predicate code type over AA with constant body ⊀\top.✦ The dummy parameter test over AA is the second path’s open observation formula over the predicate code type of AA, with the observed term free and the bottom predicate code as its fixed test.✦

The source data bundle of d,m,yd,m,y over AA is the second path’s builder over D1[A]D_1[A] with a branch predicate that uses the first path’s contravariant observation of dd as guard and its observations of mm and yy as the two branches.✦ The access probe over AA for guard GG, object ww and data function ff is the first path’s builder with outer access predicate if⁡L(G,⊀,Q)\operatorname{if}_L(G,\top,Q), where QQ is the observation predicate of ww along the second path composed with ff.✦ The bundle access observation over AA tests ww along the second path at D1[A]D_1[A] against the access probe determined by its guard and inner data function.✦

The tagged payload encoder of pp along an odd path VV, with tag t∈{0,…,7}t\in\{0,\ldots,7\} over AA, is the first path’s builder at the fourfold carrier with the encoding predicate as body.✦ The encoding predicate for payload pp along an odd path VV, with tag tt over AA, is the formula given by the disjunction of the payload-zero tag conjoined with depth-four recovery of the observation predicate of pp along VV, and the tag predicate for query index t+1t+1.✦ The payload decoder along an odd path VV builds along VV over AA with a decoding predicate that observes its predicate code along the first path at the fourfold carrier, after query-zero tagged embedding of the fresh payload.✦ The tagged observation query at tag tt of oo against pp along an odd path VV is observation of oo along the second path at the predicate code type, with the tagged payload encoder of pp as its test.✦ The query predicate of pp along an odd path VV is the second path’s contravariant observation predicate at the predicate code type, with the tag-77 payload encoder of pp as its fixed argument.✦ The inner observation probe of pp along an odd path VV is the first path’s builder over the parameter type with an inner probe predicate that selects falsity when the dummy parameter test holds and the query predicate of pp otherwise.✦

The marking predicate for tag tt and marker c0c_0 over AA observes a fresh first-path input against the query tagged embedding of c0c_0 at index t+1t+1, over the fourfold carrier.✦ The encoded data point of marker c0c_0 and payload cc along an odd path VV is the second path’s builder over the predicate code type with a data point predicate as body.✦ The data point predicate of marker c0c_0 and payload cc along an odd path VV is the conjunction of the tag-77 marking predicate of c0c_0 with the contravariant observation of cc along VV after payload decoding.✦ The recovery access observation of ww against a parameter-dependent predicate is bundle access over the parameter type, guarded by the dummy parameter test; its inner data function first evaluates that predicate and then applies the inner observation probe.✦

The probe double wrapper has the probe’s odd return path as its first path and its odd raw path as its second.✦ The probe raw type of AA is obtained by wrapping AA first along the initial path and then along the raw path.✦ The probe parameter type of AA is the double-channel parameter type of its probe raw type, using the probe double wrapper.✦ The single bundle type of AA is the carrier of its probe parameter type under the probe double wrapper.✦ The data-to-data arrow from the single bundle type of AA to the carrier of the probe’s tail is the probe function type of AA.✦ The probe type parameter domain is the positive lifting wrapper of the seed sort✦; at a parameter zz, its probe codomain family wraps the probe function type of the positive projection of zz along the function path.✦ The common probe type is the dependent product in data mode of this domain and codomain family.✦ The probe function abstraction with body QQ over AA is the data abstraction over the single bundle type whose body is data-tail encoding of QQ.✦ The wrapped probe abstraction over AA is the builder along the function path, at the probe function type of AA, applied to the probe function abstraction.✦ Probe specialization of vv to AA is data-mode application of vv to the positive lifting injection of AA.✦ The probe application observation of vv at AA against ww observes the specialization of vv along the function path at the probe function type of AA, using as test the data-tail decoding of the fresh function applied to ww.✦

An observation system OO consists of RR and inner and outer double channels DinD_{\mathrm{in}} and DoutD_{\mathrm{out}}.✦ Their successive profile paths are pβ†’kβ†’pp\to k\to p and pβ†’kβ†’jp\to k\to j, respectively. The first copy path is VV and the source path is UU. Its source carrier XX, predicate carrier 𝒫\mathcal P, and three-copy carrier YY are defined in (5). X=U[T],𝒫=W[V[T]],T1=V[T],Tm=Din[T1],Y=Dout[Tm].X=U[T],\qquad \mathcal P=W[V[T]],\qquad T_1=V[T],\qquad T_m=D_{\mathrm{in}}[T_1],\qquad Y=D_{\mathrm{out}}[T_m].(5)

The first copy wrapper type T1T_1 is the wrapped type of TT along the raw path VV.✦ The middle copy wrapper type TmT_m is the inner double-channel carrier of T1T_1.✦

The relational base type of a data type AA is its wrapped type along the probe’s initial path.✦ The constant truth marker over AA is the raw path’s builder at the relational base type of AA with constant body ⊀\top.✦ The relational point encoding of yy over AA is the encoded data point in the probe double wrapper at the probe raw type of AA, using the predicate path, the constant truth marker and the raw channel reencoding of yy at the relational base type of AA.✦ The relational argument bundle of parameter mm and element yy over AA is the source data bundle in the probe double wrapper at the probe parameter type, with the dummy observation at the probe raw type, mm, and the relational point encoding of yy as its three observations.✦ Probe application observation against the relational argument bundle of mm and yy gives the diamond observation of vv at AA with parameter mm and element yy.✦ The probe section predicate of vv over AA at parameter mm is the encoded predicate at the relational base type whose value at yy is the diamond observation of v,m,yv,m,y.✦

The structural query function at tag t∈{0,…,6}t\in\{0,\ldots,6\} over AA assigns to a predicate its tag-tt observation query against mm in the probe double wrapper, using the predicate path at the probe raw type.✦ The structural admissibility condition for a predicate over the relational base type of AA, at parameter mm, conjoins that predicate’s roundtrip invariance with its structural query at tag 00.✦ The relational pair predicate of p,ap,a over AA at parameter mm is the channel pair predicate at the relational base type, with structural admissibility for mm as guard and the structural query functions for mm as its query family.✦ The section pair query for v,av,a over AA at parameter mm is the tag-66 observation query of mm against the relational pair predicate of the probe section of vv and aa, in the probe double wrapper using the predicate path at the probe raw type.✦ The relational element lift of aa over AA at parameter mm is the logical path’s builder at the common probe type; its defining predicate assigns to a fresh probe the section pair query for that probe and aa.✦ Predicate pullback along lifting of ii over AA at parameter mm is the encoded predicate at the relational base type whose value at aa is channel evaluation of ii on the relational element lift of aa, at the common probe type.✦ Predicate pullback recovery of ii over AA against a single bundle ww is recovery access in the probe double wrapper, along the predicate path at the probe raw type, with the parameter-dependent pullback of ii as its test.✦

The tags are 0,β„“,r0,\ell,r, with b1(t)=1b_1(t)=1 exactly for t=β„“t=\ell and b2(t)=1b_2(t)=1 exactly for t=rt=r. The tagged copy of xβˆˆπ’ŸXx\in\mathcal D_X is the term xtx^t in (6). xt=emb⁡Doutb2(t)(Tm,emb⁡Dinb1(t)(T1,EU,V(T,x))).x^t=\operatorname{emb}_{D_{\mathrm{out}}}^{b_2(t)} \bigl(T_m,\operatorname{emb}_{D_{\mathrm{in}}}^{b_1(t)} (T_1,E_{U,V}(T,x))\bigr).(6)✦

For iβˆˆπ’Ÿπ’«i\in\mathcal D_{\mathcal P}, let qiq_i be its uniform predicate probe in TT. For a data term yy of carrier YY, the inner and outer marker formulas H1,H2H_1,H_2, the three-copy observation OiO_i, and the probe order formula le\operatorname{le} are defined in (7); aa and bb denote the distinguished free variables of the outer and inner recovery formulas. H1(y)=rec⁡Dout(Tm,y;bit⁡Din(T1,a)),H2(y)=bit⁡Dout(Tm,y),Oi(y)=rec⁡Dout(Tm,y;rec⁡Din(T1,a;⟨b,qi⟩V,T)),le⁡(i,x)=⟨x,qi⟩U,T.\begin{aligned} H_1(y)&=\operatorname{rec}_{D_{\mathrm{out}}} (T_m,y;\operatorname{bit}_{D_{\mathrm{in}}}(T_1,a)),\\ H_2(y)&=\operatorname{bit}_{D_{\mathrm{out}}}(T_m,y),\\ O_i(y)&=\operatorname{rec}_{D_{\mathrm{out}}} \bigl(T_m,y;\operatorname{rec}_{D_{\mathrm{in}}} (T_1,a;\langle b,q_i\rangle_{V,T})\bigr),\\ \operatorname{le}(i,x)&=\langle x,q_i\rangle_{U,T}. \end{aligned}(7)

Probe element comparison x≃zx\simeq z is a formula comparing data terms of the source carrier XX, while observational comparison Obs⁡(y,z)\operatorname{Obs}(y,z) and tagged observational equivalence Ae⁡(y,z)\operatorname{Ae}(y,z) are formulas comparing data terms of the three-copy carrier YY, as defined in (8). x≃z=βˆ€i:𝒫KP(le⁡(i,x)↔le⁡(i,z)),Obs⁡(y,z)=βˆ€i:𝒫KP(Oi(y)↔Oi(z)),Ae⁡(y,z)=(H1(y)↔H1(z))∧((H2(y)↔H2(z))∧Obs⁡(y,z)).\begin{aligned} x\simeq z&=\forall^{K_P}_{i:\mathcal P} \bigl(\operatorname{le}(i,x)\leftrightarrow\operatorname{le}(i,z)\bigr),\\ \operatorname{Obs}(y,z)&=\forall^{K_P}_{i:\mathcal P} \bigl(O_i(y)\leftrightarrow O_i(z)\bigr),\\ \operatorname{Ae}(y,z)&=(H_1(y)\leftrightarrow H_1(z))\wedge \bigl((H_2(y)\leftrightarrow H_2(z))\wedge\operatorname{Obs}(y,z)\bigr). \end{aligned}(8)

Specialized coding chooses a data-mode type AA with Ξ“βŠ’A:s0\Gamma\vdash A:s_0, where s0s_0 is the probe’s seed sort. Let TAT_A be its wrapped type along the probe’s initial path.✦ The specialization conditions are Y=U[TA]Y=U[T_A], Dout,2=UD_{\mathrm{out},2}=U, and Dout,1[Tm]=TAD_{\mathrm{out},1}[T_m]=T_A. The channel roundtrip Round⁡(y)\operatorname{Round}(y) for specialized coding is the operation on data terms yy of carrier YY defined in (9), with the reencodings of (2). Round⁡(y)=EV,U(TA,EU,V(TA,y)).\operatorname{Round}(y)=E_{V,U}\bigl(T_A,E_{U,V}(T_A,y)\bigr).(9)✦

The Claim

Theorem 1. Assume the relational and double-channel paths have the formations specified above, relative to LL, and use the fixed quantifier routes KY,KPK_Y,K_P. Let x,zβˆˆπ’ŸXx,z\in\mathcal D_X, iβˆˆπ’Ÿπ’«i\in\mathcal D_{\mathcal P}, and t,u∈{0,β„“,r}t,u\in\{0,\ell,r\}. The inner marker assertion (10), outer marker assertion (11), and predicate observation equivalence (12) hold. ⊩sgn⁡b1(t)(H1(xt)).\Vdash\operatorname{sgn}_{b_1(t)}(H_1(x^t)).(10)✦ ⊩sgn⁡b2(t)(H2(xt)).\Vdash\operatorname{sgn}_{b_2(t)}(H_2(x^t)).(11)✦ Oi(xt)≑ple⁡(i,x).O_i(x^t)\equiv_{\mathrm p}\operatorname{le}(i,x).(12)✦

Let y,v,wβˆˆπ’ŸYy,v,w\in\mathcal D_Y. Reflexivity is the assertion (13); symmetry and transitivity are (14) and (15), with their stated inhabitation hypotheses. ⊩Ae⁡(y,y).\Vdash\operatorname{Ae}(y,y).(13)✦ If ⊩Ae⁡(y,v), then ⊩Ae⁡(v,y).\text{If }\Vdash\operatorname{Ae}(y,v), \text{ then }\Vdash\operatorname{Ae}(v,y).(14)✦ If ⊩Ae⁡(y,v) and ⊩Ae⁡(v,w), then ⊩Ae⁡(y,w).\text{If }\Vdash\operatorname{Ae}(y,v) \text{ and }\Vdash\operatorname{Ae}(v,w), \text{ then }\Vdash\operatorname{Ae}(y,w).(15)✦

For specialized coding satisfying the carrier and path identities above, the roundtrip assertion is (16). ⊩Ae⁡(Round⁡(y),y).\Vdash\operatorname{Ae}(\operatorname{Round}(y),y).(16)✦

Equal tags have the formula equivalence (17); distinct tags satisfy (18). Ae⁡(xt,zt)≑p(x≃z).\operatorname{Ae}(x^t,z^t)\equiv_{\mathrm p}(x\simeq z).(17)✦ ⊩¬Ae⁡(xt,zu)(tβ‰ u).\Vdash\neg\operatorname{Ae}(x^t,z^u)\qquad(t\ne u).(18)✦

In the paper, the result reads: for a=1,2a=1,2 and t=0,β„“,rt=0,\ell,r, the signed formulas Ha(xt)H_a(x^t) when ba(t)=1b_a(t)=1 and Β¬Ha(xt)\neg H_a(x^t) when ba(t)=0b_a(t)=0, and the biconditionals Oi(xt)↔le⁡(i,x)O_i(x^t)\leftrightarrow\operatorname{le}(i,x), have proof-mode inhabitants; each HaH_a and OiO_i is invariant by biconditional under y↦Round⁡(y)y\mapsto\operatorname{Round}(y); the formula Ae⁡(y,z)=(β‹€a=1,2(Ha(y)↔Ha(z)))βˆ§βˆ€i(Oi(y)↔Oi(z))\operatorname{Ae}(y,z)=\bigl(\bigwedge_{a=1,2} (H_a(y)\leftrightarrow H_a(z))\bigr)\wedge \forall i\,(O_i(y)\leftrightarrow O_i(z)) is an equivalence relation with an inhabitant of Ae⁡(y,Round⁡(y))\operatorname{Ae}(y,\operatorname{Round}(y)) for every yy; and its restrictions satisfy Ae⁡(xt,zt)↔x≃z\operatorname{Ae}(x^t,z^t)\leftrightarrow x\simeq z, while distinct tags have inhabitants of Β¬Ae⁡(xt,zu)\neg\operatorname{Ae}(x^t,z^u).

What Is Checked

The assertions are stated over the labelled typing and mode judgments, the ambient logical calculus and its quantifier routes, the formed relational and observation paths, and, for the roundtrip assertion, the seed-sorted chosen type and specialized carrier identities.