Zero coefficient sum for the 50-row YAH adjacent-edge certificate
ProvedCollatzWork.YAH.edgeCertificate_cancellationcollatz-work-import
The alphabet is the fixed seven-symbol YAH alphabet \Sigma=\{f,t,0,1,2,\hat{},\}T=\Sigma\times{\mathrm{false},\mathrm{true}}C_ee\in T^2\delta(r,e)r$ minus its count on the local right side. Then
The Lean statement expresses this equality as matching coefficient lists over the complete finite feature enumeration. It supplies the cancellation identity for this particular fixed-algebra additive obstruction.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_YAHFiniteObstruction import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement open Lean.Grind open Lean.Grind.AddCommMonoid open Lean.Grind.IntModule
Formal statement
set_option maxRecDepth 100000 in
theorem CollatzWork.YAH.edgeCertificate_cancellation :
allTokenEdges.map
(weightedCoefficient edgeCertificate labeledEdgeDelta) =
allTokenEdges.map (fun _ => 0) := by sorry
Source