Canonical all-ones words are complete for variable profile certificates
ProvedSensitivityVariableWord.certificate_iff_wordA recursive-profile cycle certificate crossing the 2.15 threshold exists if and only if a canonical all-ones recipe word crosses the same threshold for some valid graph and labeling datum:
Here , , and are the certificate's vertex count, positive period, and return radius. On the right, is the state count, is the graph datum's vertex count, and is the word's terminal height clamped below by two.
On the left, all graph, label, cutoff, recipe, profile, compatibility, and cycle requirements are those of SensitivityProfileCycle.Certificate. On the right, the graph datum has exactly the same graph, label, and cutoff requirements. The height is computed by iterating the original transfer followed by interval minimization, starting from the all-ones upper-triangular profile. Recipe validity and tolerance bounds are unchanged.
All parameters may vary. This equivalence removes free initial and intermediate profile matrices, interval witnesses, and return factors from the existence problem. It does not assert that either side has a witness and does not assert that every Boolean separation must admit such a certificate.
import Definitions.Def_SensitivityVariableWord
theorem SensitivityVariableWord.certificate_iff_word :
(∃ c : SensitivityProfileCycle.Certificate,
1 < c.radius ∧ c.radius ^ 43 < (c.vertices ^ c.period) ^ 20) ↔
∃ (G : SensitivityVariableWord.GraphData) (n : ℕ)
(word : List (SensitivityProfileCycle.Recipe (n + 1))),
SensitivityVariableWord.Crosses215 G word := by sorry