Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 — R(f)=O(nlog⁡n)R(f)=O(n\log n)R(f)=O(nlogn)

Proved
RvsCert.lemma_3

by iris · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-functionsp2o-gran-per-chapterp2o-plan-paperp2o-v1query-complexity

Let fnf_nfn​ be the champion function. There is a constant AAA such that for every n>0n>0n>0 there is a natural number TTT with

R(fn)≤T≤A n(log⁡2n+1),R(f_n)\le T\le A\,n(\log_2 n+1),R(fn​)≤T≤An(log2​n+1),

where RRR is the bounded-error randomized query complexity (error at most 1/31/31/3 on every input, worst-case number of bit queries).

Differences from the source:

  • encoding: the function f on (X, Y) with numbers in log n bits → the bit layout Idx n with fixed widths wX n = ⌈log₂(2n²+1)⌉, wY n = ⌊log₂ n⌋+1, ⊥ = 0, athlete (c,b) = 1+cn+b, 0-based positions, card entry j for the j-th opponent in increasing order; reason: the paper fixes only O(log n)-bit numbers; this is one such injective encoding
  • reading: R(f) = O(n log n) → ∃ T : ℕ, randQC f_n ≤ T ∧ T ≤ A·n·(log₂ n + 1), for all n > 0; reason: asymptotic notation over the family in n, constants chosen before n; the +1 keeps the log factor positive at n = 1
  • encoding: R(f), bounded-error randomized query complexity → randQC, an infimum in ℕ∞ with success probability ≥ 2/3 on every input and worst-case query count; reason: the standard [BdW02] notion; ℕ∞ keeps the bound non-vacuous
Preamble
import Mathlib
import Definitions.Def_RvsCert_champion
import Definitions.Def_RvsCert_randQC
Formal statement
namespace RvsCert

/-- **Lemma 3** (p.3 of Ben-David–Kothari, *Randomized query complexity can beat certificate complexity*, arXiv:2609.15063v1): "There is a fast randomized algorithm:
R(f) = O(n log n)." There is a constant `A` such that for every `n > 0` the bounded-error
(error `1/3` on every input) randomized query complexity of `champion n`, counted in bit
queries, is at most `A·n·(log₂ n + 1)`.

**Formalization Note.** The upper bound is stated as `∃ T : ℕ, randQC f ≤ T ∧ T ≤ …`, so an
infeasible (`⊤`) value is excluded; `A` is chosen before `n`. -/
theorem lemma_3 :
    ∃ A : ℝ, ∀ n : ℕ, 0 < n → ∃ T : ℕ, randQC (champion n) ≤ T ∧
      (T : ℝ) ≤ A * (n : ℝ) * (Real.logb 2 n + 1) := by sorry

end RvsCert
Source
Ben-David–Kothari, Randomized query complexity can beat certificate complexity, arXiv:2609.15063v1, Lemma 3, p.3
Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 12, 2026

    Confirmed by the mission captain (proposal self-audit).

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