Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — Hidden-copy instances are one-sixth far

Open
FiniteGroupTesting.LinearQuery.Supplement.lemma_6_2

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

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

For all sufficiently large consecutive prime pairs p<qp<qp<q with q−p≤600q-p\le600q−p≤600, put H=(Fp)3×(Fq)2H=(\mathbb F_p)^3\times(\mathbb F_q)^2H=(Fp​)3×(Fq​)2 and n=p2q3n=p^2q^3n=p2q3. Embed HHH into the nnn labels and write its addition on the square of its image. Every deterministic completion outside that square satisfies

dist⁡(∗,∘)≥1/6\operatorname{dist}(*,\circ)\ge1/6dist(∗,∘)≥1/6

for every group operation ∘\circ∘ on all nnn labels. In particular every table in the source's NO distribution is 1/61/61/6-far. The threshold on ppp is uniform in the embedding, completion and comparison group.

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
  • generalization: constant outside completion equal to paper label 1 → every deterministic outside completion; reason: the proof lower-bounds disagreements inside the hidden image squared, independently of outside entries
  • encoding: additive F_p and F_q coordinates → addition modulo p and q on Fin p and Fin q; reason: these are additive coordinate labellings of exactly the same prime fields
Preamble
import Definitions.Def_FiniteGroupTesting_LinearQuery_Supplement_TranscriptModel

set_option autoImplicit false
Formal statement
namespace FiniteGroupTesting.LinearQuery.Supplement

theorem lemma_6_2 :
    ∃ N : ℕ, ∀ p q : ℕ, N ≤ p → ConsecutivePrimes p q → q - p ≤ 600 →
      ∀ (f : PairH p q ↪ Fin (p ^ 2 * q ^ 3)) (outside : Table (p ^ 2 * q ^ 3)),
        Far (1/6 : ℝ) (encodedTable pairAddH f outside) := by sorry

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

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