Differential Calculus and Optimization in Persistence Module Categories

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Oudot, Steve
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910680601329664
author Oudot, Steve
author_facet Oudot, Steve
contents Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other areas of mathematics, including symplectic topology, complex analysis, and topological data analysis, where they arise from filtrations of topological spaces by the sublevel sets of real-valued functions. Two fundamental properties of persistence modules make them useful in such contexts: (1) the fact that they are stable under perturbations of the originating functions, and (2) the fact that they can be approximated, in the sense of relative homological algebra, by classes of indecomposable modules with an elementary structure. In this text we give an introduction to the theory of persistence modules, then we explain how the above properties can be leveraged to build a framework for differential calculus and optimization with convergence guarantees in persistence module categories.
format Preprint
id arxiv_https___arxiv_org_abs_2411_00493
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Differential Calculus and Optimization in Persistence Module Categories
Oudot, Steve
Algebraic Topology
Optimization and Control
Representation Theory
55N31 (Primary) 16G20, 49J52, 90C15 (Secondary)
Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other areas of mathematics, including symplectic topology, complex analysis, and topological data analysis, where they arise from filtrations of topological spaces by the sublevel sets of real-valued functions. Two fundamental properties of persistence modules make them useful in such contexts: (1) the fact that they are stable under perturbations of the originating functions, and (2) the fact that they can be approximated, in the sense of relative homological algebra, by classes of indecomposable modules with an elementary structure. In this text we give an introduction to the theory of persistence modules, then we explain how the above properties can be leveraged to build a framework for differential calculus and optimization with convergence guarantees in persistence module categories.
title Differential Calculus and Optimization in Persistence Module Categories
topic Algebraic Topology
Optimization and Control
Representation Theory
55N31 (Primary) 16G20, 49J52, 90C15 (Secondary)
url https://arxiv.org/abs/2411.00493