Let and be group presentations, and let be a group homomorphism. Choose a word representing for each pair of generators. Then the semidirect product has presentationThe cross-relations allow every word to be written in factor order , and the multiplication rule matches the prescribed action. The natural homomorphisms to and from the semidirect product are inverse on the generators. Finite factor presentations yield a finite group presentation.
Articles by others on the same topic
There are currently no matching articles.