Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.3 (used in the proof of Theorem 1.3) — Gradient-column and rank-one updates

Open
OddPermSum.Evaluation.Supplement.lemma_6_3

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

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

Let A∈RLs×sA\in R_L^{s\times s}A∈RLs×s​ be invertible, and suppose B=A−1B=A^{-1}B=A−1, Δ=det⁡A\Delta=\det AΔ=detA and φA=Φ(A)\varphi_A=\Phi(A)φA​=Φ(A) are given as input. For a row ρ\rhoρ and index iii, put A′=A+eiρA'=A+e_i\rhoA′=A+ei​ρ, g=G(A)∗,ig=G(A)_{*,i}g=G(A)∗,i​, b=Beib=Be_ib=Bei​, v=ρBv=\rho Bv=ρB, and η=1+vi\eta=1+v_iη=1+vi​. Then

Φ(A′)=Φ(A)+ρg,det⁡A′=Δη.\Phi(A')=\Phi(A)+\rho g,\qquad\det A'=\Delta\eta.Φ(A′)=Φ(A)+ρg,detA′=Δη.

If η\etaη is a unit, then

(A′)−1=B+η−1bv.(A')^{-1}=B+\eta^{-1}bv.(A′)−1=B+η−1bv.

Moreover, ρ(0)=0\rho(0)=0ρ(0)=0 guarantees that η\etaη is a unit. One program over each coefficient field, chosen before s,L,A,B,Δ,φA,i,ρs,L,A,B,\Delta,\varphi_A,i,\rhos,L,A,B,Δ,φA​,i,ρ, computes ggg, both updated scalars, and the updated inverse when applicable, using at most

Cs2(L+1)(log⁡2(s+L+2))kC s^2(L+1)\bigl(\log_2(s+L+2)\bigr)^kCs2(L+1)(log2​(s+L+2))k

charged field operations, with C>0C>0C>0 and kkk independent of all inputs and the coefficient field. This is a simultaneous query-and-update statement, including all algebraic clauses and the unit safeguard.

Differences from the source:

  • encoding: soft-O field-operation complexity → one program and positive constants C,k preceding s,L and all matrix inputs, with an explicit logarithmic bound; reason: expands soft-O uniformly without a loss in the exponent or dependence on the truncation precision
  • encoding: inverse of a unit and available stored quantities → Ring.inverse under IsUnit and explicit coefficient-list inputs for B, determinant and value; reason: ring inverse is only asserted valid for units and the input interface retains the source availability convention
  • generalization: the finite coefficient field chosen in section 5 → every characteristic-two coefficient field, with C and k uniform over that field; reason: the ring algorithms on pp. 14–15 and 21 use characteristic two and uniform scalar polynomial arithmetic; the chosen finite field is a special case
Preamble
import Definitions.Def_OddPermSum_Evaluation_Supplement_ringAlgorithmInterfaces

set_option autoImplicit false
Formal statement
namespace OddPermSum.Evaluation.Supplement

theorem lemma_6_3 :
    ∃ (C : ℝ) (k : ℕ), 0 < C ∧
    ∀ (F : Type) [Field F] [CharP F 2], ∃ p : AlgebraicProgram F,
    ∀ (s L : ℕ) (A B : Matrix (Fin s) (Fin s) (Trunc F L))
      (δ φA : Trunc F L) (i : Fin s) (ρ : Fin s → Trunc F L),
      IsUnit A.det → B = A⁻¹ → δ = A.det → φA = phi A →
      phi (rowUpdate A i ρ) = phi A + ∑ j, ρ j * gradient A j i ∧
      (rowUpdate A i ρ).det = δ * updateEta B i ρ ∧
      (IsUnit (updateEta B i ρ) → (rowUpdate A i ρ)⁻¹ = inverseUpdate B i ρ) ∧
      ((∀ j, truncCoeff (ρ j) 0 = 0) → IsUnit (updateEta B i ρ)) ∧
      ∃ (fuel : ℕ) (st : MachineState F),
        runParameters p s L i.val (updateInputs A B δ φA ρ) fuel = some st ∧
        st.outputs = updateOutputs A i ρ ∧
        (st.cost : ℝ) ≤ C * (s : ℝ)^2 * (L+1) * (Real.logb 2 (s+L+2))^k := by sorry

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

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