UNIT 3 the SYLOW THEOREMS the Sylow Theorems

Total Page:16

File Type:pdf, Size:1020Kb

UNIT 3 the SYLOW THEOREMS the Sylow Theorems UNIT 3 THE SYLOW THEOREMS The Sylow Theorems Structure Page Nos. 3.1 Introduction 57 Objectives 3.2 Direct Product of Groups 58 External Direct Product Internal Direct Product 3.3 Existence of Subgroups of Given Orders 62 3.4 Applications of Sylow’s Theorems 70 3.5 Summary 73 3.6 Solutions / Answers 74 3.1 INTRODUCTION In this unit, we use the notions and results about group actions developed in the previous unit to derive some basic theorems about finite groups and their structures. To be able to describe, and analyse, the structure of a finite group, we need the concept of a direct product of groups. In Sec.3.2, you will study this concept. In Sec.3.3, we look at when the converse of Lagrange’s theorem holds, namely, given a factor k of ),G(o where G is finite, does there exist a subgroup of G of order ?k As you will see, the answer is “no” in general. Further, in Sec.3.3 and Sec.3.4, you will see that there are several special cases when the answer is “yes”. To reach this stage, you will be banking on very important theorems of group theory, which are due to the mathematician Sylow. In Sec.3.3, you will study the proofs of three theorems due to him. In Sec.3.4, you will be studying several applications of these theorems. As noted above, you will be closely looking at several theorems and techniques for analysing the structure of finite groups. Therefore, after studying this unit, come back to this point and make sure you have achieved the following objectives of studying this unit. Objectives After studying this unit, you should be able to: • construct the direct product of a finite number of groups; • check if a group is the direct product of its subgroups; • give examples to show when the converse of Lagrange’s theorem holds, and that it doesn’t hold in general; • state, and prove, all three Sylow theorems; and • apply Sylow’s theorems to prove the existence of subgroups of a specified order, and to analyse the structure of some finite groups. 57 Group Theory 3.2 DIRECT PRODUCT OF GROUPS In this section you will study a very important method of constructing new groups by using given groups as building blocks. We will first look at one way in which two groups can be combined to form a third group. Then we will discuss a similar way in which two subgroups of a group can be combined to form another subgroup. 3.2.1 External Direct Product In this sub-section, you will study one way of constructing a new group from two or more groups that are given. Let (G1 ,∗ 1 ) and (G2 ,∗ 2 ) be two groups. Consider their Cartesian product G= G1 × G 2 = {(x,y)|x∈ G,y1 ∈ G}.2 Can we define a binary operation on G by using the operations on G1 and G2 ? Let us try the obvious method, namely, componentwise multiplication. That is, we define the operation ∗ on G by (a,b)∗ (c,d) = (a ∗1 c,b ∗2 d) ∀ a,c ∈ G,b1 , d ∈ G2 . The way we have defined ∗ ensures that it is a binary operation. To check that (G,∗ ) is a group, you need to solve the following exercise. E1) Show that the binary operation ∗ on G is associative. Find its identity element and the inverse of any element (x, y) in .G So, by solving E1, you have proved that GGG=1 × 2 is a group with respect to ∗ . We call G the external direct product of (G1 ,∗ 1 ) and (G2 ,∗ 2 ). For example, R2 is the external direct product of R with itself. Another example is the direct product (,)(,)Z + ×R∗ ⋅ in which the operation is given by (m,x)∗ (n,y)= (m+ n,xy) for m, n∈Z , x, y ∈ R∗ . Remark 1: The groups forming the direct product do not need to have the Z same properties or algebraic structure. For instance, S3 × is a well-defined Z Z direct product of (S3 ,o ) and ( ,+ ), where S3 is non-abelian and is abelian, in fact, cyclic. We can define the external direct product of 3, 4 or more groups along the same lines. Definition: Let (G,1∗ 1 ),(G, 2 ∗ 2 ),K ,(G,n∗ n ) be n groups. Their external direct product is the group (G,∗ ), where GGGG=1 × 2 ×K × n and (x,x,1 2 K ,x)(y,y,n∗ 1 2 K ,y)n = (x1 ∗ 1 y,x 1 2 ∗ 2 y, 2 K ,xn∗ n y) n ∀ x,y i i ∈ G. i Thus, Rn is the external direct product of n copies of R,∀ n∈ N . We would like to make a remark about notation now. 58 The Sylow Theorems Remark 2: Henceforth, we will assume that all the operations ∗,,, ∗1 K ∗n are multiplication, unless mentioned otherwise. Thus, the operation on GGGG=1 × 2 ×K × n will be given by (a,1 K ,a).(b,n 1 K ,b)n= (ab,ab, 1 1 2 2 K ,ab)n n∀ a,b i i ∈ G. i Now, you know that given two sets A and B, A× B≠ B× A. So, you may Z Z wonder if, for example, ×S3 and S3 × are different groups. It turns out they are essentially the same, which is what the following exercise says. ~ E2) Show that GG1× 2GG, 2× 1 for any two groups G1 and G2 . Because of E2, we can speak of the direct product of 2 (or n ) groups without bothering about the order in which their products are taken. Now, let G be the external direct product G1× G 2 . Consider the projection map π1:G 1 × G 2 → G: 1 π 1 (x,y) = x. You should check that π 1 is a surjective group homomorphism. Also, Kerπ1 = {(x,y) ∈ G1 × G| 2 π 1 (x,y) = e}1 ={(e,y)|y1 ∈ G}2 = {e} 1 × G. 2 ∴{e1 } × G 2 G1× G 2 . So, by the Fundamental Theorem of Homomorphism ~ (G1× G 2 ) ({e 1 }× G 2 ) G. 1 You can, similarly, prove that G1× {e 2 } GG1× 2 and ~ (G1× G 2 ) (G 1 × {e 2 }) G.2 In the following exercises you can prove some general facts about external direct products of groups. E3) Show that GG1× 2 is the product of its normal subgroups H= G1 × {e 2 } and K= {e1 }× G 2 . Also show that (G1× {e}) 2 ∩ ({e}1 × G) 2 = {(e,e)}.1 2 E4) Prove that Z(G1× G) 2 = Z(G)1 × Z(G),2 where Z(G) denotes the centre of G. E5) Let A and B be cyclic groups of order m and n, respectively, where (m, n)= 1. Prove that A× B is cyclic of order mn. Z Z Z Z Z [Hint: Define f : →m × n :f(r) = (r + m,r + n). Then apply the Z Z ~ Z Fundamental Theorem of Homomorphism to show that m× n mn . ] E6) Show that if HG1≤ 1 and H2≤ G 2 , then HHGG.1× 2 ≤ 1× 2 Further, if H1 G1 and H2 G2 , is HH1× 2 G1× G? 2 Give reasons for your answer. E7) Give an example, with justification, to show that not every subgroup of the direct product GG1× 2 of the groups G1 and G2 is of the form 59 Group Theory HH,1× 2 where H1 is a subgroup of G1 and H2 is a subgroup of G2 . So, far we have discussed the construction of GG1× 2 from two groups G1 and G2 . Let us now see under which conditions we can express a group as a direct product of its subgroups. 3.2.2 Internal Direct Product Let us begin by recalling that if H and K are normal subgroups of a group G, then HK is a normal subgroup of .G We are interested in the case when HK is the whole of .G Related to this, consider the following definition. Definition: Let H and K be normal subgroups of a group .G We call G the internal direct product of H and K if G= HK and H∩ K= {e}. This fact is denoted by GHK= × . Let us consider some examples. Example 1: Show that the Klein 4-group, K4 , is an internal direct product of its subgroups. 2 2 Solution: K4 = {e, a, b, ab}, where a= e, b= e and ab= ba. Let H= a and K= b . Then, H and K are normal in K4 (as K4 is abelian), and H∩ K= {e}. Also, K4 = HK. ∴KHK4 = × . ~ Z ~ Z ~ Z Z Here, note that H 2 and K 2 . ∴K4 2 × 2. *** Z Example 2: Show that 10 is the internal direct product of its subgroups H= {0, 5} and K= {0,2,4,6,8}. Z Z Solution: Note that 10 is abelian, so that H and K are normal in 10 . Further, Z Z i) 10 =H + K, since any element of 10 is the sum of an element of H and an element of K (note that 1= 5 − 4 ∈ H + K ), and ii) H∩ K = {0}. Z Hence 10 =H × K. *** Now, can an external direct product also be an internal direct product? Well, go back to E3. What does it say? It says that the external product of GG1× 2 is the internal product (G1× {e}) 2 × ({e}1 × G). 2 Consider the following remark now. Remark 3: Let H and K be normal subgroups of a group .G Then the internal direct product of H and K is isomorphic to the external direct product of H and .K Therefore, when we talk of an internal direct product of 60 subgroups we can drop the word internal, and just say ‘direct product of The Sylow Theorems subgroups’.
Recommended publications
  • Lie Groups and Lie Algebras
    2 LIE GROUPS AND LIE ALGEBRAS 2.1 Lie groups The most general definition of a Lie group G is, that it is a differentiable manifold with group structure, such that the multiplication map G G G, (g,h) gh, and the inversion map G G, g g−1, are differentiable.× → But we shall7→ not need this concept in full generality.→ 7→ In order to avoid more elaborate differential geometry, we will restrict attention to matrix groups. Consider the set of all invertible n n matrices with entries in F, where F stands either for the real (R) or complex× (C) numbers. It is easily verified to form a group which we denote by GL(n, F), called the general linear group in n dimensions over the number field F. The space of all n n matrices, including non- invertible ones, with entries in F is denoted by M(n,×F). It is an n2-dimensional 2 vector space over F, isomorphic to Fn . The determinant is a continuous function det : M(n, F) F and GL(n, F) = det−1(F 0 ), since a matrix is invertible → −{ } 2 iff its determinant is non zero. Hence GL(n, F) is an open subset of Fn . Group multiplication and inversion are just given by the corresponding familiar matrix 2 2 2 2 2 operations, which are differentiable functions Fn Fn Fn and Fn Fn respectively. × → → 2.1.1 Examples of Lie groups GL(n, F) is our main example of a (matrix) Lie group. Any Lie group that we encounter will be a subgroups of some GL(n, F).
    [Show full text]
  • More on the Sylow Theorems
    MORE ON THE SYLOW THEOREMS 1. Introduction Several alternative proofs of the Sylow theorems are collected here. Section 2 has a proof of Sylow I by Sylow, Section 3 has a proof of Sylow I by Frobenius, and Section 4 has an extension of Sylow I and II to p-subgroups due to Sylow. Section 5 discusses some history related to the Sylow theorems and formulates (but does not prove) two extensions of Sylow III to p-subgroups, by Frobenius and Weisner. 2. Sylow I by Sylow In modern language, here is Sylow's proof that his subgroups exist. Pick a prime p dividing #G. Let P be a p-subgroup of G which is as large as possible. We call P a maximal p-subgroup. We do not yet know its size is the biggest p-power in #G. The goal is to show [G : P ] 6≡ 0 mod p, so #P is the largest p-power dividing #G. Let N = N(P ) be the normalizer of P in G. Then all the elements of p-power order in N lie in P . Indeed, any element of N with p-power order which is not in P would give a non-identity element of p-power order in N=P . Then we could take inverse images through the projection N ! N=P to find a p-subgroup inside N properly containing P , but this contradicts the maximality of P as a p-subgroup of G. Since there are no non-trivial elements of p-power order in N=P , the index [N : P ] is not divisible by p by Cauchy's theorem.
    [Show full text]
  • The Sylow Theorems and Classification of Small Finite Order Groups
    Union College Union | Digital Works Honors Theses Student Work 6-2015 The yS low Theorems and Classification of Small Finite Order Groups William Stearns Union College - Schenectady, NY Follow this and additional works at: https://digitalworks.union.edu/theses Part of the Physical Sciences and Mathematics Commons Recommended Citation Stearns, William, "The yS low Theorems and Classification of Small Finite Order Groups" (2015). Honors Theses. 395. https://digitalworks.union.edu/theses/395 This Open Access is brought to you for free and open access by the Student Work at Union | Digital Works. It has been accepted for inclusion in Honors Theses by an authorized administrator of Union | Digital Works. For more information, please contact [email protected]. THE SYLOW THEOREMS AND CLASSIFICATION OF SMALL FINITE ORDER GROUPS WILLIAM W. STEARNS Abstract. This thesis will provide an overview of various topics in group theory, all in order to accomplish the end goal of classifying all groups of order up to 15. An important precursor to classifying finite order groups, the Sylow Theorems illustrate what subgroups of a given group must exist, and constitute the first half of this thesis. Using these theorems in the latter sections we will classify all the possible groups of various orders up to isomorphism. In concluding this thesis, all possible distinct groups of orders up to 15 will be defined and the groundwork set for further study. 1. Introduction The results in this thesis require some background knowledge and motivation. To that end, material covered in an introductory course on abstract algebra should be sufficient. In particular, it is assumed that the reader is familiar with the concepts and definitions of: group, subgroup, coset, index, homomorphism, and kernel.
    [Show full text]
  • Automorphisms of Direct Products of Groups and Their Geometric Realisations
    Math. Ann. 263, 343 364 ~1983) Am Springer-Verlag 1983 Automorphisms of Direct Products of Groups and Their Geometric Realisations Francis E. A. Johnson Department of Mathematics, University College, Gower Street, London WC1E 6BT, UK O. Introduction An outstanding problem in the theory of Poincar6 Duality (=PD) groups is to decide whether each PD group can be realised as the fundamental group of a smooth closed aspherical manifold. See [2, 15-17] for previous work on this problem. There are two main ways of constructing new PD groups from old [18] ; (i) by extension of one PD group by another, and (ii) by torsion free extension of a PD group by a finite group. One approach to the above problem is to apply the constructions (i) and (ii) to known realisable PD groups and try to decide whether the resulting PD groups are realisable. Though other examples are known, for instance the examples con- structed by Mostow and Siu in [25], the most convenient PD groups with which to start are discrete uniform subgroups of noncompact Lie groups. If F is a torsion free discrete uniform subgroup of a connected noncompact Lie group G, and if K is a maximal compact subgroup of G, then F\G/K is a smooth closed manifold of type K(F, 1). The present paper is a continuation of both [15] and [16]. Whereas in [16] we allowed only Surface groups, that is, torsion free discrete uniform subgroups of PGLz(IR), and in [15] allowed only discrete uniform subgroups of Lie groups with no PSLz(IR) factors as building blocks, here we go some way towards combining the two.
    [Show full text]
  • A STUDY on the ALGEBRAIC STRUCTURE of SL 2(Zpz)
    A STUDY ON THE ALGEBRAIC STRUCTURE OF SL2 Z pZ ( ~ ) A Thesis Presented to The Honors Tutorial College Ohio University In Partial Fulfillment of the Requirements for Graduation from the Honors Tutorial College with the degree of Bachelor of Science in Mathematics by Evan North April 2015 Contents 1 Introduction 1 2 Background 5 2.1 Group Theory . 5 2.2 Linear Algebra . 14 2.3 Matrix Group SL2 R Over a Ring . 22 ( ) 3 Conjugacy Classes of Matrix Groups 26 3.1 Order of the Matrix Groups . 26 3.2 Conjugacy Classes of GL2 Fp ....................... 28 3.2.1 Linear Case . .( . .) . 29 3.2.2 First Quadratic Case . 29 3.2.3 Second Quadratic Case . 30 3.2.4 Third Quadratic Case . 31 3.2.5 Classes in SL2 Fp ......................... 33 3.3 Splitting of Classes of(SL)2 Fp ....................... 35 3.4 Results of SL2 Fp ..............................( ) 40 ( ) 2 4 Toward Lifting to SL2 Z p Z 41 4.1 Reduction mod p ...............................( ~ ) 42 4.2 Exploring the Kernel . 43 i 4.3 Generalizing to SL2 Z p Z ........................ 46 ( ~ ) 5 Closing Remarks 48 5.1 Future Work . 48 5.2 Conclusion . 48 1 Introduction Symmetries are one of the most widely-known examples of pure mathematics. Symmetry is when an object can be rotated, flipped, or otherwise transformed in such a way that its appearance remains the same. Basic geometric figures should create familiar examples, take for instance the triangle. Figure 1: The symmetries of a triangle: 3 reflections, 2 rotations. The red lines represent the reflection symmetries, where the trianlge is flipped over, while the arrows represent the rotational symmetry of the triangle.
    [Show full text]
  • Group Theory Group Theory
    12/16/2018 Group Theory Group Theory Properties of Real Topic No. 1 Numbers 1 2 Properties of Real Numbers Properties of Real Numbers Number Systems 0.131313…=0.13+ ℕ ={ 1, 2, 3, … } 0.0013+0.000013+… ℤ={…, -2, -1, 0, 1, 2, … } =13/100+13/10000+ ℚ={p/q | p, q ∊ ℤ and q≠0} 13/1000000+… ℚˊ= Set of Irrational =(13/100)(1+1/100+ Numbers 1/10000+…) ℝ=ℚ ∪ ℚˊ =(13/100)(100/99) =13/99 3 4 Properties of Real Numbers Properties of Real Numbers . e=2.718281828459045… ∊ ℚˊ . ∀ a, b, c ∊ ℝ, (ab)c=a(bc) . √2=1.414213562373095… ∊ ℚˊ . For instance, ((-2/3)4)√2=(-8/3) √2 =(-2/3)(4 √2) . √5=2.23606797749978… ∊ ℚˊ . For every a ∊ ℝ and 0 ∊ ℝ, a+0=a=0+a . ∀ a, b ∊ ℝ, a.b ∊ ℝ . For every a ∊ ℝ and 1 ∊ ℝ, a.1=a=1.a . ∀ a, b ∊ ℝ, a+b ∊ ℝ . For every a ∊ ℝ there exists -a ∊ ℝ such that . ∀ a, b, c ∊ ℝ, (a+b)+c=a+(b+c) a+(-a)=0=(-a)+a . For example, (1/4+3)+ √7=(13+4 √7)/4=1/4+(3+ √7) . For every a ∊ ℝ\{0} there exists 1/a ∊ ℝ\{0} such that a(1/a)=1=(1/a)a . ∀ a, b ∊ ℝ, a+b=b+a . ∀ a, b ∊ ℝ, a.b=b.a 5 6 1 12/16/2018 Group Theory Group Theory Properties of Complex Topic No. 2 Numbers 7 8 Properties of Complex Numbers Properties of Complex Numbers . ℂ={a+bi | a, b ∊ ℝ} .
    [Show full text]
  • Supplement. Direct Products and Semidirect Products
    Supplement: Direct Products and Semidirect Products 1 Supplement. Direct Products and Semidirect Products Note. In Section I.8 of Hungerford, we defined direct products and weak direct n products. Recall that when dealing with a finite collection of groups {Gi}i=1 then the direct product and weak direct product coincide (Hungerford, page 60). In this supplement we give results concerning recognizing when a group is a direct product of smaller groups. We also define the semidirect product and illustrate its use in classifying groups of small order. The content of this supplement is based on Sections 5.4 and 5.5 of Davis S. Dummitt and Richard M. Foote’s Abstract Algebra, 3rd Edition, John Wiley and Sons (2004). Note. Finitely generated abelian groups are classified in the Fundamental Theo- rem of Finitely Generated Abelian Groups (Theorem II.2.1). So when addressing direct products, we are mostly concerned with nonabelian groups. Notice that the following definition is “dull” if applied to an abelian group. Definition. Let G be a group, let x, y ∈ G, and let A, B be nonempty subsets of G. (1) Define [x, y]= x−1y−1xy. This is the commutator of x and y. (2) Define [A, B]= h[a,b] | a ∈ A,b ∈ Bi, the group generated by the commutators of elements from A and B where the binary operation is the same as that of group G. (3) Define G0 = {[x, y] | x, y ∈ Gi, the subgroup of G generated by the commuta- tors of elements from G under the same binary operation of G.
    [Show full text]
  • Lecture 1.3: the Sylow Theorems
    Lecture 1.3: The Sylow theorems Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8510, Abstract Algebra I M. Macauley (Clemson) Lecture 1.3: The Sylow theorems Math 8510, Abstract Algebra I 1 / 33 Some context Once the study of group theory began in the 19th century, a natural research question was to classify all groups. Of course, this is too difficult in general, but for certain cases, much is known. Later, we'll establish the following fact, which allows us to completely classify all finite abelian groups. Proposition ∼ Znm = Zn × Zm if and only if gcd(n; m) = 1. (0;0) (3;2) (1;1) (0;0) (1;0) (2;0) (3;0) (2;1) (2;2) (1;0) ∼ (3;0) (0;1) (1;1) (2;1) (3;1) Z4 × Z3 = Z12 · · · (0;2) (0;1) (0;2) (1;2) (2;2) (3;2) (3;1) (1;2) (2;0) Finite non-abelian groups are much harder. The Sylow Theorems, developed by Norwegian mathematician Peter Sylow (1832{1918), provide insight into their structure. M. Macauley (Clemson) Lecture 1.3: The Sylow theorems Math 8510, Abstract Algebra I 2 / 33 The Fundamental Theorem of Finite Abelian Groups Classification theorem (by \prime powers") Every finite abelian group A is isomorphic to a direct product of cyclic groups, i.e., for some integers n1; n2;:::; nm, ∼ A = Zn1 × Zn2 × · · · × Znm ; di where each ni is a prime power, i.e., ni = pi , where pi is prime and di 2 N. Example Up to isomorphism, there are 6 abelian groups of order 200 =2 3 · 52: Z8 × Z25 Z8 × Z5 × Z5 Z2 × Z4 × Z25 Z2 × Z4 × Z5 × Z5 Z2 × Z2 × Z2 × Z25 Z2 × Z2 × Z2 × Z5 × Z5 Instead of proving this statement for groups, we'll prove a much more general statement for R-modules over a PID, later in the class.
    [Show full text]
  • Arxiv:1406.1932V2 [Math.GR] 2 Oct 2014 B Cited
    Comments, corrections, and related references welcomed, as always! TEXed January 23, 2018 HOMOMORPHISMS ON INFINITE DIRECT PRODUCTS OF GROUPS, RINGS AND MONOIDS GEORGE M. BERGMAN Abstract. We study properties of a group, abelian group, ring, or monoid B which (a) guarantee that every homomorphism from an infinite direct product QI Ai of objects of the same sort onto B factors through the direct product of finitely many ultraproducts of the Ai (possibly after composition with the natural map B → B/Z(B) or some variant), and/or (b) guarantee that when a map does so factor (and the index set has reasonable cardinality), the ultrafilters involved must be principal. A number of open questions and topics for further investigation are noted. 1. Introduction A direct product Qi∈I Ai of infinitely many nontrivial algebraic structures is in general a “big” object: it has at least continuum cardinality, and if the operations of the Ai include a vector-space structure, it has at least continuum dimension. But there are many situations where the set of homomorphisms from such a product to a fixed object B is unexpectedly restricted. The poster child for this phenomenon is the case where the objects are abelian groups, and B is the infinite cyclic group. In that situation, if the index set I is countable (or, indeed, of less than an enormous cardinality – some details are recalled in §4), then every homomorphism Qi∈I Ai → B factors through the projection of Qi∈I Ai onto the product of finitely many of the Ai. An abelian group B which, like the infinite cyclic group, has this property, is called “slender”.
    [Show full text]
  • Graduate Algebra, Fall 2014 Lecture 5
    Graduate Algebra, Fall 2014 Lecture 5 Andrei Jorza 2014-09-05 1 Group Theory 1.9 Normal subgroups Example 1. Specific examples. 1. The alternating group An = ker " is a normal subgroup of Sn as " is a homomorphism. 2. For R = Q; R or C, SL(n; R) C GL(n; R). 3. Recall that for any group G, Z(G) C G and G=Z(G) is a group, which we'll identify later as the group × of inner automorphisms. If R = Z=pZ; Q; R or C then R In = Z(GL(n; R)) and denote the quotient PGL(n; R) = GL(n; R)=R× The case of SL(n; R) is more subtle as the center is the set of n-th roots of unity in R, which depends on 2 what R is. For example Z(SL(2; R)) = ±I2 but Z(SL(3; R)) = I3 while Z(GL(3; C)) = fI3; ζ3I3; ζ3 I3g. a b 0 1 a b c 0 4. But f g is not normal in GL(2;R). Indeed, if w = then w w = . 0 c 1 0 0 c b a 1 b a b 5. But f g is a normal subgroup of f g. 0 1 0 c Remark 1. If H; K ⊂ G are subgroups such that K is normal in G then HK is a subgroup of G. Indeed, KH = HK. Interlude on the big picture in the theory of finite groups We have seen that if G is a finite group and N is a normal subgroup then G=N is also a group.
    [Show full text]
  • Chapter 1 GENERAL STRUCTURE and PROPERTIES
    Chapter 1 GENERAL STRUCTURE AND PROPERTIES 1.1 Introduction In this Chapter we would like to introduce the main de¯nitions and describe the main properties of groups, providing examples to illustrate them. The detailed discussion of representations is however demanded to later Chapters, and so is the treatment of Lie groups based on their relation with Lie algebras. We would also like to introduce several explicit groups, or classes of groups, which are often encountered in Physics (and not only). On the one hand, these \applications" should motivate the more abstract study of the general properties of groups; on the other hand, the knowledge of the more important and common explicit instances of groups is essential for developing an e®ective understanding of the subject beyond the purely formal level. 1.2 Some basic de¯nitions In this Section we give some essential de¯nitions, illustrating them with simple examples. 1.2.1 De¯nition of a group A group G is a set equipped with a binary operation , the group product, such that1 ¢ (i) the group product is associative, namely a; b; c G ; a (b c) = (a b) c ; (1.2.1) 8 2 ¢ ¢ ¢ ¢ (ii) there is in G an identity element e: e G such that a e = e a = a a G ; (1.2.2) 9 2 ¢ ¢ 8 2 (iii) each element a admits an inverse, which is usually denoted as a¡1: a G a¡1 G such that a a¡1 = a¡1 a = e : (1.2.3) 8 2 9 2 ¢ ¢ 1 Notice that the axioms (ii) and (iii) above are in fact redundant.
    [Show full text]
  • Theoretical Approach of a Finite Abelian Groups
    Volume-04 ISSN: 2455-3085 (Online) Issue-02 RESEARCH REVIEW International Journal of Multidisciplinary February -2019 www.rrjournals.com [UGC Listed Journal] Theoretical approach of a finite abelian groups Rupen Chatterjee Department of Mathematics, Nabagram Hiralal Paul College, Nabagram, Hooghly ,West Bengal Pin:712246 India (Affiliated by Calcutta University) ARTICLE DETAILS ABSTRACT Article History It is hopeless to classify all infinite abelian groups, but a good criterion that leads to an Published Online: 20 February 2019 interesting classification is that of finite abelian groups. A finite Abelian group G is a p-group with p ∈ N a prime then every element of G has order a power of p. the order of a finite p- Keywords group must be a power of p .A finite abelian group is a group satisfying the following Finite, linear algebra, isomorphic equivalent conditions. It is isomorphic to a direct product of finitely many finite cyclic groups. It is isomorphic to a direct product of abelian groups of prime power order and it is also isomorphic to a direct product of cyclic groups of prime power order. An abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on their order (the axiom of commutativity). They are named after Niels Henrik Abel. An arbitrary finite abelian group is isomorphic to a direct sum of finite cyclic groups of prime power order, and these orders are uniquely determined, forming a complete system of invariants. The automorphism group of a finite abelian group can be described directly in terms of these invariants.
    [Show full text]