OctoInformBeta

OpenAI preprint, September 2026 · Section 3. Finite reflection-positive probability laws

Lemma 3.4: For odd primes pp, a p−1/8p^{-1/8} error and nonnegativity at the terminal mark size

A lower bound for unmarked cuts.

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

Square-difference constraints on addressed lists are combined with a Boltzmann weight on vertex labels. An unmarked cut reflects a permutation tuple through a block outside the active set.

The height hh, block cutoff TT, list base rr and interaction parameter δ\delta have the values in (1): h=24,T=80,r=h!2,δ=110h2.h=24,\qquad T=80,\qquad r=\frac{h!}{2},\qquad \delta=\frac{1}{10h^2}.(1) Put H={0,…,h−1}H=\{0,\ldots,h-1\} and ℬ={0,…,2T}\mathcal B=\{0,\ldots,2T\}, so there are 161161 blocks.✦ A permutation word vv on a block set CC is a function from CC to the permutation group 𝔖H\mathfrak S_H.✦ The tuple vertex set is 𝒱=𝔖Hℬ\mathcal V=\mathfrak S_H^\mathcal B; write d=|𝒱|d=|\mathcal V|.✦

For an active set S⊆ℬS\subseteq \mathcal B, an inactive-block address uu is a function assigning a permutation to each block outside SS.✦ The address space 𝒜S\mathcal A_S, list index set JSJ_S and addressed list entry set ℒS\mathcal L_S are defined by (2): 𝒜S=𝔖Hℬ\S,JS={0,…,r|S|−1},ℒS=𝒜S×JS.\mathcal A_S=\mathfrak S_H^{\mathcal B\setminus S},\qquad J_S=\{0,\ldots,r^{|S|}-1\},\qquad \mathcal L_S=\mathcal A_S\times J_S.(2) The inactive-block projection uS:𝒱→𝒜Su_S:\mathcal V\to\mathcal A_S is restriction to ℬ\S\mathcal B\setminus S.✦

The cyclic shift c∈𝔖Hc\in\mathfrak S_H sends each position to the next, modulo hh.✦ For a finite block set CC, a group GG, a shift g∈Gg\in G and a threshold qq, threshold shift adjacency of addresses u,w∈GCu,w\in G^C is the relation (3): u∼g,qw⇔|{a∈C:w(a)=u(a)g}|≥q.u\sim_{g,q}w \quad\Longleftrightarrow\quad \bigl|\{a\in C:w(a)=u(a)g\}\bigr|\ge q.(3)✦ Let ES⊆ℒS×ℒSE_S\subseteq\mathcal L_S\times\mathcal L_S be the list constraint edges, prescribing square differences between addressed list values.

Weights and Square Constraints

An ordered position pair is a pair (i,k)(i,k) with 0≤i<k<h0\le i<k<h.✦ For a word v∈𝒱v\in\mathcal V and a block a∈ℬa\in\mathcal B, the position transposition va;i,kv^{a;i,k} is the word obtained by right-composing its permutation at block aa with (ik)(i\ k) and leaving the other blocks fixed.✦ The transposition interaction KSK_S is the real matrix in (4), with counting sums over blocks and pairs: KS(v,w)=∑a∈S∑0≤i<k<hδk−i𝟏w=va;i,k.K_S(v,w)=\sum_{a\in S}\ \sum_{0\le i<k<h} \delta^{k-i}\mathbf 1_{w=v^{a;i,k}}.(4)✦

For a real matrix AA on a finite set II, a label set JJ and labelings j,k:I→Jj,k:I\to J, the label coincidence pairing XAX_A, index energy ℰA\mathcal E_A and index Boltzmann weight WAW_A are defined by (5); the tuple weight is WS=WKSW_S=W_{K_S}, using (4): XA(j,k)=∑x∈I∑y∈IA(x,y)𝟏j(x)=k(y),ℰA(j)=12XA(j,j),WA(j)=exp⁡(ℰA(j)).\begin{aligned} X_A(j,k)&=\sum_{x\in I}\sum_{y\in I}A(x,y)\mathbf 1_{j(x)=k(y)},\\ \mathcal E_A(j)&=\tfrac12 X_A(j,j),\qquad W_A(j)=\exp\bigl(\mathcal E_A(j)\bigr). \end{aligned}(5) The sums in (5) are counting sums. The Boltzmann weight bound WmaxW_{\max} and unmarked reflection constant CuC_{\mathrm u} are the constants in (6): Wmax=exp⁡(d(T+1)(h2)δ2),Cu=(32d2)1/4Wmax⁡2.W_{\max}=\exp\!\left(\frac{d(T+1)\binom h2\delta}{2}\right),\qquad C_{\mathrm u}=(32d^2)^{1/4}W_{\max}^2.(6)

The strict square indicator σp\sigma_p for a prime pp takes the value 11 on nonzero squares in 𝔽p\mathbb F_p and 00 elsewhere.✦ For a finite directed edge set E⊆I×IE\subseteq I\times I, the graph square-constraint indicator IEI_E on 𝔽pI\mathbb F_p^I is given by (7); the tuple validity indicator is IESI_{E_S}: IE(Y)=∏(x,y)∈Eσp(Y(y)−Y(x)).I_E(Y)=\prod_{(x,y)\in E}\sigma_p\bigl(Y(y)-Y(x)\bigr).(7)

For list values Y:ℒS→𝔽pY:\mathcal L_S\to\mathbb F_p and labels j:𝒱→JSj:\mathcal V\to J_S, the sampled configuration is zY,j(v)=Y(uS(v),j(v))z_{Y,j}(v)=Y(u_S(v),j(v)).✦ The tuple component functional 𝒞p,S\mathcal C_{p,S} on real observables G:𝔽p𝒱→ℝG:\mathbb F_p^{\mathcal V}\to\mathbb R is defined by (8), where every expectation is a uniform probability average: 𝒞p,S(G)=𝔼Y∈𝔽pℒS𝔼j∈JS𝒱IES(Y)WS(j)G(zY,j).\mathcal C_{p,S}(G)= \mathbb E_{Y\in\mathbb F_p^{\mathcal L_S}} \mathbb E_{j\in J_S^{\mathcal V}} I_{E_S}(Y)\,W_S(j)\,G(z_{Y,j}).(8)✦

The Cut and Its Moment

Fix b∈ℬb\in \mathcal B and distinct symbols α,β∈H\alpha,\beta\in H. The positive cut predicate at bb holds for a word vv when its inverse permutation places α\alpha before β\beta.✦ The positive cut half 𝒱+\mathcal V_+ and block transposition reflection RR are defined by (9); the reflection left-composes at bb: 𝒱+={v∈𝒱:v(b)−1(α)<v(b)−1(β)},(Rv)(a)={(αβ)v(b),a=b,v(a),a≠b.\begin{aligned} \mathcal V_+&=\{v\in\mathcal V:v(b)^{-1}(\alpha)<v(b)^{-1}(\beta)\},\\ (Rv)(a)&= \begin{cases} (\alpha\ \beta)v(b),&a=b,\\ v(a),&a\ne b. \end{cases} \end{aligned}(9) The reflection half decomposition is the map from two copies of 𝒱+\mathcal V_+ to 𝒱\mathcal V that sends a vertex vv in the first copy to vv and a vertex vv in the second copy to RvRv.

For a real function F:𝔽p𝒱+→ℝF:\mathbb F_p^{\mathcal V_+}\to\mathbb R, the tuple reflection quadratic form Qp,Sb(F)Q^b_{p,S}(F) uses the component functional (8) as in (10): Qp,Sb(F)=𝒞p,S(z↦F((z(v))v∈𝒱+)F((z(Rv))v∈𝒱+)).Q^b_{p,S}(F)=\mathcal C_{p,S}\!\left( z\longmapsto F\bigl((z(v))_{v\in\mathcal V_+}\bigr) F\bigl((z(Rv))_{v\in\mathcal V_+}\bigr)\right).(10)✦

Assume b∉Sb\notin S. A positive half address uu is an address in 𝒜S\mathcal A_S satisfying the cut predicate in (9); their set is denoted by 𝒜S,+\mathcal A_{S,+}.✦ The positive half list entry set ℒS,+\mathcal L_{S,+} is the Cartesian product defined by ℒS,+=𝒜S,+×JS\mathcal L_{S,+}=\mathcal A_{S,+}\times J_S.✦ The positive half projection uS,+:𝒱+→𝒜S,+u_{S,+}:\mathcal V_+\to\mathcal A_{S,+} is the restriction of uSu_S.✦ The list reflection half decomposition e:ℒS,+⊔ℒS,+→ℒSe:\mathcal L_{S,+}\sqcup\mathcal L_{S,+} \to\mathcal L_S leaves the first copy unchanged and reflects the address in the second copy, retaining the list index.

The unmarked half graph ẼS\widetilde E_S is the graph pullback of ESE_S along ee: an ordered pair (x,y)(x,y) is an edge exactly when (e(x),e(y))∈ES(e(x),e(y))\in E_S.✦ The positive half internal edge set ES,+E_{S,+} of ẼS\widetilde E_S consists of the edges with both endpoints in the first copy of ℒS,+\mathcal L_{S,+}, viewed as pairs in ℒS,+\mathcal L_{S,+}.✦ The unmarked second moment Dp,Sb(F)D^b_{p,S}(F) is defined by (11), using the graph validity indicator (7): Dp,Sb(F)=𝔼Y+∈𝔽pℒS,+𝔼j+∈JS𝒱+IES,+(Y+)[F((Y+(uS,+(v),j+(v)))v∈𝒱+)]2.D^b_{p,S}(F)= \mathbb E_{Y_+\in\mathbb F_p^{\mathcal L_{S,+}}} \mathbb E_{j_+\in J_S^{\mathcal V_+}} I_{E_{S,+}}(Y_+) \left[F\!\left( \bigl(Y_+(u_{S,+}(v),j_+(v))\bigr)_{v\in\mathcal V_+} \right)\right]^2.(11)✦

The Claim

Theorem 1. Let pp be an odd prime, S⊆ℬS\subseteq \mathcal B, b∈ℬ\Sb\in \mathcal B\setminus S and α,β∈H\alpha,\beta\in H distinct. Let F:𝔽p𝒱+→ℝF:\mathbb F_p^{\mathcal V_+}\to\mathbb R. For |S|≤T+1|S|\le T+1, the unmarked cut satisfies −Cup−1/8Dp,Sb(F)≤Qp,Sb(F).-C_{\mathrm u}p^{-1/8}D^b_{p,S}(F)\le Q^b_{p,S}(F).(12)✦ For |S|=T+1|S|=T+1, the terminal cut satisfies 0≤Qp,Sb(F).0\le Q^b_{p,S}(F).(13)✦

In the paper, the result reads: with mark cutoff t0t_0 and weight bound BB, writing jvj_v for the label at vv in the labeling j+j_+, for b∉Sb\notin S, s=|S|≤t0s=|S|\le t_0 and real FF, let I+(Y+)I_+(Y_+) impose only constraints internal to plus addresses and put Dp,Sb(F)=𝔼Y+,j+I+(Y+)F((Y+(uS(v),jv))v∈𝒱+)2D^b_{p,S}(F)=\mathbb E_{Y_+,j_+}I_+(Y_+) F((Y_+(u_S(v),j_v))_{v\in\mathcal V_+})^2; then Qp,Sb(F)≥−C*p−1/8Dp,Sb(F)Q^b_{p,S}(F)\ge-C_*p^{-1/8}D^b_{p,S}(F) with C*=(32d2)1/4B2C_*=(32d^2)^{1/4}B^2, while Qp,Sb(F)≥0Q^b_{p,S}(F)\ge0 when s=t0+1s=t_0+1.

What Is Checked

The claims (12) and (13) concern odd prime fields and real functions on permutation cut halves, with an inactive reflection block and distinct reflected symbols. The vertex and list reflection half decompositions are bijections from two copies of their respective positive halves onto the full vertex and list sets.