Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Circuit bound for coefficients after affine substitution

Proved
ResultantVNP.circuit_affine_coefficient_bound

by gjindal · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-complexitycircuitsresultants

Let CCC be an arithmetic circuit over C\mathbb CC, let SSS be its number of addition and multiplication gates, and let δx∈C\delta_x\in\mathbb Cδx​∈C be fixed for each input variable xxx. For every integer s≥0s\ge0s≥0, there is an arithmetic circuit DDD satisfying

D(x)=[zs]C((δx+zx)x),size⁡(D)≤2(s+1)2S+1.D(\mathbf x)=[z^s]C((\delta_x+zx)_{x}),\qquad \operatorname{size}(D)\le 2(s+1)^2S+1.D(x)=[zs]C((δx​+zx)x​),size(D)≤2(s+1)2S+1.

The bound is independent of the total degree of the polynomial computed by CCC. This provides the coefficient-extraction step used to pass from tensor determinant circuits to characteristic coefficient circuits.

Formalization Note Circuits count arithmetic gates only; variable and constant leaves have zero cost. Arbitrary shared intermediate results are allowed.

Preamble
import Mathlib
import Definitions.Def_ResultantVNP_Circuit
Formal statement
theorem ResultantVNP.circuit_affine_coefficient_bound {σ : Type} (C : ResultantVNP.Circuit σ) (δ : σ → ℂ) (s : ℕ) :
    ∃ D : ResultantVNP.Circuit σ,
      D.value = (MvPolynomial.aeval (fun x =>
        Polynomial.C (MvPolynomial.C (δ x)) +
          Polynomial.X * Polynomial.C (MvPolynomial.X x)) C.value).coeff s ∧
      D.size ≤ 2 * (s+1)^2 * C.size + 1 := by sorry
Source
Derived explicit circuit bound for the homogenization step in Bhargav–Curticapean–Jindal–Shukla, Multivariate Resultants: Complexity and Applications to Real Feasibility, STOC 2027 submission #1103, proof of Theorem 1.4, p.17. The paper cites Strassen homogenization; this auxiliary statement supplies a direct constructive bound. https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1103.pdf

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