Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A short ternary subbank leaves an invisible reflection

Proved
Couret.STROBO2TORS.recoh_short_ternary_subbank_collides

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group. Let AAA be a finite exponent-three abelian group of size 3s3^s3s embedded additively and injectively in GGG. Fix d≠0d\ne0d=0 with 2d=02d=02d=0. Let fi:G→Rf_i:G\to Rfi​:G→R (i<ki<ki<k) be multiplicative under addition with fi(0)=1f_i(0)=1fi​(0)=1, for a commutative ring RRR. Choose t<st<st<s indexed bank entries, allowing repeated indices. Suppose every bank entry either has fi(d)=−1f_i(d)=-1fi​(d)=−1 or is one of the selected entries. Suppose additive bj:A→F3b_j:A\to\mathbb F_3bj​:A→F3​ satisfy bj(a)=0⇒fselected(j)(emb⁡(a))=1b_j(a)=0\Rightarrow f_{\mathrm{selected}(j)}(\operatorname{emb}(a))=1bj​(a)=0⇒fselected(j)​(emb(a))=1. Then

∃v≠0, 3v=0:S={0,v,v+d}≠T={0,−v,−v+d},QS=QT,∑a∈(0,v,v+d)fi(a)=∑a∈(0,−v,−v+d)fi(a) (i<k).\exists v\ne0,\ 3v=0:\quad S=\{0,v,v+d\}\ne T=\{0,-v,-v+d\},\quad Q_S=Q_T,\quad\sum_{a\in(0,v,v+d)}f_i(a)=\sum_{a\in(0,-v,-v+d)}f_i(a)\ (i<k).∃v=0, 3v=0:S={0,v,v+d}=T={0,−v,−v+d},QS​=QT​,a∈(0,v,v+d)∑​fi​(a)=a∈(0,−v,−v+d)∑​fi​(a) (i<k).

This witnesses a reflection invisible to the entire bank.

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_order_three_reflection_same_square
import Theorems.Thm_Couret_STROBO2TORS_recoh_probe_reflection_of_cancel
import Theorems.Thm_Couret_STROBO2TORS_recoh_reflection_supports_distinct
import Theorems.Thm_Couret_STROBO2TORS_recoh_short_ternary_bank_has_kernel
import Theorems.Thm_Couret_STROBO2TORS_recoh_three_torsion_probe_equal_iff_trivial
import Definitions.Def_Couret_RecohRankKernel_9b83850e485b

set_option autoImplicit false

/-!
RECOH: bridge from rank-kernel witnesses to actual triple collisions.

This file contains only conditional lower-bound interfaces.
It does not assert the unrestricted sharp bound r+s, nor
the existence of the requisite spanning H-restrictions.
-/

namespace Couret.STROBO2TORS

variable {G : Type*} [AddCommGroup G] [DecidableEq G]



Formal statement

theorem recoh_short_ternary_subbank_collides
    {A R : Type*} [AddCommGroup A] [Fintype A] [CommRing R]
    (s t k : ℕ) (hcard : Fintype.card A = 3 ^ s) (ht : t < s)
    (h3 : ∀ a : A, (a + a) + a = 0)
    (emb : A →+ G) (hemb : Function.Injective emb)
    (d : G) (hd0 : d ≠ 0) (hd2 : d + d = 0)
    (bank : Fin k → G → R)
    (hadd : ∀ i : Fin k, ∀ x y : G,
      bank i (x + y) = bank i x * bank i y)
    (hzero : ∀ i : Fin k, bank i 0 = 1)
    (selected : Fin t → Fin k)
    (hcover : ∀ i : Fin k,
      bank i d = -1 ∨ ∃ j : Fin t, i = selected j)
    (bits : Fin t → A →+ ZMod 3)
    (hcompat : ∀ j : Fin t, ∀ a : A,
      bits j a = 0 → bank (selected j) (emb a) = 1) :
    ∃ v : G, v ≠ 0 ∧ (v + v) + v = 0 ∧
      ({0, v, v + d} : Finset G) ≠ {0, -v, -v + d} ∧
      (∀ q : G,
        orderedSquare ({0, v, v + d} : Finset G) q =
          orderedSquare ({0, -v, -v + d} : Finset G) q) ∧
      (∀ i : Fin k,
        recohTripleProbe (bank i) 0 v (v + d) =
          recohTripleProbe (bank i) 0 (-v) (-v + d)) := 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/RecohKernelCollisions.lean, lines 73–131; source file SHA-256 e531d83ad9b2feb52dc9ec79d690ceed0416e241f5f923161f3dcaf4db7e67e7; theorem Couret.STROBO2TORS.recoh_short_ternary_subbank_collides

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