Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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 G be a graph of groups on X, let T be a maximal subtree, and write Γ=π1(G,T). By Vertex groups embed in the fundamental group of a graph of groups, regard each vertex group Gv as a subgroup of Γ. For an oriented edge e, the injective boundary map identifies Ge with a subgroup of Go(e) and hence of Γ. The cosets below use these canonical embeddings.

The Bass-Serre tree X~ has:

  • vertices the left cosets Γ/Gv for vertices v of X,
  • edges the left cosets Γ/Ge for oriented edges e of X.

For an oriented edge e, define incidence and edge reversal by

o(γGe)=γGo(e),t(γGe)=γe Gt(e),γGe‾=γe Geˉ.

These are independent of the chosen representative γ. Every other representative is γαe(a) for some a∈Ge, where Ge in the coset denotes its origin image αe(Ge). The origin coset is unchanged because αe(a)∈Go(e). The path-group relation

e αeˉ(a) eˉ=αe(a)

of The path group of a graph of groups is equivalent to αe(a)e=eαeˉ(a). Hence γαe(a)e=γeαeˉ(a), which has the same coset modulo Gt(e) and the same coset modulo the opposite edge image αeˉ(Ge). Thus both the terminus and edge-reversal formulas are independent of the representative. Applying reversal twice gives γeeˉGe=γGe.

Depends on

Used by

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