Remarks on straight finite decomposition complexity (Q2363290): Difference between revisions

The notion of finite decomposition complexity for metric spaces was defined by \textit{E. Guentner} et al. [Invent. Math. 189, No. 2, 315--357 (2012; Zbl 1257.57028)], using a game-theoretic approach. The authors defined the straight finite decomposition complexity (sFDC), and gave a proof of the implication ``sFDC \(\Rightarrow\) property A'' in their earlier paper [Topology Appl. 169, 99--107 (2014; Zbl 1297.54064)]. In the paper under review, the authors give a corrected proof for this implication. Moreover, they introduce a dimension-like ordinal-valued invariant related to the sFDC, which they call the straight decomposition complexity degree, and obtain some permanence results of this invariant.