Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The sampled resultant degree bound (6.3)

Proved
APSCounting893.Main.sampled_resultant_degree_bound

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

apscomplexity-theorydegree-boundresultant

Let III be a reduced rational circuit with n>0n>0n>0 input variables and n+1n+1n+1 outputs, let LLL be the length of its binary circuit encoding, and let θ\thetaθ be any integer tuple of auxiliary parameters. Put N=2n+1N=2n+1N=2n+1 and let ddd be the maximum of 222 and the circuit's output formal degrees. For the actual normalized homogeneous resultant RθR_\thetaRθ​ used in the APS construction,

deg⁡Rθ≤D∗=(N+1)(2N+1)dN≤232(L+1)2.\deg R_\theta\le D_*=(N+1)(2N+1)d^N\le 2^{32(L+1)^2}.degRθ​≤D∗​=(N+1)(2N+1)dN≤232(L+1)2.

The bounds hold for every parameter tuple, including choices for which the resultant vanishes or the geometric projection is unsuccessful. This supplies the degree component of uniform resultant coefficient access; it imposes no polynomial bound on the expanded degree.

Preamble
import Definitions.Def_APSCounting893_Main_SampledResultant
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.sampled_resultant_degree_bound
    (I : ReducedCircuit) (theta : SampleTuple I) :
    (sampledResultant I theta).totalDegree ≤ sourceDStar I.n I.rawMap.d ∧
      sourceDStar I.n I.rawMap.d ≤ 2 ^ polyBound 32 2 I.C.encode.length := by sorry
Source
Agarwal, Hari, Pandey and Shukla, Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting Hierarchy, STOC 2027 submission #893, Section 6.2, equation (6.3), p. 24, and Theorem 6.4, pp. 25–26, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf. The explicit polynomial 32(L+1)^2 bounds the singly exponential estimate in (6.3).

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