Four-failure joint cover for the actual 22-state second phase
ProvedSensitivityJointCover.endpoint22_phase1_boundConsider the published 22-state, four-phase Boolean construction on a loopless regular tournament with 5591 vertices and outdegree 2795, with any binary edge labeling. Let be the nested child predicates: a larger index implies a smaller-index predicate. Let be the output of its actual second-phase recipe (phase index 1).
Assume three uniform bounds on child coordinate flips: at an input where is true, at most single-coordinate flips make it false; at an input where is false, at most flips make it true; and at an input where is false, at most flips make true. The bounds are arbitrary natural numbers.
For every parent input with and ,
Here flips coordinate . States 1 and 2 of this phase have the same target 12 and guard 10, with tolerances 4 and 3; state 11 has target 13, guard 10, and tolerance zero. The theorem uses these actual recipe entries, rather than a replacement Boolean family. It applies to the selected Paley tournament and labeling by specialization.
This is a supporting conditional sensitivity bound. It supplies no new separation exponent and asserts no complete numerical cycle certificate. No positivity assumption on or nonemptiness assumption on the child coordinate type is needed.
import Definitions.Def_Sensitivity213981Formal_Endpoint22Recipes import Definitions.Def_Sensitivity213981Formal_ConditionalOrdinary import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Union import Mathlib.Data.Fintype.Prod import Lean open Sensitivity213981Formal Sensitivity213981Formal.ThreeBoundWitness open Sensitivity213981Formal.ThreeBoundProfiles open scoped Classical set_option autoImplicit false
theorem SensitivityJointCover.endpoint22_phase1_bound {I : Type} [Fintype I]
(Adj : Fin 5591 → Fin 5591 → Prop) (loopless : ∀ v, ¬ Adj v v)
(label : Fin 5591 → Fin 5591 → Bool)
(htor : ∀ r z, r ≠ z → (Adj r z ↔ ¬ Adj z r))
(hd : ∀ v, (Finset.univ.filter (Adj v)).card = 2795)
(F : Fin 22 → (I → Bool) → Bool) (hF : Nested F)
(b a s : ℕ) (hb : BBound F 12 12 b) (ha : ABound F 10 10 a)
(hs : ABound F 12 13 s)
(x : ((Fin 5591 × Bool) × I) → Bool) :
let S := (Sensitivity5591Endpoint22.recipe Adj loopless label (1 : Fin 4)).stage F
let G := parent S F
G 1 x = true → G 2 x = false →
((flipsTo (G 1) false x) ∪ (flipsTo (G 11) true x)).card ≤
2*b+2791*a+4*s := by sorry