An arithmetic profile orbit at known labeling parameters crossing 2.15
DisprovedSensitivityProfileSearch.exists_215_orbitFind a positive integer number of states, a positive period , a natural number , a periodic list of valid recipes, and two positive upper-triangular integer input matrices such that the deterministic profile orbit in SensitivityProfileSearch returns within factor after steps and
Every positive tolerance used by a recipe must be at most five. The orbit uses the fixed parameters
No graph or labeling must be constructed here: the simultaneous labeling theorem for the regular cyclic tournament at these parameters is already proved. No intermediate profile matrices, interval witnesses, or compatibility inequalities are supplied by the solver; all profiles are computed using the interval-minimum recurrence, and those obligations follow automatically from the recurrence and recipe validity.
This is an open sufficient-condition conjecture for SensitivityProfileCycle.exists_215_certificate. Neither a 2.15 orbit nor the adequacy of this fixed-parameter class is asserted to be known. The cited accepted construction achieves approximately 2.13082558; it does not establish this conjecture.
import Definitions.Def_SensitivityProfileSearch
theorem SensitivityProfileSearch.exists_215_orbit :
∃ (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 := by sorry