Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Seven distinct labels force all six variables to be nonzero

Proved
Couret.InterIA.SingletonNecessity.nonzero_of_distinctLabels

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

couret-programmecouret-unification-20261108

Let GGG be an abelian group, and let x0,…,x5∈Gx_0,\ldots,x_5\in Gx0​,…,x5​∈G be such that 0,x0,…,x50,x_0,\ldots,x_50,x0​,…,x5​ are pairwise distinct. Put A={0,x0,x1,x2}A=\{0,x_0,x_1,x_2\}A={0,x0​,x1​,x2​}, B={0,x3,x4,x5}B=\{0,x_3,x_4,x_5\}B={0,x3​,x4​,x5​}, 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​]. Then

xi≠0(0≤i<6).x_i\ne0\qquad(0\le i<6).xi​=0(0≤i<6).

This exposes the nonzero consequences of the distinct-label hypothesis.

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_evaluation_basis
import Definitions.Def_Couret_CertificateSoundness_1059e04412f7
import Definitions.Def_Couret_SingletonNormalization_99875800f8c3
import Mathlib.Tactic.FinCases

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














Formal statement
theorem nonzero_of_distinctLabels (x : Fin 6 → G) (hd : SevenDistinct x) :
    ∀ i, x i ≠ 0 := 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/ExtractionBasics.lean, lines 47–54; source file SHA-256 65adcf683ecaaf85072801fa5eabac473cfd23154dfc02948e17c14bc16e67f1; theorem Couret.InterIA.SingletonNecessity.nonzero_of_distinctLabels

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