The sampled resultant degree bound (6.3)
ProvedAPSCounting893.Main.sampled_resultant_degree_boundapscomplexity-theorydegree-boundresultant
Let be a reduced rational circuit with input variables and outputs, let be the length of its binary circuit encoding, and let be any integer tuple of auxiliary parameters. Put and let be the maximum of and the circuit's output formal degrees. For the actual normalized homogeneous resultant used in the APS construction,
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 sorrySource
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).