OctoInformBeta

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

Lemma 46: Lift and extraction laws use specialized admissibility, extensional predicates, and responsive probes

Probe comparison is an equivalence relation.

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

Relational coding of the diagonal argument uses observations of elements and observations of probes. Lifting passes from the element level to the probe level; predicate extraction passes from a probe to its incidence with elements.

Fix a pure type specification P=(S,π’œ,β„›)P=(S,\mathcal A,\mathcal R), with arbitrary axiom and product-rule relations, a context Ξ“\Gamma, and a mode assignment Ξ³\gamma. Terms have annotated abstractions Ξ»x:A.M\lambda x:A.M and dependent products Ξ x:A.B\Pi x:A.B, with data and proof modes on applications and binders. Write Ξ“βŠ’dM:T\Gamma\vdash_{\mathrm d}M:T for Ξ“βŠ’M:T\Gamma\vdash M:T with MM in data mode, and 𝖧(F)\mathsf H(F) when some proof-mode term qq satisfies Ξ“βŠ’q:F\Gamma\vdash q:F. Formula equivalence F⇔pGF\Longleftrightarrow_{\mathrm p}G means uniform typed open proof-term transformers in both directions: a temporary proof input of one formula yields a proof-mode term of the other.✦ Contexts are newest-first in the indexed syntax; bound variables below are written with names. The labels on applications and binders are data to data, data to proof, and proof to proof. Labelled Ξ²\beta convertibility is the smallest equivalence relation on labelled terms containing one-step labelled Ξ²\beta reduction.

A normal form sort profile is the set πΔ(T)\pi_\Delta(T) of all sorts typing T#T^\# in Ξ”\Delta, where T#T^\# is a chosen Ξ²\beta normal form when weak normalization supplies one.✦ Full Ξ²\beta reduction includes annotations and binder bodies. Valid contexts start with the empty context and admit extension by AA whenever Ξ”βŠ’A:s\Delta\vdash A:s for some sort ss. A feasible profile is a nonempty profile of a normal term in a valid context.✦ A feasible product triple (I,J,K)(I,J,K) consists of feasible profiles with K=Out⁡(I,J)K=\operatorname{Out}(I,J), as defined in (1).✦ Ax⁡(s)={t∣(s,t)βˆˆπ’œ},Out⁡(I,J)={cβˆ£βˆƒa∈Iβˆƒb∈J(a,b,c)βˆˆβ„›}.\operatorname{Ax}(s)=\{t\mid(s,t)\in\mathcal A\},\qquad \operatorname{Out}(I,J)= \{c\mid\exists a\in I\;\exists b\in J\;(a,b,c)\in\mathcal R\}.(1) The axiom profile Ax⁡(s)\operatorname{Ax}(s) consists of the axiom successors of ss. The product output profile Out⁡(I,J)\operatorname{Out}(I,J) consists of the sorts obtainable by a product rule with domain sort in II and codomain sort in JJ. Ξ²\beta convertibility of pure type system terms is the smallest equivalence relation containing one-step Ξ²\beta reduction.

Let CC be a collection of profiles. In the primary signed graph, strict feasible profile inclusions give positive edges, while a feasible triple (I,J,K)(I,J,K) gives a negative edge Iβ†’KI\to K and a positive edge Jβ†’KJ\to K.✦ Observation layers are reached by positive edges from a nonempty Ax⁡(s)\operatorname{Ax}(s) with {s}∈C\{s\}\in C✦; a direct observation layer also occurs as the domain of a feasible triple whose codomain and output belong to CC.✦ A logical terminal profile for a collection CC of profiles is a feasible profile occurring as the codomain of a feasible product triple whose domain and output belong to CC.✦ Positive reachability in a signed graph is the relation given by finite, possibly empty paths consisting entirely of positive edges.

An ambient logical calculus LL chooses, at every feasible profile II, a data-only type TIT_I with normal erasure, sorted at every sort of II, and a value eI:TIe_I:T_I, with both TIT_I and eIe_I in data mode. It has uniform proof transformers between the chosen types at logical terminal profiles. A proof path is built from identity by positive arrow extensions with data input and negative arrow extensions with proof input; negative steps reverse parity and require their endpoint profiles in CC. The logical domain, base, and product profiles of LL form a feasible triple in CC, with even input and output proof paths connecting the base to the domain and the product to the base. For every direct observation layer, LL supplies a quantifier route: a feasible product triple at that domain together with even proof paths from the logical base to its codomain and from its output to the base. The falsity formula is the chosen type at the logical base.✦ Implication applies the output proof path to the proof arrow from the input-wrapped antecedent to the consequent. Negation is implication to falsity. Conjunction and disjunction are defined from negation and implication. Universal quantification is the dependent product with data input and proof output along a selected quantifier route; existential quantification is the negation of universal quantification of the negated body.✦ Logical equivalence is the conjunction of both implications.✦ The truth formula of LL is the implication from its falsity formula to itself. For formulas G,F,HG,F,H, the logical conditional with guard GG and branches F,HF,H is (G∧F)∨(¬G∧H)(G\wedge F)\vee(\neg G\wedge H), with all connectives taken in LL. For a formula FF and a Boolean polarity bb, polarity selection gives the formula FF when bb is true and ¬F\neg F when bb is false.

Fix routes KYK_Y and KPK_P for the logical element and predicate profiles jj and hh; subscripts on quantifiers indicate the selected route. Guarded quantification has body Gβ‡’FG\Rightarrow F.✦

Channels and Incidence

A retained data path UU is a finite path generated by identity, positive extensions retaining a domain annotation and chosen argument, and negative extensions retaining a data tail.✦ Its parity counts negative extensions modulo two. Write U[T]U[T] for its wrapped data type, build⁡U(T,Q)\operatorname{build}_U(T,Q) for its builder, and obs⁡U(T,w,Q)\operatorname{obs}_U(T,w,Q) for its observation. Positive extensions add data arrows and constant annotated abstractions; observation applies the retained argument. A negative extension adds a data arrow into its tail carrier; its builder sends the inner observation through the tail, and its observation decodes application to the inner builder. A data tail uses a positive path from a nonempty axiom profile and even encoding and decoding proof paths at its terminal sort, whose singleton belongs to CC; the decoding path contains a negative step.✦ Its positive injection uses constant data abstractions and its projection applies the chosen arguments. Data tail encoding first applies the encoding proof path to a formula and then takes the positive injection along the tail’s positive path. Data tail decoding first takes the positive projection along the tail’s positive path and then applies its decoding proof path.

A shared relational system RR has a uniform probe with seed sort s0s_0 and an initial path U0U_0, together with odd logical, raw, and predicate paths Uβ„“,Ur,UpU_\ell,U_r,U_p.✦ The raw path is also the probe’s raw path. The channel types and evaluation are (2); wrapper reencoding Re⁡U,Uβ€²\operatorname{Re}_{U,U'} observes along its source path UU and builds along its target path Uβ€²U'.✦ Log⁡(T)=Uβ„“[T],Raw⁡(T)=Ur[T],Pred⁡(T)=Up[Raw⁡(T)],raw⁡T(y)=Re⁡Uβ„“,Ur(T,y),log⁡T(c)=Re⁡Ur,Uβ„“(T,c),p@Ty=obs⁡Up(Raw⁡(T),p,raw⁡T(y)),Round⁡T(y)=log⁡T(raw⁡T(y)).\begin{aligned} \operatorname{Log}(T)&=U_\ell[T],& \operatorname{Raw}(T)&=U_r[T],& \operatorname{Pred}(T)&=U_p[\operatorname{Raw}(T)],\\ \operatorname{raw}_T(y)&=\operatorname{Re}_{U_\ell,U_r}(T,y),& \operatorname{log}_T(c)&=\operatorname{Re}_{U_r,U_\ell}(T,c),\\ p@_T y&=\operatorname{obs}_{U_p} (\operatorname{Raw}(T),p,\operatorname{raw}_T(y)),& \operatorname{Round}_T(y)&=\operatorname{log}_T(\operatorname{raw}_T(y)). \end{aligned}(2) An encoded predicate pred⁡T(Q)\operatorname{pred}_T(Q) is built along UpU_p after precomposing its body QQ with log⁡T\operatorname{log}_T.✦ The logical channel type Log⁡(T)\operatorname{Log}(T) is the wrapped data type of TT along Uβ„“U_\ell. Wrapping TT along UrU_r gives the raw channel type Raw⁡(T)\operatorname{Raw}(T). The channel predicate type Pred⁡(T)\operatorname{Pred}(T) is the wrapped data type of Raw⁡(T)\operatorname{Raw}(T) along UpU_p. Reencoding yy from the logical path to the raw path gives the raw channel encoding raw⁡T(y)\operatorname{raw}_T(y). The logical channel encoding log⁡T(c)\operatorname{log}_T(c) reencodes cc from the raw path to the logical path.

The probe also has an odd return path UbU_b, an even function path, a positive type lifting path, and a data tail. Its double channel DD applies UbU_b and then UrU_r.✦ For a type A:s0A:s_0, put TA=U0[A]T_A=U_0[A], and write DnD^n for nn iterations of the double carrier. For a type A:s0A:s_0, the raw type of the probe at AA is Raw⁡(TA)\operatorname{Raw}(T_A), its parameter type Par⁡(A)\operatorname{Par}(A) is D5[Raw⁡(TA)]D^5[\operatorname{Raw}(T_A)]✦, and its single bundle type is D[Par⁡(A)]D[\operatorname{Par}(A)]. The common probe type VV is the data dependent product over the lifted seed sort, with codomain the function-path wrapper of the data arrow from the single bundle type to the tail carrier at the projected type parameter.✦ Probe specialization applies a probe to the positive injection of AA.✦ A uniform probe abstracts over that parameter and a single bundle argument, sending its formula body through the tail before wrapping along the function path.✦ The relational base type TAT_A is the wrapped data type of AA along the initial path U0U_0.

Formation of RR requires feasible triples (I,J,k)(I,J,k) and (p,n,g)(p,n,g), a nonempty Ax⁡(s0)\operatorname{Ax}(s_0), and paths U0:{s0}β†’kU_0:\{s_0\}\to k, Ur:kβ†’pU_r:k\to p, Ub:pβ†’kU_b:p\to k, Uβ„“:kβ†’jU_\ell:k\to j, Up:pβ†’hU_p:p\to h; the function path runs from gg to JJ, the positive lifting path from Ax⁡(s0)\operatorname{Ax}(s_0) to II, and the tail ends at nn.✦ Path formation permits target restriction and extensions along feasible product triples, using the fixed witness types and values.

For A:s0A:s_0, put YA=Log⁡(TA)Y_A=\operatorname{Log}(T_A), X=Log⁡(V)X=\operatorname{Log}(V), and PX=Pred⁡(V)P_X=\operatorname{Pred}(V). For a predicate p:Pred⁡(TA)p:\operatorname{Pred}(T_A), the doubled probe channel has tagged queries QA,mt(p)Q^t_{A,m}(p) for 0≀t≀70\leq t\leq7 on a parameter m:Par⁡(A)m:\operatorname{Par}(A). A query observes mm against a tagged payload encoding of pp.✦ The encoding uses four binary markers, reserving zero for its payload and t+1t+1 for the query tag. The dummy predicate Dummy⁡A(m)\operatorname{Dummy}_A(m) observes mm against the bottom predicate code; write ND⁡A(m)=Β¬Dummy⁡A(m)\operatorname{ND}_A(m)=\neg\operatorname{Dummy}_A(m). The constant truth marker is built along the raw path.✦ For an element y:YAy:Y_A, a point encodes raw⁡TA(y)\operatorname{raw}_{T_A}(y) with that marker, and the relational argument bundle combines the dummy observation, mm, and this point.✦ Diamond incidence vβ‹„myv\diamond_m y of a probe v:Vv:V with an element y:YAy:Y_A is the probe application observation of vv on the relational argument bundle.✦ The logical probe element type XX is the logical channel type of the common probe type VV. The probe predicate type PXP_X is the channel predicate type over VV. The predicate code type over Raw⁡(TA)\operatorname{Raw}(T_A) is Ub[D4[Raw⁡(TA)]]U_b[D^4[\operatorname{Raw}(T_A)]], the first-path wrapper of its fourfold double carrier. Double channel evaluation at a type TT observes its input along the second path of DD against the term built along the first path from a formula body over TT. The query bit string of q∈{0,…,8}q\in\{0,\ldots,8\} is the four-entry Boolean string of binary digits zero through three of qq, in that order. Iterated signed embedding along a finite Boolean string leaves its input unchanged for the empty string. For a nonempty string, it first embeds along the remaining string, then applies the signed embedding selected by the first marker at the carrier whose depth is the length of that remaining string. The query tagged embedding of a term over TT at query qq is its iterated signed embedding along the query bit string of qq. The tag predicate for the empty marker string is truth. For a nonempty string, it conjoins the bit observation, negated when the first marker is false, with signed recovery of the tag predicate for the remaining string, both at the carrier whose depth is the length of that remaining string.

An admissible predicate p:Pred⁡(TA)p:\operatorname{Pred}(T_A) satisfies the guard in (3). The relation ∼m\sim_m on YAY_A relates two elements when every admissible predicate has equivalent evaluations at those elements, as specified in (3). RR⁡T(p)=βˆ€Yy:Log⁡(T).(p@Ty↔p@TRound⁡T(y)),Gm(p)=RR⁡TA(p)∧QA,m0(p),y∼mz=βˆ€Pp:Pred⁡(TA).Gm(p)β‡’(p@TAy↔p@TAz).\begin{aligned} \operatorname{RR}_T(p) &=\forall_Y y:\operatorname{Log}(T).\, (p@_T y\leftrightarrow p@_T\operatorname{Round}_T(y)),\\ G_m(p)&=\operatorname{RR}_{T_A}(p)\wedge Q^0_{A,m}(p),\\ y\sim_m z &=\forall_P p:\operatorname{Pred}(T_A).\, G_m(p)\Rightarrow(p@_{T_A}y\leftrightarrow p@_{T_A}z). \end{aligned}(3) Roundtrip invariance RR⁡T(p)\operatorname{RR}_T(p) of a predicate p:Pred⁡(T)p:\operatorname{Pred}(T) is the condition that pp has equivalent evaluations at every logical element and its channel roundtrip.

The class predicate [y]m[y]_m has body w∼myw\sim_m y✦; the class union predicate [y]mβˆͺ[z]m[y]_m\cup[z]_m has the disjunction of those bodies.✦ For elements y,z,a:YAy,z,a:Y_A and a predicate p:Pred⁡(TA)p:\operatorname{Pred}(T_A), class queries, the two edge predicates, and the pair predicate are defined in (4), where b∈{0,1}b\in\{0,1\} and the displayed bodies denote encoded predicates. Ct(y)=QA,mt+1([y]m)(t=0,1,2),Eb(y,z)=C0(y)∧C1+b(z)∧QA,m4+b([y]mβˆͺ[z]m),Pair⁡m(p,a)(z)=(βˆƒYw:YA.E0(w,z)∧p@TAw)∨E1(a,z).\begin{aligned} C_t(y)&=Q^{t+1}_{A,m}([y]_m) &&(t=0,1,2),\\ E_b(y,z)&=C_0(y)\wedge C_{1+b}(z) \wedge Q^{4+b}_{A,m}([y]_m\cup[z]_m),\\ \operatorname{Pair}_m(p,a)(z) &=\bigl(\exists_Y w:Y_A.\,E_0(w,z)\wedge p@_{T_A}w\bigr) \vee E_1(a,z). \end{aligned}(4)

For a probe v:Vv:V and an element a:YAa:Y_A, the section predicate Part⁡m(v)\operatorname{Part}_m(v) is an encoded predicate on YAY_A, the section pair query sb⁡m(v,a)\operatorname{sb}_m(v,a) is a tagged query, and the element lift lift⁡m(a)\operatorname{lift}_m(a) is a logical probe element, with the defining conditions in (5). Part⁡m(v)=pred⁡TA(y↦vβ‹„my),sb⁡m(v,a)=QA,m6(Pair⁡m(Part⁡m(v),a)),lift⁡m(a)=build⁡Uβ„“(V,v↦sb⁡m(v,a)).\begin{aligned} \operatorname{Part}_m(v)&=\operatorname{pred}_{T_A}(y\mapsto v\diamond_m y),\\ \operatorname{sb}_m(v,a)&=Q^6_{A,m} (\operatorname{Pair}_m(\operatorname{Part}_m(v),a)),\\ \operatorname{lift}_m(a)&=\operatorname{build}_{U_\ell} (V,v\mapsto\operatorname{sb}_m(v,a)). \end{aligned}(5) The pullback of i:PXi:P_X along lifting is the encoded predicate with body i@Vlift⁡m(a)i@_V\operatorname{lift}_m(a).✦ The uniform predicate probe zi:Vz_i:V associated with a predicate i:PXi:P_X is the probe whose body recovers the pullback of ii along lifting from the single bundle. The predicate pullback recovery is the recovery access observation of a single bundle against the pullback of ii along lifting, with its parameter left variable.

For probe elements x,xβ€²:Xx,x':X and predicates i,iβ€²:PXi,i':P_X, probe order le⁡(i,x)\operatorname{le}(i,x), probe element comparison x≃xβ€²x\simeq x', and predicate comparison i≑Piβ€²i\equiv_P i' are the relations defined by the formulas in (6). Write Round⁡X\operatorname{Round}_X for Round⁡V\operatorname{Round}_V. le⁡(i,x)=obs⁡Uβ„“(V,x,zi),x≃xβ€²=βˆ€Pi:PX.(le⁡(i,x)↔le⁡(i,xβ€²)),i≑Piβ€²=βˆ€Yx:X.(i@Vx↔iβ€²@Vx).\begin{aligned} \operatorname{le}(i,x)&=\operatorname{obs}_{U_\ell}(V,x,z_i),\\ x\simeq x'&=\forall_P i:P_X.\, (\operatorname{le}(i,x)\leftrightarrow\operatorname{le}(i,x')),\\ i\equiv_P i'&=\forall_Y x:X.\,(i@_Vx\leftrightarrow i'@_Vx). \end{aligned}(6) An extensional predicate i:PXi:P_X is a predicate that respects probe comparison, and a valid element x:Xx:X is an element whose order observations respect predicate comparison, as defined in (7). Ext⁡(i)=βˆ€Yx,xβ€²:X.(x≃xβ€²)β‡’(i@Vx↔i@Vxβ€²),Valid⁡(x)=βˆ€Pi,iβ€²:PX.(i≑Piβ€²)β‡’(le⁡(i,x)↔le⁡(iβ€²,x)).\begin{aligned} \operatorname{Ext}(i)&=\forall_Y x,x':X.\, (x\simeq x')\Rightarrow(i@_Vx\leftrightarrow i@_Vx'),\\ \operatorname{Valid}(x)&=\forall_P i,i':P_X.\, (i\equiv_P i')\Rightarrow (\operatorname{le}(i,x)\leftrightarrow\operatorname{le}(i',x)). \end{aligned}(7)

Specialized Admissibility

A specialized relational system fixes a type A0:s0A_0:s_0 and three tagged copies of XX.✦ Its inner double channel has profile route pβ†’kβ†’pp\to k\to p, and its outer channel has route pβ†’kβ†’jp\to k\to j. The three tagged copies Ο„t(x)\tau_t(x) of a probe element x:Xx:X, indexed by t=0,1,2t=0,1,2, reencode xx along the raw path, then use signed inner and outer embeddings with marker bits t=1t=1 and t=2t=2. Tagged observational equivalence yβ‰ˆzy\approx z is the conjunction of equivalence of their inner markers, equivalence of their outer markers, and equivalence of every observation by a uniform predicate probe.✦ Signed recovery through the two copy channels defines these observations.

The tagged observation carrier YY is required to equal Log⁡(TA0)\operatorname{Log}(T_{A_0}). The second outer path equals Uβ„“U_\ell, and the first outer path applied to the middle copy carrier of VV equals TA0T_{A_0}. The fixed type A0A_0 has data mode. For a predicate p:Pred⁡(TA0)p:\operatorname{Pred}(T_{A_0}), its structural properties are (8); the left copy predicate ipi_p has body x↦p@TA0Ο„1(x)x\mapsto p@_{T_{A_0}}\tau_1(x).✦ 𝒒(p)=βˆ€Yy,z:Y.(yβ‰ˆz)β‡’(p@TA0y↔p@TA0z),π’žt(p)=βˆƒYx:X.βˆ€Yw:Y.(p@TA0w↔wβ‰ˆΟ„t(x)),β„°t(p)=βˆƒYx:X.βˆ€Yw:Y.(p@TA0w↔(wβ‰ˆΟ„0(x)∨wβ‰ˆΟ„t(x))),β„›(p)=Ext⁡(ip)β‡’βˆ€Yx:X.Valid⁡(x)β‡’p@TA0Ο„2(x)β‡’le⁡(ip,x).\begin{aligned} \mathcal G(p)&=\forall_Y y,z:Y.\, (y\approx z)\Rightarrow(p@_{T_{A_0}}y\leftrightarrow p@_{T_{A_0}}z),\\ \mathcal C_t(p)&=\exists_Y x:X.\,\forall_Y w:Y.\, (p@_{T_{A_0}}w\leftrightarrow w\approx\tau_t(x)),\\ \mathcal E_t(p)&=\exists_Y x:X.\,\forall_Y w:Y.\, (p@_{T_{A_0}}w\leftrightarrow (w\approx\tau_0(x)\vee w\approx\tau_t(x))),\\ \mathcal R(p)&=\operatorname{Ext}(i_p)\Rightarrow \forall_Y x:X.\,\operatorname{Valid}(x)\Rightarrow p@_{T_{A_0}}\tau_2(x)\Rightarrow\operatorname{le}(i_p,x). \end{aligned}(8) The parameter m0:Par⁡(A0)m_0:\operatorname{Par}(A_0) is the structural query realization, with constant truth marker, of the seven branches 𝒒,π’ž0,π’ž1,π’ž2,β„°1,β„°2,β„›\mathcal G,\mathcal C_0,\mathcal C_1,\mathcal C_2,\mathcal E_1, \mathcal E_2,\mathcal R in that order. The realization is the marked disjunction of these branch predicates after payload decoding. The specialized admissibility guard Gm0G_{m_0} at A0A_0 is the predicate on Pred⁡(TA0)\operatorname{Pred}(T_{A_0}) given by the admissibility condition.✦ Write ∼\sim, lift\operatorname{lift}, Part\operatorname{Part}, and β‹„\diamond for the corresponding constructions at A0,m0A_0,m_0. A responsive probe v:Vv:V at A0,m0A_0,m_0 is a probe whose incidence respects the specialized relation ∼\sim on YY, as in (9). Resp⁡(v)=βˆ€Yy,z:Y.(y∼z)β‡’(vβ‹„y↔vβ‹„z).\operatorname{Resp}(v)=\forall_Y y,z:Y.\, (y\sim z)\Rightarrow(v\diamond y\leftrightarrow v\diamond z).(9) The observation invariance property 𝒒(p)\mathcal G(p) requires equivalent evaluations of pp at any two tagged observationally equivalent observations. A predicate pp has the class representation property π’žt(p)\mathcal C_t(p) when it represents the tagged observational equivalence class of some element in copy tt. The edge representation property β„°t(p)\mathcal E_t(p) says that pp represents the union of the tagged observational equivalence classes of the copies 00 and tt of some logical probe element. When the left copy predicate ipi_p is extensional, the relational closure property β„›(p)\mathcal R(p) requires every valid logical probe element whose copy 22 satisfies pp to satisfy the order observation le⁡(ip,x)\operatorname{le}(i_p,x).

The Claim

Theorem 1. Let RR have the formed relational paths specified above in the ambient logical calculus LL, with quantifier routes KY,KPK_Y,K_P. For Ξ“βŠ’dx:X\Gamma\vdash_{\mathrm d}x:X, reflexivity is (10). 𝖧(x≃x).\mathsf H(x\simeq x).(10)✦ For data terms x,y:Xx,y:X with 𝖧(x≃y)\mathsf H(x\simeq y), symmetry gives (11). 𝖧(y≃x).\mathsf H(y\simeq x).(11)✦ For data terms x,y,z:Xx,y,z:X with 𝖧(x≃y)\mathsf H(x\simeq y) and 𝖧(y≃z)\mathsf H(y\simeq z), transitivity gives (12). 𝖧(x≃z).\mathsf H(x\simeq z).(12)✦ For Ξ“βŠ’dx:X\Gamma\vdash_{\mathrm d}x:X, rounding satisfies (13). 𝖧(x≃Round⁡X(x)).\mathsf H(x\simeq\operatorname{Round}_X(x)).(13)✦ Suppose Ξ“βŠ’dA:s0\Gamma\vdash_{\mathrm d}A:s_0 and Ξ“βŠ’dm:Par⁡(A)\Gamma\vdash_{\mathrm d}m:\operatorname{Par}(A). For data terms a:YAa:Y_A and v:Vv:V, lift evaluation is (14). obs⁡Uβ„“(V,lift⁡m(a),v)⇔psb⁡m(v,a).\operatorname{obs}_{U_\ell}(V,\operatorname{lift}_m(a),v) \Longleftrightarrow_{\mathrm p}\operatorname{sb}_m(v,a).(14)✦ For data terms i:PXi:P_X and y:YAy:Y_A, assume in addition 𝖧(ND⁡A(m))\mathsf H(\operatorname{ND}_A(m)). The rounded probe law is (15). ziβ‹„my⇔pi@Vlift⁡m(Round⁡TA(y)).z_i\diamond_m y\Longleftrightarrow_{\mathrm p} i@_V\operatorname{lift}_m(\operatorname{Round}_{T_A}(y)).(15)✦ Let the specialized system at A0A_0 satisfy its observation formation and carrier identities. For data terms a,b:Ya,b:Y with 𝖧(a∼b)\mathsf H(a\sim b), lifting gives (16). 𝖧(lift⁡(a)≃lift⁡(b)).\mathsf H(\operatorname{lift}(a)\simeq\operatorname{lift}(b)).(16)✦ For every data term a:Ya:Y, validity is (17). 𝖧(Valid⁡(lift⁡(a))).\mathsf H(\operatorname{Valid}(\operatorname{lift}(a))).(17)✦ For data terms i:PXi:P_X and y:Yy:Y with 𝖧(Ext⁡(i))\mathsf H(\operatorname{Ext}(i)), exact probe evaluation is (18). ziβ‹„y⇔pi@Vlift⁡(y).z_i\diamond y\Longleftrightarrow_{\mathrm p}i@_V\operatorname{lift}(y).(18)✦ For a data term i:PXi:P_X with 𝖧(Ext⁡(i))\mathsf H(\operatorname{Ext}(i)), response is (19). 𝖧(Resp⁡(zi)).\mathsf H(\operatorname{Resp}(z_i)).(19)✦ For data terms v:Vv:V and y:Yy:Y with 𝖧(Resp⁡(v))\mathsf H(\operatorname{Resp}(v)), predicate extraction satisfies (20). Part⁡(v)@TA0y⇔pvβ‹„y.\operatorname{Part}(v)@_{T_{A_0}}y \Longleftrightarrow_{\mathrm p}v\diamond y.(20)✦

In the paper, the result reads: ≃\simeq is an equivalence relation with the congruence builder of Lemma 44 and RoundRel⁡X(x):x≃Round⁡X(x)\operatorname{RoundRel}_X(x):x\simeq\operatorname{Round}_X(x); data cancellation supplies LP⁡(i,a):le⁡(i,lift⁡m(a))↔sb⁡m(zi,a)\operatorname{LP}(i,a):\operatorname{le}(i,\operatorname{lift}_m(a)) \leftrightarrow\operatorname{sb}_m(z_i,a); under an admissibility witness ad:Admad:\operatorname{Adm} there are builders ziβ‹„my↔i@Vlift⁡m(Round⁡TA(y))z_i\diamond_m y\leftrightarrow i@_V\operatorname{lift}_m(\operatorname{Round}_{T_A}(y)), LC⁡(e):lift⁡m(a)≃lift⁡m(aβ€²)\operatorname{LC}(e):\operatorname{lift}_m(a)\simeq\operatorname{lift}_m(a') for e:a∼maβ€²e:a\sim_m a', and Valid⁡(lift⁡m(a))\operatorname{Valid}(\operatorname{lift}_m(a)); if also ex:Ext⁡(i)ex:\operatorname{Ext}(i), then ziβ‹„my↔i@Vlift⁡m(y)z_i\diamond_m y\leftrightarrow i@_V\operatorname{lift}_m(y) and Resp⁡(zi)\operatorname{Resp}(z_i); under h:Resp⁡(v)h:\operatorname{Resp}(v), Part⁡m(v)@TAy↔vβ‹„my\operatorname{Part}_m(v)@_{T_A}y\leftrightarrow v\diamond_m y.

What Is Checked

The statements are over labelled typing and the mode discipline, the ambient logical calculus with its feasible witness family and quantifier routes, formed relational paths, and the specialized three-copy system with its fixed type and carrier identities.