Canonical extensions of the 50-row YAH adjacent-edge certificate
ProvedCollatzWork.YAH.edgeCertificate_canonically_embeddablecollatz-work-import
Let be the fixed 50-row labeled YAH adjacent-edge certificate. For a row , let be its locally labeled left and right lists, and let be the specified canonical-extension procedure. Let mean that the unlabeled word is canonical, its last token is (\,\mathrm{false})$, and its adjacent suffix labels satisfy the fixed two-state algebra. Then
This verifies the canonical labeled-word predicate separately on the deterministic extensions of both sides of every listed row, providing a concrete domain check for the certificate.
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_canonically_embeddable :
edgeCertificate.all (fun entry =>
canonicalLabeled (canonicalExtension entry.2.lhs) &&
canonicalLabeled (canonicalExtension entry.2.rhs)) = true := by sorry
Source