Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4 — Completeness of the Section 5 program

Open
FiniteGroupTesting.LinearQuery.Supplement.lemma_5_4

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

group-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1property-testingquery-complexity

For every n≥2n\ge2n≥2, 0<ϵ<1/20<\epsilon<1/20<ϵ<1/2, and genuine input group table, the complete Section 5 tester satisfies

Pr⁡[accept]≥2/3.\Pr[\mathrm{accept}]\ge2/3.Pr[accept]≥2/3.

The statement names the actual dictionary-and-locator tester, with its finite budgets, shared samples and immutable linear fallback, rather than an assumed-correct evaluator. Its numerical parameter choices are those listed in the tester definition.

Differences from the source:

  • encoding: labels [n]={1,...,n} → Fin n with zero representing paper label 1; reason: bijective relabelling preserves all tables, distances and query policies
  • encoding: sufficient absolute constants in Sections 4–5 → fixed c_D=1/500, n_0=1500, gamma=1/10000, C_L=100, C_A=2000000, C_P=1000 and globally chosen expansion/fallback parameters; reason: these instantiate the displayed proof estimates uniformly; the predicates selecting numeric constants assume no existence or correctness, and the existing base theorems supply their witnesses
  • encoding: candidate filters and possible early offline rejection before later trials → offline conjunction checked at the final decision, after shared action and product records are sampled; reason: this preserves every acceptance probability and the stated worst-case budget; it accesses the input only through the same visible oracle queries
Preamble
import Definitions.Def_FiniteGroupTesting_LinearQuery_Supplement_UpperTester

set_option autoImplicit false
Formal statement
namespace FiniteGroupTesting.LinearQuery.Supplement

theorem lemma_5_4 (n : ℕ) (hn : 2 ≤ n) (ε : ℝ) (hε : 0 < ε)
    (hεhalf : ε < 1/2) (op : Table n) (hop : IsGroupLaw op) :
    (2/3 : ℝ) ≤ OracleRun.probability op (· = true) (sublinearTester n ε) := by sorry

end FiniteGroupTesting.LinearQuery.Supplement
Source
Nader Bshouty, STOC 2027 submission #622 (October 2026), p. 34, Lemma 5.4

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