Bass-Serre trees are a construction from the mathematical branch of group theory with which group effects of amalgamated products or, more generally, fundamental groups of graphs of groups on trees can be constructed.
They are named after Hyman Bass and Jean-Pierre Serre .
definition
Let it be a graph of groups and its fundamental group . The corresponding Bass Serre tree is constructed as follows:
(
E.
,
K
,
{
G
e
}
e
∈
E.
,
{
G
k
}
k
∈
K
,
{
α
k
,
i
:
G
k
→
G
e
i
}
k
=
(
e
0
,
e
1
)
∈
K
,
i
=
0
,
1
)
{\ displaystyle (E, K, \ left \ {G_ {e} \ right \} _ {e \ in E}, \ left \ {G_ {k} \ right \} _ {k \ in K}, \ left \ {\ alpha _ {k, i} \ colon G_ {k} \ to G_ {e_ {i}} \ right \} _ {k = (e_ {0}, e_ {1}) \ in K, i = 0.1})}
G
{\ displaystyle G}
T
{\ displaystyle T}
the corners are
⨆
e
∈
E.
G
/
G
e
{\ displaystyle \ bigsqcup _ {e \ in E} G / G_ {e}}
the edges are
⨆
k
∈
K
G
/
G
k
{\ displaystyle \ bigsqcup _ {k \ in K} G / G_ {k}}
the edge has the corners and , for
[
G
]
∈
G
/
G
k
{\ displaystyle \ left [g \ right] \ in G / G_ {k}}
[
G
]
∈
G
/
G
e
0
{\ displaystyle \ left [g \ right] \ in G / G_ {e_ {0}}}
[
G
k
]
∈
G
/
G
e
1
{\ displaystyle \ left [gk \ right] \ in G / G_ {e_ {1}}}
k
=
(
e
0
,
e
1
)
∈
K
{\ displaystyle k = (e_ {0}, e_ {1}) \ in K}
The group acts on through left multiplications on and .
G
{\ displaystyle G}
T
{\ displaystyle T}
G
/
G
e
{\ displaystyle G / G_ {e}}
G
/
G
k
{\ displaystyle G / G_ {k}}
T
{\ displaystyle T}
is a tree.
Structure set
Let it be a graph of groups and its Bass-Serre tree. Then the stabilizers of corners or edges are isomorphic to or for or and the quotient is the graph underlying the graph of groups .
(
E.
,
K
,
{
G
e
}
e
∈
E.
,
{
G
k
}
k
∈
K
,
{
α
k
,
i
:
G
k
→
G
e
i
}
k
=
(
e
0
,
e
1
)
∈
K
,
i
=
0
,
1
)
{\ displaystyle (E, K, \ left \ {G_ {e} \ right \} _ {e \ in E}, \ left \ {G_ {k} \ right \} _ {k \ in K}, \ left \ {\ alpha _ {k, i} \ colon G_ {k} \ to G_ {e_ {i}} \ right \} _ {k = (e_ {0}, e_ {1}) \ in K, i = 0.1})}
T
{\ displaystyle T}
e
~
{\ displaystyle {\ tilde {e}}}
k
~
{\ displaystyle {\ tilde {k}}}
G
e
{\ displaystyle G_ {e}}
G
k
{\ displaystyle G_ {k}}
e
=
[
e
~
]
{\ displaystyle e = \ left [{\ tilde {e}} \ right]}
k
=
[
k
~
]
{\ displaystyle k = \ left [{\ tilde {k}} \ right]}
G
∖
T
{\ displaystyle G \ backslash T}
(
E.
,
K
)
{\ displaystyle (E, K)}
Examples
The following two graphs are the Bass-Serre trees of a free product and an HNN extension, respectively .
Free Product Bass Serre Tree :
Z
/
2
Z
∗
Z
/
3
Z
≃
P
S.
L.
(
2
,
Z
)
{\ displaystyle \ mathbb {Z} / 2 \ mathbb {Z} * \ mathbb {Z} / 3 \ mathbb {Z} \ simeq PSL (2, \ mathbb {Z})}
Bass Serre Tree of the Baumslag Solitar Group :
B.
S.
(
1
,
2
)
=
⟨
a
,
t
:
t
a
t
-
1
=
a
2
⟩
{\ displaystyle BS (1,2) = \ langle a, t \ colon tat ^ {- 1} = a ^ {2} \ rangle}
literature
Jean-Pierre Serre : Trees. Translated from the French original by John Stillwell. Corrected 2nd printing of the 1980 English translation. Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2003. ISBN 3-540-44237-5
Web links
Richard Weidmann: Bass-Serre theory ( Memento from February 19, 2015 in the Internet Archive )
Individual evidence
↑ Serre, op.cit., Theorem 12 in Chapter I.
↑ Weidmann, op.cit., Chapter 5
<img src="https://de.wikipedia.org//de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">