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 fundamental group acts without inversions on its Bass-Serre tree
Statement
Let and let be its Bass-Serre tree. Then:
- acts on by left multiplication on cosets.
- The action is without inversions.
- The quotient graph is the original underlying graph .
- The stabilizer of a vertex coset is , and the stabilizer of an edge coset is .
Facts & Assumptions
Given: A graph of groups , a maximal subtree , and .
The Bass-Serre graph has vertices and edges given by left cosets, with the stated origin and terminus maps. (The Bass-Serre tree of a graph of groups)
That coset graph is a tree. (The Bass-Serre coset graph is a tree)
Points in the same orbit have conjugate stabilizers. (If , then )
Proof
Left multiplication and is well defined on the cosets of [L1], and the formulas for origin and terminus in [L1] are preserved by that multiplication. So acts by graph automorphisms on .
The orbit of the base vertex coset is the set of all cosets , so the quotient vertices are identified with the original vertices ; the same holds for edges. Hence the quotient graph is exactly . An inversion would send some oriented edge coset to its reverse, which would force the two opposite orientations of one edge of into the same orbit; that does not happen in the quotient description.
The stabilizer of the base vertex coset is itself, and similarly for . Therefore [L3] gives and for arbitrary cosets in the same orbits.
Combining steps 1.1, 2.1, and 2.2 with [L2] proves all four claims.
Depends on
Used by
- The fundamental group of a graph with trivial groups is free Corollary
- A graph of finite groups giving a virtually free group Example
- The Bass-Serre tree of a free product Example
- FALSE: every tree action is free False statement
- FALSE: the quotient graph determines the acting group without stabilizer data False statement
- FALSE: vertex stabilizers are literally the chosen vertex groups without conjugacy ambiguity False statement
- Different maximal trees give isomorphic graph-of-groups fundamental groups Theorem
- Kurosh subgroup theorem Theorem
Dependency tree · two levels
10 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)