OctoInformBeta

OpenAI preprint, September 2026 · Section 5. A weighted cancellation argument

Lemma 5.2 [Cancellation at a fixed second state]: A fixed second state admits a common weight in any complex vector space

Partner phases cancel under the disk condition.

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 weighted sum concerns ordered pairs of states with a fixed second state.

Let AA be a finite triangle set and VV a vertex set. A triangle system TT on VV, indexed by AA, is an assignment to each triangle t∈At\in A of an ordered list of three distinct corners vt(0),vt(1),vt(2)v_t(0),v_t(1),v_t(2), such that distinct triangles have at most one common corner.✦ Corner indices are read modulo three.

A state ss of TT onto a subset X⊆VX\subseteq V is a choice of a corner index s(t)s(t) for each triangle tt, such that the map t↦vt(s(t))t\mapsto v_t(s(t)) is injective and has image XX.✦ The selected triangle vertex σs(t)\sigma_s(t) of a state ss of TT at a triangle t∈At\in A is the vertex given by σs(t)=vt(s(t))\sigma_s(t)=v_t(s(t)).✦ Two states r,sr,s onto XX are partners when σr(t)≠σs(t)\sigma_r(t)\ne\sigma_s(t) for every t∈At\in A.✦ The partner set 𝒫(s)\mathcal P(s) of a state ss of TT onto XX is the set of all states onto XX that are partners of ss.✦

The opposite edge graph QsQ_s is the simple graph on VV whose edges are the sides of the triangles opposite their selected corners: distinct vertices v,wv,w are adjacent when some triangle tt has v=vt(i)v=v_t(i) and w=vt(j)w=v_t(j) with i,j≠s(t)i,j\ne s(t).✦

Cycle coordinates of a simple graph GG are an injective cyclic list of vertices u0,…,um−1u_0,\ldots,u_{m-1}, where m≥3m\geq 3, with consecutive vertices adjacent in GG, including um−1u_{m-1} and u0u_0.✦ An opposite cycle CC of ss consists of cycle coordinates in QsQ_s, distinct triangles t0,…,tm−1t_0,\ldots,t_{m-1}, and corner indices ℓi,hi\ell_i,h_i with vti(ℓi)=uiv_{t_i}(\ell_i)=u_i and vti(hi)=ui+1v_{t_i}(h_i)=u_{i+1}, where ℓi,hi≠s(ti)\ell_i,h_i\ne s(t_i) and the vertex subscripts are read modulo mm.✦

Index Increments and Phases

The cyclic index increment ϵ(i,j)\epsilon(i,j) of two corner indices is the integer specified in (1). ϵ(i,j)={0,i=j,1,j=i+1,−1,otherwise.\epsilon(i,j)= \begin{cases} 0,&i=j,\\ 1,&j=i+1,\\ -1,&\text{otherwise}. \end{cases}(1)✦ The third corner index operation kk on pairs of corner indices is the operation in (2), with arithmetic modulo three. k(i,j)=−(i+j).k(i,j)=-(i+j).(2)✦

For two states r,sr,s onto XX, their total cyclic index increment J(r,s)J(r,s) is given by (3). J(r,s)=∑t∈Aϵ(r(t),s(t)).J(r,s)=\sum_{t\in A}\epsilon(r(t),s(t)).(3)✦ The phase factor ϕ(n)\phi(n) of an integer nn is the complex number in (4), where i\mathrm{i} is the imaginary unit. ϕ(n)=i⌊n/3⌋.\phi(n)=\mathrm{i}^{\lfloor n/3\rfloor}.(4)✦

Given an opposite cycle CC with triangles tit_i and a state rr, define the opposite cycle index increment ΔC(r)\Delta_C(r) by (5). ΔC(r)=∑i=0m−1ϵ(r(ti),k(r(ti),s(ti))).\Delta_C(r)=\sum_{i=0}^{m-1} \epsilon\bigl(r(t_i),k(r(t_i),s(t_i))\bigr).(5)✦

The Claim

Theorem 1. Let TT be a triangle system with finite triangle set AA, let ss be a state onto XX, and let CC be an opposite cycle of ss. Suppose the signed disk condition holds: ΔC(r)\Delta_C(r) is 33 or −3-3 for every partner r∈𝒫(s)r\in\mathcal P(s). For every complex vector space MM and every common weight w∈Mw\in M, the weighted phase sum satisfies (6). ∑r∈𝒫(s)ϕ(J(r,s))w=0.\sum_{r\in\mathcal P(s)}\phi\bigl(J(r,s)\bigr)\,w=0.(6)✦

What Is Checked

The claim is stated over a triangle system with finitely many triangles, states onto a common vertex subset, an opposite cycle satisfying the signed disk condition for every partner of the fixed second state, and a common weight in a complex vector space.