Bounded least-witness value graphs stay in CH
ProvedAPSCounting893.Main.bounded_least_witness_graph_in_chapsbinary-arithmeticbounded-searchcounting-hierarchy
Let be a language at counting level . For fixed natural numbers , let be the least natural number whose framed binary query belongs to , or zero if no such number exists. Then
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 sorrySource
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.