Covariant nonzero probes identify a two-torsion shift
ProvedCouret.STROBO2TORS.recoh_orbit_translation_separatedcouret-programmecouret-unification-20261108
Let be an abelian group, complex additive characters, a finite support and arbitrary support probes satisfying for every . Assume every , and , for all i implies . If and for every i, then
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsCardinality_32b8061f8d58
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Group.AddChar
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Definitions.Def_Couret_Strobo2TorsCardinality_32b8061f8d58
import Mathlib.Algebra.Group.AddChar
import Mathlib.Data.Complex.Basic
set_option autoImplicit false
/-!
RECOH conditional reconstruction, step 1: orbit separation.
This is an abstract lemma requiring nonvanishing covariant probes and
characters separating two-torsion. No unproved character-existence
assumption is hidden in this theorem.
-/
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
Formal statement
theorem recoh_orbit_translation_separated
{I : Type*} (bank : I → AddChar G ℂ) (S : Finset G)
(probe : I → Finset G → ℂ)
(hcov : ∀ i u, probe i (translateSupport S u) = bank i u * probe i S)
(hnonzero : ∀ i, probe i S ≠ 0)
(hsep : ∀ d : G, d + d = 0 →
(∀ i, bank i d = 1) → d = 0)
(u v : G) (hu : u + u = 0) (hv : v + v = 0)
(heq : ∀ i, probe i (translateSupport S u) =
probe i (translateSupport S v)) : u = v := by sorry
end Couret.STROBO2TORS
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/60f6d03fdb26a2498e9e856b49f93ad590b99409/research/strobo-2tors-2026-10-12/lean/RecohConditionalBank.lean#L18-L52, lines 18–52; source file SHA-256 139a2f5b1511ebbcff70862427a9c94f347105914d4a3f42f054896624ce9efb; theorem Couret.STROBO2TORS.recoh_orbit_translation_separated