A short complex bank has a translation or reflection collision
ProvedCouret.STROBO2TORS.recoh_short_complex_character_bank_collisioncouret-programmecouret-unification-20261108
Let be an abelian group, , , and , where counts ordered sums and is a bank of complex additive characters. Let finite abelian groups have cardinalities , respectively, with , , and injective additive embeddings into . Assume and . For any complex characters and any three distinct elements , at least one of the following exists: (1) a nonzero such that the support and its translate by are different but have the same ordered square and all triple probes; (2) nonzero , such that and are different but have the same ordered square and all triple probes.
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