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.
Bass-Serre structure theorem
Statement
Let a group act without inversions on a simplicial tree . Let be the quotient graph of groups built from this action, and let be a maximal subtree of the quotient graph. Then
Moreover the Bass-Serre tree of is -equivariantly isomorphic to the original tree .
Facts & Assumptions
Given: A group acting without inversions on a simplicial tree , its quotient graph of groups , and a maximal subtree of the quotient graph.
The quotient graph-of-groups construction records vertex and edge stabilizers together with the boundary monomorphisms induced by chosen lifts, with connecting elements satisfying . (The quotient graph of groups attached to a tree action)
The path group is generated by the vertex groups and oriented edges, subject to the reversal and edge-group conjugacy relations. (The path group of a graph of groups)
The relative fundamental group is obtained by killing the edges of the chosen maximal subtree. (The fundamental group of a graph of groups relative to a maximal tree)
The Bass-Serre tree has vertices and edges given by cosets of the vertex and edge groups. (The Bass-Serre tree of a graph of groups)
Every element of the graph-of-groups fundamental group has a reduced representative, and a reduced word is trivial only in the edge-length- identity case. (Normal form for the fundamental group of a graph of groups)
The Bass-Serre coset graph is a tree. (The Bass-Serre coset graph is a tree)
Proof
Choose the lift data from [L1] successively along the maximal subtree so that every tree edge has connecting element . Send each chosen vertex stabilizer element to itself in and each oriented edge symbol to the corresponding . The identity from [L1] respects the reversal relation, and the definition of the boundary map respects the conjugacy relation of [L2], so this defines a homomorphism from the path group to . Because every tree edge maps to , [L3] yields a homomorphism
Fix a chosen lift of some quotient vertex . Let . The unique path in the tree from to projects to an edge path in the quotient graph. Inductively along that path, choose stabilizer elements at the intermediate chosen lifts so that the th lifted edge is and its terminal vertex is . At the end one obtains . Hence is surjective.
Let be the Bass-Serre tree of . Using [L4], define This is well defined because the vertex and edge groups in [L1] are actual stabilizer subgroups of the chosen lifts, and the incidence formulas of [L4] match the connecting elements by construction.
The map is -equivariant by definition. At a chosen vertex coset , the incident edges of above an oriented quotient edge are the cosets with , and sends them bijectively to the incident edges at the chosen lift . By equivariance the same holds at every vertex. Since [L6] says is a tree and step 2.1 shows that every translate of every chosen lift lies in the image, is a covering map from a connected tree onto the tree , hence an isomorphism of graphs.
Let satisfy . By [L5], choose a reduced closed graph-of-groups word representing . Under the map of step 2.2, its closed edge path begins and ends over the same quotient vertex, and the endpoint is the -translate of the starting point. Thus it traces a closed path in . If the word had positive edge length, this would be a nontrivial reduced closed path in the tree , impossible. Therefore the reduced representative has edge length , so by the length- clause of [L5] it is just one coefficient from a chosen vertex stabilizer. But restricts on each vertex group to the actual inclusion into , so forces that coefficient to be the identity. Hence , and is injective.
Steps 2.1 and 3.2 show that is an isomorphism, and step 3.1 gives the -equivariant identification of the Bass-Serre tree with the original tree. This proves both claims.
Depends on
Used by
- A group acting freely without inversions on a tree is free Corollary
- The underlying quotient graph does not determine the acting group Counterexample
- FALSE: the quotient graph determines the acting group without stabilizer data False statement
- A one-loop graph of groups gives an HNN extension Theorem
- A one-segment graph of groups gives an amalgamated free product Theorem
- Different maximal trees give isomorphic graph-of-groups fundamental groups Theorem
- Kurosh subgroup theorem Theorem
Dependency tree · two levels
16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jean-Pierre Serre, Trees (standard reference, not scraped)
- C. Loh, Geometric Group Theory: An Introduction (2015 course version) (standard reference, not scraped)