Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1 — Image dimension from exact feasibility

Proved
APSCounting893.Main.image_dimension_in_ch

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

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

Let a rational arithmetic circuit represent a polynomial map F:Cn→CmF:\mathbb C^n\to\mathbb C^mF:Cn→Cm, with every binary constant and wire charged in the input length. There are one language A∈CHA\in\mathrm{CH}A∈CH and one deterministic polynomial-time oracle machine computing a function hhh such that every valid circuit input satisfies

h(enc⁡(F))=enc⁡(dim⁡F(Cn)‾).h(\operatorname{enc}(F))=\operatorname{enc}(\dim\overline{F(\mathbb C^n)}).h(enc(F))=enc(dimF(Cn)​).

The oracle, machine and polynomial bound are fixed for all circuits and dimensions, including constant maps. This provides the actual geometric dimension as a function output.

Differences from the source:

  • encoding: dimension computable in deterministic polynomial time with a fixed-level CH oracle → one total bit-string function implemented by the finite oracle machine, returning the binary natural dimension; reason: fixes the source Turing model and includes the semantic circuit promise
Preamble
import Definitions.Def_APSCounting893_Main_SampledResultant

set_option autoImplicit false
Formal statement
namespace APSCounting893.Main

theorem image_dimension_in_ch :
    ∃ (A : Language) (f : Word → Word), InCountingHierarchy A ∧ FunctionInPWithOracle A f ∧
      ∀ (n : ℕ) (C : ArithmeticCircuit n), ValidCircuit .rational C →
        ∃ r : ℕ,
          RSCapacity.algDim (imageClosure (rationalComplexPolynomials C)) =
            ((r : ℕ∞) : WithBot ℕ∞) ∧ f C.encode = encodeNat r := by sorry

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