Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Validity of mixed integer-lattice certificates in block 26

Proved
Couret.InterIA.SingletonNecessity.mixedChunk26_valid

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

couret-programmecouret-unification-20261108

Every certificate in the fixed explicit list Couret.InterIA.SingletonNecessity.mixedChunk26 in MatchingCertificateData satisfies the mixed certificate validity test; this list contains 64 records. A certificate is a quadruple (p,i,j,c), with p a list of natural-number indices, i,j natural numbers and c a list of integers. Work in the integer lattice ℤ⁶ with standard basis e₀,…,e₅, and put ℓ₀=0 and ℓᵣ₊₁=eᵣ for 0≤r<6. Define the ordered lists L=(e₀,e₁,e₂,e₀+e₁,e₀+e₂,e₁+e₂,2e₀) and R=(e₃,e₄,e₅,e₃+e₄,e₃+e₅,e₄+e₅,2e₃), indexed from zero. The relation list A(p) begins with 2(e₀−e₁), 2(e₃−e₄), 2(e₂−e₅), followed, in order, by Lₜ−Rₚₜ for entries of the zipped lists L and p. In this fixed block every p has seven entries in {0,…,6}, so A(p) has ten rows. For every record in the block, all three requirements hold: i<j<7; the coefficient list c has the same length as A(p); and the integer linear combination ∑ᵣ cᵣA(p)ᵣ equals ℓᵢ−ℓⱼ in ℤ⁶. These are precisely the tests in valid(true); permutation validity is not an additional test in that predicate. Equivalently, the Boolean conjunction obtained by applying valid(true) to the entire specified list is true.

Preamble
import Definitions.Def_Couret_MatchingCertificateData_656be71337d8
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Group.Pi.Basic
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Basic
import Mathlib.Data.List.Permutation
import Definitions.Def_Couret_MatchingCertificateCore_fbb5abd3e874

set_option autoImplicit false

set_option maxRecDepth 1000000

set_option maxHeartbeats 20000000

namespace Couret.InterIA.SingletonNecessity

































































































































































Formal statement
theorem mixedChunk26_valid : mixedChunk26.all (valid true) = true := 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/MatchingCertificateData.lean, lines 2660–2660; source file SHA-256 281f2db6030f883e89d5aa00658e16116a8de5187f3c58c3d03bf50c9b44685c; theorem Couret.InterIA.SingletonNecessity.mixedChunk26_valid

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