A group homomorphism satisfies for every . Its kernel of a group homomorphism is . The homomorphism equation gives by cancellation, and . Therefore contains the identity and is closed under multiplication and inverses, so it is a subgroup.
For and ,Thus conjugation carries into itself, and applying the inverse conjugation gives equality: is a normal subgroup. If , conjugation cannot send to the identity because it is injective. ConsequentlyThis proves directly the normal subgroup of order two is central principle for kernels, including the kernel facts needed below.
True. The determinant gives a group homomorphismFor an orthogonal matrix, implies , and a reflection has determinant , so the target has order two and the map is onto. Its kernel of a group homomorphism is exactlyThis is the defining special orthogonal group inside the orthogonal group.
True. The sign of a permutation is a group homomorphism , as follows, for example, from the multiplicative determinant of permutation matrices. Its kernel of a group homomorphism is the alternating groupA transposition maps to , so this homomorphism is onto.
True. Use the odd-dimensional orthogonal determinant splitting:Scalar matrices commute with every matrix, so . Its output is orthogonal andEvery satisfies , proving surjectivity. The equation forces , whenceIn odd dimension has determinant , which is the sign needed in this construction.
False. Any supposed kernel of a group homomorphism of order two would have a nonidentity central element by the introductory proof. Every element of order two in is a transposition, and none is central: conjugating by a suitable three-cycle gives a different transposition. Thus the center of a group for is trivial, and such a kernel is impossible. This argument does not assume that an arbitrary order-two subgroup is normal.
Articles by others on the same topic
There are currently no matching articles.