Alphabeta Math

Free Groups and Presentations

About this page
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.

✓ 21 results · all verified · 0 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 21 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
2 · Logical flowchart

3 · Items

Definition

Words in an alphabet with formal inverses, elementary cancellation, and reduced words

Definition

Free group on a set of generators

Theorem

Reduced words form the free group on an alphabet

Definition

Group presentation by generators and relations

Theorem

Free groups on the same set are uniquely isomorphic compatibly with their generators

Theorem

Every group admits a presentation

Proposition

Free equivalence is an equivalence relation and concatenation respects it

Definition

The word-quotient model F_word(X):=W(X)/∼ with multiplication induced by concatenation

Theorem

F_word(X) is a group under [w][v]=[wv]

Lemma

Formal letters act by mutually inverse permutations on the set of reduced words

Theorem

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

Theorem

The word-quotient group W(X)/∼ satisfies the universal property of the free group on X

Corollary

The generator map X→ W(X)/∼ is injective

Corollary

The word-quotient and reduced-word models are uniquely isomorphic compatibly with X

Definition

A free basis of a group

Theorem

Any two finite free bases of the same group have the same cardinality

Definition

The rank of a free group admitting a finite basis

Definition

Relators and relations; finitely generated, finitely related, and finite presentations

Proposition

The normal closure of R is the set of finite products of conjugates of elements of R and their inverses

Proposition

In ⟨ X∣ R⟩, the words u and v represent the same element if and only if u⁻¹v∈⟨⟨ R⟩⟩

Theorem

Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group

Corollary

Every finite group has a finite presentation from its multiplication table

Definition

The abelianisation Gᵃᵇ:=G/[G,G] and its canonical map

Definition

Free abelian group on a set

Theorem

The abelianisation of a free group on X is a free abelian group on X

Definition

Tietze transformations: dictionary generators, redundant relators, renaming, and their inverses

Proposition

Each Tietze transformation preserves the isomorphism type of the presented group

Theorem

Two finite presentations define isomorphic groups if and only if a finite sequence of Tietze transformations and inverses connects them

Definition

Cyclically reduced words

Lemma

Every nonempty reduced word has the form tct⁻¹ with c nonempty and cyclically reduced

Theorem

Free groups are torsion-free

Theorem

Two cyclically reduced words in a free group are conjugate if and only if one is a cyclic permutation of the other

Sources