Bjerkevik's stability conjecture for the pruning distance
Bjerkevik's stability conjecture for the pruning distance
Let and be pfd modules, and let denote the pruning distance and the interleaving distance. For a module , write
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 , then
The left-hand inequality is known when the pruning parameter is restricted to , 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
Sign in to submit a solution.
No solutions have been posted yet.