Math 2.0

Group theory and generalizations Definition

Graph of groups

Builds on GraphTreeGroupGroup homomorphismPresentation of a groupFree product

Definition

A graph in the sense of Serre consists of a set VV of vertices and a set EE of oriented edges. It comes with a map e↦eˉe \mapsto \bar e from EE to EE with eˉˉ=e\bar{\bar e} = e and eˉ≠e\bar e \neq e, and maps o,t ⁣:E→Vo, t \colon E \to V with o(eˉ)=t(e)o(\bar e) = t(e). A graph of groups 𝔾\mathbb{G} consists of:

  1. a connected graph YY in this sense;
  2. a group GvG_v for each vertex vv;
  3. a group GeG_e for each edge ee, with Geˉ=GeG_{\bar e} = G_e;
  4. an injective homomorphism αe ⁣:Ge→Gt(e)\alpha_e \colon G_e \to G_{t(e)} for each edge ee.

Let TT be a maximal tree in YY. Form the free product of the groups GvG_v and of the free group on symbols tet_e, e∈Ee \in E. The fundamental group π1(𝔾,T)\pi_1(\mathbb{G}, T) is its quotient by the relations

  • teˉ=te−1t_{\bar e} = t_e^{-1} for each edge ee;
  • te αe(g) te−1=αeˉ(g)t_e \, \alpha_e(g) \, t_e^{-1} = \alpha_{\bar e}(g) for each edge ee and each g∈Geg \in G_e;
  • te=1t_e = 1 for each edge ee of TT.

Remarks

Up to isomorphism, π1(𝔾,T)\pi_1(\mathbb{G}, T) does not depend on the choice of TT, and each GvG_v embeds in it.

Example: YY has two vertices u,vu, v and one pair of edges e,eˉe, \bar e from uu to vv, with Gu=AG_u = A, Gv=BG_v = B and Ge=CG_e = C. Then T=YT = Y, all tet_e are trivial, and the relations identify αeˉ(c)∈A\alpha_{\bar e}(c) \in A with αe(c)∈B\alpha_e(c) \in B; so π1(𝔾,T)\pi_1(\mathbb{G}, T) is the amalgamated free product A∗CBA *_C B.

Example: YY has one vertex vv and a loop ee, with Gv=AG_v = A and Ge=CG_e = C. Then T={v}T = \set{v}, and π1(𝔾,T)\pi_1(\mathbb{G}, T) is generated by AA and t=tet = t_e with t αe(c) t−1=αeˉ(c)t \, \alpha_e(c) \, t^{-1} = \alpha_{\bar e}(c); this is the HNN extension of AA along the isomorphism αe(C)→αeˉ(C)\alpha_e(C) \to \alpha_{\bar e}(C).

Non-example: if some map αe\alpha_e is not injective, clause 4 fails, and the data is not a graph of groups; the vertex groups need not embed in the resulting quotient.

When all vertex and edge groups are trivial, π1(𝔾,T)\pi_1(\mathbb{G}, T) is the free group on the edges of YY outside TT, one generator for each pair e,eˉe, \bar e. This is the fundamental group of YY as a topological graph.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Free product concept
  2. Graph concept
  3. Group concept
  4. Group homomorphism concept
  5. Presentation of a group concept
  6. Tree concept
  7. Graph of groups definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Graph_of_groups
About this page
Tag11MVWQ5R31
URIm2://11MVWQ5R31
Kinddefinition
WritingW0 stub
MSC20E08, 20E06
DefinesGraph of groups
UsesGraph, Tree, Group, Group homomorphism, Presentation of a group, Free product
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.