All-ones recipe search is complete for the 2.15 orbit criterion
ProvedSensitivityProfileWord.orbit_iff_wordThe positive-profile orbit criterion of SensitivityProfileSearch.exists_215_orbit is equivalent to the existence of a positive number of states and a finite recipe word satisfying SensitivityProfileWord.Crosses215.
Thus a certificate with arbitrary positive integer initial matrices, a positive period , and an integer return factor satisfying
exists if and only if a nonempty admissible recipe sequence, started from the fixed all-ones upper-triangular profile, has terminal height satisfying
The new sequence may be longer than the original period. The equivalence preserves the allowed state counts, recipes, and tolerance bounds. It removes all freely chosen initial profile entries and the freely chosen radius from the search, without requiring a new restriction on the family of constructions. This equivalence does not assert that either side has a witness.
import Definitions.Def_SensitivityProfileWord
theorem SensitivityProfileWord.orbit_iff_word :
(∃ (n p radius : ℕ)
(recipes : Fin (p+1) → SensitivityProfileCycle.Recipe (n+1))
(initial : SensitivityProfileSearch.Profile (n+1)),
1 < radius ∧ radius^43 < (14055^(p+1))^20 ∧
SensitivityProfileSearch.PositiveUpper initial ∧
(∀ d, (recipes d).Valid ∧
∀ i, 3 ≤ i.val → 0 < (recipes d).tol i → (recipes d).tol i < 6) ∧
SensitivityProfileSearch.ReturnsWithin recipes initial radius) ↔
∃ (n : ℕ) (word : List (SensitivityProfileCycle.Recipe (n+1))),
SensitivityProfileWord.Crosses215 word := by sorry