Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Parent joint cover for states 14, 19, and 20 of the actual 22-state recipe

Proved
SensitivityJointCover.endpoint22_phase2_parent_bound

by jennyuxi · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-sensitivityconditional-boundsfinite-certificatessensitivity

Consider the published four-phase, 22-state Boolean construction on a loopless tournament with 5591 vertices and outdegree 2795, with any binary edge labels. Let H0,…,H21H_0,\ldots,H_{21}H0​,…,H21​ be nested Boolean predicates on a finite child-coordinate type. Here nested means that Hj=1H_j=1Hj​=1 implies Hi=1H_i=1Hi​=1 whenever i≤ji\le ji≤j. Let FFF be the output of the actual second phase (phase index 1) applied to HHH, and let GGG be the output of the actual third phase (phase index 2) applied to FFF.

Write Up⁡j(y)\operatorname{Up}_j(y)Upj​(y) and Down⁡j(y)\operatorname{Down}_j(y)Downj​(y) for single-coordinate flips making predicate jjj 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 HHH: if H12(y)=1H_{12}(y)=1H12​(y)=1, then ∣Down⁡12(y)∣≤53627300001453076|\operatorname{Down}_{12}(y)|\le53627300001453076∣Down12​(y)∣≤53627300001453076; if H10(y)=0H_{10}(y)=0H10​(y)=0, then ∣Up⁡10(y)∣≤914422496216727|\operatorname{Up}_{10}(y)|\le914422496216727∣Up10​(y)∣≤914422496216727; and if H12(y)=0H_{12}(y)=0H12​(y)=0, then ∣Up⁡13(y)∣≤1217719417783|\operatorname{Up}_{13}(y)|\le1217719417783∣Up13​(y)∣≤1217719417783. These are precisely the hypotheses used by the accepted child joint-cover theorem.

Assume also that FFF is nested and satisfies the following child-profile bounds: if F17(y)=1F_{17}(y)=1F17​(y)=1, then ∣Down⁡13(y)∣≤986662590537317840|\operatorname{Down}_{13}(y)|\le986662590537317840∣Down13​(y)∣≤986662590537317840; if F2(y)=0F_2(y)=0F2​(y)=0, then ∣Up⁡11(y)∣≤24354388355660|\operatorname{Up}_{11}(y)|\le24354388355660∣Up11​(y)∣≤24354388355660; and if F17(y)=1F_{17}(y)=1F17​(y)=1 and F18(y)=0F_{18}(y)=0F18​(y)=0, then ∣Up⁡18(y)∣≤47117605675757176|\operatorname{Up}_{18}(y)|\le47117605675757176∣Up18​(y)∣≤47117605675757176.

Then, for every parent input xxx with G19(x)=1G_{19}(x)=1G19​(x)=1 and G20(x)=0G_{20}(x)=0G20​(x)=0,

∣Down⁡14(x)∪Up⁡20(x)∣≤4700783999961812061.|\operatorname{Down}_{14}(x)\cup\operatorname{Up}_{20}(x)|\le4700783999961812061.∣Down14​(x)∪Up20​(x)∣≤4700783999961812061.

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.

Preamble
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
Formal statement
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
Source
Original parent-level joint-cover deduction for phase index 2, entries 14, 19, and 20, of Sensitivity213981Formal.Sensitivity5591Endpoint22.recipe (Endpoint22Recipes): https://prove2.me/definitions/c0e9ff4f-3de6-4821-bfbd-0a95cc15178b. Explicitly applies the accepted child joint-cover theorem https://prove2.me/theorems/409b3d51-0778-4512-9c47-aca9e872c9bf. Fixed child-profile constants from the existing 2.13981 construction https://prove2.me/theorems/0e93b146-3cac-42d3-b8f4-74010d06b636, by @yousofy with Codex, retaining its OpenAI/math and earlier community attribution. The new parent implication is proved here; no source is claimed to establish a new full-cycle certificate or exponent.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me