Lemma 4.6 — Group-law transport with eta plus three delta
OpenFiniteGroupTesting.LinearQuery.Supplement.lemma_4_6group-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1property-testingquery-complexity
Let be a nonempty finite set with an arbitrary operation , let be a group with , and let have defect at most a real number . Then there is a genuine group operation on all of such that
Here counts undefined locator values as multiplication failures and distance counts independent uniform ordered pairs. No uniformity or group promise is imposed on . 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