State-8-gap joint cover retaining zero-tolerance guard destruction
ProvedSensitivityJointCover.endpoint22_phase3_gap8_boundLet be nested Boolean predicates on a finite coordinate set: implies for . Let be the parent predicates obtained by applying the fourth phase (index 3) of the published 22-state construction to these predicates. The underlying graph is a loopless tournament on 5591 vertices, each with exactly 2795 outgoing neighbors, and each ordered vertex pair has a binary label.
Assume the following uniform bounds on child-coordinate flips:
- If , at most flips make false.
- If , at most flips make true.
- If and , the union of the flips making false and those making true has size at most .
Then every parent input satisfying and obeys
Here denotes a single coordinate flip. The bound covers every repair signature, including repairs at the selected witness itself, and retains the outside guard changes relevant to state 7's zero tolerance. It requires no candidate-cap hypothesis. This is a supporting conditional inequality; it makes no claim of a new separation exponent.
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_phase3_gap8_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))
(hd : ∀ v, (Finset.univ.filter (Adj v)).card=2795)
(F : Fin 22 → (I → Bool) → Bool) (hF : Nested F)
(hB : BBound F 15 16 53874150507309062240)
(hA : ABound F 11 13 1330073126471840)
(hJ : ∀ y, F 16 y=true → F 17 y=false →
(flipsTo (F 15) false y ∪ flipsTo (F 18) true y).card≤53874150507309062240)
(x : ((Fin 5591 × Bool) × I) → Bool) :
let S := (Sensitivity5591Endpoint22.recipe Adj loopless label (3:Fin 4)).stage F
parent S F 8 x=true → parent S F 9 x=false →
(flipsTo (parent S F 7) false x ∪ flipsTo (parent S F 12) true x).card≤111465855403106917280 := by sorry