REMARKS 1.4: (a) In general discussion the operation in a group G is usually written as multiplication and a b is written as ab. (b) If the operation
|
|
- Winifred Warren
- 5 years ago
- Views:
Transcription
1 FIRST-YEAR GROUP THEORY 1 DEFINITIONS AND EXAMPLES It is highly desirable that you buy, or in some other way have access to a copy of, the following book which will be referred to in these notes as Jordan and Jordan": Groups" by C. R. Jordan and D. A. Jordan, published by Edward Arnold in 1994, ISBN x. CONVENTIONS: Unless stated to the contrary, the following symbols will be used to denote the given sets: C for the set of complex numbers; R for the set of real numbers; Q for the set of rational numbers; Z for the set of integers; Z n or Z=nZ for the set of integers mod(n); M n (A) for the set of n n matrices with entries in the set A. A binary operation on a non-empty set A is a way of starting from any two elements a and b (in that order) of A and producing from them a unique corresponding element a b of A (Jordan and Jordan, Section 4.2). In practice in this course such an operation will usually be either addition or multiplication on a suitable set. Informally, a binary operation is a way of combining any two things of a certain type (i.e. elements of A) to produce an answer of the same type (i.e. an element ofa). DEFINITION 1.1: (Group; Jordan and Jordan, Section 4.3) A non-empty set G is said to be a group under or with respect to the operation, or(g; ) is said to be a group, if all of the four following axioms are satisfied: G1 (Closure) is a binary operation on G, i.e. to each ordered pair (a; b) of elements of G there corresponds a unique element a b of G (and we say that G is closed under or with respect to ); G2 (Associativity) For all a, b, c 2 G we have (a b) c = a (b c); G3 (Existence of identity element) There is an element e of G such that e g = g e = g for all g 2 G, and this element e is called the identity element (or sometimes the neutral element) of G; G4 (Existence of inverses) Corresponding to each element g of G there is an element h of G such that g h = h g = e; and this element h is called the inverse of g and is often denoted by g 1. DEFINITION 1.2: (Abelian) A group G as in 1.1 is said to be Abelian if a b = b a for all a, b 2 G. DEFINITION 1.3: (Order of a group) We shall use ord(g) to denote the number of elements in a group G and shall call ord(g) the order of G. Thus if G has a finite number n of elements then we say that G has order n and write ord(g) =n; if G has an infinite number of elements then we say that G has infinite order or is infinite.
2 REMARKS 1.4: (a) In general discussion the operation in a group G is usually written as multiplication and a b is written as ab. (b) If the operation in a group G is multiplication then we often write 1 rather than e for the identity element. (c) If the operation in a group G is addition then we usually write 0 rather than e for the identity element, and a rather than a 1 for the inverse of an element a of G. Thus in additive notation and using 0 for the identity element we have 0+g = g +0= g for all g 2 G; and given g 2 G there exists h 2 G such that g + h = h + g = 0, and we denote this element h by g. Also we write a b as a shorthand for a +( b). Additive notation is very rarely used for groups which are not Abelian. (d) The notation ord(g) is not standard. The notation jaj is often used to denote the number of elements in a set A whether or not A is a group. (e) The identity element e of a group (G; ) is unique in the sense that if f is also an element of G such that f g = g f = g for all g 2 G then e = f; to justify this note that because e is an identity element then e f = f, and because f is an identity element wehave e f = e. (f) If g is an element of a group G then the inverse of g is unique (Jordan and Jordan, Section 4.5). EXAMPLE 1.5: Let G consist of the four complex numbers 1, i, 1, i where i 2 = 1. Then G is a group with respect to multiplication of complex numbers. It is routine to check that the product of any two elements of G is again an element of G (Closure). In examples like this we shall take the associative law for granted because it is well-known that multiplication of complex numbers is always associative. The element 1 of G is the identity element of G. We can check directly that each elementofg has an inverse in G: we have 1:1 = 1 so that 1 is its own inverse; i: i = i:i = 1 so that i is the inverse of i and equally well i is the inverse of i; and 1: 1=1so that 1 isitsown inverse. We have ord(g) =4and G is Abelian. EXAMPLE 1.6: Let G be the set of non-zero rational numbers. Then G is a group under the usual multiplication of rational numbers. Recall that a rational number is a number of the form a=b where a and b are integers with b 6= 0. So a non-zero rational number is of the form a=b where both a and b are non-zero integers. To check that G is closed under multiplication, let g, h 2 G. Then g = a=b and h = c=d where all of a, b, c, d are non-zero integers. We have gh = ac=bd where ac and bd are non-zero integers, so that gh 2 G. Thus G is closed under multiplication. We shall take it for granted that the multiplication in G is associative. The identity element of G is the rational number 1=1 = 1. If g = a=b as above then the inverse of g is b=a which is again an element ofg. Therefore G is a group under multiplication, and clearly G is infinite and Abelian. EXAMPLE 1.7: We can proceed as in 1.6 to show that the set of positive rational numbers is an infinite Abelian group under multiplication. EXAMPLE 1.8: The set G of negative rational numbers is not a group under multiplication because closure fails. For instance 1, 2 2 G but 1: 2=262 G. EXAMPLE 1.9: The set Q of all rational numbers is not a group under multiplication because there is no inverse for the element 0;clearly the identity element is 1, and there is no element h of Q such that 0:h =1.
3 Similarly we get groups by taking all positive real numbers, all non-zero real numbers, or all non-zero complex numbers under multiplication. These groups are all infinite Abelian. EXAMPLE 1.10: The non-zero integers do not form a group under multiplication (Exercise). EXAMPLE 1.11: The positive integers do not form a group under multiplication (Exercise). REMARKS 1.12: Let n be a positive integer. The elements of the set Z n or Z=nZ of integers mod(n) are conveniently represented by the symbols 0, 1, 2,..., n 1, and these symbols are added and multiplied in the usual way except that multiples of n can be replaced by 0. Similarly any two integers which differ by amultiple of n, i.e. whose difference is divisible by n, are considered to be the same as elements of Z=nZ. For instance, working in Z=7Z the elements can be denoted 0, 1, 2, 3, 4, 5, 6; we have 3+4=7=0,4+6=10=3,4:6 =24=21+3=3,3:4 =12=5, and so on. Note that Z=nZ has n distinct elements. We shall always take it for granted that addition and multiplication in Z=nZ are associative. Note that we doallow n = 1 in which case Z=1Z consists of the single element 0. EXAMPLE 1.13: Let G be the set of non-zero elements of Z=5Z. Then G is a group under multiplication. The elements of G will be denoted by the sumbols 1, 2, 3, 4. To check closure is routine but tedious: for instance 3, 3 2 G and 3:3 = 9 = 4 2 G; also 2, 4 2 G and 2:4 = 8 = 3 2 G. We can state without proof in examples like this that the multiplication is associative. Clearly 1 is the identity element of G. To check for inverses note that in G we have 1 = 1:1 = 2:3 = 4:4 so that 1 and 4 are their own inverses, and 2 and 3 are inverses for each other. EXAMPLE 1.14: Let G consist of the non-zero elements of Z=6Z. Then G is not a group under multiplication. For instance 2, 3 2 G but 2:3 = 6 = 0 62 G, so that closure fails. REMARKS 1.15: (a) The key difference between Examples 1.13 and 1.14 is that 5 is a prime number but 6 is not. (b) When working in Z=nZ we can often shorten calculations by using negative symbols rather than positive ones. For instance in Z=5Z we have 4= 1, so that 4:4 = 1: 1=1. This trick" becomes more useful when n is large. For instance, working in Z=103Z it would be rather tedious without a calculator to work out 96:97 directly; but 96 = 7 and 97 = 6 in Z=103Z, sothat 96:97 = 7: 6 = 42. NOTATION 1.16: (Jordan and Jordan, Section 4.5) Let G be a group in which the operation is multiplication, so that we write xy rather than x y. It follows from the associative law that brackets can be inserted or deleted in products of three or more elements of G (provided that we do not change the order of the factors). For instance, if x, y, z, t 2 G then we have (x(yz))t = (xy)(zt) and we would usually just write this as xyzt. There is no logical problem about using the usual notation for positive integer powers, e.g. using x 2 for xx, x 3 for xxx, and so on. For x 2 G we define x 0 to be the identity element ofg, and for any positive integer n we define x n to be (x 1 ) n. For instance we define x 2 to be the square of x 1 ; it is an exercise to show that x 2 is then also the inverse of x 2. For all x 2 G and all i, j 2 Z we have x i x j = x i+j and (x i ) j = x ij.
4 WARNING 1.17: Let x and y be elements of a multiplicatively-written group G. Then (xy) 2 is not always the same as x 2 y 2. All that we can say in general about (xy) 2 is that it is xyxy, unless for some special reason we have xy = yx in which case (xy) 2 = x 2 y 2. Similarly for (xy) 3, etc. EXAMPLE 1.18: The set G of all non-zero elements of Z=7Z is a group under multiplication. We could check closure directly, but it will follow from something else which we are about to do. We take associativity for granted. The identity element is 1. Set x = 3. Recall that in G we have for instance 9 = 2 becuase 7 divides 9 2. Thus in G we have x = 3, x 2 = 9 = 2, x 3 = x 2 :x = 2:3 = 6 = 1, x 4 = x 3 :x = 1:3 = 3, x 5 = x 4 :x = 3:3 = 9 = 2, x 6 = x 5 :x = 2:3 = 6 =1,x 7 = x 6 :x =1:x = x, x 7 = x 6 :x = x 2, and so on. Hence G consists of the powers of x with x 6 =1. It follows that G is closed under multiplication. We can write the elements of G as 3, 2, 1, 1, 2, 3 rather than as 1, 2,..., 6 where for instance 5 = 2. The inverse of 1 is 1; the inverse of 1 is 1; 2 and 3 are inverses for each other because 2: 3 = 3:2 = 6 = 1; and similarly 3 and 2 are inverses for each other. Therefore G is a group under multiplication. NOTE: In the next example, and in a few other places in these notes, we shall mention matrices. You may ignore this material if you are not familiar with matrix theory, and you will not be asked about matrices, but this material is of great mathematical significance and is included for the benefit of those who know about matrices (see Jordan and Jordan, Section 3.1). EXAMPLE 1.19: The set M 2 (R) of all real 2 2 matrices is not a group under matrix multiplication because for instance there is no inverse for the zero matrix. Let G be the set of elements of M 2 (R) which have non-zero determinant. Then G is a group under matrix multiplication, and G is non-abelian (i.e. not Abelian); this group is usually denoted by either GL 2 (R) or GL(2;R) where GL" stands for general linear". Similarly, given a fixed positive integer n, the group GL(n; R) consists of all n n real matrices with non-zero determinant under matrix multiplication. EXAMPLE 1.20: (Symmetries of a circle; Jordan and Jordan, Section 1.2) Think of a circle, for instance the so-called unit circle which is the circle of radius 1 with centre at the origin in the usual (x; y)-coordinate system for the plane. It may help to think of the circle as being a rigid circular wire without any marks on it. Let G be the set of all the ways of moving the circle, without bending, stretching, tearing, etc., which put the circle back into its original position. There are two types of thing you can do: you can rotate the circle through some angle about its centre; or you can turn the circle over through 180 degrees about one of its diameters (which is equivalent to reflecting the circle in that diameter). We make the important convention that when we say Reflect the circle in the diameter D" we think of D as being a fixed line through the origin in the (x; y)-plane (for instance D might be the x-axis) and D does not move when we move the circle. Thus G consists of rotations and reflections, and if a and b are elements of G we define ab to bethe effect of doing b first and then doing a. It can be checked that G is a group under this operation. The identity element 1 or e of G is the transformation of the circle which leaves all its points fixed. Let a be a rotation through t degrees. Then the inverse of a is rotation through t degrees (i.e. rotation through t degrees in the opposite direction). By convention, angles of rotation are usually measured anti-clockwise. If b is a reflection in a diameter (equivalently, rotation through 180 degrees about that diameter) then b 2 = 1 (i.e. doing b twice takes every point onthecircle back to where it started from). Thus every reflection is its own inverse. It is crucial to note that if a is a rotation about the centre and b is a reflection as above, then bab = a 1. For instance if a is rotation through t degrees about the centre and b is reflection in the x-axis, then the equation bab = a 1 says that the combined effect of reflecting in the x-axis
5 and then rotating through t degrees and then again reflecting in the x-axis is the same as simply rotating through t degrees in the opposite direction. Because b 1 = b, the equation bab = a 1 can be rewritten as b 1 ab = a 1 or ab = ba 1. Because we can have a 6= a 1 (for instance if a is rotation through 30 degrees) it follows that we can have ab 6= ba, so that G is not Abelian. This group G is known as the group of symmetries of the circle, or as the orthogonal group O 2 (R) or just O 2. EXAMPLE 1.21: (Symmetries of an equilateral triangle; the dihedral group D 3 ) Using the same ideas as in 1.20 we take G to be the set of symmetries of an equilateral triangle T, and for two elements x and y of G we use xy to mean do y first and then do x". Then G is a group with respect to this multiplication, and we shall denote the six elements of G as follows: e or1isthe identity element (i.e. the transformation which leaves every point oft fixed); a is rotation about the centre through 120 degrees anti-clockwise; a 2 is a done twice, so that 2 is rotation through 240 degrees; b, c, d are the reflections in (i.e. turning T over through 180 degrees around) a line joining one vertex of T to the mid-point of the opposite side. We have b 2 = c 2 = d 2 = e, so that each of b, c, d is its own inverse; also a 3 is rotation through 360 degrees so that a 3 = e and a 2 is the inverse of a, i.e. a 2 = a 1 ; and as in 1.20 we have bab = a 1, i.e. ab = ba 1. In fact G is a non-abelian group of order 6, and a convenient way of writing the elements of G is as follows: G consists of the six distinct elements e, a, a 2, b, ab, a 2 b with a 3 = e = b 2 and ab = ba 1. Thus the reflections can be written as b, ab, a 2 b rather than just as b, c, d. Some typical calculations with this algebraic notation are: (ab) 2 = abab = (ab)ab = (ba 1 )ab = b(a 1 a)b = beb = b 2 = e, or with greater experience we would do this more quickly as (ab) 2 = abab = ba 1 ab = b 2 = e; also ab:a 2 b = ba 1 a 2 b = bab = a 1 = a 2. This group G is known as the group of symmetries of the equilateral triangle or as the dihedral group of order 6andis denoted by D 3. EXAMPLE 1.22: (The symmetries of a square; the dihedral group D 4 ) Proceeding as in 1.21 let G be the group of symmetries of a square S. Then G has eight elements which can be denoted as follows: e is the identity element; a is rotation through 90 degrees anti-clockwise; a 2 is rotation trhough 180 degrees; a 3 is rotation through 270 degrees, so that a 3 = a 1 and a 4 = e; x is the reflection in the diagonal joining the top left corner of S to the bottom right corner if you have S oriented with sides horizontal and vertical (and this diagonal must be thought of as fixed in space and not moving with the square); y is reflection in the other diagonal; z is reflection in the line joining the midpoints of the top and bottom edges; t is reflection in the line joining the midpoints of the left and right edges. In fact if we take b to be any one of the reflections x, y, z, or t then it is convenient to list the elements of G as e, a, a 2, a 3, b, ab, a 2 b, a 3 b with a 4 = e = b 2 and ab = ba 1. Then G is a non-abelian group of order 8 and the usual notation for G is D 4. EXAMPLE 1.23: (The dihedral group D n ) Let n be a positive integer. The dihedral group D n is a group of order 2n whose elements can be denoted by e, a, a 2,..., a n 1, b, ab, a 2 b,..., a n 1 b where e is the identity element and a n = e = b 2 and ab = ba 1. When n = 1 we have a = e, and d 1 consists of just e and b with b 2 = e. When n = 2 we have a 2 = e so that a 1 = a and ab = ba 1 = ba. In fact D 2 is Abelian of order 4 with elements e, a, b, ab where a 2 = b 2 = (ab) 2 = e. Now suppose that n 3. Then D n is not Abelian and it can be thought of as the group of symmetries of a regular n-sided polygon. Geometrically, ifn is odd there are n reflection-lines each joining a vertex to the midpoint of the opposite side; whereas if n is even there are n=2 reflection-lines joining midpoints of opposite sides, and n=2 reflection-lines joining pairs of opposite vertices. For more information about groups of symmetries see Jordan and Jordan, Section 5.3.
6 EXAMPLE 1.24: Let G consist of the four following ordered pairs of integers: e =(1; 1); a = (1; 1); b = ( 1; 1); c = ( 1; 1). We define multiplication in G componentwise, by which we mean that the product of pairs (x; y) and (z; t) is defined to be the pair (xz; yt) formed by multiplying corresponding components. Then G is an Abelian group of order 4 under this multiplication. We have a 2 = b 2 = c 2 = e where e is the identity element, and ab = c. EXAMPLE 1.25: Working in Z=8Z let G consist of the four elements 1, 3, 5, 7. Then G is an Abelian group of order 4 under multiplication. We have 3 2 = 9 = 1 recalling that we are working in Z=8Z, 5 2 = 25 = 1, and 7 2 = 49 = 1 (alternatively, 7 2 =( 1) 2 = 1). If we put e =1, a =3,b =5,c =7then we have a 2 = b 2 = c 2 = e and ab =3:5 =15=7=c. Thus in abstract terms this group seems to be just like the one in 1.24, even though they are not literally the same group. DEFINITION 1.26: (Klein 4-group V ) The Klein 4-group V is an Abelian group of order 4 in which the square of every element isthe identity. If (G; ) isany group of order 4 with identity element e and x x = e for all x 2 G, then we say that G is the Klein 4-group. So far we have met the Klein 4-group in three different settings, namely as D 2 in 1.23, and as the groups in 1.24 and ADDITIVE NOTATION: Let G be a group in which the operation is written as addition. Then we usually denote the identity element of G by 0, so that 0+x = x +0 = x for all x 2 G. The inverse of an element x of G is denoted by x rather than x 1, so that x +( x) = ( x) +x = 0. We write x y rather than x +( y), and x + y rather than ( x) +y. For an integer n and an element x of G we write nx rather than x n ; thus 3x = x + x + x, and 3x = (3x) = (x + x + x) = x x x =3( x). Additive notation is almost never used for groups which are not Abelian. EXAMPLE 1.27: The sets Z, Q, R, C, Z=nZ are all groups under addition. EXAMPLE 1.28: The positive integers do not form a group under addition because there is no identity element (note that 0 is not positive). EXAMPLE 1.29: The non-negative integers 0, 1, 2,... do not form a group under addition. There is an identity element, namely 0. But, for instance, there is no additive inverse for 2 (note that 2 is not allowed because it is not non-negative). EXAMPLE 1.30: Let n be a fixed integer. Then the set of all integers which are divisible by n is a group under addition. PROPOSITION 1.31: (Cancellation laws) Let (G; ) be a group, and let x, y, z 2 G such that either x y = x z or y x = z x. Then y = z. PROOF: Suppose that x y = x z. Let e be the identity element ofg and let a be the inverse of x. Thus a x = x a = e. Multiplying each side of the equation x y = x z on the left by a gives a (x y) =a (x z), i.e. (a x) y =(ax) z, i.e. e y = e z, i.e. y = z. The case in which y x = z x is done similarly by multiplying on the right by a. COROLLARY 1.32: Let (G; ) be a group, and let g 2 G such that g g = g. Then g = e, where e is the identity element of G. PROOF: Because e is the identity element we have g e = g. Therefore g g = g e, so that g = e by CAYLEY TABLES: If a group (G; ) has a small number of elements, it is possible to display the values of g h for g, h 2 G as a table. The rows and columns of the table are labelled by the symbols which denote the elements of the group, and the value of g h is put in the table where the rog labelled g meets the column labelled h. Such tables are known as Cayley tables.
7 For more information see Jordan and Jordan, Sections 1.1 and 4.5; it will be asssumed that you have read these. EXAMPLE 1.33: (how to form the group U n ) Let n be a positive integer. We shall find the largest multiplicative group U n of non-zero elements of Z=nZ. You should learn the following procedure for doing this. One way of denoting the elements of Z=nZ is to use the symbols 0, 1, 2,..., n 1; and another is to use the symbols for all the integers but to define two integers a and b to be equal as elements of Z=nZ if and only if n divides a b. Then U n consists of all the elements of Z=nZ which, as integers, are relatively prime to n (the justification for this statement is given in 1.34). For instance the elements of Z=5Z are 0, 1, 2, 3, 4; we can for present purposes always ignore 0; the remaining elements 1, 2, 3, 4 are all relatively prime to 5, so that U 5 consists of all the non-zero elements of Z=5Z as a group under multiplication (see 1.13). More generally, if p is any prime number then U p consists of all the non-zero elements of Z=pZ (note that U p has order p 1). On the other hand, if n is not prime then U n does not consist of all the non-zero elements of Z=nZ. For instance the non-zero elements of Z=12Z are 1, 2, 3, 4,..., 10, 11; of these only 1, 5, 7, 11 are relatively prime to 12; note that in Z=12Z we have 7= 5 and 11 = 1; hence U 12 consists of the four elements ±1 and ±5 under multiplication mod(12). In fact U 12 is another instance of the Klein 4-group. See Jordan and Jordan, Section 8.5. PROPOSITION 1.34: Let a and n be integers with n positive. Then a has a multiplicative inverse in Z=nZ if and only if a and n are relatively prime. PROOF: Firstly suppose that a and n are relatively prime, i.e. that hcf(a; n) = 1. Then sa + tn = 1 for some s, t 2 Z. Thus sa 1 is divisible by n, so that in Z=nZ we have sa = 1 and s is a multiplicative inverse for a. Conversely suppose that a has a multiplicative inverse in Z=nZ. Then there is an integer x such that xa =1inZ=nZ, i.e. such that the integer xa 1 is divisible by n. Hence xa 1=ny for some y 2 Z. Therefore xa ny = 1, so that any integer which divides both a and n must also divide 1. But the only integers which divide 1 are ±1. Therefore a and n are relatively prime. EXAMPLE 1.35: (The quaternion group) Let G consist of the eight 2 2 complex matrices which are the four following elements of M 2 (C) TOGETHER WITH THEIR NEGATIVES: E = i 0 K = 0 i 0 1 L = i M = i 0 Thus G consists of the eight elements E, K, L, m, E, K, L, and M. It can be shown that G is a group under matrix multiplication, known as the quaternion group. To show that G is closed under multiplication involves elementary but slightly tedious checking; for instance direct calculation gives that K 2 = E and KL = M. We can take associativity for granted because matrix multiplication is always associative. Clearly E is the identity element of G. It can be checked that E and E are their own inverses; K and K are inverses for each other; L and L are inverses for each other; M and M are inverses for each other. This group G and the dihedral group D 4 are essentially the only two non-abelian groups of order 8. ; ; ; :
GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationGroup, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,
Group, Rings, and Fields Rahul Pandharipande I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationExamples of Groups
Examples of Groups 8-23-2016 In this section, I ll look at some additional examples of groups. Some of these will be discussed in more detail later on. In many of these examples, I ll assume familiar things
More informationGroups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group
C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development
More informationMATH 430 PART 2: GROUPS AND SUBGROUPS
MATH 430 PART 2: GROUPS AND SUBGROUPS Last class, we encountered the structure D 3 where the set was motions which preserve an equilateral triangle and the operation was function composition. We determined
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More informationGroups. s t or s t or even st rather than f(s,t).
Groups Definition. A binary operation on a set S is a function which takes a pair of elements s,t S and produces another element f(s,t) S. That is, a binary operation is a function f : S S S. Binary operations
More informationFigure 1. Symmetries of an equilateral triangle
1. Groups Suppose that we take an equilateral triangle and look at its symmetry group. There are two obvious sets of symmetries. First one can rotate the triangle through 120. Suppose that we choose clockwise
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationSolutions I.N. Herstein- Second Edition
Solutions I.N. Herstein- Second Edition Sadiah Zahoor 25, July 2016 Please email me if any corrections at sadiahzahoor@cantab.net. Problem 0.1. In the following determine whether the systems described
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationDIHEDRAL GROUPS II KEITH CONRAD
DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite
More informationBMT 2014 Symmetry Groups of Regular Polyhedra 22 March 2014
Time Limit: 60 mins. Maximum Score: 125 points. Instructions: 1. When a problem asks you to compute or list something, no proof is necessary. However, for all other problems, unless otherwise indicated,
More informationAn Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt
An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt Class Objectives Binary Operations Groups Axioms Closure Associativity Identity Element Unique Inverse Abelian Groups
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationREMARKS 7.6: Let G be a finite group of order n. Then Lagrange's theorem shows that the order of every subgroup of G divides n; equivalently, if k is
FIRST-YEAR GROUP THEORY 7 LAGRANGE'S THEOREM EXAMPLE 7.1: Set G = D 3, where the elements of G are denoted as usual by e, a, a 2, b, ab, a 2 b. Let H be the cyclic subgroup of G generated by b; because
More informationSome Basic Logic. Henry Liu, 25 October 2010
Some Basic Logic Henry Liu, 25 October 2010 In the solution to almost every olympiad style mathematical problem, a very important part is existence of accurate proofs. Therefore, the student should be
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationAng aking kontrata: Ako, si, ay nangangakong magsisipag mag-aral hindi lang para sa aking sarili kundi para rin sa aking pamilya, para sa aking
Ang aking kontrata: Ako, si, ay nangangakong magsisipag mag-aral hindi lang para sa aking sarili kundi para rin sa aking pamilya, para sa aking bayang Pilipinas at para sa ikauunlad ng mundo. THEOREMS
More informationABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS.
ABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS. ANDREW SALCH 1. Monoids. Definition 1.1. A monoid is a set M together with a function µ : M M M satisfying the following
More informationThe symmetric group R + :1! 2! 3! 1. R :1! 3! 2! 1.
Chapter 2 The symmetric group Consider the equilateral triangle. 3 1 2 We want to describe all the symmetries, which are the motions (both rotations and flips) which takes the triangle to itself. First
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More information) = 1, ) = 2, and o( [ 11]
True/False Questions 1. The order of the identity element in any group is 1. True. n = 1 is the least positive integer such that e n = e. 2. Every cyclic group is abelian. True. Let G be a cyclic group.
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More information3.1 Definition of a Group
3.1 J.A.Beachy 1 3.1 Definition of a Group from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair This section contains the definitions of a binary operation,
More informationThe Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12
Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth
More informationSECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS
(Chapter 9: Discrete Math) 9.11 SECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS PART A: WHAT IS AN ARITHMETIC SEQUENCE? The following appears to be an example of an arithmetic (stress on the me ) sequence:
More information1 Lecture 1 (1/5/2009)
1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think
More information1 Lecture 1 (1/5/2009)
1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think
More informationNumbers, proof and all that jazz.
CHAPTER 1 Numbers, proof and all that jazz. There is a fundamental difference between mathematics and other sciences. In most sciences, one does experiments to determine laws. A law will remain a law,
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationThe Integers. Peter J. Kahn
Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,
More informationChapter 3. Introducing Groups
Chapter 3 Introducing Groups We need a super-mathematics in which the operations are as unknown as the quantities they operate on, and a super-mathematician who does not know what he is doing when he performs
More informationLecture 2: Groups. Rajat Mittal. IIT Kanpur
Lecture 2: Groups Rajat Mittal IIT Kanpur These notes are about the first abstract mathematical structure we are going to study, groups. You are already familiar with set, which is just a collection of
More informationMa/CS 6a Class 19: Group Isomorphisms
Ma/CS 6a Class 19: Group Isomorphisms By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G x y G. Associativity. For every x,
More informationMath 308 Midterm Answers and Comments July 18, Part A. Short answer questions
Math 308 Midterm Answers and Comments July 18, 2011 Part A. Short answer questions (1) Compute the determinant of the matrix a 3 3 1 1 2. 1 a 3 The determinant is 2a 2 12. Comments: Everyone seemed to
More informationFACTORIZATION AND THE PRIMES
I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationWhat is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =
STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row
More information6 Cosets & Factor Groups
6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.
More informationMathematics for Graphics and Vision
Mathematics for Graphics and Vision Steven Mills March 3, 06 Contents Introduction 5 Scalars 6. Visualising Scalars........................ 6. Operations on Scalars...................... 6.3 A Note on
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More information17 More Groups, Lagrange s Theorem and Direct Products
7 More Groups, Lagrange s Theorem and Direct Products We consider several ways to produce groups. 7. The Dihedral Group The dihedral group D n is a nonabelian group. This is the set of symmetries of a
More informationMath 320, spring 2011 before the first midterm
Math 320, spring 2011 before the first midterm Typical Exam Problems 1 Consider the linear system of equations 2x 1 + 3x 2 2x 3 + x 4 = y 1 x 1 + 3x 2 2x 3 + 2x 4 = y 2 x 1 + 2x 3 x 4 = y 3 where x 1,,
More informationAbstract Algebra I. Randall R. Holmes Auburn University. Copyright c 2012 by Randall R. Holmes Last revision: November 11, 2016
Abstract Algebra I Randall R. Holmes Auburn University Copyright c 2012 by Randall R. Holmes Last revision: November 11, 2016 This work is licensed under the Creative Commons Attribution- NonCommercial-NoDerivatives
More informationi) G is a set and that is a binary operation on G (i.e., G is closed iii) there exists e 2 G such that a e = e a = a for all a 2 G (i.e.
Math 375 Week 2 2.1 Groups Recall our basic denition: DEFINITION 1 Suppose that: i) G is a set and that is a binary operation on G (i.e., G is closed under ); ii) is associative; iii) there exists e 2
More informationR1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member
Chapter R Review of basic concepts * R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member Ex: Write the set of counting numbers
More informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationAbstract Algebra Part I: Group Theory
Abstract Algebra Part I: Group Theory From last time: Let G be a set. A binary operation on G is a function m : G G G Some examples: Some non-examples Addition and multiplication Dot and scalar products
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationM208 Pure Mathematics GTA1. Symmetry
M208 Pure Mathematics GTA1 Symmetry Note to reader Mathematical/statistical content at the Open University is usually provided to students in printed books, with PDFs of the same online. This format ensures
More informationVector Spaces. Chapter 1
Chapter 1 Vector Spaces Linear algebra is the study of linear maps on finite-dimensional vector spaces. Eventually we will learn what all these terms mean. In this chapter we will define vector spaces
More informationRings, Integral Domains, and Fields
Rings, Integral Domains, and Fields S. F. Ellermeyer September 26, 2006 Suppose that A is a set of objects endowed with two binary operations called addition (and denoted by + ) and multiplication (denoted
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2014 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to odd-numbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More information1.2 The Role of Variables
1.2 The Role of Variables variables sentences come in several flavors true false conditional In this section, a name is given to mathematical sentences that are sometimes true, sometimes false they are
More informationAlgebraic. techniques1
techniques Algebraic An electrician, a bank worker, a plumber and so on all have tools of their trade. Without these tools, and a good working knowledge of how to use them, it would be impossible for them
More informationMATH 422, CSUSM. SPRING AITKEN
CHAPTER 3 SUMMARY: THE INTEGERS Z (PART I) MATH 422, CSUSM. SPRING 2009. AITKEN 1. Introduction This is a summary of Chapter 3 from Number Systems (Math 378). The integers Z included the natural numbers
More information1 r r 2 r 3 r 4 r 5. s rs r 2 s r 3 s r 4 s r 5 s
r r r r r s rs r s r s r s r s Warmup: Draw the symmetries for the triangle. () How many symmetries are there? () If we call the move rotate clockwise r, what is the order of r? Is there a way to write
More informationChapter 2. Ma 322 Fall Ma 322. Sept 23-27
Chapter 2 Ma 322 Fall 2013 Ma 322 Sept 23-27 Summary ˆ Matrices and their Operations. ˆ Special matrices: Zero, Square, Identity. ˆ Elementary Matrices, Permutation Matrices. ˆ Voodoo Principle. What is
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 017/018 DR. ANTHONY BROWN. Lines and Their Equations.1. Slope of a Line and its y-intercept. In Euclidean geometry (where
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationGroup Theory: Math30038, Sheet 6
Group Theory: Math30038, Sheet 6 Solutions GCS 1. Consider the group D ofrigidsymmetriesofaregularn-gon (which may be turned over). Prove that this group has order 2n, is non-abelian, can be generated
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationPreliminary chapter: Review of previous coursework. Objectives
Preliminary chapter: Review of previous coursework Objectives By the end of this chapter the student should be able to recall, from Books 1 and 2 of New General Mathematics, the facts and methods that
More informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
More informationJUST THE MATHS UNIT NUMBER 1.5. ALGEBRA 5 (Manipulation of algebraic expressions) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.5 ALGEBRA 5 (Manipulation of algebraic expressions) by A.J.Hobson 1.5.1 Simplification of expressions 1.5.2 Factorisation 1.5.3 Completing the square in a quadratic expression
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.
More informationInteger (positive or negative whole numbers or zero) arithmetic
Integer (positive or negative whole numbers or zero) arithmetic The number line helps to visualize the process. The exercises below include the answers but see if you agree with them and if not try to
More informationMATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4
MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationMAS114: Numbers and Groups, Semester 2
MAS114: Numbers and Groups, Semester 2 Module Information Contact details. Dr Sam Marsh (Room G9, Hick Building). Office hour. FILL THIS IN HERE: Friday 12, or see the course website. No appointment necessary,
More informationGROUP THEORY AND THE 2 2 RUBIK S CUBE
GROUP THEORY AND THE 2 2 RUBIK S CUBE VICTOR SNAITH Abstract. This essay was motivated by my grandson Giulio being given one of these toys as a present. If I have not made errors the moves described here,
More information2 so Q[ 2] is closed under both additive and multiplicative inverses. a 2 2b 2 + b
. FINITE-DIMENSIONAL VECTOR SPACES.. Fields By now you ll have acquired a fair knowledge of matrices. These are a concrete embodiment of something rather more abstract. Sometimes it is easier to use matrices,
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
More informationNumber Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.
Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)
More informationNotes on Algebraic Structures. Peter J. Cameron
Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the second-year course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester
More informationChapter 2. Matrix Arithmetic. Chapter 2
Matrix Arithmetic Matrix Addition and Subtraction Addition and subtraction act element-wise on matrices. In order for the addition/subtraction (A B) to be possible, the two matrices A and B must have the
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More information1 Numbers. exponential functions, such as x 7! a x ; where a; x 2 R; trigonometric functions, such as x 7! sin x; where x 2 R; ffiffi x ; where x 0:
Numbers In this book we study the properties of real functions defined on intervals of the real line (possibly the whole real line) and whose image also lies on the real line. In other words, they map
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More information1. Groups Definitions
1. Groups Definitions 1 1. Groups Definitions A group is a set S of elements between which there is defined a binary operation, usually called multiplication. For the moment, the operation will be denoted
More informationLecture 3: Latin Squares and Groups
Latin Squares Instructor: Padraic Bartlett Lecture 3: Latin Squares and Groups Week 2 Mathcamp 2012 In our last lecture, we came up with some fairly surprising connections between finite fields and Latin
More informationJohn B. Fraleigh, A first course in Abstract Algebra, 5th edition, Addison-Wesley.
MATH222 ALGEBRAIC METHODS I This subject introduces the study of fundamental algebraic structures and the methods of abstract algebra which pervade much of modern mathematics. One of the important aims
More information7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Outcomes
The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a 0has a reciprocal b written as a or such that a ba = ab =. Similarly a square matrix A may have an inverse B = A where AB =
More informationGRE Quantitative Reasoning Practice Questions
GRE Quantitative Reasoning Practice Questions y O x 7. The figure above shows the graph of the function f in the xy-plane. What is the value of f (f( ))? A B C 0 D E Explanation Note that to find f (f(
More informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More information