Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.3 — Resultant criterion for APS

Proved
APSCounting893.Main.resultant_criterion_for_aps

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

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

In the admissible reduced-map setup, choose ℓ\ellℓ injective on Y0∪{0}Y_0\cup\{0\}Y0​∪{0} and use the actual resultant of the source homogenizations and perturbations. There are c∈C×c\in\mathbb C^\timesc∈C× and strictly positive integers MyM_yMy​ such that

Rℓ(T)=TCtTCwTCϵR=c∏y∈Y0(T−ℓ(y))My,My>0.R_\ell(T)=\mathrm{TC}_t\mathrm{TC}_w\mathrm{TC}_{\epsilon}R=c\prod_{y\in Y_0}(T-\ell(y))^{M_y},\qquad M_y>0.Rℓ​(T)=TCt​TCw​TCϵ​R=cy∈Y0​∏​(T−ℓ(y))My​,My​>0. APS⁡(F)  ⟺  Rℓ(0)=0.\operatorname{APS}(F)\iff R_\ell(0)=0.APS(F)⟺Rℓ​(0)=0.

Both the full factorization and the equivalence are conclusions. The finite product ranges over the entire actual zero fiber, and no order of specialization or trailing extraction is interchanged.

Differences from the source:

  • encoding: the product over the finite zero fiber and three trailing extractions → a finite set equal to the actual zero fiber, positive natural multiplicities, and coefficient extraction in epsilon, w, t order; reason: retains the full product and both directions of the APS equivalence
Preamble
import Definitions.Def_APSCounting893_Main_Resultant

set_option autoImplicit false
Formal statement
namespace APSCounting893.Main

theorem resultant_criterion_for_aps (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 (Affine ℂ (F.n + 1))) (c : ℂ) (M : Affine ℂ (F.n + 1) → ℕ),
      (S : Set _) = zeroFiber F D.c ∧ c ≠ 0 ∧ (∀ y ∈ S, 0 < M y) ∧
      resultantCriterion (resultantFor F D.c D.alpha lambda degrees) =
        Polynomial.C c * ∏ y ∈ S,
          (Polynomial.X - Polynomial.C (separatingForm lambda y)) ^ M y ∧
      (hasAPS F.F ↔ (resultantCriterion (resultantFor F D.c D.alpha lambda degrees)).eval 0 = 0) := by sorry

end APSCounting893.Main
Source
Sanyam Agarwal, Archit Hari, Anurag Pandey, Himanshu Shukla, STOC 2027 submission #893 (October 2026), Theorem 5.3, p. 22, 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