= Greendlinger lemma
{c}
= Greendlinger theorem
{c}
{synonym}
= Greendlinger's lemma
{c}
{synonym}
For the <metric small cancellation condition> $C'(1/6)$, every nonempty freely reduced <null-homotopic> combinatorial word contains a segment of a cell boundary longer than half its perimeter. Such a segment can be replaced by the shorter complementary segment. The diagram explanation uses shells with at most three internal pieces: their internal length is less than half the perimeter. Degenerate diagrams require the <disc diagram spur> alternative.
Back to article page
