A finite recursive-profile cycle crossing the 2.15 threshold
OpenSensitivityProfileCycle.exists_215_certificateFind a finite tournament-label and recursive-profile cycle certificate, with vertex count , positive period , and return factor , satisfying the exact integer inequality
All graph, label, recipe, and profile-matrix requirements are those of SensitivityProfileCycle.Certificate. The number of states, tournament size, period, cutoffs, recipes, and matrices may all vary. The inequality asks the block-growth rate of the cycle to exceed its sensitivity-growth rate raised to .
This is an open sufficient-condition conjecture for the mission's 2.15 target. No such certificate is supplied or claimed to be known. The residual problem is finite combinatorial and integer data, rather than an assertion about an asymptotic family of Boolean functions; a proof that every 2.15 separation must arise this way is not asserted.
import Definitions.Def_SensitivityProfileCycle
theorem SensitivityProfileCycle.exists_215_certificate :
∃ c : SensitivityProfileCycle.Certificate,
1 < c.radius ∧ c.radius ^ 43 < (c.vertices ^ c.period) ^ 20 := by sorry