Characters on exponent-two groups have binary coordinates
ProvedCouret.STROBO2TORS.recoh_complex_character_binary_encodingcouret-programmecouret-unification-20261108
Let be an abelian group with for all , and an additive character. There is an additive such that
This includes the trivial character and infinite groups.
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_zmod_encoding 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
Formal statement
theorem recoh_complex_character_binary_encoding
{H : Type*} [AddCommGroup H]
(h2 : ∀ a : H, a + a = 0) (chi : AddChar H ℂ) :
∃ bits : H →+ ZMod 2,
(∀ a : H, bits a = 0 ↔ chi a = 1) ∧
(∀ a : H, bits a ≠ 0 → chi a = -1) := by sorry
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
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 60–80; source file SHA-256 3305e08ce41ea1179dcef4587f7da08eb723592588b747f5a6b789df0b5fd760; theorem Couret.STROBO2TORS.recoh_complex_character_binary_encoding