Permanence of metric sparsification property under finite decomposition complexity

  • Qin Wang*
  • , Wenjing Wang
  • , Xianjin Wang
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The notions of metric sparsification property and finite decomposition complexity are recently introduced in metric geometry to study the coarse Novikov conjecture and the stable Borel conjecture. In this paper, it is proved that a metric space X has finite decomposition complexity with respect to metric sparsification property if and only if X itself has metric sparsification property. As a consequence, the authors obtain an alternative proof of a very recent result by Guentner, Tessera and Yu that all countable linear groups have the metric sparsification property and hence the operator norm localization property.

Original languageEnglish
Pages (from-to)751-760
Number of pages10
JournalChinese Annals of Mathematics. Series B
Volume35
Issue number5
DOIs
StatePublished - Sep 2014

Keywords

  • Asymptotic dimension
  • Decomposition complexity
  • Metric space
  • Metric sparsification
  • Permanence property

Fingerprint

Dive into the research topics of 'Permanence of metric sparsification property under finite decomposition complexity'. Together they form a unique fingerprint.

Cite this