Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.14 — Reduce inputs while preserving APS

Proved
APSCounting893.Main.reduce_inputs_preserving_aps

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

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

Let F=(f1,…,fm):Cn→CmF=(f_1,\ldots,f_m):\mathbb C^n\to\mathbb C^mF=(f1​,…,fm​):Cn→Cm have nonconstant coordinates, image dimension 1≤r<m1\le r<m1≤r<m, and d=max⁡(1,deg⁡fi)d=\max(1,\deg f_i)d=max(1,degfi​). Let B⊂QB\subset\mathbb QB⊂Q be finite and nonempty. Sample all coefficients of n−rn-rn−r affine equations independently from BBB, parametrize the resulting plane, and, if m>r+1m>r+1m>r+1, sample r+1r+1r+1 linear combinations of the outputs. Then

Pr⁡[dim⁡F~(Cr)‾=r and (APS⁡(F)  ⟺  APS⁡(F~))]≥1−2(n−r)dm+(r+1)dr∣B∣.\Pr[\dim\overline{\widetilde F(\mathbb C^r)}=r\ \text{and}\ (\operatorname{APS}(F)\iff\operatorname{APS}(\widetilde F))]\ge1-\frac{2(n-r)d^m+(r+1)d^r}{|B|}.Pr[dimF(Cr)​=r and (APS(F)⟺APS(F))]≥1−∣B∣2(n−r)dm+(r+1)dr​.

An unsuccessful parametrization is part of the failure event. The output is the actual composed and projected map Cr→Cr+1\mathbb C^r\to\mathbb C^{r+1}Cr→Cr+1, with both directions of APS preservation retained.

Differences from the source:

  • encoding: random affine sections and optional output projection → cardinality ratio on a finite product sample space, using a selected rational affine parametrization; reason: all coefficients are independent and uniform, and unused output coefficients when m=r+1 do not change the probability
Preamble
import Definitions.Def_APSCounting893_Main_RandomReduction

set_option autoImplicit false
Formal statement
namespace APSCounting893.Main

theorem reduce_inputs_preserving_aps (n m r : ℕ) (F : PolynomialMap ℂ n m)
    (hnonconstant : ∀ i, 0 < (F i).totalDegree)
    (hdim : RSCapacity.algDim (imageClosure F) = ((r : ℕ∞) : WithBot ℕ∞))
    (hr : 1 ≤ r) (hrm : r < m) (B : Finset ℚ) (hB : B.Nonempty) :
    reductionSuccessProbability (r := r) F B ≥
      1 - ((2 * (n - r) * inputDegree F ^ m + (r + 1) * inputDegree F ^ r : ℕ) : ℝ) /
        (B.card : ℝ) := by sorry

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