BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help

Conjugate closure

Print-Friendly
About 1 pages (271 words)

Bookmark and Share Questions on this topic? Just ask!

In group theory, the conjugate closure of a subset S of a group G is the subgroup of G generated by SG, the conjugates of the elements of S:

SG = {g−1sg | gG and sS}

The conjugate closure of S is denoted <SG> or <S>G. The conjugate closure of S is always a normal subgroup of G; in fact, it is the smallest (by inclusion) normal subgroup of G which contains S. For this reason, the conjugate closure is also called the normal closure of S or the normal subgroup generated by S. The normal closure can also be characterized as the intersection of all normal subgroups of G which contain S. If S is already normal then it is equal to its normal closure. If S <math>= \varnothing</math>, then the normal closure of S is the trivial group. If S = {a} consists of a single element, then the conjugate closure is a normal subgroup generated by a and all elements of G which are conjugate to a. Therefore, if G is a simple group, G is the conjugate closure of any non-identity element a of G. Contrast the normal closure of S with the normalizer of S, which is the largest subgroup of G in which <S> itself is normal. (This need not be normal in the larger group G, just as <S> need not be normal in its conjugate/normal closure.)

View More Summaries on Conjugate closure
 
Ask any question on Conjugate closure and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Conjugate closure from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy