Masked probes cannot distinguish a reflected exceptional pair
ProvedCouret.STROBO2TORS.recoh_masked_bank_collisioncouret-programmecouret-unification-20261108
Let be an abelian group, a commutative ring, a list of functions satisfying . Let with , , and assume each satisfies or . Set , . Then
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