Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform bounded threshold search with one oracle

Proved
APSCounting893.Main.bounded_threshold_search_with_oracle

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

apscomplexity-theoryoracle-machines

Fix an oracle language AAA. There is one total binary-word function fff computable by a deterministic polynomial-time oracle machine such that the following holds for every word xxx and every integer 0≤r≤∣x∣0\le r\le |x|0≤r≤∣x∣. If

A(⟨x,enc⁡(j)⟩)  ⟺  j≤r(0≤j≤∣x∣),A(\langle x,\operatorname{enc}(j)\rangle)\iff j\le r\qquad(0\le j\le |x|),A(⟨x,enc(j)⟩)⟺j≤r(0≤j≤∣x∣),

then

f(x)=enc⁡(r).f(x)=\operatorname{enc}(r).f(x)=enc(r).

The machine writes its answer to the physical output tape. The same machine handles every input length and threshold. This supplies the bounded search step that converts rank-threshold queries into image dimension in Lemma 6.1.

Preamble
import Definitions.Def_APSCounting893_Main_OracleProofPrimitives
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.bounded_threshold_search_with_oracle (A : Language) :
    ∃ f : Word → Word,FunctionInPWithOracle A f ∧
      ∀ (x : Word) (r : ℕ),r≤x.length →
        (∀ j : ℕ,j≤x.length → (A (pairWord x (encodeNat j)) ↔ j≤r)) → f x=encodeNat r := by sorry
Source
Bounded search component of Agarwal, Hari, Pandey, Shukla, STOC 2027 submission #893, Lemma 6.1 and proof, p. 23; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf

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