Amplitude and orbit-separator contracts give quantitative fibre separation
ProvedCouret.STROBO2TORS.recoh_probe_separated_square_fibrecouret-programmecouret-unification-20261108
Let be an abelian group, , the ordered pair-sum count, the full fibre among three-element supports, and . A bank is -separated on a candidate set when every two distinct candidates have at least one reading whose distance is at least . Assume finite. Let banks be indexed by any types, and let with . Suppose for every and every ; the common kernel on is trivial; every is trivial on ; and equality of all readings for two fibre members implies they are -translates. Then
No positivity assumption on is present.
Preamble
import Aesop
import Definitions.Def_Couret_RecohProbeStability_e389a2280f15
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Field.ZMod
import Mathlib.Algebra.Group.AddChar
import Mathlib.Algebra.Module.ZMod
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Finite.Card
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Nat.Factorization.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finiteness
import Mathlib.GroupTheory.FiniteAbelian.Duality
import Mathlib.LinearAlgebra.Dimension.Constructions
import Mathlib.LinearAlgebra.Dimension.Finite
import Mathlib.LinearAlgebra.Dual.Lemmas
import Mathlib.LinearAlgebra.LinearIndependent.Lemmas
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Choose
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_recoh_exceptional_probe_distance_of_ne
import Theorems.Thm_Couret_STROBO2TORS_recoh_ordinary_probe_distance
import Definitions.Def_Couret_RecohProbeStability_e389a2280f15
set_option autoImplicit false
/-!
Exact separation constants in the exceptional normal form. Binary probes
have amplitudes one or three, and a detecting ternary probe separates the
two orbits by exactly twice the square root of three. The two-torsion pair
inside the normal form supplies a matching universal upper bound of two.
-/
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
variable [Fintype G]
Formal statement
theorem recoh_probe_separated_square_fibre
{I J : Type*} (bank2 : I → AddChar G ℂ) (bank3 : J → AddChar G ℂ)
(S : Finset G) (a : ℝ) (ha : a ≤ Real.sqrt 3)
(hamp : ∀ T ∈ squareFibre S, ∀ i, a ≤ ‖recohSupportProbe (bank2 i) T‖)
(hsep2 : ∀ u : G, u + u = 0 → (∀ i, bank2 i u = 1) → u = 0)
(htrivial : ∀ j, ∀ u : G, u + u = 0 → bank3 j u = 1)
(horbits : ∀ B ∈ squareFibre S, ∀ C ∈ squareFibre S,
(∀ j, recohSupportProbe (bank3 j) B = recohSupportProbe (bank3 j) C) →
OrdinaryPartner B C) :
RecohProbeSeparated (Sum.elim bank2 bank3) (squareFibre S) (2 * a) := by sorry
end Couret.STROBO2TORS
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/eb7323762a9fa64f54f95ea7aa2981dee0ba54af/research/strobo-2tors-2026-10-12/lean/RecohExceptionalStability.lean#L164-L193, lines 164–193; source file SHA-256 788e929f7e526870f55ea3a771c8f7f5dc647bcd18b0afb61c80f3eaf4f4c947; theorem Couret.STROBO2TORS.recoh_probe_separated_square_fibre