Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.4 — True marked candidate and located values

Open
FiniteGroupTesting.LinearQuery.Supplement.lemma_4_4

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

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

Let GGG be a finite group, let θ:G→H\theta:G\to Hθ:G→H be a group isomorphism, and choose visible generator labels sis_isi​ and a dictionary start d0d_0d0​. Compute the syntactic inverse candidates and the dictionary using any signed dictionary word. Mark HHH by ρ=θ(d0)\rho=\theta(d_0)ρ=θ(d0​) and ai=θ(si)a_i=\theta(s_i)ai​=θ(si​). Its dictionary equality pattern is identical to the visible one. For any common locator word,

ΨH(x) defined⟹ΨH(x)=θ(x).\Psi_H(x)\text{ defined}\quad\Longrightarrow\quad\Psi_H(x)=\theta(x).ΨH​(x) defined⟹ΨH​(x)=θ(x).

Thus the true candidate is retained by the dictionary test and is correctly interpreted at every located point, without a spectral assumption.

Differences from the source:

  • generalization: an isomorphism onto an enumerated representative → an isomorphism onto any target group; reason: the statement uses only the isomorphism; every enumerated representative is an instance
  • encoding: fixed parenthesized inverse expressions and a locator undefined on a miss → binary-power expressions, lists including time zero, and Option-valued locators; reason: these compute exactly the prescribed expressions and first-hit values, including arbitrary words
  • encoding: a genuine input group table ([n],*) → an arbitrary finite group G with its own multiplication; reason: every genuine input table is such a group, and the conclusion uses only its multiplication
Preamble
import Definitions.Def_FiniteGroupTesting_LinearQuery_Supplement_Dictionary

set_option autoImplicit false
Formal statement
namespace FiniteGroupTesting.LinearQuery.Supplement

theorem lemma_4_4 {G H : Type} [Group G] [Fintype G] [DecidableEq G]
    [Group H] [DecidableEq H] {k : ℕ} (s : Fin k → G) (d₀ : G)
    (ξ σ : List (Signed k)) (θ : G ≃* H) :
    let u := visibleSigned (· * ·) (Fintype.card G) s
    let a := fun i => θ (s i)
    let ds := walk (· * ·) u d₀ ξ
    let hs := walk (· * ·) (signedMark a) (θ d₀) ξ
    equalityPattern ds hs ∧
      ∀ x h, locator (· * ·) u ds hs a σ x = some h → h = θ x := by sorry

end FiniteGroupTesting.LinearQuery.Supplement
Source
Nader Bshouty, STOC 2027 submission #622 (October 2026), p. 28, Lemma 4.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