Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.6 — Group-law transport with eta plus three delta

Open
FiniteGroupTesting.LinearQuery.Supplement.lemma_4_6

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

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

Let GGG be a nonempty finite set with an arbitrary operation ∗*∗, let HHH be a group with ∣H∣=∣G∣|H|=|G|∣H∣=∣G∣, and let Ψ:G⇀H\Psi:G\rightharpoonup HΨ:G⇀H have defect at most a real number δ\deltaδ. Then there is a genuine group operation ∘\circ∘ on all of GGG such that

dist⁡(∗,∘)≤η(Ψ)+3δ.\operatorname{dist}(*,\circ)\le\eta(\Psi)+3\delta.dist(∗,∘)≤η(Ψ)+3δ.

Here η\etaη counts undefined locator values as multiplication failures and distance counts independent uniform ordered pairs. No uniformity or group promise is imposed on x∗yx*yx∗y. The result connects the two partial-map tests to the source's same-carrier distance.

Differences from the source:

  • encoding: the input carrier G = [n] with operation *, and |G| = |H| = n → any nonempty finite type G with an arbitrary operation and |G| = |H|; reason: every nonempty finite type is a relabelling of [n]; distance and eta are invariant under relabelling
Preamble
import Definitions.Def_FiniteGroupTesting_LinearQuery_Supplement_PartialMaps

set_option autoImplicit false
Formal statement
namespace FiniteGroupTesting.LinearQuery.Supplement

theorem lemma_4_6 {G H : Type} [Fintype G] [Fintype H] [Nonempty G]
    [Group H] (hcard : Fintype.card G = Fintype.card H) (op : G → G → G)
    (ψ : PartialMap G H) (δ : ℝ) (hδ : defect ψ ≤ δ) :
    ∃ law : G → G → G, IsGroupLaw law ∧ operationDistance op law ≤ eta op ψ + 3 * δ := by sorry

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

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