Conjugation
From Maths
Revision as of 22:21, 11 May 2015 by Alec (Talk | contribs) (Created page with "==Definition== Two elements {{M|g,h}} of a group {{M|(G,\times)}} are ''conjugate'' if: * {{M|1=\exists x\in G[xgx^{-1}=h]}} ===Conjugation operation=== Let {{M|x}}...")
Definition
Two elements g,h of a group (G,×) are conjugate if:
- ∃x∈G[xgx−1=h]
Conjugation operation
Let x in G be given, define:
- Cx:G→G as the automorphism (recall that means an isomorphism of a group onto itself) which:
- g↦xgx−1
This association of x↦cx is a homomorphism of the form G→Aut(G) (or indeed G→(G→G) instead)
This operation on G is called conjugation[1]
TODO: Link with language - "the conjugation of x is the image of cx" and so forth
Proof of clams
[Expand]
Claim: The map Cx:G→G given by g↦xgx−1 is an automorphism
[Expand]
Claim: The family {Cx|x∈G} form a group, and x↦cx is a homomorphism from G to this family
See also
References
- Jump up ↑ Algebra - Serge Lang - Revised Third Edition - GTM