Ask your own question, for FREE!
Mathematics 21 Online
OpenStudy (aravindg):

What do we mean by abelian,cyclic and infinite groups?

OpenStudy (paki):

an ablian group is a group for which the elements commute (i.e., AB=BA for all elements A and B)... whereas a cyclic group is a group that can be generated by a single element X (the group generator)... and an infinite group is a group, of which the underlying set contains an infinite number of elements...

OpenStudy (aravindg):

Can you explain cyclic and infinite group more?

OpenStudy (aravindg):

Maybe an example?

OpenStudy (paki):

hmm... a cyclic group is a group in which every element is a power of some fixed element....

OpenStudy (ikram002p):

ill give u example

OpenStudy (aravindg):

So how do I check if it is cyclic,abelian or infinite for this question?

OpenStudy (aravindg):

Here is the qn I am working on^

OpenStudy (paki):

group G is cyclic if G = (a)... for some a belongs to G and a = {a^k / k belongs to Z}.. Such an element is called a generator of G...

OpenStudy (aravindg):

Can you explain using the qn I posted?

OpenStudy (aravindg):

How do I check for cyclic and infinite in it?

OpenStudy (ikram002p):

hey is this the only info abt ur group ?

OpenStudy (ikram002p):

i mean what kind of element should G have ?

OpenStudy (aravindg):

Yep. That's an obective qn and options are like a)abelian b)cyclic c)infinite

OpenStudy (aravindg):

I am seeing such a question for first time. These terms are like from another planet for me.

OpenStudy (ikram002p):

well i wont guess lol but to show if its cyclic u need info abt the elements , G is consederd to be cyclic when all elements are generated from one element so i cant juge if its cyclic or not :O ovs its abelian , and its infinte

OpenStudy (aravindg):

Only 1 answer is right.

OpenStudy (paki):

its not the abilaian... because the abelian group holds commutative property.. and here not that case... if a and b are tha members of abelian group, then ab must be equal to ba...

OpenStudy (ikram002p):

for exampl f(x)=e^x we wud have G g={1,e,e^2,e^3,...} i think this group apply the condition (a^2*b^2)=(a*b)^2 (e^2a * b^2b)=(e^2(a+b))=(e^a+b)^2=(e^a *e^b)^2 so as u can see here in this exampl its cyclic , abelian,and infinte :3 so somthing missing :O

OpenStudy (aravindg):

I dont want to check abelian. I want cyclic and infinite!

OpenStudy (paki):

for cyclic we need the members of G...?

OpenStudy (ikram002p):

so in general i dnt think that only one of them :O whats ur course name ?

OpenStudy (aravindg):

Just a competitive exam.

OpenStudy (ikram002p):

ok ok i said what i have , i gave u an example for such a G that have the same condition and its cyclic , abelian and infinite at the same time :O

OpenStudy (aravindg):

hmm...

OpenStudy (experimentx):

consider the group of n-th roots of unity under the operation of multiplication.. i.e. \( \omega ^n = 1 \) , this is an example of cyclic group generated by \( \omega \). it's elements are \[G = \{ 1, \omega, \dots , \omega^{n-1}\}\] consider the group of integers under the operation of addition, it is an example of infinite group. and, for abelian group, both of above are Abelian group. Rather let me give you an example of non-abelain group. consider a set of 2x2 matrices, under the operation of multiplication such that \(ad-bc \neq 0 \). where matrix is \[ \begin{bmatrix} a & b\\ c & d \end{bmatrix} \] http://groupprops.subwiki.org/wiki/Symmetric_group:S3 Also consider this group.

OpenStudy (experimentx):

if \(a^2*b^2 = (a*b)^2 \) for two elements in a group, then it's abelian group.

OpenStudy (experimentx):

It can be seen in following way, \[ a^2*b^2 = (a*b)^2 \\ a^{-1}*(a^2*b^2)*b^{-1} = a^{-1}((a*b)*(a*b))*b^{-1} \] Since both, 'a' and 'b' are elements of group, they both have inverse. using associativity property, you get \( a*b = b*a \). There is not enough information about weather it's cyclic group or infinite group.

OpenStudy (aravindg):

Thank you for such a wonderful explanation @experimentX . I have 2 doubts after going through it: 1. How do we know that inverse exists for both a and b if they are present in the group? 2.You applied associative property while proving commutativity.How do we know that "*"obeys associative property? Thanks again :)

OpenStudy (experimentx):

that is the definition of group. http://en.wikipedia.org/wiki/Group_(mathematics)#Definition

OpenStudy (experimentx):

For a set equipped with some operation to be group ... it must satisfy those properties.

OpenStudy (aravindg):

Oh I see it now. One more question. What do we mean by the order of a group and why we take order of e as 1?

OpenStudy (experimentx):

e does not necessarily have to be 1. (if the operation is (algebraic) multiplicative then e=1 Just that it has to satisfy the property e*a = a*e = a the order of group if the number of elements present on it.

OpenStudy (experimentx):

If you consider the group of 2x2 matrix under multiplication, then e = unit matrix. under addition, your e=0.

OpenStudy (experimentx):

under addition for set of real numbers, your e=0.

OpenStudy (zarkon):

"why we take order of e as 1" \[e^1=1\] therefore \(|e|=1\)

OpenStudy (zarkon):

e^1=e

OpenStudy (experimentx):

O.o ... you meant order of e!!

OpenStudy (aravindg):

Take a look at this: So If it cannot be true for addition then why this qn is general?

OpenStudy (aravindg):

@Zarkon How does that relate with number of members?

OpenStudy (experimentx):

first of all you need to define the order of element. for \( a \in G \) , order of a = n => a^n = e

OpenStudy (zarkon):

where n is the smallest natural number that works

OpenStudy (experimentx):

0 + 0 = 0

OpenStudy (aravindg):

Oh wait..That doesnt look right. Why we get a^n=e?

OpenStudy (experimentx):

hmm ... pigeonhole principle.

OpenStudy (experimentx):

closure property ... for finite group

OpenStudy (aravindg):

By closure property we mean the values lie in a particular range?

OpenStudy (experimentx):

no ... for two elements \(a, b \in G \), \(a *b \in G\) ... if suppose \( a^n \) is different from \( a^{n-1}\) for each n, what do you get? and if Group is finite?

OpenStudy (aravindg):

No idea about that.

OpenStudy (experimentx):

for some 'n', all elements of G, a^n = e. and you can guess this n is less or equal to the order of group.

OpenStudy (experimentx):

you get \[\{ a , a^2, a^3, \dots , a^n , a^{n+1}, ... \}\] they all are different elements and unique elements. But in group of order k, there are only k elements, say \[ G= \{ e, a, b, c, \dots , k\}\]

OpenStudy (experimentx):

*k+1 elements

OpenStudy (experimentx):

what do you see?

OpenStudy (aravindg):

a,b,c....k product gives 1?

OpenStudy (zarkon):

Suppose that \(|G|=n\) suppose \(a\ne e\) then look at the list \[\{a,a^2,a^3,\ldots,a^n\}\] if they are all different (and not equal to e) then you have n+1 elements this is not possible therefore for some i,j; \(i\ne j\) \[a^i=a^j\] then \[a^{i-j}=e\]

OpenStudy (experimentx):

No ... i meant to say that there are only k+1 elements on the group.

OpenStudy (aravindg):

Why doesn't the product work out to 1 as the group contains inverse of each elements?

OpenStudy (zarkon):

the group might not be abelian

OpenStudy (aravindg):

Oh I see.

OpenStudy (aravindg):

So then i-j=n?

OpenStudy (zarkon):

maybe...maybe not

OpenStudy (zarkon):

if a generates G then the order of a is n, but is could be any natural number that divides n

OpenStudy (zarkon):

depends on the group and the element

OpenStudy (aravindg):

So order is least natural number n such that a^n=e?

OpenStudy (experimentx):

yep!!

OpenStudy (experimentx):

and \( o(a) \le o(G) \)

OpenStudy (aravindg):

Okay it makes a lot of things clear!! Thank you both for clarifying my doubts!! :)

OpenStudy (experimentx):

yw

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!