Freiman word guards: run extension
ProvedFreiman.lower_guard_run_extensionfreimanword-guards
Under both unshortened guards, a repeated run of at least three 3s creates no forbidden boundary, extends both words and ends in 33.
Preamble
import Definitions.Def_Freiman_lowerWordGuardData open Freiman
Formal statement
theorem Freiman.lower_guard_run_extension (p : LowerPair) (hp : lowerAdmissible p) (hr : lowerRunOffered p) (k : ℕ) (hk : 3 ≤ k) :
lowerGuardExtensionData p (List.replicate k 3,List.replicate k 3) := by
sorrySource
Freiman report, 'The complete boundary table for selected words', Appendix app:selection-words, report/source/staging/parts/word_certificates.tex; global_selection.tex admissibility argument; certificates/word_selection/selection_words_printed.json, word_guards.json and source_bindings.json; verification/families/word_selection/verify_word_guards.py.