Chapter 14: Problem 13
Let \(G\) be a commutative group, and \(H\) a subgroup. Show that \(G / H\) is commutative.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 14: Problem 13
Let \(G\) be a commutative group, and \(H\) a subgroup. Show that \(G / H\) is commutative.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A, B\) be two finite cyclic groups of orders \(m\) and \(n\) respectively. Assume that \(m, n\) are relatively prime. Show that \(A \times B\) is cyclic. What is its order?
(a) Let \(G\) be the set of all maps of \(\mathbf{R}\) into itself of type \(x \mapsto a x+b\), where \(a \in \mathbf{R}, a \neq 0\) and \(b \in \mathbf{R}\). Show that \(G\) is a group. We denote such a map by \(\sigma_{a, b}\). Thus \(\sigma_{a, b}(x)=a x+b\). (b) To each map \(\sigma_{a, b}\) we associate the number \(a\). Show that the association $$ \sigma_{a, b} \mapsto a $$ is a homomorphism of \(G\) into \(\mathbf{R}^{*}\). Describe the kernel.
Consider the additive group of integers \(\mathbf{Z}\). Show that it has only two generators, namely 1 and \(-1 .\) In general, show that an infinite cyclic group has only two generators.
Let \(G, G^{\prime}\) be finite groups of orders \(m, n\) respectively. What is the order of \(G \times G^{\prime} ?\)
Let \(S\) be a set with at least one element. Let \(G\) be the set of all maps \(f: S \rightarrow S\) which are injective and surjective. Show that \(G\) is a group, the law of composition being composition of mappings. (Condition GR 1 is already known as the law of associativity of mappings.) This group \(G\) is called the group of all invertible maps of \(S\) into itself. It is a generalization of the notion of . permutation group on \(n\) elements.
What do you think about this solution?
We value your feedback to improve our textbook solutions.