Arithmetic semantics of the thirteen unlabelled YAH rows
ProvedCollatzWork.YAH.unlabelledRows_semanticcollatz-work-import
Let be the fixed list of thirteen unlabelled YAH instances, with full words and for each row . Let evaluate a word from the initial value , with digit maps , , and for ; boundary symbols leave the value unchanged. Define for even and for odd . Then
Here the two dynamic rule names are . The theorem checks the arithmetic meaning of these thirteen concrete instances; it does not quantify over all contexts.
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.unlabelledRows_semantic :
unlabelledRows.all validUnlabelledSemantics = true := by sorry
Source