Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Affine-section certificate preserving the polynomial image closure

Proved
APSCounting893.Main.affine_section_nonvanishing_certificate

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

algebraic-geometryapsgeneric-sections

Let F:Cn→CmF:\mathbb C^n\to\mathbb C^mF:Cn→Cm be a polynomial map with image closure YYY of dimension r<mr<mr<m, and put d=max⁡(1,deg⁡fi)d=\max(1,\deg f_i)d=max(1,degfi​). There is a nonzero polynomial qqq in the coefficients of n−rn-rn−r affine equations such that

deg⁡q≤2(n−r)dm.\deg q\le 2(n-r)d^m.degq≤2(n−r)dm.

Whenever rational coefficients sss satisfy q(s)≠0q(s)\ne0q(s)=0, their affine equations define an rrr-dimensional plane admitting a rational affine parametrization. For every affine parametrization selected by the section predicate, the restriction of FFF has exactly the original image closure:

F∣H(Cr)‾Zar=Y.\overline{F|_H(\mathbb C^r)}^{\mathrm{Zar}}=Y.F∣H​(Cr)​Zar=Y.

This is the domain-reduction certificate used in Proposition 3.14. It preserves the entire image closure and therefore preserves both its dimension and APS. The output-projection coefficients are unrestricted in this statement.

Formalization Note The output count is written as m+1m+1m+1 in Lean to expose its positive size. The selected rational parametrization is the same epsilon-selected object used by the mission's input-reduction definition.

Preamble
import Definitions.Def_APSCounting893_Main_RandomReduction
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem APSCounting893.Main.affine_section_nonvanishing_certificate {n m r : ℕ} (F : PolynomialMap ℂ n (m+1))
    (hrm : r < m+1)
    (hdim : RSCapacity.algDim (imageClosure F) = ((r : ℕ∞) : WithBot ℕ∞)) :
    ∃ q : MvPolynomial ((Fin (n-r) × Fin (n+1))) ℂ,
      q ≠ 0 ∧ q.totalDegree ≤ 2*(n-r)*(inputDegree F)^(m+1) ∧
      ∀ s : ReductionLabels n (m+1) r → ℚ,
        eval (fun a => (s (Sum.inl a) : ℂ)) q ≠ 0 →
        ParametrizesSection s (selectedSectionParameter s) ∧
        imageClosure ((fun i => MvPolynomial.eval₂Hom MvPolynomial.C (parameterMap (selectedSectionParameter s)) (F i))) = imageClosure F := by sorry
Source
Agarwal, Hari, Pandey and Shukla, Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting Hierarchy, STOC 2027 submission #893, Proposition 3.14 and proof, pp.14–15 (domain/input reduction using generic affine sections), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf

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