en>Omnipaedista: style fix

2014-12-22T00:48:37Z

style fix

en>Quondum: /* Examples */ oops – removing template

2014-02-17T18:28:11Z

Examples: oops – removing template

← Older revision		Revision as of 20:28, 17 February 2014
Line 1:		Line 1:
	~~In [[mathematics]], an '''automorphism'''~~ is ~~an [[isomorphism]] from a [[mathematical object]] to itself~~. It is~~, in some sense, a [[symmetry]] of the object, and a way of [[map (mathematics)\|mapping]] the object to itself while preserving all of its structure~~. ~~The set of all automorphisms of an object forms a [[group (mathematics)\|group]], called the '''automorphism group'''. It~~ is~~, loosely speaking, the [[symmetry group]] of the object.~~		Emilia Shryock is my name but you can call me anything you like. Hiring is my occupation. To do aerobics is a factor that I'm completely addicted to. California is exactly where her house is but she needs to transfer because of her family.<br><br>Also visit my web site: home std test ([http://nfldev.com/index.php?do=/profile-12302/info/ click the next website])

	~~==Definition==~~
	The exact definition of an automorphism depends on the type of "mathematical object" in question and what, precisely, constitutes an "isomorphism" of that object. The most general setting in which these words have meaning is an abstract branch of mathematics called [[category theory]]. Category theory deals with abstract objects and [[morphism]]s between those objects.

	~~In category theory, an automorphism is an [[endomorphism]] (i.e.~~ a ~~[[morphism]] from an object to itself) which is also an [[isomorphism]] (in the categorical sense of the word).~~

	This is a very abstract definition since, in category theory, morphisms aren't necessarily functions and objects aren't necessarily sets. In most concrete settings, however, the objects will be sets with some additional structure and the morphisms will be functions preserving that ~~structure.~~

	In the context of [[abstract algebra]], for example, a mathematical object is an [[algebraic structure]] such as a [[group (mathematics)\|group]], [[ring (mathematics)\|ring]], or [[vector space]]. An isomorphism is simply a [[bijective]] [[homomorphism]]. (The definition of a homomorphism depends on the type of algebraic structure; see, for example: [[group homomorphism]], [[ring homomorphism]], and [[linear operator]]).

	~~The [[identity morphism]] ([[identity mapping]]) is called the~~ '~~''trivial automorphism''' in some contexts. Respectively, other (non-identity) automorphisms are called '''nontrivial automorphisms'''.~~

	~~==Automorphism group==~~
	If the automorphisms of an object ''X'' form a set (instead of a proper [[class (set theory)\|class]]), then they form a [[group (mathematics)\|group]] under [[Function composition\|composition]] of [[morphism]]s. This group is called the '''automorphism group''' of ''X''. That this is indeed a group is simple to ~~see:~~
	* [[Closure (binary operation)\|Closure]]: composition of two endomorphisms is another endomorphism.
	* [[Associativity]]: composition of morphisms is ~~''always'' associative.~~
	* [[Identity element\|Identity]]: the identity is ~~the identity morphism from an object~~ to ~~itself which exists by definition.~~
	* [[Inverse element\|Inverses]]: by definition every isomorphism has an inverse which is also an isomorphism, and since the inverse is also an endomorphism of ~~the same object it is an automorphism~~.

	~~The automorphism group of an object ''X'' in a category ''C'' is denoted Aut~~<~~sub~~>~~''C''~~<~~/sub~~>~~(''X''), or simply Aut(''X'') if the category is clear from context.~~

	~~==Examples==~~
	* In [[set theory]], an arbitrary [[permutation]] of the elements of a set ''X'' is an automorphism. The automorphism group of ''X'' is also called the [[symmetric group]] on ''X''.
	* In [[elementary arithmetic]], the set of [[integer]]s, '''Z''', considered as a group under addition, has a unique nontrivial automorphism: ~~negation. Considered as a [[ring~~ (~~mathematics)\|ring]], however, it has only the trivial automorphism. Generally speaking, negation is an automorphism of any~~ [~~[abelian group]], but not of a ring or field.~~
	* A group automorphism is a [[group isomorphism]] from a group to itself. Informally, it is a permutation of the group elements such that the structure remains unchanged. For every group ''G'' there is a natural group homomorphism ''G'' → Aut(''G'') whose [[image (mathematics)\|image]] is the group Inn(''G'') of [[inner automorphism]]s and whose [[kernel (algebra)\|kernel]] is the [[center (group theory)\|center]] of ''G''. Thus, if ''G'' has [[Trivial group\|trivial]] center it can be embedded into its own automorphism group.<ref name=Pahl>

	~~{{cite book \|url=~~http://~~books.google~~.com/?id=kvoaoWOfqd8C&pg=PA376 \|page=376 \|chapter=§7.5.5 Automorphisms \|title=Mathematical foundations of computational engineering \|edition=Felix Pahl translation \|author=PJ Pahl, R Damrath \|isbn=3-540-67995-2 \|year=2001 \|publisher=Springer}}

	~~</ref>~~
	* In [[linear algebra]], an endomorphism of a [[vector space]] ''V'' is a [[linear transformation\|linear operator]] ''V'' → ''V''. An automorphism is an invertible linear operator on ''V''. When the vector space is finite-dimensional, the automorphism group of ''V'' is the same as the [[general linear group]], GL(''V'').
	* A field automorphism is a [[bijection\|bijective]] [[ring homomorphism]] from a [[field (mathematics)\|field]] to itself. In the cases of the [[rational number]]s ('''Q''') and the [[real number]]s ('''R''') there are no nontrivial field automorphisms. Some subfields of '''R''' have nontrivial field automorphisms, which however do not extend to all of '''R''' (because they cannot preserve the property of a number having a square root in '''R'''). In the case of the [[complex number]]s, '''C''', there is a unique nontrivial automorphism that sends '''R''' into '''R''': [[complex conjugate\|complex conjugation]], but there are infinitely ([[uncountable\|uncountably]]) many "wild" automorphisms (assuming the [[axiom of choice]]).<ref>{{cite journal \| last = ~~Yale \| first = Paul B. \| journal = Mathematics Magazine \| title = Automorphisms of the Complex Numbers \| volume = 39 \| issue = 3 \|date=May 1966 \| pages = 135–141 \| url = http:~~//www.maa.org/sites/default/files/pdf/upload_library/22/Ford/PaulBYale.pdf \| doi = 10.2307/2689301 \| jstor = 2689301}}</ref> Field automorphisms are important to the theory of [[field extension]]s, in particular [[Galois extension]]s. In the case of a Galois extension ''L''/''K'' the [[subgroup]] of all automorphisms of ''L'' fixing ''K'' pointwise is called the [[Galois group]] of the extension.
	* In [[graph theory]] an [[graph automorphism\|automorphism of a graph]] is a permutation of the nodes that preserves edges and non-edges. In particular, if two nodes are joined by an edge, so are their images under the permutation.
	* For relations, see [[Isomorphism#A relation-preserving isomorphism\|relation-preserving automorphism]].
	** In [[order theory]], see [[order automorphism]].
	* In [[geometry]], an automorphism may be called a [[motion (geometry)\|motion]] of the space. Specialized terminology is also used:
	** In [[metric geometry]] an automorphism is a self-~~[[isometry]]. The automorphism group is also called the [[isometry group]].~~
	** In the category of [[Riemann surface]]s, an automorphism is a bijective [[biholomorphy\|biholomorphic]] map (also called a [[conformal map]]), from a surface to itself. For example, the automorphisms of the [[Riemann sphere]] are [[Möbius transformation]]s.
	** An automorphism of a differentiable [[manifold]] ''M'' is a [[diffeomorphism]] from ''M'' to itself. The automorphism group is sometimes denoted Diff(''M'').
	** In [[topology]], morphisms between topological spaces are called [[Continuous function (topology)\|continuous maps]], and an automorphism of a topological space is a [[homeomorphism]] of the space to itself, or self-homeomorphism (see [[homeomorphism group]]). In this example it is ''not sufficient'' for a morphism to be bijective to be an isomorphism.

	~~==History==~~
	One of the earliest group automorphisms (automorphism of a group, not simply a group of automorphisms of points) was given by the Irish mathematician [[William Rowan Hamilton]] in 1856, in his [[icosian calculus]], where he discovered an order two automorphism,<ref>{{Cite journal
	~~\|title=Memorandum respecting a new System of Roots of Unity~~
	~~\|author=Sir William Rowan Hamilton~~
	~~\|author-link=William Rowan Hamilton~~
	~~\|url=http://www.maths.tcd.ie/pub/HistMath/People/Hamilton/Icosian/NewSys.pdf~~
	~~\|journal=[[Philosophical Magazine]]~~
	~~\|volume=12~~
	~~\|year=1856~~
	~~\|pages=446~~
	~~}}<~~/~~ref> writing:~~
	~~{{quotation\|so that <math>\mu<~~/~~math> is a new fifth root of unity, connected with~~ the ~~former fifth root <math>\lambda</math> by relations of perfect reciprocity.}}~~

	~~==Inner and outer automorphisms==~~
	~~In some categories—notably [[group (mathematics)\|groups~~]~~], [[ring (mathematics~~)~~\|rings]], and [[Lie algebra]]s—it is possible to separate automorphisms into two types, called "inner" and "outer" automorphisms.~~

	In the case of groups, the [[inner automorphism]]s are the conjugations by the elements of the group itself. For each element ''a'' of a group ''G'', conjugation by ''a'' is the operation φ<sub>''a''</sub> : ''G'' → ''G'' given by <math> \varphi_a (g) = a g a^{-1} </math> (or ''a''<sup>−1</sup>''ga''; usage varies). One can easily check that conjugation by ''a'' is a group automorphism. The inner automorphisms form a [[normal subgroup]] of Aut(''G''), denoted by Inn(''G''); this is called [[Goursat's lemma]].

	The other automorphisms are called [[outer automorphism]]s. The [[quotient group]] Aut(''G'') / Inn(''G'') is usually denoted by Out(''G''); the non-trivial elements are the cosets that contain the outer automorphisms.

	The same definition holds in any [[unital algebra\|unital]] [[ring (mathematics)\|ring]] or [[algebra over a field\|algebra]] where ''a'' is any [[Unit (ring theory)\|invertible element]]. For [[Lie algebra]]s the definition is slightly different.

	~~==See also==~~
	* [[endomorphism ring]]
	* [[antiautomorphism]]
	* [[Frobenius automorphism]]
	* [[morphism]]
	* [[characteristic subgroup]]

	~~==References==~~
	~~<!-- See [[Wikipedia:Footnotes]] for instructions. -->~~
	~~<references />~~

	~~==External links==~~
	* [http://www.encyclopediaofmath.org/index.php/Automorphism ''Automorphism'' at Encyclopaedia of Mathematics]
	* {{MathWorld \| urlname=Automorphism \| title = Automorphism}}

	~~[[Category:Morphisms]]~~
	~~[[Category:Abstract algebra]]~~
	~~[[Category:Symmetry]]~~

en>Monkbot: /* Examples */Fix CS1 deprecated date parameter errors

2014-01-14T21:12:09Z

Examples: Fix CS1 deprecated date parameter errors

Show changes

en>MathKnight-at-TAU: /* Inner and outer automorphisms */

2012-08-20T12:34:51Z

Inner and outer automorphisms

New page

"Why does my computer keep freezing up?" I was asked by a great deal of individuals the cause of their pc freeze difficulties. And I am fed up with spending much time inside answering the question time plus time again. This post is to tell we the real cause of the PC Freezes. Google Chrome crashes on Windows 7 by the corrupted cache contents plus problems with all the stored browsing data. Delete the browsing information plus well-defined the contents of the cache to solve this issue. With RegCure to boost the start up and shut down of the computer. The program shows the scan progress plus you shouldn't worry where it is very working at which time. It shows we what happens. Dynamic link library section of the registry will cause serious application failures. RegCure restores plus repairs the registry and keeps you out of DLL. RegCure is able to make individual corrections, thus it can functions for your needs. Registry cleaners have been crafted for one purpose - to wash out the 'registry'. This really is the central database which Windows relies on to function. Without this database, Windows wouldn't even exist. It's so significant, that your computer is continually adding plus updating the files inside it, even when you're browsing the Internet (like now). This really is good, however, the problems occur when a few of those files become corrupt or lost. This happens a lot, plus it takes a advantageous tool to fix it. So to fix this, we really have to be capable to create all registry files non-corrupted again. This can dramatically speed up the loading time of your computer and may allow we to do a big amount of aspects on it again. And fixing these files couldn't be easier - we merely should use a tool called a [http://bestregistrycleanerfix.com/regzooka zookaware]. We should additionally see with it it is very easy to download and install. You should avoid those products that may need you a especially complicated set of instructions. Furthermore, you should no longer need any other program requirements. Most probably in the event you are experiencing a slow computer it will be a couple years older. We furthermore might not have been told that while you use a computer everyday; there are certain details which it needs to continue running in its ideal performance. We additionally could not even own any diagnostic tools that may receive a PC running like brand-new again. So do not allow which stop we from getting your program cleaned. With access to the web you will find the tools which will help we receive a system running like brand-new again. Before you buy a complete unique system; it is very time to receive the aged one cleaned up to begin getting more performed online today! Visit our site under and access the most reputable registry cleaner software available.

Automorphism - Revision history

en>Omnipaedista: style fix

en>Quondum: /* Examples */ oops – removing template

en>Monkbot: /* Examples */Fix CS1 deprecated date parameter errors

en>MathKnight-at-TAU: /* Inner and outer automorphisms */