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.
The Bass-Serre tree of a graph of groups
Definition
Let be a graph of groups on , let be a maximal subtree, and write . By Vertex groups embed in the fundamental group of a graph of groups, regard each vertex group as a subgroup of . For an oriented edge , the injective boundary map identifies with a subgroup of and hence of . The cosets below use these canonical embeddings.
The Bass-Serre tree has:
- vertices the left cosets for vertices of ,
- edges the left cosets for oriented edges of .
For an oriented edge , define incidence and edge reversal by
These are independent of the chosen representative : replacing by with leaves the origin coset unchanged because , and leaves the terminus coset unchanged because the edge relation identifies with inside . The same relation makes the reversal formula independent of the representative, and applying reversal twice gives .
Depends on
Used by
- The Bass-Serre tree of a Baumslag-Solitar group Example
- The Bass-Serre tree of a free product Example
- The Bass-Serre tree of an amalgamated free product Example
- The Bass-Serre coset graph is a tree Lemma
- Bass-Serre structure theorem Theorem
- Different maximal trees give isomorphic graph-of-groups fundamental groups Theorem
- The fundamental group acts without inversions on its Bass-Serre tree Theorem
Dependency tree · two levels
8 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)