A variable-parameter canonical recipe word crosses the 2.15 threshold
OpenSensitivityVariableWord.exists_215_wordFind a graph and labeling datum satisfying all the tournament, coherence, defect, and source bounds of the recursive-profile certificate interface, a positive number of states, and a nonempty admissible finite recipe word.
Starting from matrices equal to one on and above the diagonal and zero below it, compute the profile by the datum's transfer formulas and interval minima. If the datum has vertices, the word has length , and its terminal height clamped below by two is , require
The vertex count, outdegree, labeling, cutoffs, tolerance range, number of states, and recipes may all vary. There are no free profile matrices or return factors. The associated equivalence theorem identifies this with the general finite-certificate existence problem. This is the remaining open search problem: no crossing word, numerical parameter bound, or 2.15 separation is supplied or claimed to be known.
import Definitions.Def_SensitivityVariableWord
theorem SensitivityVariableWord.exists_215_word :
∃ (G : SensitivityVariableWord.GraphData) (n : ℕ)
(word : List (SensitivityProfileCycle.Recipe (n + 1))),
SensitivityVariableWord.Crosses215 G word := by sorry