A finite recipe sequence from all ones crossing the 2.15 threshold
DisprovedSensitivityProfileWord.exists_215_wordFind a positive number of states and a nonempty finite sequence of valid recipes. Every positive tolerance used on an ordinary state must be at most five. Start from two matrices having ones on and above the diagonal and zeros below it; apply the fixed interval-envelope transfer map for the recipes in sequence.
If the sequence has length and the largest terminal matrix entry, clamped below by two, is , the required condition is the exact integer inequality
All graph parameters and defect cutoffs remain fixed at those of SensitivityProfileSearch. No initial matrices, intermediate profiles, interval witnesses, or radius need be guessed: the sequence determines them. The all-ones characterization proves that this search is complete for SensitivityProfileSearch.exists_215_orbit, allowing repetition of a successful cycle.
The existence of a crossing sequence remains open. No witness reaching 2.15 is supplied, and no bound on the necessary state count or word length is asserted.
import Definitions.Def_SensitivityProfileWord
theorem SensitivityProfileWord.exists_215_word :
∃ (n : ℕ) (word : List (SensitivityProfileCycle.Recipe (n+1))),
SensitivityProfileWord.Crosses215 word := by sorry