| Line 1: | Line 1: | ||
For the following definitions, Let G and H be two groups: | For the following definitions, Let G and H be two groups: | ||
| − | A '''morphism''', rho, from G to H is a function rho: G --> H such that: | + | A '''morphism''',<math>\rho\,\!</math>, from G to H is a function <math>\rho\,\!</math>: G --> H such that: |
1)(1G) = 1H | 1)(1G) = 1H | ||
| − | 2) | + | 2)<math>\rho\,\!</math>(g*g') = <math>\rho\,\!</math>(g)*<math>\rho\,\!</math>(g'), this preserves the multiplication table |
The domain and the codomain are two operations that are defined on every morphism. | The domain and the codomain are two operations that are defined on every morphism. | ||
| Line 15: | Line 15: | ||
An '''epimorphism''' is a morphism where for every h in H, there is at least one g in G with f(g) = h | An '''epimorphism''' is a morphism where for every h in H, there is at least one g in G with f(g) = h | ||
| − | •This is the same as saying that rho is surjective or onto | + | •This is the same as saying that <math>\rho\,\!</math> is surjective or onto |
| − | A '''monomorphism''' is a morphism for which rho(g) = rho( | + | A '''monomorphism''' is a morphism for which <math>\rho\,\!</math>(g) = <math>\rho\,\!</math>(g') can only happen if g = g' |
| − | •This is the same as saying that rho is injective | + | •This is the same as saying that <math>\rho\,\!</math> is injective |
| − | An '''isomorphism''' is a morphism that is both an epimorphism and a monomorphism (both surjective and injective). This means that rho sets up a 1-to-1 correspondence between the elements of G and the elements of H. | + | An '''isomorphism''' is a morphism that is both an epimorphism and a monomorphism (both surjective and injective). This means that <math>\rho\,\!</math> sets up a 1-to-1 correspondence between the elements of G and the elements of H. |
| − | •This is the same as saying that rho is bijective | + | •This is the same as saying that <math>\rho\,\!</math> is bijective |
An '''automorphism''' is an isomorphism from a function to itself. It is a way of mapping the object to itself while preserving all of its structure. | An '''automorphism''' is an isomorphism from a function to itself. It is a way of mapping the object to itself while preserving all of its structure. | ||
| − | •An inner automorphism | + | •An inner automorphism is a function ƒ: G → G such that ƒ(x) = a−1xa, for all x in G, where a is a given fixed element of |
G. | G. | ||
A '''homomorphism''' is a structure-preserving map between two algebraic structures (such as groups, rings, or vector spaces). | A '''homomorphism''' is a structure-preserving map between two algebraic structures (such as groups, rings, or vector spaces). | ||
| Line 31: | Line 31: | ||
o Algebra homomorphism- this is a homomorphism between two algebras | o Algebra homomorphism- this is a homomorphism between two algebras | ||
•Properties of elements under homomorphisms: | •Properties of elements under homomorphisms: | ||
| − | Let | + | Let <math>\Phi\,\!</math> be a homomorphism from a group G to a grou H and let g be and element of G. Then: |
| − | 1) Phi carries the identity of G to the identity of H | + | 1) <math>\Phi\,\!</math> carries the identity of G to the identity of H |
| − | 2)Phi(g^n) = ( | + | 2)<math>\Phi\,\!</math>(g^n) = (<math>\Phi\,\!</math>(g))^n for all n in Z |
| − | 3)If |g| is finite, then | | + | 3)If |g| is finite, then |<math>\Phi\,\!</math>(g)| divides |g| |
| − | 4)Ker( | + | 4)Ker(<math>\Phi\,\!</math>) is a subgroup of G |
| − | 5)aKer( | + | 5)aKer(<math>\Phi\,\!</math>) = bKern(<math>\Phi\,\!</math>) if and only if <math>\Phi\,\!</math>(a) = <math>\Phi\,\!</math>(b) |
| − | 6)If | + | 6)If <math>\Phi\,\!</math>(g) = g' then <math>\Phi\,\!</math>^-1(gprime) = {x in G | <math>\Phi\,\!</math>(x) = g'} = gKer<math>\Phi\,\!</math> |
•Properties of Subgroups Under Homomorphisms | •Properties of Subgroups Under Homomorphisms | ||
| − | Let | + | Let <math>\Phi\,\!</math> be a homomorphism from a group G to a group H and let I be a subgroup of G. Then: |
| − | 1)Phi(I) = [ | + | 1)<math>\Phi\,\!</math>(I) = [<math>\Phi\,\!</math>(i) | i in I} is a subgroup of H |
| − | 2)If I is cyclic, then | + | 2)If I is cyclic, then <math>\Phi\,\!</math>(I) is cyclic |
| − | 3)If I is Abelian, then | + | 3)If I is Abelian, then <math>\Phi\,\!</math>(I) is Abelian |
| − | 4)If I is normal in G, then | + | 4)If I is normal in G, then <math>\Phi\,\!</math>(I) is normal in <math>\Phi\,\!</math>(G) |
| − | 5)If \ | + | 5)If |Ker<math>\Phi\,\!</math>| = n, then phis is an n-to-1 mapping from G onto <math>\Phi\,\!</math>(G) |
| − | 6)If |I| = n, then | | + | 6)If |I| = n, then |<math>\Phi\,\!</math>(I)| divides n |
| − | 7)If I bar is a subgroup of G bar, then | + | 7)If I bar is a subgroup of G bar, then <math>\Phi\,\!</math>^-1(I bar) = {i in G | <math>\Phi\,\!</math>(i) in Ibar} is a subgroup of G. |
| − | 8)If I bar is a normal subgroup of G bar, then | + | 8)If I bar is a normal subgroup of G bar, then <math>\Phi\,\!</math>^-1(Ibar) = {i in G| <math>\Phi\,\!</math>(i) in Ibar} is a normal subgroup of G |
| − | 9)If | + | 9)If <math>\Phi\,\!</math> is onto and Kerphi = {e}, then <math>\Phi\,\!</math> is an isomorphism from G to G bar. |
Examples | Examples | ||
Revision as of 17:57, 25 April 2011
For the following definitions, Let G and H be two groups:
A morphism,$ \rho\,\! $, from G to H is a function $ \rho\,\! $: G --> H such that:
1)(1G) = 1H
2)$ \rho\,\! $(g*g') = $ \rho\,\! $(g)*$ \rho\,\! $(g'), this preserves the multiplication table
The domain and the codomain are two operations that are defined on every morphism.
Morphims satisfy two axioms:
1)Associativity: h o (g o f) = (h o g)o f whenever the operations are defined
2)Identity: for every object X, the identity morphism on X exists such that for every morphism f: A --> B,
id_B_ o f = f = f o idA.
Types of morphisms:
An epimorphism is a morphism where for every h in H, there is at least one g in G with f(g) = h
•This is the same as saying that $ \rho\,\! $ is surjective or onto
A monomorphism is a morphism for which $ \rho\,\! $(g) = $ \rho\,\! $(g') can only happen if g = g'
•This is the same as saying that $ \rho\,\! $ is injective
An isomorphism is a morphism that is both an epimorphism and a monomorphism (both surjective and injective). This means that $ \rho\,\! $ sets up a 1-to-1 correspondence between the elements of G and the elements of H.
•This is the same as saying that $ \rho\,\! $ is bijective
An automorphism is an isomorphism from a function to itself. It is a way of mapping the object to itself while preserving all of its structure.
•An inner automorphism is a function ƒ: G → G such that ƒ(x) = a−1xa, for all x in G, where a is a given fixed element of
G.
A homomorphism is a structure-preserving map between two algebraic structures (such as groups, rings, or vector spaces).
•Types of homomorphisms:
o Group homomorphism- this is a homomorphism between two groups.
o Ring homomorphism- this is a homomorphism between two rings.
o Functor- this is a homomorphism between two categories
o Linear map- this is a homomorphism between two vector spaces
o Algebra homomorphism- this is a homomorphism between two algebras
•Properties of elements under homomorphisms:
Let $ \Phi\,\! $ be a homomorphism from a group G to a grou H and let g be and element of G. Then:
1) $ \Phi\,\! $ carries the identity of G to the identity of H
2)$ \Phi\,\! $(g^n) = ($ \Phi\,\! $(g))^n for all n in Z
3)If |g| is finite, then |$ \Phi\,\! $(g)| divides |g|
4)Ker($ \Phi\,\! $) is a subgroup of G
5)aKer($ \Phi\,\! $) = bKern($ \Phi\,\! $) if and only if $ \Phi\,\! $(a) = $ \Phi\,\! $(b)
6)If $ \Phi\,\! $(g) = g' then $ \Phi\,\! $^-1(gprime) = {x in G | $ \Phi\,\! $(x) = g'} = gKer$ \Phi\,\! $
•Properties of Subgroups Under Homomorphisms
Let $ \Phi\,\! $ be a homomorphism from a group G to a group H and let I be a subgroup of G. Then:
1)$ \Phi\,\! $(I) = [$ \Phi\,\! $(i) | i in I} is a subgroup of H
2)If I is cyclic, then $ \Phi\,\! $(I) is cyclic
3)If I is Abelian, then $ \Phi\,\! $(I) is Abelian
4)If I is normal in G, then $ \Phi\,\! $(I) is normal in $ \Phi\,\! $(G)
5)If |Ker$ \Phi\,\! $| = n, then phis is an n-to-1 mapping from G onto $ \Phi\,\! $(G)
6)If |I| = n, then |$ \Phi\,\! $(I)| divides n
7)If I bar is a subgroup of G bar, then $ \Phi\,\! $^-1(I bar) = {i in G | $ \Phi\,\! $(i) in Ibar} is a subgroup of G.
8)If I bar is a normal subgroup of G bar, then $ \Phi\,\! $^-1(Ibar) = {i in G| $ \Phi\,\! $(i) in Ibar} is a normal subgroup of G
9)If $ \Phi\,\! $ is onto and Kerphi = {e}, then $ \Phi\,\! $ is an isomorphism from G to G bar.
Examples
• Any isomorphism is a homomorphism that is also onto and 1-to-1
• The mapping phi from Z to Zn, definded by phi(m) = m mod n is a homomorphism
• The mapping phi(x) = x^2 from R*, the nonzero real numbers under multiplication, to itself is a homomorphism. This is because phi(ab) =(ab)^2 = a^2b^2 = phi(a)phi(b) for all a and b in R*
• The exponential function rho : x --> e^x is an isomorphism. It is injective (monomorphism) and surjective (epimorphism) because one can take logs.
• : (R_t_, *) --> (R_t_, *) is an isomorphism
• ( *2) : Z/3Z --> Z/3Z is a monomorphism,epimorphism and isomorphism
