How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Graphs of Groups and Bass Serre Theory - Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Free Groups and Presentations
- Free Products and Amalgamation
- Graphs of Groups and Bass Serre Theory
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hnn Extensions and Brittons Lemma
- Normal Subgroups and Quotient Groups
- Relations, Functions, and Quotients
- Simplicial Trees and Group Actions
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
These examples make the abstract constructions visible: the free-product tree, an amalgam tree, the Bass-Serre tree of a Baumslag-Solitar group, one quotient graph basis for a free action, one explicit Kurosh decomposition, and one virtually free example from finite vertex groups. The counterexample shows why quotient graph data without stabilizers is not enough.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The Bass-Serre tree of a free product
Example
For a free product , the Bass-Serre tree has vertex set and one edge for each left coset of the trivial amalgamating subgroup.
Facts & Assumptions
Given: The Bass-Serre construction for a graph of groups.
The Bass-Serre tree uses cosets of vertex groups for vertices and cosets of edge groups for edges. (The Bass-Serre tree of a graph of groups)
The fundamental group acts on that tree with quotient the underlying graph. (The fundamental group acts without inversions on its Bass-Serre tree)
Verification
View as the graph of groups with two vertices, vertex groups and , and one trivial edge group between them. Then [L1] gives vertex cosets and , while the edge cosets are just the elements of itself.
By [L2], the quotient is a single segment. Thus each edge joins one -coset to one -coset, giving the usual bipartite Bass-Serre tree of the free product.
The Bass-Serre tree of an amalgamated free product
Example
For an amalgamated free product , the Bass-Serre tree has vertices the left cosets of and and edges the left cosets of .
Facts & Assumptions
Given: The one-segment graph-of-groups description of an amalgamated free product.
A one-segment graph of groups yields an amalgamated free product. (A one-segment graph of groups gives an amalgamated free product)
In the Bass-Serre tree, vertices are cosets of vertex groups and edges are cosets of edge groups. (The Bass-Serre tree of a graph of groups)
Verification
Realize by the one-segment graph of groups from [L1]. Then [L2] says the two vertex orbits are and , while the edge orbit is .
The edge coset joins the vertices and , so the tree records exactly how the amalgamating subgroup sits in the two factors.
The Bass-Serre tree of a Baumslag-Solitar group
Example
For nonzero integers , the Baumslag-Solitar group
is the fundamental group of a one-loop graph of groups with vertex group and edge group , where the two boundary maps are and .
Facts & Assumptions
Given: Nonzero integers and the one-loop graph-of-groups description of HNN extensions.
A one-loop graph of groups yields the corresponding HNN extension. (A one-loop graph of groups gives an HNN extension)
The Bass-Serre tree uses cosets of the vertex and edge groups. (The Bass-Serre tree of a graph of groups)
Verification
Because , the maps , and , are injective. Applying [L1] to these two monomorphisms gives exactly the presentation of .
Therefore [L2] describes its Bass-Serre tree: vertices are left cosets of the vertex copy of , edges are left cosets of the edge copy of , and the stable letter translates between adjacent levels of this tree.
A free action and the quotient-graph basis
Example
Let act on the bi-infinite line by translation . Then the quotient graph is a single loop, and the resulting basis of the acting group has one generator.
Facts & Assumptions
Given: The quotient graph of an action without inversions.
A group acting freely without inversions on a tree is free. (A group acting freely without inversions on a tree is free)
The quotient graph records vertex and edge orbits of the action. (The quotient graph of an action without inversions)
Verification
Translation by one step on the bi-infinite line has one vertex orbit and one edge orbit, so by [L2] the quotient graph is a single loop. The action is free and without inversions.
Therefore [L1] identifies the acting group with a free group on one generator, namely the loop edge of the quotient graph. This recovers .
A Kurosh decomposition of a subgroup of a free product
Example
Let and let be the first factor. Then the Kurosh decomposition of is just itself, with trivial free part.
Facts & Assumptions
Given: The Kurosh subgroup theorem.
A subgroup of a free product is a free product of intersections with conjugates of the factors together with a free group. (Kurosh subgroup theorem)
Verification
The subgroup already is one of the free-product factors of . Therefore one of the Kurosh intersection terms in [L1] is exactly .
No further nontrivial intersection factor is needed, and there is no free remainder. So the Kurosh decomposition here is the tautological one .
A graph of finite groups giving a virtually free group
Example
The one-segment graph of groups with vertex groups and and trivial edge group has fundamental group , and this group is virtually free.
Facts & Assumptions
Given: The graph of groups with vertex groups and and trivial edge group.
The graph-of-groups fundamental group acts on its Bass-Serre tree, with vertex and edge stabilizers conjugate to the chosen groups. (The fundamental group acts without inversions on its Bass-Serre tree)
A group acting freely without inversions on a tree is free. (A group acting freely without inversions on a tree is free)
Verification
By [L1], the fundamental group acts on its Bass-Serre tree with vertex stabilizers conjugate to and and trivial edge stabilizers. The canonical surjection has finite image of order , so its kernel has index . Because this quotient map is injective on each factor, meets every conjugate of and trivially.
The subgroup therefore acts freely on the same tree, so [L2] makes a free group. Since has finite index in , the group is virtually free.
The underlying quotient graph does not determine the acting group
Statement refuted
The underlying quotient graph of a tree action determines the acting group.
Facts & Assumptions
Given: Bass-Serre structure recovers a group from a graph of groups, not from the quotient graph alone.
The acting group is recovered from the quotient graph together with its stabilizer data. (Bass-Serre structure theorem)
Counterexample
Take the same one-loop quotient graph twice. In one graph of groups put the trivial vertex group and trivial edge group; the resulting group is . In the other put vertex group and trivial edge group; the resulting group is .
The quotient graphs are identical but the resulting groups are not isomorphic, so the quotient graph alone does not determine the acting group.