Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bit access to implicit sums of long integers stays in CH

Proved
APSCounting893.Main.implicit_long_integer_sums_in_ch

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

apsbinary-arithmeticcounting-hierarchyimplicit-sums

Let FFF be a total natural-valued function on binary words. Assume that its bit language, with a length-delimited input and a binary bit index, belongs to counting level jjj. For fixed natural numbers a,ba,ba,b, set r=a(∣x∣+1)br=a(|x|+1)^br=a(∣x∣+1)b and define the actual sum

S(x)=∑i=02r−1F(frame⁡(x) ∥ bits⁡r(i)).S(x)=\sum_{i=0}^{2^r-1} F\bigl(\operatorname{frame}(x)\,\Vert\,\operatorname{bits}_r(i)\bigr).S(x)=i=0∑2r−1​F(frame(x)∥bitsr​(i)).

Then

Bit⁡(S)∈Cj+22P.\operatorname{Bit}(S)\in C_{j+22}P.Bit(S)∈Cj+22​P.

There is no hypothesis on the bit length of F(x)F(x)F(x). The relative hierarchy overhead and all machine resource constants precede the input word and the queried bit index. This supplies uniform iterated addition for exponentially indexed integer families, including the long dyadic numerators used in Chinese remainder comparison.

Preamble
import Definitions.Def_APSCounting893_Main_ImplicitCountingArithmetic
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.implicit_long_integer_sums_in_ch (F : Word → ℕ) (j a b : ℕ)
    (hF : AtCHLevel j (NaturalBitLanguage F)) :
    AtCHLevel (j+22) (NaturalBitLanguage (indexedNaturalSum F a b)) := by sorry
Source
Iterated-addition ingredient in Hesse, Allender and Barrington, Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication, JCSS 65(4), 2002, author manuscript Section 3, p. 7, and Section 4, Lemma 4.3, pp. 10–11, https://www.cs.rutgers.edu/~allender/papers/division.pdf. Explicit finite oracle-machine bit-language implementation for 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 relative level 22 is an implementation bound proved here, not a numerical level claimed by either source.

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