Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Recovering a polynomial-length value from its CH bit language

Proved
APSCounting893.Main.short_natural_graph_from_bits

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

apsbinary-arithmeticcounting-hierarchyoracle-machines

Let FFF assign a natural number to each binary input word, and suppose fixed natural numbers a,ba,ba,b bound its binary length on every input:

bits⁡(F(x))≤a(∣x∣+1)b.\operatorname{bits}(F(x))\le a(|x|+1)^b.bits(F(x))≤a(∣x∣+1)b.

If the bit-query language of FFF belongs to counting level jjj, then its value-graph language belongs to level j+3j+3j+3:

BIT⁡F∈CjP⟹GRAPH⁡F∈Cj+3P.\operatorname{BIT}_F\in C_jP\quad\Longrightarrow\quad\operatorname{GRAPH}_F\in C_{j+3}P.BITF​∈Cj​P⟹GRAPHF​∈Cj+3​P.

A graph query consists of a framed input word followed by arbitrary little-endian candidate bits. All such words, including candidates with trailing zeros, are covered.

This is an implicit short-value interface for arithmetic constructions: a bounded-length integer can be tested through its individual bits while retaining a fixed counting level. The hierarchy uses the published physical finite oracle machines.

Preamble
import Definitions.Def_APSCounting893_Main_BinaryOracleArithmetic
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.short_natural_graph_from_bits
    (F : Word → ℕ) (j a b : ℕ)
    (hF : ∀ x,(F x).bits.length ≤ polyBound a b x.length)
    (hbits : AtCHLevel j (NaturalBitLanguage F)) :
    AtCHLevel (j+3) (NaturalGraphLanguage F) := by sorry
Source
Finite-machine bit-to-value interface used for the short-integer operations in Hesse, Allender and Barrington, Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication, JCSS 65(4), 2002, Section 4, pp. 8–11 of the author manuscript, https://www.cs.rutgers.edu/~allender/papers/division.pdf; arithmetic-to-threshold construction used in Agarwal, Hari, Pandey and Shukla, STOC 2027 submission #893, Theorem 6.4, pp. 25–26, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf. The explicit overhead of three levels reflects the published native preprocessing and bounded-universal simulation interfaces.

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