Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11
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 free group on the empty set is the trivial group

Example

Every free group on the empty set is trivial: it has exactly one element.

Facts & Assumptions

[L1]

Every class in W(X)/∼ contains exactly one reduced word (Every class in W(X)/∼ contains exactly one reduced word).

[L2]

If (F,i) and (F′,i′) are free groups on the same set X, then there is a unique group isomorphism ϕ:F→F′ with ϕ∘i=i′ (Free groups on the same set are uniquely isomorphic compatibly with their generators).

[L3]

The word-quotient group W(X)/∼, with x↦[x], is a free group on X (The word-quotient group W(X)/∼ satisfies the universal property of the free group on X).

Verification

technique · direct
1.1

On the empty alphabet, the empty word is the only finite word and hence the only reduced word; by [L1], Fword(∅) has the single class [ε].

L1given
2.1

That class is the identity, so Fword(∅) has exactly one element.

step 1.1given
3.1

By [L3] this model is a free group on ∅, so [L2] makes every free group on ∅ isomorphic to it; an isomorphism is a bijection, so every free group on ∅ has exactly one element and is trivial.

L2L3step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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