Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29
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.

A one-segment graph of groups gives an amalgamated free product

Statement

If a graph of groups has two vertices joined by one geometric edge and that edge lies in the chosen maximal subtree, then its fundamental group is the amalgamated free product of the two vertex groups over the edge group.

Facts & Assumptions

Given: A one-segment graph of groups with vertex groups A,B and edge group C.

[L1]

A free product with amalgamation is the pushout of the two injective edge maps CA and CB. (Free products with amalgamation along monomorphisms)

[L2]

The relative fundamental group is obtained from the path group by killing the chosen tree edge. (The fundamental group of a graph of groups relative to a maximal tree)

Proof

technique · direct
1.1

Because the unique geometric edge belongs to the maximal subtree, [L2] kills the edge symbol. The only remaining generators are the two vertex groups, and the only remaining cross relation is that the two images of the edge group agree.

L2given
2.1

That is exactly the pushout presentation named in [L1], so the fundamental group of the one-segment graph of groups is ACB.

L1step 1.1

Depends on

Used by

Dependency tree · two levels

12 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