The thirteen-row YAH cancellation leaves only a negative coefficient
ProvedCollatzWork.YAH.unlabelledCertificate_cancellationcollatz-work-import
Let be the seven-symbol YAH alphabet and its fixed thirteen-row unlabelled certificate. For an adjacent-symbol pair , let be the number of occurrences of on the full left word of row minus its number on the full right word. With the stored multiplier of each certificate entry,
The Lean statement compares the two coefficient lists over the enumeration of all symbol pairs. This exact integer identity isolates the repeated edge for subsequent potential arguments.
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
theorem CollatzWork.YAH.unlabelledCertificate_cancellation :
allSymbolEdges.map
(weightedCoefficient unlabelledCertificate unlabelledEdgeDelta) =
allSymbolEdges.map negativeFFCoefficient := by sorry
Source