Free factor complex

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, the free factor complex (sometimes also called the complex of free factors) is a free group counterpart of the notion of the curve complex of a finite type surface. The free factor complex was originally introduced in a 1998 paper of Allen Hatcher and Karen Vogtmann.[1] Like the curve complex, the free factor complex is known to be Gromov-hyperbolic. The free factor complex plays a significant role in the study of large-scale geometry of Out⁡(Fn).

Formal definition

For a free group G a proper free factor of G is a subgroup A≤G such that A≠{1},A≠G and that there exists a subgroup B≤G such that G=A∗B.

Let n≥3 be an integer and let Fn be the free group of rank n. The free factor complex ℱn for Fn is a simplicial complex where:

(1) The 0-cells are the conjugacy classes in Fn of proper free factors of Fn, that is

ℱn(0)={[A]|A≤Fn is a proper free factor of Fn}.

(2) For k≥1, a k-simplex in ℱn is a collection of k+1 distinct 0-cells {v0,v1,…,vk}⊂ℱn(0) such that there exist free factors A0,A1,…,Ak of Fn such that vi=Ai for i=0,1,…,k, and that A0≤A1≤…≤Ak. [The assumption that these 0-cells are distinct implies that Ai≠Ai+1 for i=0,1,…,k−1]. In particular, a 1-cell is a collection {[A],[B]} of two distinct 0-cells where A,B≤Fn are proper free factors of Fn such that A⪇B.

For n=2 the above definition produces a complex with no k-cells of dimension k≥1. Therefore, ℱ2 is defined slightly differently. One still defines ℱ2(0) to be the set of conjugacy classes of proper free factors of F2; (such free factors are necessarily infinite cyclic). Two distinct 0-simplices {v0,v1}⊂ℱ2(0) determine a 1-simplex in ℱ2 if and only if there exists a free basis a,b of F2 such that v0=[⟨a⟩],v1=[⟨b⟩]. The complex ℱ2 has no k-cells of dimension k≥2.

For n≥2 the 1-skeleton ℱn(1) is called the free factor graph for Fn.

Main properties

  • For every integer n≥3 the complex ℱn is connected, locally infinite, and has dimension n−2. The complex ℱ2 is connected, locally infinite, and has dimension 1.
  • For n=2, the graph ℱ2 is isomorphic to the Farey graph.
  • There is a natural action of Out⁡(Fn) on ℱn by simplicial automorphisms. For a k-simplex Δ={[A0],…,[Ak]} and φ∈Out⁡(Fn) one has φΔ:={[φ(A0)],…,[φ(Ak)]}.
  • For n≥3 the complex ℱn has the homotopy type of a wedge of spheres of dimension n−2.[1]
  • For every integer n≥2, the free factor graph ℱn(1), equipped with the simplicial metric (where every edge has length 1), is a connected graph of infinite diameter.[2][3]
  • For every integer n≥2, the free factor graph ℱn(1), equipped with the simplicial metric, is Gromov-hyperbolic. This result was originally established by Mladen Bestvina and Mark Feighn;[4] see also [5][6] for subsequent alternative proofs.
  • An element φ∈Out⁡(Fn) acts as a loxodromic isometry of ℱn(1) if and only if φ is fully irreducible.[4]
  • There exists a coarsely Lipschitz coarsely Out⁡(Fn)-equivariant coarsely surjective map ℱ𝒮n→ℱn(1), where ℱ𝒮n is the free splittings complex. However, this map is not a quasi-isometry. The free splitting complex is also known to be Gromov-hyperbolic, as was proved by Handel and Mosher.[7]
  • Similarly, there exists a natural coarsely Lipschitz coarsely Out⁡(Fn)-equivariant coarsely surjective map CVn→ℱn(1), where CVn is the (volume-ones normalized) Culler–Vogtmann Outer space, equipped with the symmetric Lipschitz metric. The map π takes a geodesic path in CVn to a path in ℱFn contained in a uniform Hausdorff neighborhood of the geodesic with the same endpoints.[4]
  • The hyperbolic boundary ∂ℱn(1) of the free factor graph can be identified with the set of equivalence classes of "arational" Fn-trees in the boundary ∂CVn of the Outer space CVn.[8]
  • The free factor complex is a key tool in studying the behavior of random walks on Out⁡(Fn) and in identifying the Poisson boundary of Out⁡(Fn).[9]

Other models

There are several other models which produce graphs coarsely Out⁡(Fn)-equivariantly quasi-isometric to ℱn(1). These models include:

  • The graph whose vertex set is ℱn0 and where two distinct vertices v0,v1 are adjacent if and only if there exists a free product decomposition Fn=A∗B∗C such that v0=[A] and v1=[B].
  • The free bases graph whose vertex set is the set of Fn-conjugacy classes of free bases of Fn, and where two vertices v0,v1 are adjacent if and only if there exist free bases 𝒜,ℬ of Fn such that v0=[𝒜],v1=[ℬ] and 𝒜∩ℬ≠∅.[5]

References

Template:Reflist

See also