On computability and triviality of well groups
type: Item
instance of: scholarly article
title: On computability and triviality of well groups
zbMATH Open document ID: 1353.65047
author: Peter Franek
author: Marek Krčál
published in: Discrete \& Computational Geometry
publication date: 2016-08-31T00:00:00Z
full work available at URL: https://arxiv.org/abs/1501.03641
review text: The concept of well groups in a special case captures homological properties of the zero set of a continuous map \(f: K\rightarrow {\mathbb R}^n\) on a compact space \(K\) that are invariant with respect to perturbations of \(f\). The perturbations are arbitrary continuous maps within \(L_{\infty} \) distance \(r\) from \(f\) for a given \(r>0\). The main drawback of the approach is that the computability of well groups was shown only when dim \(K=n\) or \(n=1\). The contribution of the authors to the theory of well groups in this paper is twofold: on the one hand, the computability issue is improved, and on the other hand, a range of examples is presented where the well groups are incomplete invariants (that is, fail to capture certain important robust properties of the zero set). For the first part, the authors identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of \({\mathbb R}^n\) by \(f\). In other words, well groups can be algorithmically approximated from below. When \(f\) is smooth and dim\(K<2n-2\), the approximation developed of the (dim \(K-n\))th well group is exact. For the second part, the authors find examples of maps \(f,f': K\rightarrow {\mathbb R}^n\) with all well groups isomorphic but whose perturbations have different zero sets. Finally, a possible replacement of the well groups of vector-valued maps is discussed by an invariant of a better descriptive power and computability status.
reviewed by: Sonia Pérez Díaz
Mathematics Subject Classification ID: 65H20
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 55S35
Mathematics Subject Classification ID: 55Q55
zbMATH DE Number: 6621061
zbMATH Keywords: nonlinear equations
zbMATH Keywords: robustness
zbMATH Keywords: well groups
zbMATH Keywords: computational topology
zbMATH Keywords: obstruction theory
zbMATH Keywords: homotopy theory
describes a project that uses: mctoolbox
MaRDI profile type: Publication
OpenAlex ID: W1895954743
Wikidata QID: Q59462583
arXiv ID: 1501.03641
cites work: Q5558469
cites work: Q2765609
cites work: Q3182207
cites work: Homology and robustness of level and interlevel sets
cites work: Piecewise linear topology
cites work: Computing All Maps into a Sphere
cites work: Topology and data
cites work: Computing well diagrams for vector fields on \(\mathbb R^n\)
cites work: Computability and Representations of the Zero Set
cites work: Q3655278
cites work: Quantifying transversality by measuring the robustness of intersections
cites work: Axiomatic Approach to Homology Theory
cites work: Persistence of zero sets
cites work: Robust Satisfiability of Systems of Equations
cites work: Quasi-decidability of a fragment of the first-order theory of real numbers
cites work: Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
cites work: Q3149478
cites work: Q4819371
cites work: Accuracy and Stability of Numerical Algorithms
cites work: On existence and uniqueness verification for non-smooth functions
cites work: Q4363916
cites work: Q4956083
cites work: Q4413072
cites work: Elementary Differential Topology. (AM-54)
cites work: Interval Methods for Systems of Equations
cites work: Q3445967
cites work: On the theory of obstructions
cites work: Q5522742
cites work: Q5423687
DBLP publication ID: journals/dcg/FranekK16
DOI: 10.1007/S00454-016-9794-2
description: scientific article; zbMATH DE number 6621061