Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The nontranslation collision branch is exactly exceptional

Proved
Couret.STROBO2TORS.orderedSquare_nontranslation_iff_exceptional

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

couret-programmecouret-unification-20261108

Let GGG be any abelian group and S,TS,TS,T supports of size three. Write RSR_SRS​ for their ordered pair-sum counts. Then

[RS=RT∧∄u, T=S+u]  ⟺  ExceptionalPartner⁡(S,T).[R_S=R_T\land\nexists u,\ T=S+u]\iff\operatorname{ExceptionalPartner}(S,T).[RS​=RT​∧∄u, T=S+u]⟺ExceptionalPartner(S,T).

Here exceptional means S={a,b,b+d}S=\{a,b,b+d\}S={a,b,b+d}, T={a,2b−a,2b−a+d}+uT=\{a,2b-a,2b-a+d\}+uT={a,2b−a,2b−a+d}+u for d≠0d\ne0d=0, 2d=2u=02d=2u=02d=2u=0, 2a≠2b2a\ne2b2a=2b, 3(b−a)∈{0,d}3(b-a)\in\{0,d\}3(b−a)∈{0,d}.

Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsNontranslationBridge_e18319b1ae30
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Definitions.Def_Couret_Strobo2TorsCore_3589e2e5b464

set_option autoImplicit false

namespace Couret.STROBO2TORS

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

Formal statement

theorem orderedSquare_nontranslation_iff_exceptional
    (S T : Finset G) (hS : S.card = 3) (hT : T.card = 3) :
    ((∀ z : G, orderedSquare S z = orderedSquare T z) ∧
      ¬ ∃ v : G, T = translateSupport S v) ↔ ExceptionalPartner S T := 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/Strobo2TorsNontranslationBridge.lean, lines 9–22; source file SHA-256 69eddf5a9bf0e6dd7b706b3e6d593c7d3d8cf875b213644de00a9d2d32bd5389; theorem Couret.STROBO2TORS.orderedSquare_nontranslation_iff_exceptional

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