Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A valid six- or seven-term matching forces an embedded square of order four

Proved
Couret.InterIA.SingletonNecessity.contains_c4_square_of_matching

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group and let 0,x0,…,x50,x_0,\ldots,x_50,x0​,…,x5​ be seven distinct elements. Write L=[x0,x1,x2,x0+x1,x0+x2,x1+x2]L=[x_0,x_1,x_2,x_0+x_1,x_0+x_2,x_1+x_2]L=[x0​,x1​,x2​,x0​+x1​,x0​+x2​,x1​+x2​] and R=[x3,x4,x5,x3+x4,x3+x5,x4+x5]R=[x_3,x_4,x_5,x_3+x_4,x_3+x_5,x_4+x_5]R=[x3​,x4​,x5​,x3​+x4​,x3​+x5​,x4​+x5​]. Suppose either (i) 2xi=2xi+32x_i=2x_{i+3}2xi​=2xi+3​ for i=0,1,2i=0,1,2i=0,1,2, and a permutation of six positions matches LLL termwise to RRR; or (ii) 2x0=2x12x_0=2x_12x0​=2x1​, 2x3=2x42x_3=2x_42x3​=2x4​, 2x2=2x52x_2=2x_52x2​=2x5​, and a permutation of seven positions matches LLL followed by 2x02x_02x0​ to RRR followed by 2x32x_32x3​. Then

∃ϕ:(Z/4Z)2↪Gadditive.\exists\phi:(\mathbb Z/4\mathbb Z)^2\hookrightarrow G\quad\text{additive}.∃ϕ:(Z/4Z)2↪Gadditive.

The matching conditions are equalities of the indicated group-valued list entries.

Preamble
import Definitions.Def_Couret_C4SquareAlgebra_06ed7b10cc0e
import Definitions.Def_Couret_MatchingElimination_8675038abe55
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.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_SingletonNecessity_cross_matching_is_reverse
import Theorems.Thm_Couret_InterIA_SingletonNecessity_mixed_matching_impossible
import Theorems.Thm_Couret_InterIA_SingletonNecessity_reverse_relations_contains_c4_square
import Definitions.Def_Couret_MatchingElimination_8675038abe55
import Definitions.Def_Couret_C4SquareAlgebra_06ed7b10cc0e

set_option autoImplicit false
namespace Couret.InterIA.SingletonNecessity
open Couret.InterIA.AbelianBoundary
variable {G : Type*} [AddCommGroup G]





Formal statement

theorem contains_c4_square_of_matching (x : Fin 6 → G) (hd : DistinctLabels x)
    (hm : (∃ p : List ℕ, p.Perm (List.range 6) ∧ RelationsHold x false p) ∨
      (∃ p : List ℕ, p.Perm (List.range 7) ∧ RelationsHold x true p)) :
    ∃ φ : G4 →+ G, Function.Injective φ := 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/ConditionalNecessity.lean, lines 76–84; source file SHA-256 cb9bb017b413d40837c57c50cc3c78b5f8fc5f8253e41ffaffda5cd427f7047c; theorem Couret.InterIA.SingletonNecessity.contains_c4_square_of_matching

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