Alphabeta Math
Session-authored (Fable 5 assisted)
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.

7 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Graphs of Groups and Bass Serre Theory - Examples

1 · Prerequisites

2 · Summary

These examples make the abstract constructions visible: the free-product tree, an amalgam tree, the Bass-Serre tree of a Baumslag-Solitar group, one quotient graph basis for a free action, one explicit Kurosh decomposition, and one virtually free example from finite vertex groups. The counterexample shows why quotient graph data without stabilizers is not enough.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

The Bass-Serre tree of a free product

Example

For a free product AB, the Bass-Serre tree has vertex set (AB)/A    (AB)/B and one edge for each left coset of the trivial amalgamating subgroup.

Facts & Assumptions

Given: The Bass-Serre construction for a graph of groups.

[L1]

The Bass-Serre tree uses cosets of vertex groups for vertices and cosets of edge groups for edges. (The Bass-Serre tree of a graph of groups)

[L2]

The fundamental group acts on that tree with quotient the underlying graph. (The fundamental group acts without inversions on its Bass-Serre tree)

Verification

technique · direct
1.1

View AB as the graph of groups with two vertices, vertex groups A and B, and one trivial edge group between them. Then [L1] gives vertex cosets (AB)/A and (AB)/B, while the edge cosets are just the elements of AB itself.

L1given
2.1

By [L2], the quotient is a single segment. Thus each edge joins one A-coset to one B-coset, giving the usual bipartite Bass-Serre tree of the free product.

L2step 1.1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The Bass-Serre tree of an amalgamated free product

Example

For an amalgamated free product ACB, the Bass-Serre tree has vertices the left cosets of A and B and edges the left cosets of C.

Facts & Assumptions

Given: The one-segment graph-of-groups description of an amalgamated free product.

[L1]

A one-segment graph of groups yields an amalgamated free product. (A one-segment graph of groups gives an amalgamated free product)

[L2]

In the Bass-Serre tree, vertices are cosets of vertex groups and edges are cosets of edge groups. (The Bass-Serre tree of a graph of groups)

Verification

technique · direct
1.1

Realize ACB by the one-segment graph of groups from [L1]. Then [L2] says the two vertex orbits are (ACB)/A and (ACB)/B, while the edge orbit is (ACB)/C.

L1L2given
2.1

The edge coset γC joins the vertices γA and γB, so the tree records exactly how the amalgamating subgroup sits in the two factors.

step 1.1algebra
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

The Bass-Serre tree of a Baumslag-Solitar group

Example

For nonzero integers m,n, the Baumslag-Solitar group

BS(m,n)=a,ttamt1=an

is the fundamental group of a one-loop graph of groups with vertex group Z and edge group Z, where the two boundary maps are kmk and knk.

Facts & Assumptions

Given: Nonzero integers m,n and the one-loop graph-of-groups description of HNN extensions.

[L1]

A one-loop graph of groups yields the corresponding HNN extension. (A one-loop graph of groups gives an HNN extension)

[L2]

The Bass-Serre tree uses cosets of the vertex and edge groups. (The Bass-Serre tree of a graph of groups)

Verification

technique · direct
1.1

Because m,n0, the maps ZZ, kmk and knk, are injective. Applying [L1] to these two monomorphisms gives exactly the presentation of BS(m,n).

L1givenalgebra
2.1

Therefore [L2] describes its Bass-Serre tree: vertices are left cosets of the vertex copy of Z, edges are left cosets of the edge copy of Z, and the stable letter translates between adjacent levels of this tree.

L2step 1.1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

A free action and the quotient-graph basis

Example

Let Z act on the bi-infinite line by translation nn+1. Then the quotient graph is a single loop, and the resulting basis of the acting group has one generator.

Facts & Assumptions

Given: The quotient graph of an action without inversions.

[L1]

A group acting freely without inversions on a tree is free. (A group acting freely without inversions on a tree is free)

[L2]

The quotient graph records vertex and edge orbits of the action. (The quotient graph of an action without inversions)

Verification

technique · direct
1.1

Translation by one step on the bi-infinite line has one vertex orbit and one edge orbit, so by [L2] the quotient graph is a single loop. The action is free and without inversions.

L2given
2.1

Therefore [L1] identifies the acting group with a free group on one generator, namely the loop edge of the quotient graph. This recovers Z.

L1step 1.1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

A Kurosh decomposition of a subgroup of a free product

Example

Let G=C2C3 and let H=C2 be the first factor. Then the Kurosh decomposition of H is just H itself, with trivial free part.

Facts & Assumptions

Given: The Kurosh subgroup theorem.

[L1]

A subgroup of a free product is a free product of intersections with conjugates of the factors together with a free group. (Kurosh subgroup theorem)

Verification

technique · direct
1.1

The subgroup H=C2 already is one of the free-product factors of G=C2C3. Therefore one of the Kurosh intersection terms in [L1] is exactly H.

L1given
2.1

No further nontrivial intersection factor is needed, and there is no free remainder. So the Kurosh decomposition here is the tautological one HC2.

step 1.1algebra
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

A graph of finite groups giving a virtually free group

Example

The one-segment graph of groups with vertex groups C2 and C3 and trivial edge group has fundamental group C2C3, and this group is virtually free.

Facts & Assumptions

Given: The graph of groups with vertex groups C2 and C3 and trivial edge group.

[L1]

The graph-of-groups fundamental group acts on its Bass-Serre tree, with vertex and edge stabilizers conjugate to the chosen groups. (The fundamental group acts without inversions on its Bass-Serre tree)

[L2]

A group acting freely without inversions on a tree is free. (A group acting freely without inversions on a tree is free)

Verification

technique · direct
1.1

By [L1], the fundamental group Γ=C2C3 acts on its Bass-Serre tree with vertex stabilizers conjugate to C2 and C3 and trivial edge stabilizers. The canonical surjection ΓC2×C3 has finite image of order 6, so its kernel Γ0 has index 6. Because this quotient map is injective on each factor, Γ0 meets every conjugate of C2 and C3 trivially.

L1given
2.1

The subgroup Γ0 therefore acts freely on the same tree, so [L2] makes Γ0 a free group. Since Γ0 has finite index in Γ, the group C2C3 is virtually free.

L2step 1.1
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

The underlying quotient graph does not determine the acting group

Statement refuted

The underlying quotient graph of a tree action determines the acting group.

Facts & Assumptions

Given: Bass-Serre structure recovers a group from a graph of groups, not from the quotient graph alone.

[L1]

The acting group is recovered from the quotient graph together with its stabilizer data. (Bass-Serre structure theorem)

Counterexample

technique · direct
1.1

Take the same one-loop quotient graph twice. In one graph of groups put the trivial vertex group and trivial edge group; the resulting group is Z. In the other put vertex group C2 and trivial edge group; the resulting group is C2Z.

L1given
2.1

The quotient graphs are identical but the resulting groups are not isomorphic, so the quotient graph alone does not determine the acting group.

step 1.1algebra

Sources