Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded strict-majority oracle queries lie in PP

Proved
APSCounting893.Main.bounded_majority_oracle_pp

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

apscounting-hierarchymajorityoracle-machines

Let AAA be any language of finite binary words and let q(n)=a(n+1)bq(n)=a(n+1)^bq(n)=a(n+1)b, where a,ba,ba,b are fixed natural numbers. The language

{x:2q(∣x∣)<2∣{w∈{0,1}q(∣x∣):A(⟨x,w⟩)}∣}\left\{x:2^{q(|x|)}<2\left|\left\{w\in\{0,1\}^{q(|x|)}:A(\langle x,w\rangle)\right\}\right|\right\}{x:2q(∣x∣)<2​{w∈{0,1}q(∣x∣):A(⟨x,w⟩)}​}

belongs to PPA\mathrm{PP}^{A}PPA. The majority is strict, and the case of a zero-length random seed is included. The pairing is the fixed prefix-free word encoding used throughout this development.

The conclusion uses an actual finite oracle machine with one uniform polynomial time bound for every input and every seed. It provides the majority layer in uniform threshold-gate evaluation.

Preamble
import Definitions.Def_APSCounting893_Main_OracleProofPrimitives
set_option autoImplicit false
open APSCounting893.Main
Formal statement
theorem APSCounting893.Main.bounded_majority_oracle_pp (A : Language) (a b : ℕ) :
    InOraclePP A (fun x =>
      2^polyBound a b x.length < 2*Set.ncard
        {w : Word | w.length=polyBound a b x.length ∧ A (pairWord x w)}) := by sorry
Source
Andrews, Garg and Schost, Hilbert’s Nullstellensatz is in the Counting Hierarchy, https://arxiv.org/abs/2602.17904, Lemma 6.3, pp.45–46 (one strict-majority oracle layer). 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.

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