Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Enumerating two four-sets with one common zero

Proved
Couret.InterIA.SingletonNecessity.exclusive_enumeration

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group. Let A,B⊆GA,B\subseteq GA,B⊆G have four elements each and satisfy A∩B={0}A\cap B=\{0\}A∩B={0}. There exist six nonzero pairwise distinct elements x0,…,x5x_0,\ldots,x_5x0​,…,x5​ such that

A={0,x0,x1,x2},B={0,x3,x4,x5}.A=\{0,x_0,x_1,x_2\},\qquad B=\{0,x_3,x_4,x_5\}.A={0,x0​,x1​,x2​},B={0,x3​,x4​,x5​}.

This supplies labels for the singleton-intersection matching argument.

Preamble
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Group.Pi.Basic
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Basic
import Mathlib.Data.List.Permutation
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_SingletonNecessity_distinctLabels_of_injective_nonzero
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738

set_option autoImplicit false
set_option maxHeartbeats 8000000
set_option linter.unusedSimpArgs false
namespace Couret.InterIA.SingletonNecessity
open Finset
variable {G : Type*} [AddCommGroup G] [DecidableEq G]

Formal statement
theorem exclusive_enumeration (A B : Finset G) (ha : A.card=4) (hb : B.card=4)
    (hi : A ∩ B={0}) :
    ∃ x : Fin 6 → G, SevenDistinct x ∧ supportLeft x=A ∧ supportRight x=B := 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/ExclusiveEnumeration.lean, lines 10–59; source file SHA-256 e9335ae75c793b443dea30485ce117fdc77557ebd960ab9a5308276ea8778067; theorem Couret.InterIA.SingletonNecessity.exclusive_enumeration

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