Lemma 6.2 (used in the proof of Theorem 1.3) — Fixed Boolean border identities and units
OpenOddPermSum.Evaluation.Supplement.lemma_6_2algebracomplexity-theorylinear-algebrap2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1
Let with a characteristic-two field. Fix any vertex and set for , placing the added index last. For every ,
If , both and have unit determinant in .
The identities hold without an invertibility assumption on . 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