Parent joint cover for states 14, 19, and 20 of the actual 22-state recipe
ProvedSensitivityJointCover.endpoint22_phase2_parent_boundConsider the published four-phase, 22-state Boolean construction on a loopless tournament with 5591 vertices and outdegree 2795, with any binary edge labels. Let be nested Boolean predicates on a finite child-coordinate type. Here nested means that implies whenever . Let be the output of the actual second phase (phase index 1) applied to , and let be the output of the actual third phase (phase index 2) applied to .
Write and for single-coordinate flips making predicate true and false, respectively. Every flip set below is evaluated at its stated input, and its cardinality counts coordinates, not witness rows.
Assume the following uniform bounds on : if , then ; if , then ; and if , then . These are precisely the hypotheses used by the accepted child joint-cover theorem.
Assume also that is nested and satisfies the following child-profile bounds: if , then ; if , then ; and if and , then .
Then, for every parent input with and ,
The bound covers every repair signature, including the maximal two-guard-head case.
This is a conditional supporting transfer theorem for the actual recipe. Its child-profile hypotheses are explicit; it does not itself verify the complete four-phase numerical certificate or claim a new separation exponent. No nonempty child-coordinate type is assumed.
import Definitions.Def_Sensitivity213981Formal_Endpoint22Recipes import Definitions.Def_Sensitivity213981Formal_ConditionalOrdinary import Theorems.Thm_SensitivityJointCover_endpoint22_phase1_bound 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_phase2_parent_bound {K : Type} [Fintype K]
(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)
(H : Fin 22 → (K → Bool) → Bool) (hH : Nested H)
(hB : BBound H 12 12 53627300001453076)
(hA : ABound H 10 10 914422496216727)
(hs : ABound H 12 13 1217719417783) :
let F := parent ((Sensitivity5591Endpoint22.recipe Adj loopless label (1 : Fin 4)).stage H) H
let G := parent ((Sensitivity5591Endpoint22.recipe Adj loopless label (2 : Fin 4)).stage F) F
Nested F → BBound F 13 17 986662590537317840 →
ABound F 2 11 24354388355660 →
(∀ y, F 17 y = true → F 18 y = false →
(flipsTo (F 18) true y).card ≤ 47117605675757176) →
∀ x, G 19 x = true → G 20 x = false →
(flipsTo (G 14) false x ∪ flipsTo (G 20) true x).card ≤ 4700783999961812061 := by sorry