|
|
| Line 1: |
Line 1: |
| In [[mathematics]], the '''outer automorphism group''' of a [[group (mathematics)|group]] ''G''
| | If you have the desire to process settings instantly, loading files instantly, however the body is logy plus torpid, what would you do? If you are a giant "switchboard" which is lack of effective administration system plus effective housekeeper, what would you do? If you have send a exact commands to the mind, but the body cannot do correctly, what would you do? Yes! We want a full-featured repair registry!<br><br>The PC registry begins to receive mistakes plus fragmented the more we employ the computer because you enter more information each time, in addition to create changes inside the systems and setup. When the registry starts to get overloaded and full of errors, a computer can eventually crash. It can be done to fix it on your however really risky, incredibly in the event you have no extensive experience in doing this. Therefore, do NOT even attempt to do this yourself.<br><br>Windows is actually especially dumb. It only knows how to follow commands and instructions, that means which when you install a program, which system has to tell Windows exactly what to do. This really is done by storing an "training file" in the registry of your program. All a computer programs place these "manuals" into the registry, allowing the computer to run a wide array of programs. Whenever we load up 1 of those programs, Windows simply looks up the program file in the registry, plus carries out its instructions.<br><br>The issue with many of the people is that they never wish To spend income. In the cracked variation one does not have to pay anything and may download it from internet surprisingly easily. It is easy to install too. However, the issue comes when it happens to be not able to identify all possible viruses, spyware plus malware inside the program. This really is because it really is obsolete inside nature plus does not receive any usual updates within the url downloaded. Thus, the system is accessible to problems like hacking.<br><br>So to fix this, we just should be capable to create all of the registry files non-corrupted again. This usually dramatically accelerate the loading time of your computer plus usually allow you to do a large number of points on it again. And fixing these files couldn't be simpler - you just should use a tool called a [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities 2014].<br><br>Another factor is registry. It is one of the most important piece inside a Windows XP, Vista operating systems. When Windows start up, it read associated information from registry and load into computer RAM. This takes up a big part of the startup time. After the data is all loaded, computer runs the startup programs.<br><br>The first reason the computer might be slow is considering it needs more RAM. You'll see this issue right away, specifically in the event you have lower than a gig of RAM. Most modern computers come with a least which much. While Microsoft states Windows XP will run on 128 MB, it and Vista want at least a gig to run smoothly plus enable we to run multiple programs at once. Fortunately, the cost of RAM has dropped greatly, and we can get a gig installed for $100 or less.<br><br>All of these problems can be easily solved by the clean registry. Installing our registry cleaner will allow we to employ your PC without worries behind. You may able to utilize we system without being scared that it's going to crash inside the middle. Our registry cleaner usually fix a host of mistakes on your PC, identifying missing, invalid or corrupt settings inside the registry. |
| is the [[quotient group|quotient]] Aut(''G'') / Inn(''G''), where Aut(''G'') is the [[automorphism group]] of ''G'' and Inn(''G'') is the subgroup consisting of [[inner automorphism]]s. The outer automorphism group is usually denoted Out(''G''). If Out(''G'') is trivial and ''G'' has a trivial center, then ''G'' is said to be [[complete group|complete]]. | |
| | |
| An automorphism of a group which is not inner is called an outer automorphism. Note that the elements of Out(''G'') are cosets of automorphisms of ''G'', and not themselves automorphisms; this is an instance of the fact that quotients of groups are not in general (isomorphic to) subgroups. Elements of Out(''G'') are cosets of Inn(''G'') in Aut(''G'').
| |
| | |
| For example, for the [[alternating group]] ''A''<sub>''n''</sub>, the outer automorphism group is usually the group of order 2, with exceptions noted below. Considering ''A''<sub>''n''</sub> as a subgroup of the [[symmetric group]] ''S''<sub>''n''</sub> conjugation by any [[odd permutation]] is an outer automorphism of ''A''<sub>''n''</sub> or more precisely "represents the class of the (non-trivial) outer automorphism of ''A''<sub>''n''</sub>", but the outer automorphism does not correspond to conjugation by any ''particular'' odd element, and all conjugations by odd elements are equivalent up to conjugation by an even element.
| |
| | |
| However, for an abelian group ''A,'' the inner automorphism group is trivial and thus the automorphism group and outer automorphism group are naturally identified, and outer automorphisms do act on ''A''.
| |
| | |
| ==Out(''G'') for some finite groups==
| |
| | |
| For the outer automorphism groups of all finite simple groups see the [[list of finite simple groups]]. Sporadic simple groups and alternating groups (other than the alternating group ''A''<sub>6</sub>; see below) all have outer automorphism groups of order 1 or 2. The outer automorphism group of a finite simple [[group of Lie type]] is an extension of a group of "diagonal automorphisms" (cyclic except for [[List of finite simple groups#Dn.28q.29 n .3E 3 Chevalley groups.2C orthogonal groups|D<sub>''n''</sub>(''q'')]] when it has order 4), a group of "field automorphisms" (always cyclic), and
| |
| a group of "graph automorphisms" (of order 1 or 2 except for D<sub>4</sub>(''q'') when it is the symmetric group on 3 points). These extensions are [[semidirect product]]s except that for the [[group of Lie type#Suzuki–Ree groups|Suzuki-Ree groups]] the graph automorphism squares to a generator of the field automorphisms.
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| ! Group
| |
| ! Parameter
| |
| ! Out(G)
| |
| ! <math>|\mbox{Out}(G)|</math>
| |
| |-
| |
| | [[Integer|''Z'']]
| |
| | infinite cyclic || Z<sub>2</sub>
| |
| | 2; the identity and the map f(x) = -x
| |
| |-
| |
| | [[cyclic group|Z<sub>''n''</sub>]] || ''n'' > 2
| |
| | [[Multiplicative group of integers modulo n|Z<sub>''n''</sub><sup>×]]</sup>
| |
| |[[Euler's totient function|φ(n)]] = <math>n\prod_{p|n}\left(1-\frac{1}{p}\right)</math> elements; one corresponding to multiplication by an invertible element in Z<sub>''n''</sub> viewed as a ring.
| |
| |-
| |
| | [[cyclic group|Z<sub>''p''</sub><sup>''n''</sup>]]
| |
| | ''p'' prime, ''n'' > 1
| |
| | [[general linear group|GL<sub>''n''</sub>(''p'')]]
| |
| |(''p''<sup>''n''</sup> − 1)(''p''<sup>''n''</sup> − ''p'' )(''p''<sup>''n''</sup> − ''p''<sup>2</sup>) ... (''p''<sup>''n''</sup> − ''p''<sup>''n''−1</sup>)
| |
| elements
| |
| |-
| |
| | [[symmetric group|''S''<sub>''n''</sub>]]
| |
| | n ≠ 6 || [[trivial group|trivial]]
| |
| | 1
| |
| |-
| |
| | [[symmetric group|''S''<sub>6</sub>]]
| |
| | || Z<sub>2</sub> (see below)
| |
| | 2
| |
| |-
| |
| | [[alternating group|''A''<sub>''n''</sub>]]
| |
| | ''n'' ≠ 6 || Z<sub>2</sub>
| |
| | 2
| |
| |-
| |
| | [[alternating group|''A''<sub>6</sub>]]
| |
| |
| |
| | Z<sub>2</sub> × Z<sub>2</sub>(see below)
| |
| | 4
| |
| |-
| |
| | [[projective special linear group|PSL<sub>2</sub>(''p'')]]
| |
| | ''p'' > 3 prime || Z<sub>2</sub>
| |
| |2
| |
| |-
| |
| | [[projective special linear group|PSL<sub>2</sub>(2<sup>''n''</sup>)]]
| |
| | ''n'' > 1 || Z<sub>''n''</sub>
| |
| |''n''
| |
| |-
| |
| | [[projective special linear group|PSL<sub>3</sub>(4)]] = [[Mathieu group|M<sub>21</sub>]]
| |
| | || [[dihedral group|Dih<sub>6</sub>]]
| |
| | 12
| |
| |-
| |
| | [[Mathieu group|M<sub>''n''</sub>]]
| |
| | ''n'' = 11, 23, 24 || [[trivial group|trivial]]
| |
| |1
| |
| |-
| |
| | [[Mathieu group|M<sub>''n''</sub>]]
| |
| | ''n'' = 12, 22 || Z<sub>2</sub>
| |
| |2
| |
| |-
| |
| | [[Conway group|Co<sub>''n''</sub>]]
| |
| | ''n'' = 1, 2, 3 || [[trivial group|trivial]]
| |
| |1
| |
| |}{{Citation needed|date=February 2007}}
| |
| | |
| == The outer automorphisms of the symmetric and alternating groups==
| |
| {{details|Automorphisms of the symmetric and alternating groups}}
| |
| | |
| The outer automorphism group of a finite simple group in some infinite family of finite simple groups can almost always be given by a uniform formula that works for all elements of the family. There is just one exception to this:<ref>ATLAS p. xvi</ref> the alternating group ''A''<sub>6</sub> has outer automorphism group of order 4, rather than 2 as do the other simple alternating groups (given by conjugation by an [[odd permutation]]). Equivalently the symmetric group ''S''<sub>6</sub> is the only symmetric group with a non-trivial outer automorphism group.
| |
| | |
| :<math>
| |
| \begin{align}
| |
| n\neq 6: \mathrm{Out}(S_n) & = 1 \\
| |
| n\geq 3,\ n\neq 6: \mathrm{Out}(A_n) & = C_2 \\
| |
| \mathrm{Out}(S_6) & = C_2 \\
| |
| \mathrm{Out}(A_6) & = C_2 \times C_2
| |
| \end{align}
| |
| </math>
| |
| | |
| ==Outer automorphism groups of complex Lie groups==
| |
| [[File:Dynkin diagram D4.png|thumb|150px|The symmetries of the [[Dynkin diagram]] D<sub>4</sub> correspond to the outer automorphisms of Spin(8) in triality.]]
| |
| Let ''G'' now be a connected [[reductive group]] over an [[algebraically closed field]]. Then any two [[Borel subgroup]]s are conjugate by an inner automorphism, so to study outer automorphisms it suffices to consider automorphisms that fix a given Borel subgroup. Associated to the Borel subgroup is a set of [[Root system#Positive roots and simple roots|simple roots]], and the outer automorphism may permute them, while preserving the structure of the associated [[Root system#Classification of root systems by Dynkin diagrams|Dynkin diagram]]. In this way one may identify the automorphism group of the Dynkin diagram of ''G'' with a subgroup of Out(''G'').
| |
| | |
| ''D''<sub>4</sub> has a very symmetric Dynkin diagram, which yields a large outer automorphism group of [[Spin(8)]], namely Out(Spin(8)) = ''S''<sub>3</sub>; this is called [[triality]]. | |
| | |
| ==Outer automorphism groups of complex and real simple Lie algebras==
| |
| The preceding interpretation of outer automorphisms as symmetries of a Dynkin diagram follows from the general fact, that for a complex or real simple Lie algebra <math>\mathfrak{g}</math>, the automorphism group <math>\operatorname{Aut}(\mathfrak{g})</math> is a [[semidirect product]] of <math>\operatorname{Inn}(\mathfrak{g})</math> and <math>\operatorname{Out}(\mathfrak{g})</math>, i.e., the [[exact sequence|short exact sequence]]
| |
| | |
| : <math>1 \;\xrightarrow{}\; \operatorname{Inn}(\mathfrak{g}) \;\xrightarrow{}\; \operatorname{Aut}(\mathfrak{g}) \;\xrightarrow{}\; \operatorname{Out}(\mathfrak{g}) \;\xrightarrow{}\; 1</math>
| |
| | |
| splits. In the complex simple case, this is a classical result,<ref>{{Harv |Fulton |Harris |1991 |loc = Proposition D.40}}</ref> whereas for real simple Lie algebras, this fact has been proven as recently as 2010.<ref name="JOLT">[http://www.heldermann.de/JLT/JLT20/JLT204/jlt20035.htm]</ref>
| |
| | |
| == Structure ==
| |
| The [[Schreier conjecture]] asserts that Out(''G'') is always a [[solvable group]] when ''G'' is a finite [[simple group]]. This result is now known to be true as a corollary of the [[classification of finite simple groups]], although no simpler proof is known.
| |
| | |
| == Dual to center ==
| |
| The outer automorphism group is [[duality (mathematics)|dual]] to the center in the following sense: conjugation by an element of ''G'' is an automorphism, yielding a map <math>\sigma\colon G \to \operatorname{Aut}(G).</math> The [[kernel (algebra)|kernel]] of the conjugation map is the center, while the [[cokernel]] is the outer automorphism group (and the image is the [[inner automorphism]] group). This can be summarized by the [[short exact sequence]]:
| |
| :<math>Z(G) \hookrightarrow G \overset{\sigma}{\to} \operatorname{Aut}(G) \twoheadrightarrow \operatorname{Out}(G).</math>
| |
| | |
| == Applications ==
| |
| The outer automorphism group of a group acts on [[conjugacy class]]es, and accordingly on the [[character table]]. See details at [[Character table#Outer automorphisms|character table: outer automorphisms]].
| |
| | |
| === Topology of surfaces ===
| |
| The outer automorphism group is important in the [[topology]] of [[surface]]s because there is a connection provided by the [[Dehn–Nielsen theorem]]: the extended [[mapping class group]] of the surface is the Out of its [[fundamental group]].
| |
| | |
| ==Puns==
| |
| The term "outer automorphism" lends itself to [[pun]]s:
| |
| the term ''outermorphism'' is sometimes used for "outer automorphism",
| |
| and a particular [[Geometric group action|geometry]] on which <math>\scriptstyle\operatorname{Out}(F_n)</math> acts is called ''[[Out(Fn)#Outer space|outer space]]''. | |
| | |
| ==External links==
| |
| *[http://brauer.maths.qmul.ac.uk/Atlas/v3/ ATLAS of Finite Group Representations-V3]
| |
| (contains a lot of information on various classes of finite groups (in particular sporadic simple groups), including the order of Out(''G'') for each group listed.
| |
| | |
| ==See also==
| |
| *[[Mapping class group]]
| |
| *[[Out(Fn)|Out(F<sub>n</sub>)]]
| |
| | |
| ==References==
| |
| {{Refimprove|date=November 2009}}
| |
| {{reflist}}
| |
| {{refbegin}}
| |
| {{refend}}
| |
| | |
| [[Category:Group theory]]
| |
| [[Category:Group automorphisms]]
| |
If you have the desire to process settings instantly, loading files instantly, however the body is logy plus torpid, what would you do? If you are a giant "switchboard" which is lack of effective administration system plus effective housekeeper, what would you do? If you have send a exact commands to the mind, but the body cannot do correctly, what would you do? Yes! We want a full-featured repair registry!
The PC registry begins to receive mistakes plus fragmented the more we employ the computer because you enter more information each time, in addition to create changes inside the systems and setup. When the registry starts to get overloaded and full of errors, a computer can eventually crash. It can be done to fix it on your however really risky, incredibly in the event you have no extensive experience in doing this. Therefore, do NOT even attempt to do this yourself.
Windows is actually especially dumb. It only knows how to follow commands and instructions, that means which when you install a program, which system has to tell Windows exactly what to do. This really is done by storing an "training file" in the registry of your program. All a computer programs place these "manuals" into the registry, allowing the computer to run a wide array of programs. Whenever we load up 1 of those programs, Windows simply looks up the program file in the registry, plus carries out its instructions.
The issue with many of the people is that they never wish To spend income. In the cracked variation one does not have to pay anything and may download it from internet surprisingly easily. It is easy to install too. However, the issue comes when it happens to be not able to identify all possible viruses, spyware plus malware inside the program. This really is because it really is obsolete inside nature plus does not receive any usual updates within the url downloaded. Thus, the system is accessible to problems like hacking.
So to fix this, we just should be capable to create all of the registry files non-corrupted again. This usually dramatically accelerate the loading time of your computer plus usually allow you to do a large number of points on it again. And fixing these files couldn't be simpler - you just should use a tool called a tuneup utilities 2014.
Another factor is registry. It is one of the most important piece inside a Windows XP, Vista operating systems. When Windows start up, it read associated information from registry and load into computer RAM. This takes up a big part of the startup time. After the data is all loaded, computer runs the startup programs.
The first reason the computer might be slow is considering it needs more RAM. You'll see this issue right away, specifically in the event you have lower than a gig of RAM. Most modern computers come with a least which much. While Microsoft states Windows XP will run on 128 MB, it and Vista want at least a gig to run smoothly plus enable we to run multiple programs at once. Fortunately, the cost of RAM has dropped greatly, and we can get a gig installed for $100 or less.
All of these problems can be easily solved by the clean registry. Installing our registry cleaner will allow we to employ your PC without worries behind. You may able to utilize we system without being scared that it's going to crash inside the middle. Our registry cleaner usually fix a host of mistakes on your PC, identifying missing, invalid or corrupt settings inside the registry.