Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A short modular bank has a nonzero common kernel

Proved
Couret.STROBO2TORS.recoh_short_mod_bank_has_kernel

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

couret-programmecouret-unification-20261108

Let p>1p>1p>1 be a natural number, AAA a finite abelian group with ∣A∣=pr|A|=p^r∣A∣=pr, and k<rk<rk<r. For any kkk additive maps bi:A→Z/pZb_i:A\to\mathbb Z/p\mathbb Zbi​:A→Z/pZ,

∃a≠0,∀i<k, bi(a)=0.\exists a\ne0,\quad\forall i<k,\ b_i(a)=0.∃a=0,∀i<k, bi​(a)=0.

The modulus need not be prime.

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

set_option autoImplicit false

/-!
RECOH: finite character rank kernel bound.

For a finite additive group A of cardinal p^r and any list of k < r
additive probes valued in ZMod p, a nonzero element lies in their
common kernel. This is a group-homomorphism statement, not merely
a pigeonhole bound on unstructured binary or ternary words.

Scope boundary: this covers the common-kernel case of the
lower bound. It does NOT build the mixed order-two/order-three
mask for k between r and r+s, nor construct the upper bank.
-/

namespace Couret.STROBO2TORS





Formal statement

theorem recoh_short_mod_bank_has_kernel
    {A : Type*} [AddCommGroup A] [Fintype A]
    (p r k : ℕ) [NeZero p]
    (hp : 1 < p)
    (hcard : Fintype.card A = p ^ r)
    (hk : k < r)
    (bank : Fin k → A →+ ZMod p) :
    ∃ a : A, a ≠ 0 ∧ ∀ i : Fin k, bank i a = 0 := 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/RecohRankKernel.lean, lines 57–77; source file SHA-256 487347524b5e69a3ac7a4b19c6bd0f66ddebcee99da5fdb907592b14d58f65ff; theorem Couret.STROBO2TORS.recoh_short_mod_bank_has_kernel

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