Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Masked probes cannot distinguish a reflected exceptional pair

Proved
Couret.STROBO2TORS.recoh_masked_bank_collision

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, RRR a commutative ring, LLL a list of functions f:G→Rf:G\to Rf:G→R satisfying f(x+y)=f(x)f(y)f(x+y)=f(x)f(y)f(x+y)=f(x)f(y). Let v,d≠0v,d\ne0v,d=0 with 3v=03v=03v=0, 2d=02d=02d=0, and assume each f∈Lf\in Lf∈L satisfies f(d)=−1f(d)=-1f(d)=−1 or f(v)=f(−v)f(v)=f(-v)f(v)=f(−v). Set S={0,v,v+d}S=\{0,v,v+d\}S={0,v,v+d}, T={0,−v,−v+d}T=\{0,-v,-v+d\}T={0,−v,−v+d}. Then

S≠T,RS=RT,∑s∈Sf(s)=∑t∈Tf(t)(f∈L).S\ne T,\qquad R_S=R_T,\qquad\sum_{s\in S}f(s)=\sum_{t\in T}f(t)\quad(f\in L).S=T,RS​=RT​,s∈S∑​f(s)=t∈T∑​f(t)(f∈L).

Each probe may satisfy a different one of the two masking alternatives.

Preamble
import Aesop
import Definitions.Def_Couret_RecohFourierBridge_5b164a1abe76
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Data.Finset.Powerset
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 Definitions.Def_Couret_Strobo2TorsCardinality_32b8061f8d58
import Mathlib.Tactic.Ring

set_option autoImplicit false

/-!
RECOH/STROBO Fourier bridge -- bounded formalization layer, 2026-10-14.

This file reuses the already compiled STROBO classification/ordered-square
definitions instead of declaring another square or accepting an unproved
classification. It formalizes the collision witness and the *algebraic*
condition under which one character probe cannot distinguish the pair.

IMPORTANT BOUNDARY:
  * no theorem B(G) = r+s is claimed in this file;
  * the finite-rank/character-existence arguments still need a Lean proof;
  * complex Fourier characters are not assumed merely from ring functions;
  * no analytic, prime-race, novelty or publication claim.
-/

namespace Couret.STROBO2TORS

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














Formal statement

theorem recoh_masked_bank_collision
    {R : Type*} [CommRing R]
    (bank : List (G → R))
    (hadd : ∀ chi ∈ bank, ∀ x y : G, chi (x + y) = chi x * chi y)
    (v d : G) (hv0 : v ≠ 0)
    (hv3 : (v + v) + v = 0)
    (hd0 : d ≠ 0) (hd2 : d + d = 0)
    (hmask : ∀ chi ∈ bank, chi d = -1 ∨ chi v = chi (-v)) :
    (({0, v, v + d} : Finset G) ≠ {0, -v, -v + d}) ∧
      (∀ z : G, orderedSquare ({0, v, v + d} : Finset G) z =
        orderedSquare ({0, -v, -v + d} : Finset G) z) ∧
      (∀ chi ∈ bank, recohTripleProbe chi 0 v (v + d) =
        recohTripleProbe chi 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/RecohFourierBridge.lean, lines 135–154; source file SHA-256 162c4aac6224640abce8987d230b6cd34d69fa584578b00550229ed923853089; theorem Couret.STROBO2TORS.recoh_masked_bank_collision

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