Linear combinations of vanishing relations vanish
ProvedCouret.InterIA.SingletonNecessity.evaluation_combination_zerocouret-programmecouret-unification-20261108
Let be an abelian group, , a list of integer relation vectors, and an integer coefficient list. If every vector in evaluates to zero, then
No equality of list lengths is assumed; the defined combination operation supplies its own list convention.
Preamble
import Definitions.Def_Couret_CertificateSoundness_1059e04412f7
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 Definitions.Def_Couret_MatchingCertificateCore_fbb5abd3e874
import Definitions.Def_Couret_ConvolutionParity_aa654fd002fc
set_option autoImplicit false
namespace Couret.InterIA.SingletonNecessity
open Finset
variable {G : Type*} [AddCommGroup G]
Formal statement
theorem evaluation_combination_zero (x : Fin 6 → G) (rows : List Vec)
(coeff : List ℤ) (hr : ∀ v ∈ rows, evaluation x v = 0) :
evaluation x (combination rows coeff) = 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/CertificateSoundness.lean, lines 24–39; source file SHA-256 10bfe9fce95e54024ac1f979cda844bfbd42adbb9a4bcc608954b4c55b77c9f0; theorem Couret.InterIA.SingletonNecessity.evaluation_combination_zero