Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Normalized integer resultant: existence and characteristic-zero base change

Proved
APSCounting893.Main.normalized_resultant_foundation

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryelimination-theorypuiseux-series

Let d0,…,dnd_0,\ldots,d_nd0​,…,dn​ be positive integers. There exists a universal polynomial with integer coefficients that is normalized to be 111 on the diagonal pure-power system and is irreducible over C\mathbb CC, and whose vanishing exactly detects a common nonzero complex root.

Every integer polynomial satisfying these defining properties has, over every algebraically closed field KKK of characteristic zero, the exact root criterion

Res⁡(G0,…,Gn)=0⟺∃x∈Kn+1∖{0}:Gi(x)=0 for every i,\operatorname{Res}(G_0,\ldots,G_n)=0\quad\Longleftrightarrow\quad\exists x\in K^{n+1}\setminus\{0\}:G_i(x)=0\text{ for every }i,Res(G0​,…,Gn​)=0⟺∃x∈Kn+1∖{0}:Gi​(x)=0 for every i,

for homogeneous forms GiG_iGi​ of degrees did_idi​. This establishes the existence and base-change specification required to use the selected universal resultant over the valued-series fields in Lemma 5.2.

Preamble
import Definitions.Def_APSCounting893_Main_Resultant
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.normalized_resultant_foundation
    {n : ℕ} (d : Fin (n+1) → ℕ) (hd : ∀ i, 0 < d i) :
    (∃ R : MvPolynomial (ResultantVNP.CoeffVar d) ℤ, ResultantVNP.IsMultivariateResultant d R) ∧
    (∀ (R : MvPolynomial (ResultantVNP.CoeffVar d) ℤ) (hR : ResultantVNP.IsMultivariateResultant d R)
      (K : Type) [Field K] [IsAlgClosed K] [CharZero K]
      (G : Fin (n+1) → MvPolynomial (Fin (n+1)) K) (hG : ∀ i, (G i).IsHomogeneous (d i)),
      MvPolynomial.eval₂ (Int.castRingHom K)
        (fun v : ResultantVNP.CoeffVar d => (G v.1).coeff v.2.1) R = 0 ↔
        ∃ x : Fin (n+1) → K, x ≠ 0 ∧ ∀ i, MvPolynomial.eval x (G i) = 0) := by sorry
Source
Agarwal, Hari, Pandey and Shukla, Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting Hierarchy, STOC 2027 submission #893, Section 5.1, pp. 20–21, Lemma 5.2 and Remark 5.1; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf. Andrews, Garg and Schost, Hilbert’s Nullstellensatz is in the Counting Hierarchy, arXiv:2602.17904, https://arxiv.org/pdf/2602.17904, Definition 4.1, pp. 22–23 (existence, normalization, irreducibility and integral universal coefficients).

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