The fixed two-state suffix algebra satisfies every YAH rule equation
ProvedCollatzWork.YAH.twoState_rule_equationscollatz-work-import
Let be the list of all eleven YAH rules and let denote the specified Boolean unary map of a symbol . For a word , define , with . Then
This verifies the rule equations for the one fixed two-state algebra used for suffix labeling. It does not assert that any induced order proves termination.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement open Lean.Grind open Lean.Grind.AddCommMonoid open Lean.Grind.IntModule
Formal statement
theorem CollatzWork.YAH.twoState_rule_equations :
∀ name ∈ allRuleNames, ∀ tail : Bool,
evalWord (rule name).lhs tail = evalWord (rule name).rhs tail := by sorry
Source