Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prominent copies sit on real bars (prom-copy to bar extraction)

Proved
PersistClust.Count.prom_bar

by fabianroll · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

barcountdiagonalmultoffdoffptpersistclustpersistenceprominencepromqnesupport-tool

Let a be a prominent copy of the multiplicity diagram mult (rankFn stage J) with prominence level α and diagonal radius ε, i.e. PromQNE α ε a: the offset point offPt a lies in the quadrant Q^NE_α strictly above α in both coordinates, and no diagonal point x is ε-close to offPt a in both coordinates. Then offPt a is a genuine real bar: there exist reals b and d with offPt a = (b, d) and d < b, the bar is wider than the 2ε diagonal band (d + 2ε < b), it lies strictly above the prominence level (α < d), and the multiplicity diagram is nonzero at it (mult (rankFn stage J) (b, d) ≠ 0).

Preamble
import Mathlib
import Definitions.Def_PersistClust_Count_Setting
import Definitions.Def_PersistClust_Count_Diagram
import Definitions.Def_PersistClust_Count_FiltrationLaw
import Definitions.Def_PersistClust_Count_MatchingCensus
import Definitions.Def_PersistClust_Count_MatchingGate

open PersistClust.Count
open scoped ENNReal
Formal statement
namespace PersistClust.Count

theorem prom_bar {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
    {α ε : ℝ} {a : offD (mult (rankFn stage J))} (hprom : PromQNE α ε a) :
    ∃ b d : ℝ, offPt a = ((b : EReal), (d : EReal)) ∧ d < b ∧ d + 2 * ε < b ∧ α < d ∧
      mult (rankFn stage J) ((b : EReal), (d : EReal)) ≠ 0
    := by sorry
Source
Support tool of the persistence-clustering deliverable (RR-6968, Theorem 4.5 cluster): the prom-copy to bar extraction consumed by the S6 const-squeeze branch of the rank-level kill (t5_l1_rankKill, rankR1) — every prominent copy's offset point is a real, nonzero-multiplicity bar clearing the ε-diagonal band and sitting above the prominence threshold.

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