Evaluation commutes with a finite weighted coefficient sum
ProvedCollatzWork.YAH.evalCoefficients_weightedCoefficientcollatz-work-import
Let be an integer module, a finite list of features of any type , , a finite list of pairs , and . Integer scalar multiplication in is denoted by juxtaposition. Then
Both sums retain duplicate list entries. This algebraic identity transfers a coefficient-level certificate to a weighted sum of evaluated row gaps; it requires no order assumptions.
Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement
universe u
open Lean.Grind
open Lean.Grind.AddCommMonoid
open Lean.Grind.IntModule
variable {M : Type u} [IntModule M]
Formal statement
theorem CollatzWork.YAH.evalCoefficients_weightedCoefficient {φ : Type _} {ρ : Type _}
(features : List φ) (weight : φ → M)
(certificate : List (Nat × ρ)) (delta : ρ → φ → Int) :
evalCoefficients features weight
(weightedCoefficient certificate delta) =
weightedGapSum certificate
(fun row => evalCoefficients features weight (delta row)) := by sorry
Source