shadi's profile沙地PhotosBlogListsMore ![]() | Help |
|
1/20/2007 1202 ex1 Q3:Q3:
Because G is a finite set,
So we can say {g1,g2,g3...gn}=G
For each gi belongs to G, define a new set F={f1,f2,f3...fn}=G
S.T.
gi * g1 = f1
gi * g2 = f2
:
:
:
gi * gn = fn
because * is an associative binary operation so * is a map G*G-->G
so f1, f2, ... fn belongs to G
If fp = fq, fp,fq belongs to F
i.e. gi*gp = gi*gq
==> gp = gq by cancellation law.
so F=G
so there is a fj = gi I call it "fj", which also known as "gi" in G
i.e. gi*gj=gi=gi*e
so gj = e
so there is a fk = gj I call it "fk", which also known as "gj" in G
i.e. gi*gk=gj=e
so gi has an inverse element, which is gk.
so G is a group.
QED Comments (7)
TrackbacksThe trackback URL for this entry is: http://greenlandwsd.spaces.live.com/blog/cns!FBF6FBB346E28AC8!707.trak Weblogs that reference this entry
|
|
|