Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Nonemptiness transfer (psi-side): a nonempty Y-stage forces a nonempty X-stage at the pullback level

Proved
PersistClust.Count.nt_transfer_Y

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

countinterleavingnonemptinesspersistclustpullbacksupport-tool

The interleaving setup: X and Y are one-parameter persistence modules of finite components (comps families with structure maps under filtration laws), phi maps X-levels down eps to Y-levels and psi maps Y-levels down eps to X-levels. If the Y-stage is nonempty at some level beta at least alpha, then the X-stage is nonempty at the pullback level beta - eps: any Y-component at level beta is sent by psi to an X-component at beta - eps.

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 nt_transfer_Y {ιX ιY : Type*}
    {stageX : ℝ → Set ιX} {JX : ℝ → ιX → ιX → Prop}
    {stageY : ℝ → Set ιY} {JY : ℝ → ιY → ιY → Prop}
    {α ε : ℝ}
    (ψ : ∀ β : ℝ, α ≤ β → comps stageY JY β → comps stageX JX (β - ε))
    {β : ℝ} (hβ : α ≤ β) (hY : Nonempty (comps stageY JY β)) :
    Nonempty (comps stageX JX (β - ε))
    := by sorry
Source
Support tool of the persistence-clustering deliverable (RR-6968, Theorem 4.8 cluster): the nonemptiness transfer (psi-side) of the interleaving rank calculus. Transcribed GREEN (exit 0, sorry-free) from the working file; the platform mirror structures (comps/structMap/compRep/offD) rely on the platform Definitions via imports.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me