Final-phase state-11-gap joint cover retaining the external child interval
ProvedSensitivityJointCover.endpoint22_phase3_gap11_boundLet be nested Boolean predicates on a finite child-coordinate type: implies for . Apply phase index 3, the actual fourth phase of the published 22-state construction, to obtain parent predicates . The graph is a loopless tournament on 5591 vertices with binary edge labels.
Assume the existing source exclusion: if a vertex points to every vertex of a disjoint set , and a binary coloring of makes every edge from into agree with its head's color, then . This is the unchanged candidate-cap interface .
Assume these uniform child-coordinate bounds:
- Where , at most flips make false.
- Where , at most flips make false.
- Where , at most flips make false.
- Where , at most flips make true.
- Where , at most flips make true.
Then every parent input with and satisfies
Here flips coordinate . This is a global conditional transfer bound for every repair signature of the actual recipe, including self-target repairs at the selected state-11 witness. All graph, cap, nestedness, and child-bound hypotheses are explicit. No cap attainability, positive abstract counting bound, or nonempty child-coordinate assumption is made. This supporting inequality does not assert an improved full-cycle integer multiplier or separation exponent.
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_gap11_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)
(hM7 : ∀ y, F 7 y=true → F 8 y=false → (flipsTo (F 6) false y).card≤150358948041692066811)
(hM8 : ∀ y, F 8 y=true → F 9 y=false → (flipsTo (F 6) false y).card≤146185162351149245833)
(hS : ABound F 9 18 98368454968486)
(hQ : ∀ y, F 17 y=true → F 18 y=false → (flipsTo (F 18) true y).card≤2871710707230501566)
(x : ((Fin 5591 × Bool) × I) → Bool) :
let S := (Sensitivity5591Endpoint22.recipe Adj loopless label (3:Fin 4)).stage F
parent S F 11 x=true → parent S F 12 x=false →
(flipsTo (parent S F 3) false x ∪ flipsTo (parent S F 13) true x).card≤154443510066938910319 := by sorry