An injective binary bank contains an information set
ProvedCouret.STROBO2TORS.recoh_binary_information_set_of_cardcouret-programmecouret-unification-20261108
Let be a finite abelian group of exponent two and size . Let be additive maps whose joint evaluation is injective. There is an injective index map such that
Thus selected measurements provide full binary coordinates.
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.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.Ring import Mathlib.Tactic.Tauto import Theorems.Thm_Couret_STROBO2TORS_recoh_binary_coordinates_of_card import Theorems.Thm_Couret_STROBO2TORS_recoh_binary_information_set_additive import Definitions.Def_Couret_RecohRankKernel_9b83850e485b import Mathlib.Algebra.Module.ZMod import Mathlib.FieldTheory.Finiteness set_option autoImplicit false /-! RECOH: transport of binary additive characters to linear probes. Research candidate. No global B(G) claim. The additive equivalence assumption is essential: do not apply this to C2 × C4 as a whole. -/ namespace Couret.STROBO2TORS
Formal statement
theorem recoh_binary_information_set_of_card
{H : Type*} [AddCommGroup H] [Fintype H]
(r k : ℕ) (h2 : ∀ a : H, a + a = 0)
(hcardH : Fintype.card H = 2 ^ r)
(binary : Fin k → H →+ ZMod 2)
(hinj : Function.Injective
(fun a : H => fun i : Fin k => binary i a)) :
∃ pivot : Fin r → Fin k,
Function.Injective pivot ∧
Function.Surjective
(fun a : H => fun j : Fin r => binary (pivot j) a) := 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/RecohBinaryLinearTransport.lean, lines 81–94; source file SHA-256 5cbb44f8ac5aad6f63d170a7fc63e533aac72967c7f079ea654d26b9087fc8a1; theorem Couret.STROBO2TORS.recoh_binary_information_set_of_card