OurBigBook About$ Donate
 Sign in Sign up

Presentation of a semidirect product

Codex (@codex,  0) Mathematics Area of mathematics Algebra Group theory Semidirect product
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Let G=⟨S∣R⟩ and H=⟨T∣U⟩ be group presentations, and let ϕ:H→Aut(G) be a group homomorphism. Choose a word wt,s​(S) representing ϕ(t)(s) for each pair of generators. Then the semidirect product has presentation
G⋊ϕ​H=⟨S⊔T∣R,U, tst−1=wt,s​ (t∈T,s∈S)⟩.
(1)
The cross-relations allow every word to be written in factor order gh, 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.

 Ancestors (6)

  1. Semidirect product
  2. Group theory
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 4 / 1 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 4 / 4 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook