Proving that a subgroup is normal: Difference between revisions
| Line 86: | Line 86: | ||
{{further|[[Normality satisfies intermediate subgroup condition]], [[Normality satisfies transfer condition]], [[Normality satisfies image condition]], [[Normality satisfies inverse image condition]]}} | {{further|[[Normality satisfies intermediate subgroup condition]], [[Normality satisfies transfer condition]], [[Normality satisfies image condition]], [[Normality satisfies inverse image condition]]}} | ||
===Centralizers=== | |||
{{further|[[Normality is centralizer-closed]]}} | |||
The centralizer of a normal subgroup is normal. Thus, a group obtained by starting from a normal subgroup and taking the centralizer is normal. Moreover, the ''taking the centralizer'' operation can be combined with joins, intersections, and many other operations. | |||
===Commutators=== | |||
{{further|[[Normality is commutator-closed]], [[commutator of a group and a subgroup implies normal]], [[commutator of a group and a subset implies normal]]}} | |||
The [[commutator of two subgroups|commutator]] of two normal subgroups is also a normal subgroup. Also, the commutator of the whole group and any subset is normal. These facts can be useful in establishing that certain subgroups are normal. | |||
==Subgroup-defining function== | ==Subgroup-defining function== | ||
| Line 97: | Line 109: | ||
{{fillin}} | {{fillin}} | ||
==Starting from normal subgroups and using deterministic processes== | |||
An even more general idea than that of subgroup-defining functions is the following: any subgroup that is obtained by starting from a collection of normal subgroups and using deterministic processes, which may involve [[join of subgroups|joins]], [[intersection of subgroups|intersections]], [[centralizer]]s, and [[commutator of two subgroups|commutators]], or other processes, still yields a normal subgroup. Here, the term ''deterministic'' means invariant under automorphisms of the entire system, which implies, in particular, invariance under inner automorphisms. | |||
==The deviation method of proving normality== | ==The deviation method of proving normality== | ||
Revision as of 03:00, 23 December 2009
This survey article is about proof techniques for or related to: normal subgroup
Find other survey articles about normal subgroup
This article explores the various ways in which, given a group and a subgroup (through some kind of description) we can try proving that the subgroup is normal (or that it is not normal). We first discuss the leading general ideas, and then plunge into the specific cases.
Other things instead of proving normality
In some cases, proving that a certain subgroup is normal may be hard or impossible, perhaps because the subgroup is not normal. The following alternative approaches are useful here:
- Replacing a subgroup by a normal subgroup: There are many techniques to guarantee, from the existence of a subgroup satisfying certain conditions, the existence of a normal subgroup satisfying similar conditions.
Using the standard definitions
The best way to try proving that a subgroup is normal is to show that it satisfies one of the standard equivalent definitions of normality.
Construct a homomorphism having it as kernel
To prove that is a normal subgroup of , we can construct a homomorphism such that the kernel of the homomorphism, i.e., the set of elements that map to the identity, is precisely . Note that if we do this successfully, it is not even necessary to establish separately that is a subgroup.
Here are some examples:
- Every group is normal in itself: This can be proved by taking the trivial homomorphism from to the trivial group. The kernel of the trivial homomorphism is precisely the whole group .
- Trivial subgroup is normal: This can be proved by taking the identity homomorphism from to . The kernel of this homomorphism is the trivial subgroup.
- Center is normal: Although there are other, more direct ways of seeing this, one way of seeing it is that the center is the kernel of the homomorphism from the group to its automorphism group via the conjugation action.
Other examples involve using the fact that some subgroups are normal to prove that other subgroups are normal. For instance:
- Normality is strongly intersection-closed: Given a collection of normal subgroups of , we can construct a homomorphism from to the external direct product of the corresponding quotient groups. The kernel of this is the intersection of all the normal subgroups. This proves that an arbitrary intersection of normal subgroups is normal.
- Normality satisfies intermediate subgroup condition: If , and is normal in , then is normal in . To prove this, note that is the kernel of the homomorphism from to obtained via composition of the inclusion of in and the quotient map from to .
Verify invariance under inner automorphisms
Another way of proving normality is using the inner automorphism, or conjugation, definition. This states that a subgroup of a group is normal if for every , we have .
This definition could be used in three broad ways:
- Try everything: Here, we basically check every element of and every element of .
- Use generic elements: Here, we don't actually try each element, but rather, argue that for an arbitrary choice of element of and element of , the result holds.
- Use generating sets: This is a somewhat stronger version. It says that if is a generating set for and is a generating set for , then is normal in if for every , and are both in .Further information: Normality testing problem
Here are some applications of the generic-element approach:
- Every group is normal in itself: It is easy to see, using generic elements, that the condition is satisfied.
- Trivial subgroup is normal: This is also easy to see.
- Normality is strongly intersection-closed
- Normality satisfies intermediate subgroup condition
- Center is normal
The generating set approach, or ideas of that kind, are more useful when the subgroup is described by means of generating elements or as a join of subgroups. For instance:
Determine its left and right cosets
A subgroup is normal in a group iff, for every , . This definition is useful for proving normality is some situations:
- Every group is normal in itself
- Trivial subgroup is normal
- Subgroup of index two is normal
- Center is normal
Compute its commutator with the whole group
A subgroup of a group is normal iff the commutator is contained in . This definition is useful for proving, for instance, that the commutator subgroup is normal.
Methods involving metaproperties of normality
Joins and intersections
Further information: Normality is strongly join-closed,Normality is strongly intersection-closed
If the given subgroup can be described using joins and intersections ,starting with normal subgroups, then it is normal.
Upper joins
Further information: Normality is upper join-closed
If the given subgroup is normal in a bunch of intermediate subgroups that together generate the whole group, it is normal in the whole group.
Quotient-transitivity
Further information: Normality is quotient-transitive
If are such that is normal in and is normal in , then is normal in . This is a frequently used fact.
Images, inverse images, transfer, intermediate subgroups
Further information: Normality satisfies intermediate subgroup condition, Normality satisfies transfer condition, Normality satisfies image condition, Normality satisfies inverse image condition
Centralizers
Further information: Normality is centralizer-closed
The centralizer of a normal subgroup is normal. Thus, a group obtained by starting from a normal subgroup and taking the centralizer is normal. Moreover, the taking the centralizer operation can be combined with joins, intersections, and many other operations.
Commutators
Further information: Normality is commutator-closed, commutator of a group and a subgroup implies normal, commutator of a group and a subset implies normal
The commutator of two normal subgroups is also a normal subgroup. Also, the commutator of the whole group and any subset is normal. These facts can be useful in establishing that certain subgroups are normal.
Subgroup-defining function
One of the simplest ways of showing that a subgroup is normal is to show that it arises from a subgroup-defining function. A subgroup-defining function is a rule that associates a unique subgroup to the group.
Any subgroup obtained via a subgroup-defining function is invariant under any automorphism of the group, and is hence a characteristic subgroup. In particular, it is invariant under inner automorphisms of the group, and is hence normal.
With this approach, for instance, we can show that the center, the commutator subgroup, and the Frattini subgroup are normal.
The example of the center: crude versus refined argument
PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
Starting from normal subgroups and using deterministic processes
An even more general idea than that of subgroup-defining functions is the following: any subgroup that is obtained by starting from a collection of normal subgroups and using deterministic processes, which may involve joins, intersections, centralizers, and commutators, or other processes, still yields a normal subgroup. Here, the term deterministic means invariant under automorphisms of the entire system, which implies, in particular, invariance under inner automorphisms.
The deviation method of proving normality
In measuring deviation from normality, we see three ways of measuring the extent to which a subgroup deviates from normality: the normalizer, the normal closure and the normal core. Here, we explore each of these as a tool for trying to prove normality.
The normal core method and group actions
Further information: Group acts on left coset space of subgroup by left multiplication
The idea behind using the normal core to prove normality is to show that the given subgroup equals its normal core: the largest normal subgroup contained in it. In other words, we try to establish that the intersection of all conjugates of the subgroup equals the subgroup itself. This method is particularly useful in cases where the subgroup has small index in the whole group.
The normal core method is typically applied along with group actions, as in the setup described below.
Let be a subgroup of . Then, acts on the coset space of . This gives a homomorphism from to the symmetric group on the coset space, and the kernel of the homomorphism is the normal core . Hence, the quotient group sits as a subgroup of the symmetric group .
This approach can be used to prove results like the following:
- Index two implies normal
- Subgroup of least prime index is normal
- A related result, that does not prove the subgroup itself is normal, but that it contains another large enough normal subgroup: Poincare's theorem, which states that any subgroup of index contains a normal subgroup of index dividing .
Normal closure
The idea behind using the normal closure in order to prove normality is to prove that the subgroup equals its own normal closure. In other words, we show that the subgroup equals that subgroup generated by all its conjugates. This method is particularly useful when the subgroup is given in terms of a generating set.
Suppose is a group and is a subgroup with generating set . The normal closure of in can be obtained as the subgroup generated by all conjugates of elements of be elements of . Thus, to show that is normal in , it suffices to show that all such conjugates are again in .
In fact, if we are given a generating set for , it suffices to prove that conjugating any element of by any element in gives an element of .
Normalizer
The idea behind using the normalizer to prove normality is to prove that the normalizer of the subgroup equals the whole group. In other words, we show that every element of the group commutes with the subgroup.
Methods suited for particular groups
For abelian groups
If the whole group is abelian, then every subgroup is normal, so there is nothing to prove.