Straight finite decomposition complexity implies property A for coarse spaces (Q2411478): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.topol.2017.09.034 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2759944818 / rank | |||
Normal rank |
Revision as of 01:07, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Straight finite decomposition complexity implies property A for coarse spaces |
scientific article |
Statements
Straight finite decomposition complexity implies property A for coarse spaces (English)
0 references
24 October 2017
0 references
Ever since \textit{G. Yu} proved that the coarse Baum-Connes conjecture holds for discrete metric spaces of bounded geometry which coarsely embed into a Hilbert space [Invent. Math. 139, No. 1, 201--240 (2000; Zbl 0956.19004)], there has been a significant interest in developing a property, which would imply the existence of such a coarse embedding. The strictest of such properties is that of finite asymptotic dimension, and one of the most general such properties is property A. Between them there are many related properties: finite decomposition complexity, asymptotic property C, straight finite decomposition complexity, etc. In the introduction the author explains all known relationships between them. All these properties also have coarse versions, which are designed for more general coarse spaces instead of metric spaces. However, not all implications known to hold for the original versions of these properties, are known to hold for the coarse versions. In this short but technical paper the author generalizes one such implication to the coarse setting. He proves that straight finite coarse decomposition complexity implies coarse property A.
0 references
coarse space
0 references
property A
0 references
straight finite decomposition complexity
0 references