| Popis: |
When working with (multi-parameter) persistence modules, one usually makes some type of tameness assumption in order to obtain better control over their algebraic behavior. One such notion is Ezra Millers notion of finite encodability, which roughly states that a persistence module can be obtained by pulling back a finite dimensional persistence module over a finite poset. From the perspective of homological algebra, finitely encodable persistence have an inconvenient property: They do not form an abelian category. Here, we prove that if one restricts to such persistence modules which can be constructed in terms of topologically closed and sufficiently constructible (piecewise linear, semi-algebraic, etc.) upsets then abelianity can be restored. |
