Abstract
We prove that, over an arbitrary field, pointwise finite-dimensional persistence modules indexed by [Formula: see text] decompose uniquely, up to isomorphism, into the direct sum of a bar code and finitely-many Jordan cells. In the language of representation theory, this is a direct sum of string modules and band modules. Persistence modules indexed on [Formula: see text] have also been called angle-valued or circular persistence modules. We allow either a cyclic order or partial order on [Formula: see text] and do not have additional finiteness requirements on the modules. We also show that a pointwise finite-dimensional [Formula: see text] persistence module is indecomposable if and only if it is a bar or Jordan cell. Along the way we classify the isomorphism classes of such indecomposable modules.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
