Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 (used in the proof of Theorem 1.3) — Fixed Boolean border identities and units

Open
OddPermSum.Evaluation.Supplement.lemma_6_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebracomplexity-theorylinear-algebrap2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let Rr=F[z]/(zr+1)R_r=F[z]/(z^{r+1})Rr​=F[z]/(zr+1) with FFF a characteristic-two field. Fix any vertex uuu and set Mb(X)=(Xeueu⊤b)M_b(X)=\left(\begin{smallmatrix}X&e_u\\e_u^\top&b\end{smallmatrix}\right)Mb​(X)=(Xeu⊤​​eu​b​) for b=0,1b=0,1b=0,1, placing the added index last. For every X∈Rrn×nX\in R_r^{n\times n}X∈Rrn×n​,

Φ(X)=Φ(M0(X))+Φ(M1(X)),G(X)j,i=G(M0(X))j,i+G(M1(X))j,i(i,j∈[n]).\Phi(X)=\Phi(M_0(X))+\Phi(M_1(X)),\qquad G(X)_{j,i}=G(M_0(X))_{j,i}+G(M_1(X))_{j,i}\quad( i,j\in[n]).Φ(X)=Φ(M0​(X))+Φ(M1​(X)),G(X)j,i​=G(M0​(X))j,i​+G(M1​(X))j,i​(i,j∈[n]).

If X(0)=I−eueu⊤X(0)=I-e_ue_u^\topX(0)=I−eu​eu⊤​, both M0(X)M_0(X)M0​(X) and M1(X)M_1(X)M1​(X) have unit determinant in RrR_rRr​.

The identities hold without an invertibility assumption on XXX. The final conditional clause permits valid inverse maintenance on both borders.

Differences from the source:

  • encoding: original indices [n] and the new last border index → Fin n, Fin.castAdd into Fin (n+1), with the published border; reason: preserves the original matrix order and transposed derivative convention
  • generalization: the finite field and n >= 2 working setting of sections 5–6 → every characteristic-two field and every n with a chosen vertex u : Fin n; reason: the formal border identities and constant-determinant argument on p. 20 are field-independent and also apply at n = 1
Preamble
import Definitions.Def_OddPermSum_Evaluation_Supplement_truncatedRing
import Definitions.Def_OddPermSum_Evaluation_Supplement_rowUpdate
import Definitions.Def_OddPermSum_Evaluation_gradient

set_option autoImplicit false
Formal statement
namespace OddPermSum.Evaluation.Supplement

theorem lemma_6_2 {F : Type*} [Field F] [CharP F 2] {n r : ℕ}
    (u : Fin n) (X : Matrix (Fin n) (Fin n) (Trunc F r)) :
    phi X = phi (fixedBorder u X 0) + phi (fixedBorder u X 1) ∧
    (∀ i j : Fin n, gradient X j i =
      gradient (fixedBorder u X 0) (Fin.castAdd 1 j) (Fin.castAdd 1 i) +
      gradient (fixedBorder u X 1) (Fin.castAdd 1 j) (Fin.castAdd 1 i)) ∧
    ((constantMatrix X = fun i j => (if i = j then 1 else 0) -
        (if i = u ∧ j = u then 1 else 0)) →
      IsUnit (fixedBorder u X 0).det ∧ IsUnit (fixedBorder u X 1).det) := by sorry

end OddPermSum.Evaluation.Supplement
Source
Boxuan Chen, Bin Cui, Hanqing Li, Xupeng Miao, Haoze Wang, STOC 2027 submission #716 (October 2026), p. 19, Lemma 6.2

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me