Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.4 — poly-size circuits for Resn(2)\mathrm{Res}^{(2)}_nResn(2)​ imply VP=VNP\mathrm{VP}=\mathrm{VNP}VP=VNP

Proved
ResultantVNP.theorem_1_4

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-complexityp2o-gran-per-chapterp2o-plan-paperp2o-v1resultantsvnp

Algebraic hardness of resultants. If the polynomial family {Resn(2)}n≥1\{\mathrm{Res}^{(2)}_n\}_{n\ge1}{Resn(2)​}n≥1​ of resultants of nnn quadratic forms in nnn variables has poly(nnn)-size arithmetic circuits over C\mathbb CC, then

VP=VNP.\mathrm{VP}=\mathrm{VNP}.VP=VNP.

Only the circuit size is assumed polynomial: Resn(2)\mathrm{Res}^{(2)}_nResn(2)​ has degree n2n−1n2^{n-1}n2n−1, so it is not itself in VP or VNP. The theorem says that small circuits for the resultant would refute Valiant's hypothesis VP≠VNP\mathrm{VP}\ne\mathrm{VNP}VP=VNP.

Differences from the source:

  • encoding: the multivariate resultant Res, the unique integral polynomial with the three properties of Definition 2.1 (existence and uniqueness cited from [GKZ94]) → an arbitrary ResultantSystem 𝓡 (integral polynomials satisfying the three properties for n ≥ 1 and positive degrees), quantified universally; reason: existence is cited, not proved in the paper; by uniqueness every resultant system is the resultant on every admissible degree vector, so the statement is the paper's
  • encoding: poly(n)-size arithmetic circuits over ℂ → HasPolySizeCircuits: ∃ c, ∀ n ≥ 1, a fan-in-two circuit with complex constants and at most c·n^c + c gates computes Res^{(2)}_n mapped to ℂ[u]; reason: Section 3.1 conventions; c·n^c + c dominates every polynomial; size only, as printed
  • encoding: VP and VNP → sets of PolyFamily (number of variables, p_n over Fin (nvars n)); VNP with g_n on exactly nvars n + q n variables; reason: Section 3.1 definitions
Preamble
import Mathlib
import Definitions.Def_ResultantVNP_quadRes
import Definitions.Def_ResultantVNP_HasPolySizeCircuits
import Definitions.Def_ResultantVNP_VNP
Formal statement
namespace ResultantVNP

/-- **Theorem 1.4 (Algebraic hardness of resultants).** If the polynomial family `{Res^{(2)}_n}_{n≥1}`
has poly(n)-size arithmetic circuits over `ℂ`, then `VP = VNP`.

Bhargav–Curticapean–Jindal–Shukla, *Multivariate Resultants: Complexity and Applications to Real Feasibility*, STOC 2027 submission manuscript (sha256 8827709b…7f8271), Theorem 1.4, p.6 (proof p.17).

**Formalization Note** The resultant is taken from an arbitrary `ResultantSystem` `𝓡`; by the uniqueness in Definition 2.1 it is the multivariate resultant wherever the paper uses it. `Res^{(2)}_n ∈ ℤ[u]` is mapped to `ℂ[u]`; "poly(n)-size" is `HasPolySizeCircuits` (size only, no
degree bound). `VP = VNP` is the equality of the two classes of polynomial families of Section 3.1. -/
theorem theorem_1_4 (𝓡 : ResultantSystem)
    (h : HasPolySizeCircuits (fun n => MvPolynomial.map (Int.castRingHom ℂ) (quadRes 𝓡 n))) :
    VP = VNP := by sorry

end ResultantVNP
Source
Bhargav–Curticapean–Jindal–Shukla, Multivariate Resultants: Complexity and Applications to Real Feasibility, STOC 2027 submission (manuscript sha256 8827709b…7f8271), Theorem 1.4, p.6 (proof p.17)
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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