Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

State-8-gap joint cover retaining zero-tolerance guard destruction

Proved
SensitivityJointCover.endpoint22_phase3_gap8_bound

by jennyuxi · Nov 14, 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 coordinate set: Fj(y)=1F_j(y)=1Fj​(y)=1 implies Fi(y)=1F_i(y)=1Fi​(y)=1 for i≤ji\le ji≤j. Let G0,…,G21G_0,\ldots,G_{21}G0​,…,G21​ 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 F16(y)=1F_{16}(y)=1F16​(y)=1, at most 538741505073090622405387415050730906224053874150507309062240 flips make F15F_{15}F15​ false.
  • If F11(y)=0F_{11}(y)=0F11​(y)=0, at most 133007312647184013300731264718401330073126471840 flips make F13F_{13}F13​ true.
  • If F16(y)=1F_{16}(y)=1F16​(y)=1 and F17(y)=0F_{17}(y)=0F17​(y)=0, the union of the flips making F15F_{15}F15​ false and those making F18F_{18}F18​ true has size at most 538741505073090622405387415050730906224053874150507309062240.

Then every parent input xxx satisfying G8(x)=1G_8(x)=1G8​(x)=1 and G9(x)=0G_9(x)=0G9​(x)=0 obeys

∣{z:G7(x{z})=0}∪{z:G12(x{z})=1}∣≤111465855403106917280.\left|\{z:G_7(x^{\{z\}})=0\}\cup\{z:G_{12}(x^{\{z\}})=1\}\right|\le111465855403106917280.​{z:G7​(x{z})=0}∪{z:G12​(x{z})=1}​≤111465855403106917280.

Here x{z}x^{\{z\}}x{z} 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.

Preamble
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
Formal statement
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
Source
Original deduction for the unchanged Endpoint22Recipes fourth phase, https://prove2.me/definitions/c0e9ff4f-3de6-4821-bfbd-0a95cc15178b. Uses child profileTable3 B(15,16), A(11,13), D(15,16,18) 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 joint bound is max(2B,B+J)+2795A. No candidate-cap assumption or improved exponent 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