Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Amplitude and orbit-separator contracts give quantitative fibre separation

Proved
Couret.STROBO2TORS.recoh_probe_separated_square_fibre

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

Let GGG be an abelian group, Pχ(A)=∑x∈Aχ(x)P_\chi(A)=\sum_{x\in A}\chi(x)Pχ​(A)=∑x∈A​χ(x), RA(z)R_A(z)RA​(z) the ordered pair-sum count, F(A)F(A)F(A) the full fibre among three-element supports, and H=G[2]H=G[2]H=G[2]. A bank is δ\deltaδ-separated on a candidate set when every two distinct candidates have at least one reading whose distance is at least δ\deltaδ. Assume GGG finite. Let banks αi,βj\alpha_i,\beta_jαi​,βj​ be indexed by any types, and let b∈Rb\in\mathbb Rb∈R with b≤3b\le\sqrt3b≤3​. Suppose ∣Pαi(T)∣≥b|P_{\alpha_i}(T)|\ge b∣Pαi​​(T)∣≥b for every T∈F(A)T\in F(A)T∈F(A) and every iii; the common α\alphaα kernel on HHH is trivial; every βj\beta_jβj​ is trivial on HHH; and equality of all β\betaβ readings for two fibre members implies they are HHH-translates. Then

α⊔β is 2b-separated on F(A).\alpha\sqcup\beta\text{ is }2b\text{-separated on }F(A).α⊔β is 2b-separated on F(A).

No positivity assumption on bbb 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

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