- Bass–Serre theory
Bass–Serre theory is a part of the mathematical subject of
group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated applications of the operations offree product with amalgamation andHNN extension , via the notion of the fundamental group of agraph of groups .Bass–Serre theory can be regarded as one-dimentional version of the orbifold theory.History
Bass–Serre theory was developed by
Jean-Pierre Serre in 1970s and formalized in "Trees", Serre's seminal 1977 monograph (developed in collaboration withHyman Bass ) on the subject. [J.-P. Serre. "Arbres, amalgames, SL2". Rédigé avec la collaboration de Hyman Bass. Astérisque, No. 46. Société Mathématique de France, Paris, 1977] J.-P. Serre, "Trees". (Translated from the French by John Stillwell).Springer-Verlag , 1980. ISBN: 3-540-10103-9] . Serre's original motivation was to understand the structure of certainalgebraic group s whoseBruhat–Tits building s are trees. However, the theory quickly became a standard tool ofgeometric group theory andgeometric topology , particularly the study of3-manifold s. Subsequent work ofHyman Bass H. Bass, "Covering theory for graphs of groups."Journal of Pure and Applied Algebra , vol. 89 (1993), no. 1–2, pp. 3–47] contributed substantially to the formalization and development of basic tools of the theory and currently the term "Bass–Serre theory" is widely used to describe the subject.Mathematically, Bass–Serre theory builds on exploiting and generalizing the properties of two older group-theoretic constructions:
free product with amalgamation andHNN extension . However, unlike the traditional algebraic study of these two constructions, Bass–Serre theory uses the geometric language of covering theory andfundamental group s. Graphs of groups, which are the basic objects of Bass–Serre theory, can be viewed as one-dimensional versions oforbifold s.Apart from Serre's book, the basic treatment of Bass–Serre theory is available in the article of Bass, the article of Scott and Wall [Peter Scott and Terry Wall. "Topological methods in group theory." in: "Homological group theory (Proc. Sympos., Durham, 1977)", pp. 137–203, London Mathematical Society Lecture Notes Series, vol. 36,
Cambridge University Press , Cambridge-New York, 1979; ISBN: 0-521-22729-1 ] and the books of Hatcher [A. Hatcher. "Algebraic topology."Cambridge University Press , Cambridge, 2002. ISBN: 0-521-79160-X; 0-521-79540-0 ] , Baumslag [G. Baumslag. "Topics in combinatorial group theory." Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Basel, 1993. ISBN:3-7643-2921-1] , Dicks and Dunwoody [W. Dicks, and M. J. Dunwoody. "Groups acting on graphs." Cambridge Studies in Advanced Mathematics, 17.Cambridge University Press , Cambridge, 1989. ISBN: 0-521-23033-0 ] and Cohen [Daniel E. Cohen. "Combinatorial group theory: a topological approach." London Mathematical Society Student Texts, 14.Cambridge University Press , Cambridge, 1989. ISBN: 0-521-34133-7] .Basic set-up
Graphs in the sense of Serre
Serre's formalism of graphs is slightly different from the standard set up of
Graph theory . Here a graph "A" consists of a "vertex set" "V", an "edge set" "E", an "edge reversal" map such that and for every , and an "initial vertex map" . Thus in "A" every edge "e" comes equipped with its "formal inverse" . The vertex "o"("e") is called the "origin" or the "initial vertex" of "e" and the vertex is called the "terminus" of "e" and is denoted "t"("e"). Both loop-edges (that is, edges "e" such that "o"("e")="t"("e")) andmultiple edge s are allowed. An "orientation" on "A" is a partition of "E" into the union of two disjoint subsets "E"+ and "E"− so that for every edge "e" exactly one of the edges from the pair belongs to "E"+ and the other belongs to "E"−.Graphs of groups
A "
graph of groups " A consists of the following data:
* A connected graph "A";
* An assignment of a "vertex group" "A""v" to every vertex "v" of "A".
* An assignment of an "edge group" "A""v" to every edge "e" of "A" so that we have for every "e"∈"E".
* "Boundary monomorphisms" for all edges "e" of "A", so that each "αe" is aninjective group homomorphism .For every "e"∈"E" the map is also denoted by "ωe".
Fundamental group of a graph of groups
There are two equivalent definitions of the notion of the fundamental group of a graph of groups: the first is a direct algebraic definition via an explicit
group presentation (as a certain iterated application of amalgamated free products andHNN extension s), and the second using the language ofgroupoid s.The algebraic definition is easier to state:
First, choose a
spanning tree "T" in "A" and an orientation on "A". The fundamental group of "A" with respect to "T", denoted , is defined as the quotient of thefree product : where "F"("E") is afree group with free basis "E", subject to the following relations:
* for every "e" in "E" and every . (The so-called "Bass–Serre relation".)
* for every .
* for every edge "e" of the spanning tree "T".There is also a notion of the fundamental group of "A" with respect to a base-vertex , denoted , which is defined using the formalism of
groupoid s. It turns out that for every choice of a base-vertex "v" and every spanning tree "T" in "A" the groups and are naturally isomorphic.Fundamental groups of graphs of groups as iterations of amalgamated products and HNN-extensions
The group defined above admits an algebraic description in terms of iterated amalgamated free products and
HNN extension s. First, form a group "B" as a quotient of the free product:
subject to the relations
*"e"-1"α""e"("g")"e"="ω""e"("g") for every "e" in "E+T" and every .
*"e"=1 for every "e" in "E"+"T".This presentation can be rewritten as:which shows that "B" is an iterated amalgamated free product of the vertex groups "A""v".
Then the group has the presentation
:
which shows that is a multiple
HNN extension of "B" with stable letters .plittings
An isomorphism between a group "G" and the fundamental group of a graph of groups is called a "splitting" of "G". If the edge groups in the splitting come from a particular class of groups (e.g. finite, cyclic, abelian, etc), the splitting is said to be a "splitting over" that class.Thus a splitting where all edge groups are finite is called a splitting over finite groups.
Algebraically, a splitting of "G" with trivial edge groups corresponds to a free product decomposition : where "F"("X") is a
free group with free basis "X"="E"+("A-T") consisting of all positively oriented edges (with respect to some orientation on "A") in the complement of some spanning tree "T" of "A".The normal forms theorem
Let "g" be an element of represented as a product of the form:where "e"1,..., "e""n" is a closed edge-path in "A" with the vertex sequence "v"0, "v"1,...,"vn"="v"0 (that is "v"0="o"("e"1), "v"n="t"("e""n") and "v""i"="t"("e""i")="o"("e""i"+1) for 0 < "i" < "n") and where for "i" = 0, ..., "n".
Suppose that "g" = 1 in "G". Then
*either "n=0" and "a"0=1 in ,
*or "n" > 0 and there is some 0 < "i" < "n" such that and .The normal forms theorem immediately implies that the canonical homomorphisms are injective, so that we can think of the vertex groups "A""v" as subgroups of "G".
Bass–Serre covering trees
To every graph of groups A, with a specified choice of a base-vertex, one can associate a "Bass–Serre covering tree" , which is a tree that comes equipped with a natural
group action of the fundamental group without edge-inversions.Moreover, the quotient graph is isomorphic to "A".Similarly, if "G" is a group acting on a tree "X" without edge-inversions (that is, so that for every edge "e" of "X" and every "g" in "G" we have ), one can define the natural notion of a "quotient graph of groups" A. The underlying graph "A" of A is the quotient graph "X/G". The vertex groups of A are isomorphic to vertex stabilizers in "G" of vertices of "X" and the edge groups of A are isomorphic to edge stabilizers in "G" of edges of "X".
Moreover, if "X" was the Bass–Serre covering tree of a graph of groups A and if then the quotient graph of groups for the action of "G" on "X" can be chosen to be naturally isomorphic to A.
Fundamental theorem of Bass–Serre theory
Let "G" be a group acting on a tree "X" without inversions. Let A be the quotient graph of groups and let "v" be a base-vertex in "A". Then "G" is isomorphic to the group and there is an equivariant isomorphism between the tree "X" and the Bass–Serre covering tree and the tree "X". More precisely, there is a
group isomorphism and a graph isomorphism such that for every "g" in "G", for every vertex "x" of "X" and for every edge "e" of "X" we have "j"("gx") = "g" "j"("x") and "j"("ge") = "g" "j"("e").One of the immediate consequences of the above result is the classic
Kurosh subgroup theorem describing the algebraic structure of subgroups offree product s.Examples
Amalgamated free product
Consider a graph of groups A consisting of a single non-loop edge "e" (together with its formal inverse ) with two distinct end-vertices "u" = "o"("e") and "v" = "t"("e"), vertex groups "H"="A""u", "K"="A""v", an edge group "C"="A""e" and the boundary monomorphisms .Then "T" = "A" is a spanning tree in "A" and the fundamental group is isomorphic to the amalgamated free product
:
In this case the Bass–Serre tree can be described as follows. The vertex set of "X" is the set of
coset s:
Two vertices "gK" and "fH" are adjacent in "X" whenever there exists such that "fH" = "gkH" (or, equivalently, whenever there is such that "gK" = "fhK").
The "G"-stabilizer of every vertex of "X" of type "gK" is equal to "gKg"-1 and the "G"-stabilizer of every vertex of "X" of type "gH" is equal to "gHg"-1. For an edge ["gH", "ghK"] of "X" its "G"-stabilizer is equal to "ghα"("C")"h"-1"g"-1.
For every and the edges ["gH", "ghK"] and ["gH, ghα"("c")"K"] are equal and the degree of the vertex "gH" in "X" is equal to the index ["H":"α"("C")] .Similarly, every vertex of type "gK" has degree ["K":"ω"("C")] in "X".
HNN extension
Let A be a graph of groups consisting of a single loop-edge "e" (together with its formal inverse ), a single vertex "v" = "o"("e") = "t"("e"), a vertex group "B"="A""v", an edge group "C"="A""e" and the boundary monomorphisms .Then "T" = "v" is a spanning tree in "A" and the fundamental group is isomorphic to the
HNN extension :
with the base group "B", stable letter "e" and the associated subgroups "H"="α"("C"), "K"="ω"("C") in "B".The composition is an isomorphism and the above HNN-extension presentation of "G" can be rewritten as
:
In this case the Bass–Serre tree can be described as follows. The vertex set of "X" is the set of
coset s .Two vertices "gB" and "fB" are adjacent in "X" whenever there exists such that either "fB=gbeB" or "fB" = "gbe"−1"B". The "G"-stabilizer of every vertex of "X" is conjugate to "B" in "G" and the stabilizer of every edge of "X" is conjugate to "H" in "G". Every vertex of "X" has degree equal to ["B":"H"] + ["B":"K"] .
A graph with the trivial graph of groups structure
Let A be a graph of groups with underlying graph "A" such that all the vertex and edge groups in A are trivial. Let "v" be a base-vertex in "A". Then "π"1(A,"v") is equal to the
fundamental group "π"1("A","v") of the underlying graph "A" in the standard sense of algebraic topology and the Bass-Serre covering tree is equal to the standarduniversal covering space of "A". Moreover, the action of "π"1(A,"v") on is exactly the standard action of "π"1("A","v") on bydeck transformation s.Basic facts and properties
*If A is a graph of groups with a spanning tree "T" and if , then for every vertex "v" of "A" the canonical homomorphism from "Av" to "G" is injective.
*If is an element of finite order then "g" is conjugate in "G" to an element of finite order in some vertex group "Av".
*If is a finite subgroup then "F" is conjugate in "G" to a subgroup of some vertex group "Av".
*If the graph "A" is finite and all vertex groups "Av" are finite then the group "G" is "virtually free", that is, "G" contains a free subgroup of finite index.
*If "A" is finite and all the vertex groups "Av" are finitely generated then "G" is finitely generated.
*If "A" is finite and all the vertex groups "Av" are finitely presented and all the edge groups "Ae" are finitely generated then "G" is finitely presented.Trivial and nontrivial actions
A graph of groups A is called "trivial" if "A" = "T" is already a tree and there is some vertex "v" of "A" such that . This is equivalent to the condition that "A" is a tree and that for every edge "e" = ["u","z"] of "A" (with "o"("e") = "u", "t"("e") = "z") such that "u" is closer to "v" than "z" we have ["A""z":"ω""e"("A""e")] =1, that is "A""z"="ω""e"("A""e").
An action of a group "G" on a tree "X" without edge-inversions is called "trivial" if there exists a vertex "x" of "X" that is fixed by "G", that is such that "Gx" = "x". It is known that an action of "G" on "X" is trivial if and only if the quotient graph of groups for that action is trivial.
Typically, only nontrivial actions on trees are studied in Bass–Serre theory since trivial graphs of groups do not carry any interesting algebraic information, although trivial actions in the above sense (e. g. actions of groups by automorphisms on rooted trees) may also be interesting for other mathematical reasons.
One of the classic and still important results of the theory is a theorem of Stallings about ends of groups. The theorem states that a
finitely generated group has more than one end if and only if this group admits a nontrivial splitting over finite subroups that is, if and only if the group admits a nontrivial action without inversions on a tree with finite edge stabilizers. [J. R. Stallings. "Groups of cohomological dimension one." in: "Applications of Categorical Algebra (Proc. Sympos. Pure Math., Vol. XVIII, New York, 1968)", pp. 124–128;American Mathematical Society , Providence, R.I, 1970. ]An important general result of the theory states that if "G" is a group with
Kazhdan's property (T) then "G" does not admit any nontrivial splitting, that is, that any action of "G" on a tree "X" without edge-inversions has a global fixed vertex. [Y. Watatani. "Property T of Kazhdan implies property FA of Serre." Mathematica Japonica, vol. 27 (1982), no. 1, pp. 97–103 ]Hyperbolic length functions
Let "G" be a group acting on a tree "X" without edge-inversions.
For every "g"∈"G" put :
Then is called the "translation length" of "g" on "X".
The function:is called the "hyperbolic length function" or the "translation length function" for the action of "G" on "X".
Basic facts regarding hyperbolic length functions
*For "g"∈"G" exactly one of the following holds::(a) and "g" fixes a vertex of "G". In this caled "g" is called an "elliptic" element of "G".:(b) and there is a unique bi-infinite embedded line in "X", called the "axis" of "g" and denoted "Lg" which is "g"-invariant. In this case "g" acts on "Lg" by translation of magnitude and the element "g"∈"G" is called "hyperbolic".
*If then there exists a unique minimal "G"-invariant subtree "XG" of "X". Moreover "XG" is equal to the union of axes of hyperbolic elements of "G".The length-function is said to be "abelian" if it is a
group homomorphism from "G" to and "non-abelian" otherwise. Similarly, the action of "G" on "X" is said to be "abelian" if the associated hyperbolic length function is abelian and is said to be "non-abelian" otherwise.In general, an action of "G" on a tree "X" without edge-inversions is said to be "minimal" if there are no proper "G"-invariant subtrees in "X".
An important fact in the theory says that minimal non-abelian tree actions are uniquely determined by their hyperbolic length functions:
Uniqueness Theorem
Let "G" be a group with two nonabelian minimal actions without edge-inversions on trees "X" and "Y". Suppose that the hyperbolic length functions and on G are equal, that is for every "g"∈"G".Then the actions of "G" on "X" and "Y" are equal in the sense that there exists a
graph isomorphism "f":"X"→"Y" which is "G"-equivariant, that is "f"("gx")="g" "f"("x") for every "g"∈"G" and every "x"∈"VX".Important developments in Bass–Serre theory
Important developments in Bass–Serre theory in the last 30 years include:
*Various "accessibility results" for
finitely presented group s that bound the complexity (that is, the number of edges) in a graph of groups decomposition of a finitely presented group, where some algebraic or geometric restrictions on the types of groups of groups considered are imposed. These results include:
**Dunwoody's theorem about "accessibility" offinitely presented group s [M. J. Dunwoody. "The accessibility of finitely presented groups."Inventiones Mathematicae vol. 81 (1985), no. 3, pp. 449–457] stating that for anyfinitely presented group "G" there exists a bound on the complexity of splittings of "G" over finite subgroups (the splittings are required to satisfy a technical assumption of being "reduced");
**Bestvina–Feighn "generalized accessibility" theorem stating that for any finitely presented group "G" there is a bound on the complexity of reduced splittings of "G" over "small" subgroups (the class of small groups includes, in particular, all groups that do not contain non-abelian free subgroups);
**"Acylindrical accessibility" results for finitely presented (Sela [Z. Sela. "Acylindrical accessibility for groups." Inventiones Mathematicae, vol. 129 (1997), no. 3, pp. 527−565] , Delzant [T. Delzant. "Sur l'accessibilité acylindrique des groupes de présentation finie." Université de Grenoble. Annales de l'Institut Fourier, vol. 49 (1999), no. 4, pp. 1215–1224] ) and finitely generated (Weidmann) groups which bound the complexity of the so-called "acylindrical" splittings, that is splittings where for their Bass–Serre covering trees the diameters of fixed subsets of nontrivial elements of G are uniformly bounded.
*The theory of "JSJ-decompositions" for finitely presented groups. This theory was motivated by the classic notion ofJSJ decomposition in 3-manifold topology and was initiated, in the context ofword-hyperbolic group s, by the work of Sela. JSJ decompositions are splittings of finitely presented groups over some classes of "small" subgroups (cyclic, abelian, noetherian, etc, depending on the version of the theory) that provide a canonical descriptions, in terms of some standard moves, of all splittings of the group over subgroups of the class. There are a number of versions of JSJ-decomposition theories:
**The initial version of Sela for cyclic splittings of torsion-freeword-hyperbolic group s. [ Z. Sela, "Structure and rigidity in (Gromov) hyperbolic groups and discrete groups in rank $1$ Lie groups. II."Geometric and Functional Analysis , vol. 7 (1997), no. 3, pp. 561–593]
**Bowditch's version of JSJ theory for word-hyperbolic groups (with possible torsion) encoding their splittings over virtually cyclic subgroups. [B. H. Bowditch, "Cut points and canonical splittings of hyperbolic groups."Acta Mathematica , vol. 180 (1998), no. 2, pp. 145–186]
**The version of Rips and Sela of JSJ decompositions of torsion-freefinitely presented group s encoding their splittings over free abelian subgroups. [E. Rips, and Z. Sela, "Cyclic splittings of finitely presented groups and the canonical JSJ decomposition."Annals of Mathematics (2) vol. 146 (1997), no. 1, pp. 53–109]
**The version of Dunwoody and Sageev of JSJ decompositions offinitely presented group s over noetherian subgroups. [M. J. Dunwoody, and M. E. Sageev, "JSJ-splittings for finitely presented groups over slender groups."Inventiones Mathematicae , vol. 135 (1999), no. 1, pp. 25–44. ]
**The version of Fujiwara and Papasoglu, also of JSJ decompositions offinitely presented group s over noetherian subgroups. [K. Fujiwara, and P. Papasoglu, "JSJ-decompositions of finitely presented groups and complexes of groups."Geometric and Functional Analysis , vol. 16 (2006), no. 1, pp. 70–125]
**A version of JSJ decomposition theory forfinitely presented group s developed by Scott and Swarup. [Scott, Peter and Swarup, Gadde A."Regular neighbourhoods and canonical decompositions for groups." Astérisque No. 289 (2003). ]
*The theory of lattices in automorphism groups of trees. The theory of "tree lattices" was developed by Bass, Kulkarni and Lubotzky [ H. Bass, and R. Kulkarni. "Uniform tree lattices."Journal of the American Mathematical Society , vol. 3 (1990), no. 4, pp. 843–902 ] [A. Lubotzky. "Tree-lattices and lattices in Lie groups." in "Combinatorial and geometric group theory (Edinburgh, 1993)", pp. 217–232,London Mathematical Society Lecture Notes Series, vol. 204,Cambridge University Press , Cambridge, 1995; ISBN: 0-521-46595-8] by analogy with the theory of lattices inLie group s (that is discrete subgroups ofLie group s of finite co-volume). For a discrete subgroup "G" of the automorphism group of a locally finite tree "X" one can define a natural notion of "volume" for the quotient graph of groups A as :: :The group "G" is called an "X-lattice" if
Wikimedia Foundation. 2010.