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,
|
|
- Charlene Craig
- 5 years ago
- Views:
Transcription
1 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}. φ : S S S. A binary operation φ is commutative if φ(x, y) = φ(y, x) for all x, y S. A binary operation is associative if for all x, y, z S. φ(φ(x, y), z) = φ(x, φ(y, z)) For example, let S = {1, 2, 3,... } be the set of positive integers. Then, φ(x, y) = x + y is a binary operation which is both commutative and associative, φ(x, y) = (x + y) 2 is a binary operation which is commutative, but not associative, and φ(x, y) = x y, is a binary operation which is neither commutative nor associative. These operations are defined using the familiar operations of addition and multiplication on the positive integers. Later, we will see examples of binary operations which are associative, but not commutative. It will often be convenient to name binary operations on a set S by the symbols + or familiar from arithmetic. The operations on S may have little or nothing to do with addition or multiplication on the integers the symbols + and are used simply as names. One immediate convenience: we may write x + y and x y instead of the cumbersome +(x, y) and (x, y). 1
2 2 II. Groups A group (G, +, 0) consists of a set G together with a binary operation + and a distinguished element 0 G satisfying the following properties: (i) + : G G G is associative, (ii) for all x G, x + 0 = x and 0 + x = x, (iii) for each x G, there exists an element y G satisfying x + y = 0 and y + x = 0. We may easily prove for each x G, the inverse element y guaranteed by (iii) is unique. If y and y are inverses for x, then y = (y + x) + y = y + (x + y ) = y. Properties (i) and (ii) are used in the above deduction. The inverse of x is usually denoted by x. The group axioms imply a useful left cancellation property: if z + x = z + y, then x = y. The cancellation property is derived as follows. Let z the inverse of z. Then, z + x = z + y implies By associativity, Hence, z + (z + x) = z + (z + y). ( z + z) + x = ( z + z) + y. 0 + x = 0 + y. We then conclude x = y by (ii). A similar right cancellation property holds (and is proven in the same way). Let Z = {..., 2, 1, 0, 1, 2,... } be the set of integers. Then, (Z, +, 0) is a group where + is the usual addition. However, (Z,, 1), where is the usual multiplication,is not a group: multiplicative inverses can not always be found in the integers, violating property (iii). Let Q be the set of rational numbers. Then, (Q, +, 0) is a group. Let Q be the set of non-zero rational numbers. Then, (Q,, 1) is a group. You should check the problems with the (failed) example of a multiplicative group structure on the integers are fixed in (Q,, 1).
3 The real numbers R and the complex numbers C also provide examples of groups: (R, +, 0), (R,, 1), (C, +, 0), (C,, 1), where the superscripted denotes the non-zero elements as before. Let n be a positive integer. Let Z/nZ = {0, 1, 2,..., n 1} be the set of remainders modulo n. We can define a binary operation + on Z/nZ by usual addition followed by taking the remainder modulo n. For example, = 2 Z/6Z. The bar above the elements of Z/nZ indicates the elements are not integers, but remainder classes modulo n. You should check (Z/nZ, +, 0) is a group with n elements. A group is abelian if the binary operation is commutative. All the above examples are abelian groups. There are many non-abelian groups. Let GL n (R) be the set of invertible n n matrices with real entries. Let denote matrix multiplication, and let I n denote the n n identity matrix. You should check (GL n (R),, I n ) is a group. For n 2, (GL n (R),, I n ) is not abelian. The binary operation in a non-abelian group is associative, but not commutative. Group theory is an old and very well developed subject. 3 III. Rings A ring (R, +,, 0, 1) consists of a set R together with two binary operations + and and two distinguished elements 0, 1 R satisfying the following properties: (i) (R, +, 0) is an abelian group, (ii) : R R R is associative, (iii) for all x R, (iv) for all x, y, z R, x 1 = x and 1 x = x, x (y + z) = x y + x z and (x + y) z = x z + y z.
4 4 Property (iv) consists of the left and right distributive laws. The first binary operation + of a ring is called addition and second is called multiplication. Unless we wish to emphasize the multiplicative operation, we will often follow the usual convention of abbreviating x y by xy. Sometimes rings defined by (i)-(iv) are called unital rings since the existence of a multiplicative unit 1 is stipulated. The standard number systems all define rings: (Z, +,, 0, 1), (Q, +,, 0, 1), (R, +,, 0, 1), (C, +,, 0, 1). We can define multiplication on the set Z/nZ by the usual multiplication followed by taking the remainder modulo n. For example, 2 5 = 4, 2 3 = 0 Z/6Z. Then, (Z/nZ, +,, 0, 1) is a ring with finitely many elements. The ring (Z/1Z, +,, 0, 1) is degenerate since 0 = 1. You may ask why the addition of a ring is required to be commutative. In fact, we can deduce the commutativity of addition from the repeated use of properties (iii) and (iv) and the group laws for +. The deduction of commutativity is as follows. First, by (iii) and (iv). Next, (x + y) (1 + 1) = x (1 + 1) + y (1 + 1) = x 1 + x 1 + y 1 + y 1 = x + x + y + y, (x + y) (1 + 1) = (x + y) 1 + (x + y) 1 by (iii) and (iv). We have proven, = x 1 + y 1 + x 1 + y 1 = x + y + x + y, x + x + y + y = x + y + x + y. Finally, using the cancellation property of the additive group, we can cancel the first and last terms to conclude x + y = y + x. So, the commutation of addition is implied by the other axioms. Hence, we may as well assume + is commutative from the beginning.
5 However, the multiplication of a ring is not required to be commutative. A ring is called commutative if multiplication commutes. All the rings above are commutative rings. Let M n (R) be the set of all n n matrices with real coefficients. Then, (M n (R), +,, 0, I n ) is ring. If n 2, the multiplication of (M n (R), +,, 0, I n ) is not commutative. 5 IV. Fields A field (F, +,, 0, 1) consists of a set F together with two binary operations + and and two distinguished elements 0, 1 F satisfying the following properties: (i) (F, +, 0) is an abelian group, (ii) : F F F is associative and commutative, (iii) for all x F, x 1 = x and 1 x = x, (iv) for each 0 x F, there exists an element y F satisfying (v) for all x, y, z F, x y = 1 and y x = 1. x (y + z) = x y + x z and (x + y) z = x z + y z. We will always assume 0 1 in F. We can deduce many familiar properties from the field axioms. For example, for all x F, The first step of the derivation is: x 0 = 0. (1) x 0 + x 0 = x (0 + 0) = x 0, using (v) and the group properties for +. Then, cancelling x 0 from both sides using the group properties for +, we find x 0 = 0.
6 6 Let F denote the non-zero elements of a field F. If x F and x z = 0, then z = 0. The proof is as follows. Let y be the multiplicative inverse of x guaranteed by (iv). Then, using property (1). Also, y (x z) = y 0 = 0, y (x z) = (y x) z = 1 z = z, using associativity and (iii). We conclude z = 0. As a consequence, we find the set F is closed under multiplication: for all x, y F, x y F. Also, 1 F. The field axioms imply (F,, 1) is an abelian group. The field axioms (i)-(iv) above may be rewritten in a simpler form: (i) (F, +, 0) is an abelian group, (ii) (F,, 1) is an abelian group, (iii) the distributive laws hold. The standard number systems with the exception of (Z, +,, 0, 1) all define fields: (Q, +,, 0, 1), (R, +,, 0, 1), (C, +,, 0, 1). The integers fail the field axioms since multiplicative inverses do not always exist. Suppose n is not a prime number. Then, pq = n where p and q are positive integers less than n. Hence, p q = 0 Z/nZ since the product leaves 0 remainder modulo n. Since the non-zero elements are not closed under multiplication, (Z/nZ, +,, 0, 1) is not a field if n is not prime. If p is a prime number, then (Z/pZ, +,, 0, 1) is a field. The main property to verify is the existence of multiplicative inverses for non-zero elements. Let x be a positive integer less than p corresponding to a non-zero element x of Z/pZ. Then, x and p are relatively prime (that is, they have no common factor greater than 1). Since x and p are relatively prime, there exist integers a, b Z for which xa + pb = 1 Z. (2)
7 Can you prove this? A proof is provided below, but you may wish to find an argument yourself. We now establish the existence of a, b Z satisfying (2). Let I Z denote the set of integers of the form xs + pt for s, t Z, I = {xs + pt s, t Z}. Since I contains both x and p, I certainly contains positive integers. The well-ordering property of the integers states: every non-empty set of positive integers has a smallest element. The well-ordering property is equivalent to the principle of induction. Let d be the smallest positive integer in I. Certainly d x, p. Since d I, we see there exist a, b Z satisfying xa + yb = d. We prove by contradiction that d divides x. If not, we may write x = md + r, where m Z and r is the remainder 0 < r < d. We see then r I since r = x(1 ma) + y( mb). But r I contradicts the fact that d is the smallest positive integer in I. Hence, d must divide x. Similarly, d must divide p. Since x and p are relatively prime, the only positive integer which divides both x and p is 1. Thus, d = 1. We have proven the existence of (2). Let y be the remainder of a mod p. We see (2) implies x y = 1 Z/pZ. Hence, we have established the existence of multiplicative inverses of non-zero elements in (Z/pZ, +,, 0, 1). All of the other field axioms are easy to check. We can consider linear algebra over an arbitrary field F. That is, we may study systems of linear equations α 11 x 1 + α 12 x α 1n x n = y 1 α 21 x 1 + α 22 x α 2n x n = y α m1 x 1 + α 12 x α mn x n = y m
8 8 where the elements α ij, y i lie in F. And, we may seek solutions x 1,..., x n F. The method of elimination via row operations works without modification for any field F. For example, we may solve the following system of equations in the field Z/11Z: 2x 1 + 1x 2 = 3 4x 1 + 4x 2 = 5 The multiplicative inverse of 2 in Z/11Z is 6. The additive inverse of 4 is 7. After adding a multiple of 7 6 of the first equation to the second, we obtain: 2x 2 = 10. Using the multiplicative inverse of 2 again, we find: x 2 = 5. Then, using the original system, we find: x 1 = 10. V. Skew-fields By the field axioms, the multiplication of a field is required to be commutative. However, we may consider algebraic structures satisfying all the field axioms except for the commutativity of multiplication. A skew-field (F, +,, 0, 1) consists of a set F together with two binary operations + and and two distinguished elements 0, 1 F satisfying the following properties: (i) (F, +, 0) is an abelian group, (ii) (F,, 1) is a group, (iii) the distributive laws hold. The multiplication of a skew-field is allowed to be non-abelian. Sometimes skew-fields are called division rings. Certainly, every field is a skew-field. It is quite difficult to find skewfields which are not fields. In 1905, Wedderburn proved all skew-fields with only finitely many elements are actually fields (their multiplication
9 is actually abelian). You can find the proof in most good algebra books in the library, but some knowledge of group theory is required. To find an example of a true skew-field, we must look for a candidate with infinitely many elements. The most fundamental example is the skew-field of quaternions discovered by Hamilton in We will first discuss the complex numbers. Given the real numbers (R, +,, 0, 1), we can construct the complex numbers (C, +,, 0, 1) in the following way. As a set, C = R R, C = {(x, y) x, y R}. Addition in C is defined by addition of real components: (x, y) + (z, w) = (x + z, y + w). (3) Multiplication in C is defined in terms of multiplication in R by: (x, y) (z, w) = (xz yw, xw + yz). (4) Let 0 C be (0, 0), and let 1 C be (1, 0). Then, (C, +,, 0, 1) is a field. From the above definition, checking the field axioms for the complex numbers takes some work. The usual representation of complex numbers is as follows. Let i C be the element i = (0, 1). Then, by the definition of multiplication, i 2 = (0, 1) (0, 1) = ( 1, 0) = 1. Complex numbers can be written as x + yi where x, y R. You can check the definitions of addition (3) and multiplication (4) coincide with the familiar operations for complex numbers. The complex numbers have a norm defined by x + yi 2 = x 2 + y 2 which satisfies a multiplicative property: for all µ, ν C. µ ν 2 = µ 2 ν 2, We are now prepared to describe Hamilton s quaternions (H, +,, 0, 1). Introduce the elements i, j, k with the multiplicative properties: i 2 = 1, j 2 = 1, k 2 = 1, ij = k, ji = k, (5) 9
10 10 jk = i, kj = i, ki = j, ik = j. Let H be set of linear combinations, H = {w + xi + yj + zk w, x, y, z R}. Addition is defined on H by addition of the components, (w + xi + yj + zk) + (w + x i + y j + z k) = (w + w ) + (x + x ) i + (y + y ) j + (z + z ) k. The element 0 H is 0 + 0i + 0j + 0k. Multiplication in the quaternions is defined by the rules (5): (w + xi + yj + zk) (w + x i + y j + z k) = (ww xx yy zz ) + (wx + xw + yz zy ) i + (wy xz + yw + zx ) j + (wz + xy yx + zw ) k. Certainly, multiplication in the quaternions is not commutative. The element 1 H is 1 + 0i + 0j + 0k. Again, some work is required to check the quaternions satisfy the axioms of a skew-field. You might try to verify the axioms. Hamilton found the multiplication rules for the quaternions only after searching for 10 years. The name quaternion comes from the fact that i, j, and k are fourth roots of unity: i 4 = j 4 = k 4 = 1. The quaternions have a norm defined by w + xi + yj + zk 2 = w 2 + x 2 + y 2 + z 2 which satisfies a multiplicative property: for all µ, ν H. µ ν 2 = µ 2 ν 2, A remarkable result due to Frobenius states: the only skew-fields which are finite dimensional over the real numbers are: R, C, and H. Many aspects of linear algebra are valid for skew-fields, but some require modification. The quaternions play an important role in modern algebra and geometry, and you will likely encounter them again.
Course 2BA1: Hilary Term 2007 Section 8: Quaternions and Rotations
Course BA1: Hilary Term 007 Section 8: Quaternions and Rotations David R. Wilkins Copyright c David R. Wilkins 005 Contents 8 Quaternions and Rotations 1 8.1 Quaternions............................ 1 8.
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 informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationCourse MA2C02, Hilary Term 2010 Section 4: Vectors and Quaternions
Course MA2C02, Hilary Term 2010 Section 4: Vectors and Quaternions David R. Wilkins Copyright c David R. Wilkins 2000 2010 Contents 4 Vectors and Quaternions 47 4.1 Vectors...............................
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 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 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 informationMATH 403 MIDTERM ANSWERS WINTER 2007
MAH 403 MIDERM ANSWERS WINER 2007 COMMON ERRORS (1) A subset S of a ring R is a subring provided that x±y and xy belong to S whenever x and y do. A lot of people only said that x + y and xy must belong
More informationREMARKS 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
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
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 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 informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
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 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 First Theme: Sums of Squares
I will try to organize the work of this semester around several classical questions. The first is, When is a prime p the sum of two squares? The question was raised by Fermat who gave the correct answer
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 informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationEXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices
/ rings definitions and elementary properties 171 EXERCISES A. Examples of Rings In each of the following, a set A with operations of addition and multiplication is given. Prove that A satisfies all the
More informationON A NEW SPECIES OF IMAGINARY QUANTITIES CONNECTED WITH A THEORY OF QUATERNIONS. William Rowan Hamilton
ON A NEW SPECIES OF IMAGINARY QUANTITIES CONNECTED WITH A THEORY OF QUATERNIONS By William Rowan Hamilton (Proceedings of the Royal Irish Academy, 2 (1844), 424 434.) Edited by David R. Wilkins 1999 On
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 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 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 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 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 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 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 informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
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 informationSolutions I.N. Herstein- Second Edition
Solutions I.N. Herstein- Second Edition Sadiah Zahoor Please email me if any corrections at sadiahzahoor@cantab.net. R is a ring in all problems. Problem 0.1. If a, b, c, d R, evaluate (a + b)(c + d).
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 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 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 informationTHE RING OF POLYNOMIALS. Special Products and Factoring
THE RING OF POLYNOMIALS Special Products and Factoring Special Products and Factoring Upon completion, you should be able to Find special products Factor a polynomial completely Special Products - rules
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
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 informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
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 informationELLIPTIC CURVES AND INTEGER FACTORIZATION
ELLIPTIC CURVES AND INTEGER FACTORIZATION HAORU LIU Abstract. Elliptic curves are a class of cubic curves over fields which can be endowed with an algebraic structure. They are particularly useful in number
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationSYMBOL EXPLANATION EXAMPLE
MATH 4310 PRELIM I REVIEW Notation These are the symbols we have used in class, leading up to Prelim I, and which I will use on the exam SYMBOL EXPLANATION EXAMPLE {a, b, c, } The is the way to write the
More informationRings and modular arithmetic
Chapter 8 Rings and modular arithmetic So far, we have been working with just one operation at a time. But standard number systems, such as Z, have two operations + and which interact. It is useful to
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationMATH 433 Applied Algebra Lecture 22: Semigroups. Rings.
MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and
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 informationCHAPTER 3 BOOLEAN ALGEBRA
CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus
More informationDOES XY 2 = Z 2 IMPLY X IS A SQUARE?
DOES XY 2 = Z 2 IMPLY X IS A SQUARE? JACK S. CALCUT 1. Introduction Ordinary integers have the property that if the product of a number and a square is a square, then the number itself is a square. That
More informationMath Introduction to Modern Algebra
Math 343 - Introduction to Modern Algebra Notes Rings and Special Kinds of Rings Let R be a (nonempty) set. R is a ring if there are two binary operations + and such that (A) (R, +) is an abelian group.
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationCircles in F 2 q. Jacob Haddock, Wesley Perkins, and John Pope Faculty Adviser: Dr. Jeremy Chapman
Circles in F q Jacob Haddock, Wesley Perkins, and John Pope Faculty Adviser: Dr. Jeremy Chapman Abstract. In Euclid s The Elements, a unique circle in R is determined by three noncollinear points. This
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 information(d) Since we can think of isometries of a regular 2n-gon as invertible linear operators on R 2, we get a 2-dimensional representation of G for
Solutions to Homework #7 0. Prove that [S n, S n ] = A n for every n 2 (where A n is the alternating group). Solution: Since [f, g] = f 1 g 1 fg is an even permutation for all f, g S n and since A n is
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationHigher Algebra Lecture Notes
Higher Algebra Lecture Notes October 2010 Gerald Höhn Department of Mathematics Kansas State University 138 Cardwell Hall Manhattan, KS 66506-2602 USA gerald@math.ksu.edu This are the notes for my lecture
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationSUPPLEMENTARY NOTES: CHAPTER 1
SUPPLEMENTARY NOTES: CHAPTER 1 1. Groups A group G is a set with single binary operation which takes two elements a, b G and produces a third, denoted ab and generally called their product. (Mathspeak:
More informationChapter XI Novanion rings
Chapter XI Novanion rings 11.1 Introduction. In this chapter we continue to provide general structures for theories in physics. J. F. Adams proved in 1960 that the only possible division algebras are at
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1
More informationSubrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING
Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty
More informationPRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.
PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.
More informationMath 370 Homework 2, Fall 2009
Math 370 Homework 2, Fall 2009 (1a) Prove that every natural number N is congurent to the sum of its decimal digits mod 9. PROOF: Let the decimal representation of N be n d n d 1... n 1 n 0 so that N =
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationa b (mod m) : m b a with a,b,c,d real and ad bc 0 forms a group, again under the composition as operation.
Homework for UTK M351 Algebra I Fall 2013, Jochen Denzler, MWF 10:10 11:00 Each part separately graded on a [0/1/2] scale. Problem 1: Recalling the field axioms from class, prove for any field F (i.e.,
More informationMODEL ANSWERS TO THE FIRST HOMEWORK
MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
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 informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationINTRODUCTION TO SEMIGROUPS AND MONOIDS
INTRODUCTION TO SEMIGROUPS AND MONOIDS PETE L. CLARK We give here some basic definitions and very basic results concerning semigroups and monoids. Aside from the mathematical maturity necessary to follow
More information1 Linear transformations; the basics
Linear Algebra Fall 2013 Linear Transformations 1 Linear transformations; the basics Definition 1 Let V, W be vector spaces over the same field F. A linear transformation (also known as linear map, or
More informationSection 18 Rings and fields
Section 18 Rings and fields Instructor: Yifan Yang Spring 2007 Motivation Many sets in mathematics have two binary operations (and thus two algebraic structures) For example, the sets Z, Q, R, M n (R)
More informationEuler s, Fermat s and Wilson s Theorems
Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing
More informationCOMP 175 COMPUTER GRAPHICS. Lecture 04: Transform 1. COMP 175: Computer Graphics February 9, Erik Anderson 04 Transform 1
Lecture 04: Transform COMP 75: Computer Graphics February 9, 206 /59 Admin Sign up via email/piazza for your in-person grading Anderson@cs.tufts.edu 2/59 Geometric Transform Apply transforms to a hierarchy
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).
18.312: Algebraic Combinatorics Lionel Levine Lecture date: May 3, 2011 Lecture 22 Notes by: Lou Odette This lecture: Smith normal form of an integer matrix (linear algebra over Z). 1 Review of Abelian
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 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 informationChapter 1: Systems of Linear Equations and Matrices
: Systems of Linear Equations and Matrices Multiple Choice Questions. Which of the following equations is linear? (A) x + 3x 3 + 4x 4 3 = 5 (B) 3x x + x 3 = 5 (C) 5x + 5 x x 3 = x + cos (x ) + 4x 3 = 7.
More informationChapter 2. Vectors and Vector Spaces
2.1. Operations on Vectors 1 Chapter 2. Vectors and Vector Spaces Section 2.1. Operations on Vectors Note. In this section, we define several arithmetic operations on vectors (especially, vector addition
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
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 informationover a field F with char F 2: we define
Chapter 3 Involutions In this chapter, we define the standard involution (also called conjugation) on a quaternion algebra. In this way, we characterize division quaternion algebras as noncommutative division
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
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 informationRings. EE 387, Notes 7, Handout #10
Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for
More informationHW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).
Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately
More informationModular Arithmetic and Elementary Algebra
18.310 lecture notes September 2, 2013 Modular Arithmetic and Elementary Algebra Lecturer: Michel Goemans These notes cover basic notions in algebra which will be needed for discussing several topics of
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 informationChapter 3: Complex Numbers
Chapter 3: Complex Numbers Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 3: Complex Numbers Semester 1 2018 1 / 48 Philosophical discussion about numbers Q In what sense is 1 a number? DISCUSS
More informationLagrange Multipliers
Optimization with Constraints As long as algebra and geometry have been separated, their progress have been slow and their uses limited; but when these two sciences have been united, they have lent each
More informationAN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS
AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply
More informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More information