HOME

TheInfoList



OR:

In mathematics, the free factor complex (sometimes also called the complex of free factors) is a
free group In mathematics, the free group ''F'S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''− ...
counterpart of the notion of the
curve complex In mathematics, the curve complex is a simplicial complex ''C''(''S'') associated to a finite-type surface ''S'', which encodes the combinatorics of simple closed curves on ''S''. The curve complex turned out to be a fundamental tool in the s ...
of a finite type surface. The free factor complex was originally introduced in a 1998 paper of
Allen Hatcher Allen, Allen's or Allens may refer to: Buildings * Allen Arena, an indoor arena at Lipscomb University in Nashville, Tennessee * Allen Center, a skyscraper complex in downtown Houston, Texas * Allen Fieldhouse, an indoor sports arena on the Unive ...
and
Karen Vogtmann Karen Vogtmann (born July 13, 1949 in Pittsburg, California''Biographies of Candidates 200 ...
. 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 \operatorname(F_n).


Formal definition

For a free group G a ''proper free factor'' of G is a
subgroup In group theory, a branch of mathematics, given a group ''G'' under a binary operation ∗, a subset ''H'' of ''G'' is called a subgroup of ''G'' if ''H'' also forms a group under the operation ∗. More precisely, ''H'' is a subgrou ...
A\le G such that A\ne \, A\ne G and that there exists a subgroup B\le G such that G=A\ast B. Let n\ge 3 be an integer and let F_n be the
free group In mathematics, the free group ''F'S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''− ...
of rank n. The free factor complex \mathcal F_n for F_n is a
simplicial complex In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their ''n''-dimensional counterparts (see illustration). Simplicial complexes should not be confused with the more abstract notion of a simplicial ...
where: (1) The 0-cells are the
conjugacy class In mathematics, especially group theory, two elements a and b of a group are conjugate if there is an element g in the group such that b = gag^. This is an equivalence relation whose equivalence classes are called conjugacy classes. In other w ...
es in F_n of proper free factors of F_n, that is :\mathcal F_n^=\. (2) For k\ge 1, a k-simplex in \mathcal F_n is a collection of k+1 distinct 0-cells \\subset \mathcal F_n^ such that there exist free factors A_0,A_1,\dots, A_k of F_n such that v_i=A_i for i=0,1,\dots, k, and that A_0\le A_1\le \dots \le A_k. he assumption that these 0-cells are distinct implies that A_i\ne A_ for i=0,1,\dots, k-1 In particular, a 1-cell is a collection \ of two distinct 0-cells where A,B\le F_n are proper free factors of F_n such that A\lneq B. For n=2 the above definition produces a complex with no k-cells of dimension k\ge 1. Therefore, \mathcal F_2 is defined slightly differently. One still defines \mathcal F_2^ to be the set of conjugacy classes of proper free factors of F_2; (such free factors are necessarily infinite cyclic). Two distinct 0-simplices \\subset \mathcal F_2^ determine a 1-simplex in \mathcal F_2 if and only if there exists a free basis a,b of F_2 such that v_0= langle a\rangle v_1= langle b\rangle/math>. The complex \mathcal F_2 has no k-cells of dimension k\ge 2. For n\ge 2 the 1-skeleton \mathcal F_n^ is called the free factor graph for F_n.


Main properties

* For every integer n\ge 3 the complex \mathcal F_n is connected, locally infinite, and has dimension n-2. The complex \mathcal F_2 is connected, locally infinite, and has dimension 1. * For n=2, the graph \mathcal F_2 is isomorphic to the
Farey graph In mathematics, the Farey sequence of order ''n'' is the sequence of completely reduced fractions, either between 0 and 1, or without this restriction, which when in lowest terms have denominators less than or equal to ''n'', arranged in ord ...
. * There is a natural
action Action may refer to: * Action (narrative), a literary mode * Action fiction, a type of genre fiction * Action game, a genre of video game Film * Action film, a genre of film * ''Action'' (1921 film), a film by John Ford * ''Action'' (1980 fil ...
of \operatorname(F_n) on \mathcal F_n by simplicial automorphisms. For a ''k''-simplex \Delta=\ and \varphi\in \operatorname(F_n) one has \varphi \Delta:=\. *For n\ge 3 the complex \mathcal F_n has the
homotopy type In topology, a branch of mathematics, two continuous functions from one topological space to another are called homotopic (from grc, ὁμός "same, similar" and "place") if one can be "continuously deformed" into the other, such a defor ...
of a wedge of spheres of dimension n-2. *For every integer n\ge 2, the free factor graph \mathcal F_n^, equipped with the simplicial metric (where every edge has length 1), is a connected graph of infinite diameter. *For every integer n\ge 2, the free factor graph \mathcal F_n^, equipped with the simplicial metric, is Gromov-hyperbolic. This result was originally established by
Mladen Bestvina Mladen Bestvina (born 1959) is a Croatian-American mathematician working in the area of geometric group theory. He is a Distinguished Professor in the Department of Mathematics at the University of Utah. Biographical info Mladen Bestvina is a thr ...
and Mark Feighn; see also for subsequent alternative proofs. *An element \varphi\in \operatorname(F_n) acts as a loxodromic isometry of \mathcal F_n^ if and only if \varphi is fully irreducible. *There exists a coarsely Lipschitz coarsely \operatorname(F_n)-equivariant coarsely surjective map \mathcal_n\to \mathcal F_n^, where \mathcal_n is the free splittings complex. However, this map is not a
quasi-isometry In mathematics, a quasi-isometry is a function between two metric spaces that respects large-scale geometry of these spaces and ignores their small-scale details. Two metric spaces are quasi-isometric if there exists a quasi-isometry between them. ...
. The free splitting complex is also known to be Gromov-hyperbolic, as was proved by Handel and Mosher. *Similarly, there exists a natural coarsely Lipschitz coarsely \operatorname(F_n)-equivariant coarsely surjective map CV_n\to \mathcal F_n^, where CV_n is the (volume-ones normalized) Culler–Vogtmann Outer space, equipped with the symmetric Lipschitz metric. The map \pi takes a geodesic path in CV_n to a path in \mathcal FF_n contained in a uniform Hausdorff neighborhood of the geodesic with the same endpoints. *The hyperbolic boundary \partial \mathcal F_n^ of the free factor graph can be identified with the set of equivalence classes of "arational" F_n-trees in the boundary \partial CV_n of the Outer space CV_n. *The free factor complex is a key tool in studying the behavior of
random walk In mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space. An elementary example of a random walk is the random walk on the integer number line \mathbb ...
s on \operatorname(F_n) and in identifying the
Poisson boundary In mathematics, the Poisson boundary is a measure space associated to a random walk. It is an object designed to encode the asymptotic behaviour of the random walk, i.e. how trajectories diverge when the number of steps goes to infinity. Despite be ...
of \operatorname(F_n).


Other models

There are several other models which produce graphs coarsely \operatorname(F_n)-equivariantly quasi-isometric to \mathcal F_n^. These models include: *The graph whose vertex set is \mathcal F_n^ and where two distinct vertices v_0,v_1 are adjacent if and only if there exists a free product decomposition F_n=A\ast B\ast C such that v_0= /math> and v_1= /math>. *The free bases graph whose vertex set is the set of F_n-conjugacy classes of free bases of F_n, and where two vertices v_0,v_1 are adjacent if and only if there exist free bases \mathcal A, \mathcal B of F_n such that v_0= mathcal A v_1= mathcal B/math> and \mathcal A\cap \mathcal B\ne \varnothing .


References

{{Reflist


See also

*
Mapping class group In mathematics, in the subfield of geometric topology, the mapping class group is an important algebraic invariant of a topological space. Briefly, the mapping class group is a certain discrete group corresponding to symmetries of the space. Mo ...
Geometric group theory Geometric topology