An injective binary bank detects the nonzero rank-one element
ProvedCouret.STROBO2TORS.recoh_rank_one_has_detecting_coordinatecouret-programmecouret-unification-20261108
For any natural and additive maps , if the joint bank is injective, then
In particular an empty bank cannot be injective on this domain.
Preamble
import Aesop import Definitions.Def_Couret_RecohRankKernel_9b83850e485b import Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Group.Finset.Basic 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.Tactic.Abel import Mathlib.Tactic.Ring import Mathlib.Tactic.Tauto import Definitions.Def_Couret_RecohRankKernel_9b83850e485b set_option autoImplicit false /-! RECOH rank-one information-set base case. A genuinely injective binary bank on ZMod 2 must contain at least one coordinate detecting the unique nonzero element. This does NOT prove the higher-rank information-set lemma. -/ namespace Couret.STROBO2TORS
Formal statement
theorem recoh_rank_one_has_detecting_coordinate
(k : ℕ)
(bank : Fin k → ZMod 2 →+ ZMod 2)
(hinj : Function.Injective
(fun x : ZMod 2 => fun i : Fin k => bank i x)) :
∃ i : Fin k, bank i (1 : ZMod 2) ≠ 0 := by sorry
end Couret.STROBO2TORS
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/71d66a9addc72a758b9d02ffad265c35cab94534/research/strobo-2tors-2026-10-12/lean/RecohRankOne.lean#L14-L31, lines 14–31; source file SHA-256 07da71eb8926527921cf51da12d15c9f546c2c883d038fc93b2c3819a8b907be; theorem Couret.STROBO2TORS.recoh_rank_one_has_detecting_coordinate