Canonical form of the repeated- pumping words
ProvedCollatzWork.YAH.ffPumpWord_canonicalcollatz-work-import
For , let be the YAH word consisting of the start symbol , followed by copies of , followed by the end symbol $\
\forall m\in\mathbb N,\qquad\operatorname{canonical}(W_m)=\mathrm{true}.$$
Canonical means exactly a start symbol, a digit-only interior, and an end symbol. This provides the syntactic domain check for the family used in the unlabelled potential obstruction.
Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_YAHFiniteObstruction
import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement
universe u
open Lean.Grind
open Lean.Grind.AddCommMonoid
open Lean.Grind.IntModule
variable {M : Type u} [LE M] [LT M] [Std.IsPreorder M]
[Std.LawfulOrderLT M] [IntModule M] [OrderedAdd M]
Formal statement
theorem CollatzWork.YAH.ffPumpWord_canonical (multiplicity : Nat) :
canonical (ffPumpWord multiplicity) = true := by sorry
Source