Global joint cover for states 4, 10, 11, and 21 of the actual final phase
ProvedSensitivityJointCover.endpoint22_phase3_global_boundLet be nested Boolean predicates on a finite child-coordinate type: implies whenever . Apply phase index 3, the actual fourth phase of the published 22-state construction, to obtain parent predicates . The underlying directed graph is a loopless tournament on 5591 vertices, with binary edge labels.
Assume the source exclusion from the existing candidate-cap certificates. Explicitly, if a vertex points to every vertex of a disjoint set , and there is a binary coloring of such that every edge from into agrees with the color of its head, then . In the formal statement this is the unchanged interface .
Assume three uniform child-profile bounds. At any child input where , at most coordinate flips make false. Where , at most coordinate flips make false. Where , at most coordinate flips make true.
Then every parent input satisfying and obeys
Here flips the single coordinate . The count concerns coordinates, including overlaps, rather than separately counting witness rows.
This is a conditional global transfer theorem for the unchanged actual final-phase recipe. It covers every repair signature and uses the existing source cap as an upper bound, without requiring any cap to be attained. Its graph, cap, nestedness, and child-profile hypotheses are explicit. It does not establish a complete improved four-phase cycle certificate or a separation exponent, and it assumes no nonempty child-coordinate type.
import Definitions.Def_Sensitivity213981Formal_Endpoint22Recipes import Definitions.Def_Sensitivity213981Formal_ConditionalOrdinary import Definitions.Def_Sensitivity213981Formal_ResidualCaps 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_phase3_global_bound {I : Type} [Fintype I]
(Adj : Fin 5591 → Fin 5591 → Prop) (loopless : ∀ v, ¬Adj v v)
(label : Fin 5591 → Fin 5591 → Bool)
(htor : ∀ v r, v≠r → (Adj v r ↔ ¬Adj r v))
(hcap : Sensitivity213981Formal.ResidualCaps.DominatorCardBound Adj label 1 19)
(F : Fin 22 → (I → Bool) → Bool) (hF : Nested F)
(hB : BBound F 14 17 2041395696528705380)
(hG : BBound F 0 9 3056915546137949758)
(hS : ABound F 11 21 98368454968486)
(x : ((Fin 5591 × Bool) × I) → Bool) :
let S := (Sensitivity5591Endpoint22.recipe Adj loopless label (3:Fin 4)).stage F
parent S F 10 x=true → parent S F 11 x=false →
(flipsTo (parent S F 4) false x ∪ flipsTo (parent S F 21) true x).card≤7141477571384793266 := by sorry