clopen.solutions
OP-00812 Solution claimed

Minimal persistence grids versus homological Morse lower bounds

Submit a result

Fix a field $\Bbbk$, an integer $n \ge 1$ and a finite nonempty simplicial complex $K$ of dimension $d$. A filter assigns to every nonempty simplex a vector $f(\sigma) \in [0,1]^n$, with $f(\tau) \le f(\sigma)$ coordinatewise whenever $\tau \subseteq \sigma$. Put $$K_u = \{\sigma \in K : f(\sigma) \le u\}, \qquad M^q_u = H_q(K_u; \Bbbk), \qquad \mathbf M = (M^0, \ldots, M^d),$$ with ordinary unreduced homology and the maps induced by inclusions. Let $\xi_i^q(u)$ be the multigraded Betti numbers of the persistence module $M^q$: the number of free summands generated at grade $u$ in homological position $i$ of a minimal free resolution, computed after restricting to a finite grid determining the module and regrading its coordinate sets into $\mathbb{Z}^n$; set $\xi_i^q = 0$ for $q < 0$ or $q > d$. The minimal grid of $\mathbf M$ is $G = G_1 \times \cdots \times G_n$, where $$G_j = \bigcup_{q=0}^{d} \{u_j : \xi_0^q(u) + \xi_1^q(u) > 0\},$$ so that the values $0$ and $1$ belong to $G_j$ only if they occur there. Put $$b_q(u) = \max\Bigl\{0,\ \xi_0^q(u) + \xi_1^{q-1}(u) - \sum_{p=1}^{n-1} \xi_{p+1}^{q-p}(u)\Bigr\}, \qquad \mathcal L(\mathbf M) = \sum_{u \in G} \sum_{q=0}^{d} b_q(u).$$

Harrington, Tillmann and Torras-Pérez bound the dimension of the space of filters with persistent homology $\mathbf M$ by $n|K| - \sum_j |G_j|$ and by $\frac n2 (|K| - \mathcal L(\mathbf M))$, where $|K|$ is the number of simplices; the second bound is at least as strong as the first whenever $|G_j| \le \mathcal L(\mathbf M)$ for every $j$. They note that this holds for $n = 1$ and for filters injective in every coordinate, for which $\mathcal L(\mathbf M) = |K|$.

Problem. Does every such filter satisfy $$|G_j| \le \mathcal L(\mathbf M) \qquad \text{for every } j = 1, \ldots, n?$$ The tuple $\mathbf M$ is the persistent homology of a filter on a finite simplicial complex, not an arbitrary tuple of persistence modules, and the filter may assign equal coordinate values to distinct simplices.

Source: Harrington, Tillmann and Torras-Pérez (2026), the conjecture in Remark 5.12. Stated by AIM — Open Applied Problems with the minimal grid and the lower bound written out.

Imported from github.com/MColbrook/AIM.

Classification

Primary
AT — Algebraic Topology
Secondary
AC
Keywords
AIM Open Applied Problems, multigraded Betti numbers, multiparameter persistent homology

References

@misc{harrington2026,
  author        = {Harrington, Heather A. and Tillmann, Ulrike and Torras-P{\'e}rez, Maria},
  title         = {The fiber of multiparameter persistent homology for simplicial complexes},
  year          = {2026},
  eprint        = {2608.04640},
  archivePrefix = {arXiv},
  primaryClass  = {math.AT},
}
@article{guidolin2023,
  author  = {Guidolin, Andrea and Landi, Claudia},
  title   = {Morse inequalities for the {K}oszul complex of multi-persistence},
  journal = {J. Pure Appl. Algebra},
  volume  = {227},
  number  = {7},
  year    = {2023},
  pages   = {107319},
  doi     = {10.1016/j.jpaa.2023.107319},
}
@misc{aim-minimal-persistence-grid-morse-bound,
  author       = {Brunton, Steve and Colbrook, Matthew J. and de Hoop, Maarten V. and Stepaniants, George and Townsend, Alex and Ward, Rachel},
  title        = {{Minimal persistence grids versus homological Morse lower bounds}},
  howpublished = {AIM --- Open Applied Problems, GitHub repository},
  year         = {2026},
  url          = {https://github.com/MColbrook/AIM/blob/24edaadc6bb272737d8da0745c662c992db07b22/problems/547-minimal-persistence-grid-morse-bound.md},
  note         = {Entry 547 at commit 24edaad, 2026-10-15},
}

Resolution claims

Kaiwen Jin

The persistent homology of a finite simplicial complex is determined by a canonical grid whose coordinate values occur in minimal generators and relations. We prove that the number of values in each coordinate is bounded by the homological Morse lower bound defined from the multigraded Betti tables. The result holds over every field, for every number of parameters, and for …

Full resolution · not verified · fidelity not established · posted on GitHub 13 Oct 2026

Status history

WhenChangeByReason
2026-10-18 Needs verification → Solution claimed — Recorded here: AIM @ 24edaad, paper/grid_morse_bound.pdf.

Citing this problem

This identifier is permanent. It will not change if the problem is solved, reclassified or withdrawn.

OP-00812, "Minimal persistence grids versus homological Morse lower bounds", clopen.solutions.