Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Joint cover including self-repair for the final-phase state-7 gap

Proved
SensitivityJointCover.endpoint22_phase3_gap7_bound

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

block-sensitivityconditional-boundsfinite-certificatessensitivity

Let F0,…,F21F_0,\ldots,F_{21}F0​,…,F21​ be nested Boolean predicates on a finite child-coordinate type: Fj(y)=1F_j(y)=1Fj​(y)=1 implies Fi(y)=1F_i(y)=1Fi​(y)=1 for i≤ji\le ji≤j. Apply phase index 3, the actual fourth phase of the published 22-state construction, to obtain parent predicates G0,…,G21G_0,\ldots,G_{21}G0​,…,G21​. The graph is a loopless tournament on 5591 vertices with binary edge labels.

Assume the existing source exclusion: if a vertex vvv points to every vertex of a disjoint set AAA, and a binary coloring of AAA makes every edge from A∪{v}A\cup\{v\}A∪{v} into AAA agree with its head's color, then ∣A∣≤18|A|\le18∣A∣≤18. This is the unchanged candidate-cap interface DominatorCardBound(1,19)\mathrm{DominatorCardBound}(1,19)DominatorCardBound(1,19).

Assume the following uniform child-coordinate bounds:

  • Where F15=1F_{15}=1F15​=1, at most 204139569652870538020413956965287053802041395696528705380 flips make F14F_{14}F14​ false.
  • Where F11=1F_{11}=1F11​=1, at most 305691554613794975830569155461379497583056915546137949758 flips make F6F_6F6​ false.
  • Where F13=0F_{13}=0F13​=0, at most 375024291803558637502429180355863750242918035586 flips make F18F_{18}F18​ true.
  • Where F15=1F_{15}=1F15​=1 and F16=0F_{16}=0F16​=0, at most 108524743996953688108524743996953688108524743996953688 flips make F18F_{18}F18​ true.

Then every parent input xxx with G7(x)=1G_7(x)=1G7​(x)=1 and G8(x)=0G_8(x)=0G8​(x)=0 satisfies

∣{z:G4(x{z})=0}∪{z:G13(x{z})=1}∣≤7207211311720001066.\left|\{z:G_4(x^{\{z\}})=0\}\cup\{z:G_{13}(x^{\{z\}})=1\}\right| \le7207211311720001066.​{z:G4​(x{z})=0}∪{z:G13​(x{z})=1}​≤7207211311720001066.

Here x{z}x^{\{z\}}x{z} flips coordinate zzz. This is a global conditional transfer bound for all repair signatures of the actual recipe. It includes the possibility that the selected state-7 witness is itself a state-13 target-repair candidate. No cap or child-count attainability, positivity of abstract counting bounds, or nonempty child-coordinate assumption is made. It does not assert an improved full-cycle integer multiplier or separation exponent.

Preamble
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
Formal statement
theorem SensitivityJointCover.endpoint22_phase3_gap7_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 15 2041395696528705380)
 (hG : BBound F 6 11 3056915546137949758)
 (hS : ABound F 13 18 3750242918035586)
 (hQ : ∀ y, F 15 y=true → F 16 y=false →
   (flipsTo (F 18) true y).card≤108524743996953688)
 (x : ((Fin 5591 × Bool) × I) → Bool) :
 let S := (Sensitivity5591Endpoint22.recipe Adj loopless label (3:Fin 4)).stage F
 parent S F 7 x=true → parent S F 8 x=false →
 (flipsTo (parent S F 4) false x ∪ flipsTo (parent S F 13) true x).card≤7207211311720001066 := by sorry
Source
Original joint-cover deduction for phase index 3, entries 4, 7, 8, and 13 of Sensitivity213981Formal.Sensitivity5591Endpoint22.recipe (Endpoint22Recipes): https://prove2.me/definitions/c0e9ff4f-3de6-4821-bfbd-0a95cc15178b. Uses the unchanged ResidualCaps.DominatorCardBound source interface with cutoff 19 (pcross=18). Child bounds are profileTable3 B(14,15), B(6,11), A(13,18), and P(15,18) of 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. Related accepted state-9-gap cover: https://prove2.me/theorems/ae4c10fa-8aa7-4286-b0a0-043bdfe6e6bd. The present proof treats the different state-7 gap and explicitly removes the witness from the target-candidate set before invoking the source exclusion. No new exponent or improved full-cycle integer multiplier is asserted.

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