Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A short complex bank has a translation or reflection collision

Proved
Couret.STROBO2TORS.recoh_short_complex_character_bank_collision

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, H=G[2]H=G[2]H=G[2], Pχ(S)=∑x∈Sχ(x)P_\chi(S)=\sum_{x\in S}\chi(x)Pχ​(S)=∑x∈S​χ(x), and OB(S)=(QS,(Pχi(S))i)\mathcal O_B(S)=(Q_S,(P_{\chi_i}(S))_i)OB​(S)=(QS​,(Pχi​​(S))i​), where QSQ_SQS​ counts ordered sums and BBB is a bank of complex additive characters. Let finite abelian groups L,VL,VL,V have cardinalities 2r,3s2^r,3^s2r,3s, respectively, with 2L=02L=02L=0, 3V=03V=03V=0, and injective additive embeddings into GGG. Assume r>0r>0r>0 and k<r+sk<r+sk<r+s. For any kkk complex characters and any three distinct elements x,y,z∈Gx,y,z\in Gx,y,z∈G, at least one of the following exists: (1) a nonzero u∈G[2]u\in G[2]u∈G[2] such that the support {x,y,z}\{x,y,z\}{x,y,z} and its translate by uuu are different but have the same ordered square and all kkk triple probes; (2) nonzero u∈G[2]u\in G[2]u∈G[2], v∈G[3]v\in G[3]v∈G[3] such that {0,v,v+u}\{0,v,v+u\}{0,v,v+u} and {0,−v,−v+u}\{0,-v,-v+u\}{0,−v,−v+u} are different but have the same ordered square and all kkk triple probes.

A translation collision or an exceptional reflection collision exists.\text{A translation collision or an exceptional reflection collision exists.}A translation collision or an exceptional reflection collision exists.

The second alternative need not involve the supplied triple.

Preamble
import Aesop
import Definitions.Def_Couret_RecohBinaryLinearTransport_ea1ab9036ae4
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Field.ZMod
import Mathlib.Algebra.Module.ZMod
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Card
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finiteness
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.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_recoh_complex_character_binary_encoding
import Theorems.Thm_Couret_STROBO2TORS_recoh_complex_character_zmod_encoding
import Theorems.Thm_Couret_STROBO2TORS_recoh_short_bank_collision_of_binary_card
import Definitions.Def_Couret_RecohBinaryLinearTransport_ea1ab9036ae4
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Tactic.Choose

set_option autoImplicit false

/-!
RECOH: character restrictions provide their own finite-field encodings.

Every complex additive character on a group annihilated by n factors
through the standard character of ZMod n. The binary and ternary
specializations discharge the compatibility assumptions of the existing
short-bank collision theorem. No primary character extension or upper
bound is assumed here.
-/

namespace Couret.STROBO2TORS









variable {G : Type*} [AddCommGroup G] [DecidableEq G]

Formal statement

theorem recoh_short_complex_character_bank_collision
    {H V : Type*}
    [AddCommGroup H] [Fintype H]
    [AddCommGroup V] [Fintype V]
    (r s k : ℕ) (hr : 0 < r) (hk : k < r + s)
    (hcardV : Fintype.card V = 3 ^ s)
    (hcardH : Fintype.card H = 2 ^ r)
    (h2 : ∀ a : H, a + a = 0)
    (h3 : ∀ a : V, (a + a) + a = 0)
    (embH : H →+ G) (injH : Function.Injective embH)
    (embV : V →+ G) (injV : Function.Injective embV)
    (bank : Fin k → AddChar G ℂ)
    (x y z : G) (hcard : ({x, y, z} : Finset G).card = 3) :
    (∃ d : G, d ≠ 0 ∧ d + d = 0 ∧
      ({x, y, z} : Finset G) ≠ {x + d, y + d, z + d} ∧
      (∀ q : G,
        orderedSquare ({x, y, z} : Finset G) q =
          orderedSquare ({x + d, y + d, z + d} : Finset G) q) ∧
      (∀ i : Fin k,
        recohTripleProbe (bank i) x y z =
          recohTripleProbe (bank i) (x + d) (y + d) (z + d))) ∨
    (∃ d v : G, d ≠ 0 ∧ d + d = 0 ∧
      v ≠ 0 ∧ (v + v) + v = 0 ∧
      ({0, v, v + d} : Finset G) ≠ {0, -v, -v + d} ∧
      (∀ q : G,
        orderedSquare ({0, v, v + d} : Finset G) q =
          orderedSquare ({0, -v, -v + d} : Finset G) q) ∧
      (∀ i : Fin k,
        recohTripleProbe (bank i) 0 v (v + d) =
          recohTripleProbe (bank i) 0 (-v) (-v + d))) := by sorry


end Couret.STROBO2TORS

Source
Alexandre Couret, Couret — Additive reconstruction: STROBO-4, singleton collisions and RECOH formal proof artifacts, https://zenodo.org/records/23980513; archive COURET_MATHEMATIQUES_20261105.zip, SHA-256 19a3b59aee930df74cab79c27b29e014843bd17179a26fef1261ed6b5a651ab7; file RECOH/lean/RecohComplexCharacterEncodings.lean, lines 100–146; source file SHA-256 3305e08ce41ea1179dcef4587f7da08eb723592588b747f5a6b789df0b5fd760; theorem Couret.STROBO2TORS.recoh_short_complex_character_bank_collision

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