Searcharxiv⌕ Search

arXiv subjects

Wojciech Chacholski

Publications and source records attributed to Wojciech Chacholski.

14 recordsLinked to original sources

Realisations of posets and tameness

We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that these numbers for realisations behave in a similar way as they do for upper semilattices. Furthermore, similarly to upper semilattices, realisations have well-behaved discrete approximations which are suitable for capturing homological properties of functors indexed by them. These discretisations are convenient and effective for describing tameness of functors. Homotopical and homological properties of tame functors, particularly those indexed by realisations, are discussed, with emphasis on the use of Koszul complexes to compute Betti diagrams of minimal free resolutions of tame functors indexed by upper semilattices and realisations.

math.AT↗

Koszul complexes and relative homological algebra of functors over posets

Under certain conditions, Koszul complexes can be used to calculate relative Betti diagrams of vector space-valued functors indexed by a poset, without the explicit computation of global minimal relative resolutions. In relative homological algebra of such functors, free functors are replaced by an arbitrary family of functors. Relative Betti diagrams encode the multiplicities of these functors in minimal relative resolutions. In this article we provide conditions under which grading the chosen family of functors leads to explicit Koszul complexes whose homology dimensions are the relative Betti diagrams, thus giving a scheme for the computation of these numerical descriptors.

math.AT↗

Data, geometry and homology

Homology-based invariants can be used to characterize the geometry of datasets and thereby gain some understanding of the processes generating those datasets. In this work we investigate how the geometry of a dataset changes when it is subsampled in various ways. In our framework the dataset serves as a reference object; we then consider different points in the ambient space and endow them with a geometry defined in relation to the reference object, for instance by subsampling the dataset proportionally to the distance between its elements and the point under consideration. We illustrate how this process can be used to extract rich geometrical information, allowing for example to classify points coming from different data distributions.

math.AT↗

Landscapes of data sets and functoriality of persistent homology

The aim of this article is to describe a new perspective on functoriality of persistent homology and explain its intrinsic symmetry that is often overlooked. A data set for us is a finite collection of functions, called measurements, with a finite domain. Such a data set might contain internal symmetries which are effectively captured by the action of a set of the domain endomorphisms. Different choices of the set of endomorphisms encode different symmetries of the data set. We describe various category structures on such enriched data sets and prove some of their properties such as decompositions and morphism formations. We also describe a data structure, based on coloured directed graphs, which is convenient to encode the mentioned enrichment. We show that persistent homology preserves only some aspects of these landscapes of enriched data sets however not all. In other words persistent homology is not a functor on the entire category of enriched data sets. Nevertheless we show that persistent homology is functorial locally. We use the concept of equivariant operators to capture some of the information missed by persistent homology.

math.AT↗

Homotopical decompositions of simplicial and Vietoris Rips complexes

Motivated by applications in Topological Data Analysis, we consider decompositions of a simplicial complex induced by a cover of its vertices. We study how the homotopy type of such decompositions approximates the homotopy of the simplicial complex itself. The difference between the simplicial complex and such an approximation is quantitatively measured by means of the so called obstruction complexes. Our general machinery is then specialized to clique complexes, Vietoris-Rips complexes and Vietoris-Rips complexes of metric gluings. For the latter we give metric conditions which allow to recover the first and zero-th homology of the gluing from the respective homologies of the components.

math.AT↗

Generalized persistence analysis based on stable rank invariant

We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for supervised and machine learning. Stable rank, a continuous invariant for multidimensional persistence, was introduced in W. Chacholski et al. - Multidimensional persistence and noise, 2017. In the current paper we continue this work by demonstrating how one builds an efficient computational pipeline around this invariant and uses it in inference in case of one parameter. We demonstrate some computational evidence of the statistical stability of stable rank. We also show how our framework can be used in supervised learning.

cs.CG↗

Relative homological algebra via truncations

To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spaltenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving the pieces, and gluing back the partial resolutions. Our aim is to give a homotopy theoretical interpretation of this procedure, which may be extended to a relative setting. We work in an arbitrary abelian category A and fix a class I of "injective objects". We show that Spaltenstein's construction can be captured by a pair of adjoint functors between unbounded chain complexes and towers of non-positively graded ones. This pair of adjoint functors forms what we call a Quillen pair and the above process of truncations, partial resolutions, and gluing, gives a meaningful way to resolve complexes in a relative setting up to a split error term. In order to do homotopy theory, and in particular to construct a well behaved relative derived category D(A; I), we need more: the split error term must vanish. This is the case when I is the class of all injective R-modules but not in general, not even for certain classes of injectives modules over a Noetherian ring. The key property is a relative analogue of Roos's AB4*-n axiom for abelian categories. Various concrete examples such as Gorenstein homological algebra and purity are also discussed.

math.AT↗

Homotopy excision and cellularity

Consider a push-out diagram of spaces C <-- A --> B, construct the homotopy push-out, and then the homotopy pull-back of the diagram one gets by forgetting the initial object A. We compare the difference between A and this homotopy pull-back. This difference is measured in terms of the homotopy fibers of the original maps. Restricting our attention to the connectivity of these maps, we recover the classical Blakers-Massey Theorem.

math.AT↗

Combinatorial resolutions of multigraded modules and multipersistent homology

Let $ R=k[x_1...x_r]$ and $M$ a multigraded $R-$module. In this work we interpret $M$ as a multipersistent homology module and give a multigraded resolution of it. The construction involves cellular resolutions of monomial ideals and reflects the combinatorial structure of multipersistence homology modules. In the one critical case, a multifiltration is represented by a labelled cellular complex. A multipersistence homology module measures the defect of acyclicity of the associated multigraded cellular chain complex.

math.AT↗

Combinatorial presentation of multidimensional persistent homology

A multifiltration is a functor indexed by $\mathbb{N}^r$ that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural $\mathbb{N}^r$-graded $R[x_1,\ldots, x_r]$-module structure on the homology of a multifiltration of simplicial complexes. To do that we study multifiltrations of sets and vector spaces. We prove in particular that the $\mathbb{N}^r$-graded $R[x_1,\ldots, x_r]$-modules that can occur as $R$-spans of multifiltrations of sets are the direct sums of monomial ideals.

math.AT↗

Homotopy colimits of nilpotent spaces

We show that cellular approximations of nilpotent Postnikov stages are always nilpotent Postnikov stages, in particular classifying spaces of nilpotent groups are turned into classifying spaces of nilpotent groups. We use a modified Bousfield-Kan homology completion tower z_k X whose terms we prove are all X-cellular for any X. As straightforward consequences, we show that if X is K-acyclic and nilpotent for a given homology theory K, then so are all its Postnikov sections, and that any nilpotent space for which the space of pointed self-maps map_*(X,X) is "canonically" discrete must be aspherical.

math.AT↗

On the classification of fibrations

Classification questions are often about understanding components of a category. It is much more desirable however to be able to understand the entire homotopy type of this category and not just the set of its components. In this paper we prove that this is possible for the category of functors indexed a small category I which assign to any morphism in I a weak equivalence in a given model category. We identify the homotopy type of this category with the mapping space out of the nerve of I into the classifying space of the space of weak equivalences of values of these functors. We use it to reprove the classical classification of fibration theorem of Stasheff and its generalizations by Dwyer-Kan.

math.AT↗

Homotopy exponents for large H-spaces

We show that H-spaces with finitely generated cohomology, as an algebra or as an algebra over the Steenrod algebra, have homotopy exponents at all primes. This provides a positive answer to a question of Stanley.

math.AT↗

Homotopy theory of diagrams

In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model approximation. Our key result says that if a category admits a model approximation then so does any diagram category with values in this category. From the homotopy theoretical point of view categories with model approximations have similar properties to those of model categories. They admit homotopy categories (localizations with respect to weak equivalences). They also can be used to construct derived functors by taking the analogs of fibrant and cofibrant replacements. A category with weak equivalences can have several useful model approximations. We take advantage of this possibility and in each situation choose one that suits our needs. In this way we prove all the fundamental properties of the homotopy colimit and limit: Fubini Theorem (the homotopy colimit -respectively limit- commutes with itself), Thomason's theorem about diagrams indexed by Grothendieck constructions, and cofinality statements. Since the model approximations we present here consist of certain functors "indexed by spaces", the key role in all our arguments is played by the geometric nature of the indexing categories.

math.AT↗