Math 2.0

Group theory and generalizations Definition

Small cancellation theory

Builds on Free groupPresentation of a group

Definition

Let F(S)F(S) be the free group on a set SS, with elements written as freely reduced words. Let ∣w∣\abs{w} be the length of a word ww. A set RR of cyclically reduced words in F(S)F(S) is symmetrized if it is closed under taking inverses and cyclic permutations. Let RR be symmetrized. A piece relative to RR is a nonempty word uu such that two distinct elements r1≠r2r_1 \ne r_2 of RR both begin with uu. That is, r1=uv1r_1 = u v_1 and r2=uv2r_2 = u v_2 with no cancellation.

  1. Let λ\lambda be a real number with 0<λ<10 < \lambda < 1. Then RR satisfies the condition C′(λ)C'(\lambda) if ∣u∣<λ∣r∣\abs{u} < \lambda \abs{r} whenever r∈Rr \in R and r=uvr = u v with uu a piece.
  2. For an integer p≥2p \ge 2, RR satisfies the condition C(p)C(p) if no element of RR is a product of fewer than pp pieces.

A presentation ⟨S∣R0⟩\langle S \mid R_0 \rangle is a small cancellation presentation of type C′(λ)C'(\lambda) or C(p)C(p) if the symmetrized closure of R0R_0 satisfies the condition. Small cancellation theory is the study of groups with such presentations.

Remarks

The condition C′(λ)C'(\lambda) implies C(p)C(p) for pp with λ≤1/(p−1)\lambda \le 1/(p-1); in particular C′(1/6)C'(1/6) implies C(7)C(7). Greendlinger's lemma: if RR satisfies C′(1/6)C'(1/6) and a nontrivial reduced word ww equals 11 in ⟨S∣R⟩\langle S \mid R \rangle, then ww contains a subword of some r∈Rr \in R of length greater than ∣r∣/2\abs{r}/2.

Example: let S={a,b,c,d}S = \set{a, b, c, d} and r=aba−1b−1cdc−1d−1r = a b a^{-1} b^{-1} c d c^{-1} d^{-1}. In rr and its cyclic permutations each two-letter subword occurs once, and no two-letter subword of r−1r^{-1} or of its cyclic permutations occurs in rr. So all pieces have length 11, and 1<16⋅81 < \frac{1}{6} \cdot 8, so the presentation satisfies C′(1/6)C'(1/6).

Non-example: ⟨a,b∣aba−1b−1⟩\langle a, b \mid a b a^{-1} b^{-1} \rangle, a presentation of ℤ2\Z^2, does not satisfy C′(1/6)C'(1/6). Each letter is a piece, but the relator has length 44 and 1≥16⋅41 \ge \frac{1}{6} \cdot 4.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Free group concept
  2. Presentation of a group concept
  3. Small cancellation theory definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Small_cancellation_theory
About this page
TagPW2TVRD47Y
URIm2://PW2TVRD47Y
Kinddefinition
WritingW0 stub
MSC20F06, 20F05
DefinesSmall cancellation theory
UsesFree group, Presentation of a group
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.