Bjerkevik's stability conjecture for the pruning distance

From papers

Let MM and NN be pfd modules, and let dPd_P denote the pruning distance and dId_I the interleaving distance. For a module MM, write

supdimM=suppPdimMp.\operatorname{supdim} M=\sup_{p\in\mathbb{P}}\dim M_p.

Bjerkevik's conjecture. On persistence modules of bounded pointwise dimension, the pruning distance is stable and Lipschitz equivalent to the interleaving distance. More precisely, if r=supdimM<r=\operatorname{supdim}M<\infty, then

dP(M,N)dI(M,N)2rdP(M,N).d_P(M,N)\leq d_I(M,N)\leq 2r\,d_P(M,N).

The left-hand inequality is known when the pruning parameter is restricted to δ=0\delta=0, but its extension to arbitrary positive parameters remains open; the stated stability and Lipschitz-equivalence conjecture is therefore open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Roy Nicolas Nehme, “Pruning distance of upset-decomposable persistence modules”, arXiv:2602.15243 (2026).

Solutions 0

No solutions have been posted yet.