Asymptotic dimension

From testwiki
Jump to navigation Jump to search

In metric geometry, asymptotic dimension of a metric space is a large-scale analog of Lebesgue covering dimension. The notion of asymptotic dimension was introduced by Mikhail Gromov in his 1993 monograph Asymptotic invariants of infinite groups[1] in the context of geometric group theory, as a quasi-isometry invariant of finitely generated groups. As shown by Guoliang Yu, finitely generated groups of finite homotopy type with finite asymptotic dimension satisfy the Novikov conjecture.[2] Asymptotic dimension has important applications in geometric analysis and index theory.

Formal definition

Let X be a metric space and n0 be an integer. We say that asdim(X)n if for every R1 there exists a uniformly bounded cover 𝒰 of X such that every closed R-ball in X intersects at most n+1 subsets from 𝒰. Here 'uniformly bounded' means that supU𝒰diam(U)<.

We then define the asymptotic dimension asdim(X) as the smallest integer n0 such that asdim(X)n, if at least one such n exists, and define asdim(X):= otherwise.

Also, one says that a family (Xi)iI of metric spaces satisfies asdim(X)n uniformly if for every R1 and every iI there exists a cover 𝒰i of Xi by sets of diameter at most D(R)< (independent of i) such that every closed R-ball in Xi intersects at most n+1 subsets from 𝒰i.

Examples

  • If X is a metric space of bounded diameter then asdim(X)=0.
  • asdim()=asdim()=1.
  • asdim(n)=n.
  • asdim(n)=n.

Properties

  • If YX is a subspace of a metric space X, then asdim(Y)asdim(X).
  • For any metric spaces X and Y one has asdim(X×Y)asdim(X)+asdim(Y).
  • If A,BX then asdim(AB)max{asdim(A),asdim(B)}.
  • If f:YX is a coarse embedding (e.g. a quasi-isometric embedding), then asdim(Y)asdim(X).
  • If X and Y are coarsely equivalent metric spaces (e.g. quasi-isometric metric spaces), then asdim(X)=asdim(Y).
  • If X is a real tree then asdim(X)1.
  • Let f:XY be a Lipschitz map from a geodesic metric space X to a metric space Y . Suppose that for every r>0 the set family {f1(Br(y))}yY satisfies the inequality asdimn uniformly. Then asdim(X)asdim(Y)+n. See[3]
  • If X is a metric space with asdim(X)< then X admits a coarse (uniform) embedding into a Hilbert space.[4]
  • If X is a metric space of bounded geometry with asdim(X)n then X admits a coarse embedding into a product of n+1 locally finite simplicial trees.[5]

Asymptotic dimension in geometric group theory

Asymptotic dimension achieved particular prominence in geometric group theory after a 1998 paper of Guoliang Yu[2] , which proved that if G is a finitely generated group of finite homotopy type (that is with a classifying space of the homotopy type of a finite CW-complex) such that asdim(G)<, then G satisfies the Novikov conjecture. As was subsequently shown,[6] finitely generated groups with finite asymptotic dimension are topologically amenable, i.e. satisfy Guoliang Yu's Property A introduced in[7] and equivalent to the exactness of the reduced C*-algebra of the group.

  • If G is a word-hyperbolic group then asdim(G)<.[8]
  • If G is relatively hyperbolic with respect to subgroups H1,,Hk each of which has finite asymptotic dimension then asdim(G)<.[9]
  • asdim(n)=n.
  • If HG, where H,G are finitely generated, then asdim(H)asdim(G).
  • For Thompson's group F we have asdim(F)= since F contains subgroups isomorphic to n for arbitrarily large n.
  • If G is the fundamental group of a finite graph of groups 𝔸 with underlying graph A and finitely generated vertex groups, then[10]

asdim(G)1+maxvVYasdim(Av).

  • Mapping class groups of orientable finite type surfaces have finite asymptotic dimension.[11]
  • Let G be a connected Lie group and let ΓG be a finitely generated discrete subgroup. Then asdim(Γ)<.[12]
  • It is not known if Out(Fn) has finite asymptotic dimension for n>2.[13]

References

Template:Reflist

Further reading

Template:Refbegin

Template:Refend