Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An injective equal-rank binary bank is surjective

Proved
Couret.STROBO2TORS.recoh_equal_rank_bank_surjective

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

couret-programmecouret-unification-20261108

Let HHH be a finite abelian group of size 2r2^r2r, and rrr additive maps bi:H→Z/2Zb_i:H\to\mathbb Z/2\mathbb Zbi​:H→Z/2Z. If their joint map is injective, then

a↦(bi(a))i<ris surjective onto (Z/2Z)r.a\mapsto(b_i(a))_{i<r}\quad\text{is surjective onto }(\mathbb Z/2\mathbb Z)^r.a↦(bi​(a))i<r​is surjective onto (Z/2Z)r.

The case r=0r=0r=0 is allowed.

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
import Mathlib.Data.Fintype.Card
import Mathlib.Data.ZMod.Basic

set_option autoImplicit false

/-!
RECOH: the square (k=r) information-set case.
This avoids claiming any selection theorem for k > r.
-/

namespace Couret.STROBO2TORS

Formal statement

theorem recoh_equal_rank_bank_surjective
    {H : Type*} [AddCommGroup H] [Fintype H]
    (r : ℕ)
    (hcard : Fintype.card H = 2 ^ r)
    (bank : Fin r → H →+ ZMod 2)
    (hinj : Function.Injective
      (fun a : H => fun i : Fin r => bank i a)) :
    Function.Surjective
      (fun a : H => fun i : Fin r => bank i a) := by sorry


end Couret.STROBO2TORS

Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/85df7268e792e69b2e1ad2461dec2af575c43c88/research/strobo-2tors-2026-10-12/lean/RecohEqualRank.lean#L14-L32, lines 14–32; source file SHA-256 145264824ba6e4556bc833bba9f6993ce5e3f8a2793764e8545cc893e5195340; theorem Couret.STROBO2TORS.recoh_equal_rank_bank_surjective

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