Math 2.0

Lemma

Whitehead's "Peak Reduction Lemma"

Statement

The following statement is referred to as Whitehead's "Peak Reduction Lemma", see Proposition 4.20 in and Proposition 1.2 in:

Let w∈Fnw\in F_n. Then the following hold:

  1. If [w][w] is not automorphically minimal, then there exists a Whitehead automorphism τ∈Aut⁡(Fn)\tau\in \operatorname{Aut}(F_n) such that ∥τ(w)∥X<∥w∥X\|\tau(w)\|_X< \|w\|_X.
  2. Suppose that [w][w] is automorphically minimal, and that another conjugacy class [w′][w'] is also automorphically minimal. Then Aut⁡(Fn)w=Aut⁡(Fn)w′\operatorname{Aut}(F_n)w=\operatorname{Aut}(F_n)w' if and only if ∥w∥X=∥w′∥X\|w\|_X=\|w'\|_X and there exists a finite sequence of Whitehead moves τ1,…,τk∈Aut⁡(Fn)\tau_1,\dots, \tau_k\in\operatorname{Aut}(F_n) such that τk⋯τ1(w)=w′\tau_k\cdots \tau_1(w)=w' and ∥τi⋯τ1(w)∥X=∥w∥X for i=1,…,k.\|\tau_i\cdots\tau_1(w)\|_X=\|w\|_X \text{ for } i=1,\dots, k.

Part (1) of the Peak Reduction Lemma implies that a conjugacy class [w][w] is Whitehead minimal if and only if it is automorphically minimal.

Further reading

  1. Wikipedia, page 60327286, revision 1358691180, Whitehead's algorithm, section Whitehead's algorithm > Whitehead's "Peak Reduction Lemma". adopted
About this page
TagDB1BZZJN86
URIm2://DB1BZZJN86
Kindstatement, lemma
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status DB1BZZJN86.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (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.