Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 — Ierardi resultant factorization

Proved
APSCounting893.Main.ierardi_resultant_factorization

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

algebraic-geometryapscomplexity-theoryp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For the actual homogenized and perturbed system, choose the source linear form ℓ\ellℓ injective on Y0∪{0}Y_0\cup\{0\}Y0​∪{0}. Let RRR be its normalized homogeneous resultant with HT,wH_{T,w}HT,w​, and let Z0∗Z_0^*Z0∗​ be the projective set of actual ϵ\epsilonϵ-limits. This set is finite. There are positive integer multiplicities μz\mu_zμz​ and compatible homogeneous representatives for which

TCϵR=∏z∈Z0∗HT,w(z)μz,μz>0.\mathrm{TC}_{\epsilon}R=\prod_{z\in Z_0^*}H_{T,w}(z)^{\mu_z},\qquad\mu_z>0.TCϵ​R=z∈Z0∗​∏​HT,w​(z)μz​,μz​>0.

Points at infinity are retained. The representatives and nonzero rescalings are conclusions, so the literal product identity is not inserted into a definition or assumed as data. The identity is read after mapping the line parameter into the series field.

Differences from the source:

  • reading: projective points z in the homogeneous evaluations H(z), with the scalar convention implicit → explicit nonzero rescalings of canonical representatives, existentially selected together with the positive multiplicities; reason: H has degree two and changes under rescaling; this makes the source normalization explicit while retaining the literal product identity
  • encoding: the finite epsilon-limit set over the Puiseux field → specializations of actual nonnegative-valuation epsilon-Puiseux solutions in an iterated Hahn ambient field; reason: all finite ramification denominators and infinity points are retained, and no resultant factorization defines the limit set
Preamble
import Definitions.Def_APSCounting893_Main_Resultant

set_option autoImplicit false
Formal statement
namespace APSCounting893.Main

theorem ierardi_resultant_factorization (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),
      (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

end APSCounting893.Main
Source
Sanyam Agarwal, Archit Hari, Anurag Pandey, Himanshu Shukla, STOC 2027 submission #893 (October 2026), Lemma 5.2, p. 21, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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