Normalize a singleton-intersection collision
ProvedCouret.InterIA.SingletonNecessity.normalize_singleton_collisioncouret-programmecouret-unification-20261108
Let be an abelian group and each have four elements, intersect in exactly one element, and satisfy . There exist four-element supports with
This places the shared point at the identity.
Preamble
import Definitions.Def_Couret_SingletonNormalization_99875800f8c3
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Definitions.Def_Couret_AbelianBoundary_ad32094cf511
set_option autoImplicit false
namespace Couret.InterIA.SingletonNecessity
open Finset Couret.InterIA.Parity
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
Formal statement
theorem normalize_singleton_collision (A B : Finset G)
(ha : A.card=4) (hb : B.card=4) (hi : (A ∩ B).card=1)
(hc : ∀ z, orderedSquare A z=orderedSquare B z) :
∃ A₀ B₀ : Finset G, A₀.card=4 ∧ B₀.card=4 ∧ A₀ ∩ B₀={0} ∧
(∀ z, orderedSquare A₀ z=orderedSquare B₀ z) := by sorry
end Couret.InterIA.SingletonNecessity
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 source-tree/research/interia/abelian-singleton-necessity-20261104/formal/SingletonNormalization.lean, lines 40–48; source file SHA-256 b79e3a7dcd27241fd2b42296a8a3585acdf1ea087086ba375ded443d56f96cf2; theorem Couret.InterIA.SingletonNecessity.normalize_singleton_collision