Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Resultant product over the actual finite epsilon-limit set

Proved
APSCounting893.Main.epsilon_resultant_product

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

algebraic-geometryelimination-theorypuiseux-series

Let FFF, the admissible line data, the separating form ℓ\ellℓ, and the positive homogenizing degrees be as in Lemma 5.2. Let SSS be a finite enumeration of the actual projective epsilon-limit set Z0∗Z_0^*Z0∗​.

There are positive integer multiplicities μz\mu_zμz​ and nonzero scalar rescalings z~\widetilde zz of each projective representative z∈Sz\in Sz∈S such that

TC⁡ϵR(T,t,w,ϵ)=∏z∈SHT,w(z~)μz.\operatorname{TC}_{\epsilon}R(T,t,w,\epsilon)=\prod_{z\in S}H_{T,w}(\widetilde z)^{\mu_z}.TCϵ​R(T,t,w,ϵ)=z∈S∏​HT,w​(z)μz​.

Here RRR is the actual normalized universal resultant of the perturbed equations and the prescribed quadratic form. The product includes limits at infinity, and every multiplicity is positive. This is the factorization assertion of Lemma 5.2 after its finite limit set has been enumerated.

Preamble
import Definitions.Def_APSCounting893_Main_Resultant
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.epsilon_resultant_product
    (F : ReducedMap) (D : LineData F) (lambda : Affine ℂ (F.n+1))
    (hsep : Set.InjOn (separatingForm lambda) (zeroFiber F D.c ∪ {0}))
    (degrees : Fin (F.n+(F.n+1)) → ℕ) (hdegrees : HomogenizingDegrees F D.c D.alpha degrees)
    (S : Finset (Fin (F.n+(F.n+1)+1) → PuiseuxAmbient))
    (hS : (S : Set _) = epsilonLimitSet F D.c D.alpha degrees) :
    ∃ (mu : (Fin (F.n+(F.n+1)+1) → PuiseuxAmbient) → ℕ)
      (representatives : (Fin (F.n+(F.n+1)+1) → PuiseuxAmbient) →
        (Fin (F.n+(F.n+1)+1) → PuiseuxAmbient)),
      (∀ z ∈ S, 0 < mu z ∧ ∃ a : PuiseuxAmbient, a ≠ 0 ∧ representatives z = a • z) ∧
      trailingEpsilonResultant (resultantFor F D.c D.alpha lambda degrees) =
        ∏ z ∈ S, HAtPoint F lambda (representatives z) ^ mu z := 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, Lemma 4.7 (Ierardi Lemma 2.6), p. 26.

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