A group presentation denotes the quotient of the free group on the generator symbols by the normal closure of the relator words. The symbols generate the quotient, and each relator becomes the identity. The phrase also asserts that no additional relations are imposed except consequences of these relators and the group axioms. Equivalently, an assignment of the generators to a group extends to a group homomorphism from the presented group exactly when all relators evaluate to the identity; this is the universal property of a group presentation.
Multiplication, followed by induction and inversion for negative powers, gives
If , apply Euclidean division to write with . Choose , so . This is one step of the Euclidean algorithm implemented by a determinant-one row operation.
After the reduction in part (b), multiply by . The new bottom-left entry is , whose absolute value is strictly smaller than the previous :
Repeated Euclidean division must terminate because the nonnegative integers decrease strictly until zero. Thus a word in and their inverses gives a matrix with bottom-left entry zero. Its determinant is one, so the diagonal entries are equal and are either both or both :
Since , this final matrix belongs to . So does , proving
The identity shows that generate the same group. Direct multiplication gives
Consequently their images in the quotient group satisfy and . The universal property of a group presentation gives a group homomorphism taking , from the stated presentation. It is surjective because these images generate the target. Injectivity is not needed here.
Suppose were a normal subgroup of index and put . The supplied reduction map and part (c) show that is generated by the images of . Their orders divide and , respectively, because and . By Lagrange's theorem, their orders also divide . Since , both and equal one. Thus , forcing to be trivial and , a contradiction. No such normal subgroup exists for .

Articles by others on the same topic (0)

There are currently no matching articles.