Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded least-witness value graphs stay in CH

Proved
APSCounting893.Main.bounded_least_witness_graph_in_ch

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

apsbinary-arithmeticbounded-searchcounting-hierarchy

Let AAA be a language at counting level jjj. For fixed natural numbers a,ba,ba,b, let μA,a,b(x)\mu_{A,a,b}(x)μA,a,b​(x) be the least natural number n<2a(∣x∣+1)bn<2^{a(|x|+1)^b}n<2a(∣x∣+1)b whose framed binary query belongs to AAA, or zero if no such number exists. Then

Graph⁡(μA,a,b)∈Cj+8P.\operatorname{Graph}(\mu_{A,a,b})\in C_{j+8}P.Graph(μA,a,b​)∈Cj+8​P.

The assertion uses actual uniform finite oracle machines. The relative hierarchy overhead and all resource constants are independent of the input word. This bounded-search closure supplies least generators and discrete logarithms for the implicit CRT arithmetic stage.

Preamble
import Definitions.Def_APSCounting893_Main_BoundedLeastArithmetic
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.bounded_least_witness_graph_in_ch (A : Language) (j a b : ℕ)
    (hA : AtCHLevel j A) :
    AtCHLevel (j+8) (NaturalGraphLanguage (boundedLeastValue A a b)) := by sorry
Source
Bounded-search implementation for the discrete logarithms and primitive generators in Hesse, Allender and Barrington, Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication, JCSS 65(4), 2002, Section 4, Steps 2–3 and Lemmas 4.1–4.3, pp. 9–11, https://www.cs.rutgers.edu/~allender/papers/division.pdf. Used in the finite-machine arithmetic foundations for Agarwal, Hari, Pandey and Shukla, STOC 2027 submission #893, Theorem 6.4.

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