In mathematics, particularly in the area of abstract algebra known as group theory, a characteristic subgroup is a subgroup that is mapped to itself by every automorphism of the parent group. Because every conjugation map is an inner automorphism, every characteristic subgroup is normal; though the converse is not guaranteed. Examples of characteristic subgroups include the commutator subgroup and the center of a group. A subgroup H of a group G is called a characteristic subgroup if for every automorphism φ of G, one has φ(H) ≤ H; then write H char G. It would be equivalent to require the stronger condition φ(H) = H for every automorphism φ of G, because φ−1(H) ≤ H implies the reverse inclusion H ≤ φ(H). Given H char G, every automorphism of G induces an automorphism of the quotient group G/H, which yields a homomorphism Aut(G) → Aut(G/H). If G has a unique subgroup H of a given index, then H is characteristic in G. Normal subgroup A subgroup of H that is invariant under all inner automorphisms is called normal; also, an invariant subgroup. ∀φ ∈ Inn(G): φ[H] ≤ H Since Inn(G) ⊆ Aut(G) and a characteristic subgroup is invariant under all automorphisms, every characteristic subgroup is normal. However, not every normal subgroup is characteristic. Here are several examples: Let H be a nontrivial group, and let G be the direct product, H × H. Then the subgroups, {1} × H and H × {1, are both normal, but neither is characteristic. In particular, neither of these subgroups is invariant under the automorphism, (x, y) → (y, x), that switches the two factors. For a concrete example of this, let V be the Klein four-group (which is isomorphic to the direct product, ). Since this group is abelian, every subgroup is normal; but every permutation of the 3 non-identity elements is an automorphism of V, so the 3 subgroups of order 2 are not characteristic. Here V = {e, a, b, ab} . Consider H = {e, a and consider the automorphism, T(e) = e, T(a) = b, T(b) = a, T(ab) = ab; then T(H) is not contained in H.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.