State-15-gap joint cover with zero-tolerance external guards and self-target repairs
ProvedSensitivityJointCover.endpoint22_phase3_gap15_boundLet be nested Boolean predicates on a finite coordinate set: implies for . Let be the parent predicates produced by the fourth phase (index 3) of the published 22-state construction. The underlying graph is a loopless tournament on 5591 vertices, each having 2795 outgoing neighbors, with binary labels on ordered vertex pairs.
Assume the following uniform bounds on child-coordinate flips:
- Where , at most flips make false.
- Where , at most flips make true.
- Where and , the union of flips making false and flips making true has size at most .
Then every parent input satisfying and obeys
Here denotes a single coordinate flip. This bound includes every repair signature, both outside the selected state-15 witness and at the witness itself, and retains the external guard changes relevant to state 7's zero tolerance. No candidate-cap hypothesis is required. This supporting conditional inequality does not assert a new cycle integer multiplier or 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_gap15_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 20 53874150507309062240)
(hA : ABound F 0 13 1330073126471840)
(hJ : ∀ y, F 20 y=true → F 21 y=false →
(flipsTo (F 15) false y ∪ flipsTo (F 21) true y).card≤56530689653409078976)
(x : ((Fin 5591 × Bool) × I) → Bool) :
let S := (Sensitivity5591Endpoint22.recipe Adj loopless label (3:Fin 4)).stage F
parent S F 15 x=true → parent S F 16 x=false →
(flipsTo (parent S F 7) false x ∪ flipsTo (parent S F 16) true x).card≤114122394549206934016 := by sorry