Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Covariant nonzero probes identify a two-torsion shift

Proved
Couret.STROBO2TORS.recoh_orbit_translation_separated

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, (χi)i∈I(\chi_i)_{i\in I}(χi​)i∈I​ complex additive characters, SSS a finite support and PiP_iPi​ arbitrary support probes satisfying Pi(S+u)=χi(u)Pi(S)P_i(S+u)=\chi_i(u)P_i(S)Pi​(S+u)=χi​(u)Pi​(S) for every i,ui,ui,u. Assume every Pi(S)≠0P_i(S)\ne0Pi​(S)=0, and 2d=02d=02d=0, χi(d)=1\chi_i(d)=1χi​(d)=1 for all i implies d=0d=0d=0. If 2u=2v=02u=2v=02u=2v=0 and Pi(S+u)=Pi(S+v)P_i(S+u)=P_i(S+v)Pi​(S+u)=Pi​(S+v) for every i, then

u=v.u=v.u=v.
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

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