01.02.2015 Views

64 m kj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;] bykgkckn

64 m kj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;] bykgkckn

64 m kj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;] bykgkckn

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

25<br />

87<br />

m <strong>kj</strong> izns’k jktf"<strong>kZ</strong> V.<strong>Mu</strong> <strong>eqDr</strong> fo’ofo|ky;] <strong>bykgkckn</strong><br />

fo’k; % xf.kr<br />

Subject : Mathematics<br />

dkslZ “kh’<strong>kZ</strong>d % Abstract Algebra<br />

Course Title : Abstract Algebra<br />

vf/kU;kl (Assignment) 2012-2013<br />

Lukrd dyk dk;ZØe<br />

Under Graduate Art Programme<br />

Section - A<br />

[k.M & d<br />

fo’k; dksM% ;w0th0,e0,e0<br />

Subject Code : UGMM<br />

dkslZ dksM % ;w0th0,e0,e0-06<br />

Course Code : UGMM-06<br />

vf/kdre vad % 30<br />

Maximum Marks:30<br />

vf/kdre vad % 18<br />

Max. Marks: 18<br />

uksV % nh<strong>kZ</strong> mRrjh; iz”uA vius iz”uksa ds mRrj 800 ls 1000 “kCnksa esa fy[ksaA lHkh iz”u vfuok;Z gSA<br />

Note : Long Answer Questions. Answer should be given in 800 to 1000 words. Answer all<br />

questions.<br />

1 Define a semi-group and a group. Prove that a semi-group having finite number of<br />

elements in which cancellation laws hold is a group. Does this result hold for an<br />

infinite semi-group 6<br />

,d mi lewg rFkk lewg dks ifjHkkf’kr djsaA fn[kk;sa fd ,d milewg esa ifjfer vo;o gS ftlesa dkVu<br />

fu;e lEHko gS] og ,d lewg gSA D;k ;g ckr vifjfer vo;o okys lewg esa Hkh ykxw gksrk gS\<br />

2 Show that the set Z m of residue classes modulo the positive integer m is a<br />

commutative ring with identity with respect to addition and multiplication of residue<br />

classes. 6<br />

fn[kk;s fd leqPp; Z m ¼jsftM~;w oxZ mod m½ ,d Øefofue; oy; identity vo;o ds lkFk gS]<br />

jsftM~;w oxZ ds ;ksx ,oa xq.ku ds lkis{k esaA<br />

3 Deifne a subgroup of a group and find a necessary and sufficient condition for a nonempty<br />

subset of a group to be a subgroup of the group.If<br />

homomorphism, prove that the Ker f is a suchgroup of G.<br />

6<br />

'<br />

f : G ® G is a group<br />

fdlh lewg ds milewg dks ifjHkkf’kr djsaA fdlh v”kwU; lewPp;] fdlh lewg dk milewg ds fy,<br />

'<br />

f : G ® G ,d lewg ledkfjrk gS rks fn[kk;sa fd<br />

vko”;d ,oa fuf”pr “krZ Kkr djsaA ;fn<br />

(Ker f ), G dk ,d milewg gSA<br />

Section B<br />

[k.M & [k vf/kdre vad % 12<br />

Max. Marks: 12<br />

uksV % ykq mRrjh; iz”uA vius iz”uksa ds mRrj 200 ls 300 “kCnksa esa fy[ksaA lHkh iz”u vfuok;Z gSA<br />

Note : Short Answer Questions. Answer should be given in 200 to 300 words.<br />

Answer all questions.<br />

4 Let A and B be two finite sets having m and n elements respectively. Find the number<br />

of distinct relations that can be defined from A to B. 3<br />

nks ifjfer leqPp; A rFkk B ftuesa m, n vo;o gS ds chp fdrus vyx&vyx lEcU/k gks ldrs gSA<br />

5 In a group with even number of elements, show that there is at least one element<br />

besides the identity, which is its own inverse and there will be odd number of such<br />

elements. 3<br />

fn[kkb;s fd fdlh lewg esa de ls de ,d vo;o [kqn dk izfrykse gksxk tcfd ml lewg esa 2m ¼le½<br />

vo;o gSaA fn[kkb;sa fd [kqn izfrykse okys vo;o gSA fn[kkb;sa fd [kqn izfrykse okys vo;oksa dh la[;k<br />

fo’ke gksxhA<br />

6 Let f be a group homomorphism from the additive group of integers to the<br />

multiplicaitve group of non-zero rational numbers. Find the following 3<br />

(i) f(0)<br />

(ii) f(-2) if f(2)=1<br />

(iii) f(3) if f(1)= -1<br />

;fn f : ( z,<br />

+ ) ® ( Q -{0};<br />

) ,d ledkfjrk gS rks fuEu dks Kkr djsaA<br />

(i) f(0)<br />

(ii) f(-2) ;fn f(2)=1<br />

(iii) f(3) ;fn if f(1)= -1<br />

7 Define a cyclic group and give an example of a non-cyclic group whose all proper<br />

subgroups are cyclic. 3<br />

,d pØh; lewg dks ifjHkkf’kr djsa ,d mnkgj.k vpØh; lewg dk nsa ftlds lHkh proper milewg<br />

pØh; gksA

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!