Section 3.3 Equivalence Relations
|
|
- Vanessa Lawrence
- 7 years ago
- Views:
Transcription
1 1 Section 3.3 Purpose of Section To introduce the concept of an equivalence relation and show how it subdivides or partitions a set into distinct categories. Introduction Classifying objects and placing similar objects into groups provides a way to organize information and focus attention on the similarities of like objects and not on the dissimilarities of dislike objects. Mathematicians have been classifying objects for millennia. Lines in the plane can be subdivided into groups of parallel lines. Lines in a given group many not be the same line, but they are considered equivalent insofar as our classification is concerned. Triangles can also be classified as being congruent 1 or noncongruent. In modular arithmetic we say two integers are equivalent if they have the same remainder when divided by a given number, say 7 for example. Here, the numbers -12, -5, 2, 9, 16, 23, 30, would be considered equivalent, whereas and 3 and 5 are not. This classification based on division by 7 subdivides the entire set of natural numbers into seven distinct equivalence classes depending on whether a number s remainder is 0,1,2,3,4,5, or 6 when divided by 7. So what are the properties a relation must have in order that it subdivide set into distinct categories? Keep reading. Equivalence Relation The reader is already familiar with one equivalence relation, the relation of two things being equal. That s right " = ". However, since ambiguity restricts us from using the equal sign to denote the equivalence relation, we have adopted the nearby symbol 2 " ". So what properties does an equivalence relation possess? Definition A relation " " on a set A is an equivalence relation if for all x, y, z in A, the following RST properties hold: Reflexive: x x Symmetric: if x y, then y x Transitive: if x y and y z, then x z. 1 Recall that two triangles are congruent their corresponding sides and angles have the same measurements. 2 Another common notation for the equivalence relation is " ".
2 2 Note: Remember, a relation on a set A is a subset of all ordered pairs of A, so x y means x, y. However, the keep in mind is a set. For example, ( ) set notation looks awkward so we prefer to simply write x Example 1 y. The following relations are equivalence relations on the given sets. x y means equality ( = ) between numbers or sets. x y means x is congruent to y where x, y are triangles. x y means x y for logical sentences x, y. x y means x has the same birthday as y where x and y are people. x y means x differs from y by an integer multiple of 5 ) on the set Z of integers. Example 2 Non The following relations are not equivalence relations on the given sets since at least one of the three RST conditions fails. x y means x is in love with y on the set of all people. (Not likely symmetric; at least for two persons, one loves the other but not Vice-versa.) x y means " x y" on the real numbers. (Not symmetric; 2 3 does not imply 3 2.) x y means x and y have a common factor greater than 1 on the set of integers. (Not transitive; 2 and 6 have a common factor, 6 and 3 have a common factor, but 2 and 3 do not.) x y means x y on a family of sets. (Not symmetric; A B B A.)
3 3 Equivalence Broadens the Concept of Equality Partitioning of Sets into Equivalence Classes The equivalence relation provides a way for mathematicians to subdivide collections of objects into distinct subsets called partitions. Definition: Let A be a set. A partition of A is a (finite or infinite) collection A, A,... of nonempty subsets of A such that { } 1 2 the union of all the A i is A the sets in the collection are pairwise disjoint; that is Ai Aj distinct pair A and A. i j = for every Example 3 The following are partitions of a set. The even and odd integers are a partition the integers into two distinct sets.
4 4 A collection of people partitioned into groups according to the first letter in their surname. A set of students in a classroom partitioned into males and females. (If there are no members of one sex, then the partition is the set itself.) The following theorem lies at the heart of the importance of the equivalence relation. Theorem 1 Equivalence Classes Let A be any set and " " an equivalence relation on A. For every x A, x, by define a set, denoted by [ ] [ x] = { y A : y x} This set is called the equivalence ence class of x and consists of all elements of A equivalen to x. Under these conditions each element of the set A belongs to one and only one equivalence class, which means the equivalence relation partitions the set A into distinct subsets. Proof: First observe every element x A belongs to at least one equivalence class since x x x x. Also note the union of the equivalence, which means [ ] classes is A since every element x A belongs to some equivalence class. Now show the equivalence classes are disjoint. We do this by showing if two equivalence classes intersect, then they are the same equivalence class. Let s, t A and assume that the equivalence classes [ ] define, intersect. That is, there exists [ s] [ t] s and [ ] t which they y (as drawn in the diagram).
5 5 We now show[ s] = [ t]. We first prove [ s] [ t] by letting [ s] that x [ t]. Letting [ s] of the equivalence relation, we have i) x s [ ] [ ] x and showing x and using the symmetric and transitive properties ii) but y s and so y s, hence s y iii) since x s and s y we have x y. iv) but y t and so y t v) since x y and y t we have x t This shows x [ t] and hence [ s] [ t]. The proof [ s] [ t] [ s] = [ t]. is similar and so Significance of Theorem 1 (Partitioning Sets) An equivalence relation defined on a set A, partitions the set into disjoint subsets, called equivalence classes. The elements of each equivalent class are equivalent to each other, but not to any element in a different equivalence class. One can think of the equivalence relation as a kind of generalized equality where objects in a given class are equal. The set of equivalences classes of A partitioned by is called the quotient set of A modulo, and denoted by A/. See Figure 1. Example 4 (Modular Arithmetic) Partitioning of A into Equivalence Classes Figure 1 Let A =Z be the integers. We define two numbers, x y as equivalent if they have the same remainder when divided by a given number, say 5, and we
6 6 write this as x y ( mod 5) find the equivalence classes of this relation. Solution reflexive: x x( mod 5) reflexive: symmetric: If x y ( mod 5) symmetric:. Show this relation is an equivalence relation and since 5 divides x x = 0. then 5 divides x y. This means there exists an integer k such that x y = 5k. But this implies y x = 5k = 5( k ) which means 5 divides y x Hence is a symmetric relation.. Hence y x ( mod 5). transitive: If x y ( mod 5) and y z ( mod 5) transitive:, then 5 divides x y and 5 divides y z. Hence, there exist integers k 1, k 2 that satisfy x y = 5k1 and y z = 5k2. Adding these equations yields or ( x y) + ( y z) = 5k1 + 5k2 ( ) x z = 5 k + k = 5k which shows that 5 divides x z or x z ( mod 5). Hence is a transitive relation. The above equivalence relation divides the integers Z into the equivalence classes, where each equivalence class consists of integers with remainders of 0,1,2,3,4 when divided by 5. We give the numbers 0,1,2,3,4 special status and assign them as representatives of each equivalence class 3 listed below. ble 1 Equivalence Classes for mod ( 5) Table 1 Equivalence Classes for [ 0] = { 5 n : n Z} = { 10, 5, 0, 5, 10 } [ 1] = { 5n + 1: n Z} = { 9, 4, 1, 6, 11 } [ 2] = { 5n + 2 : n Z} = { 8, 3, 2, 7, 12 } [ 3] = { 5n + 3: n Z} = { 7, 2, 3, 8, 13 } [ 4] = { 5n + 4 : n Z} = { 6, 1, 4, 9, 14 } 3 In number theory these equivalence classes are also called residue classes.
7 7 In this example, the quotient set Z / (set of equivalence classes) would be {[ ] [ ] [ ] [ ] [ ]} Z / = 0, 1, 2, 3, 4 Note: Some people do not understand how the remainder of 3 / 5 can be 2. Remainders are defined as non negative integers, so we write 3 / 5 = / 5 = 1+ 2 / 5. ( ) Modular Arithmetic: Modular arithmetic occurs in many areas of mathematics as well as application in our daily lives. Instead of working with an infinite number of integers, it is only necessary to work with a few. The smallest number is mod ( 2 ), which subdivides the integers into two types, even and odd integers. Public key cryptography allows computers to do exact arithmetic mod ( n ), where n is the product of two prime numbers each 100 digits long. Example 5 (Equivalence Classes in the Plane) The Cartesian product A = N N defines points in the first quadrant of the Cartesian plane with integer coordinates. Define a relationship between, c, d as ( a b ) and ( ) (, ) (, ) a b c d b a = d c. Given that this relation defines an equivalence relation (See Problem 7), find its equivalence classes. Solution This relation classifies points (, ) x y as equivalent if their y coordinate minus their x coordinate are equal. This means two points (with positive integer coefficients), are equivalent if they both lie on 45 degree lines y = x + n, where n is an integer. Each value of n defines a different equivalence class. Some typical equivalence classes are
8 8 Table 3 Equivalence Classes ( 2,0 ) = {(2,0),(3,1),(4, 2),... } ( n = 2) ( 1,0 ) = {(1,0),(2,1),(3,2),... } ( n = 1) ( 0,0 ) = {(0,0),(1,1),(2, 2),... } ( n = 0) ( 0,1 ) = {(0,1),(1, 2),(2,3),... } ( n = 1) ( 0, 2 ) = {(0,2),(1,3),(2, 4),... } ( n = 2) These equivalence classes are illustrated in Figure 2 as points with integer coordinates lying on 45 degree lines in the first quadrant. Equivalence Classes as Grid Points on Lines y = x + n Figure 2 Margin Note: a is equivalent to b means a is equal to b, not in every respect, but as far as a particular property is concerned. Graph of an Equivalence Relation R The graph of the relation R = {( 1,1 ),( 2, 2 ),( 3,3)( 4, 4 ),( 1,3 ),( 3,1 ),( 3,4 ),( 4,3) }
9 9 on the set A = { 1,2,3, 4} is shown in Figure 3. It is an easy matter to verify that R is an equivalence relation. What are the equivalence classes of this relation? Solution The relation R says 1 1, 2 2, 3 3, 4 4, 1 3, 3 1, 3 4, 4 3 Using the transitivity property, we can show 1 3 4, and that the number 2 is only equivalent to itself. Hence the set A has been subdivided into two 2. Note that the two equivalence classes equivalence classes { 1,3, 4} and { } are disjoint and their union is A. Graph of an Equivalence Relation Figure 3
10 10 Problems 1. Let A be the set of students at a university and let x and y be students; i.e. elements of A. Tell if the following relations on A are equivalent relations. a) x is related to y iff x and y have the same major. b) x is related to y iff x and y have the GPA. c) x is related to y iff x and y are from the same country. d) x is related to y iff x and y e) x is related to y iff x and y have the same major. 2. (?) Tell if the following relations R are equivalence relations on a set A. If the relation is an equivalence relation, find the equivalence classes. a) xry iff y 2 = x ( A =R ) b) xry iff x is a factor of y ( A =N ) c) xry iff x and y are multiples of 5 ( A =N ) (Modular Arithmetic) Given the set { 1,2,3,4,5,6,7,8 } have x y ( mod 4), i.e. 4 divides x y 3. (Modular Arithmetic) relation and find the equivalence classes of the relation. 3. (True or False) a) 8 3( mod 5) b) 12 1( mod 6) c) 21 0( mod 3) d) 10 10( mod12) e) 99 9( mod 9) A = and for x, y A we. Prove that is an equivalence 4. (Defining New ) Let " " and " " be two equivalence relations on a set. Define two more relations by ( ) ( ) ( ) ( ) a b a b a b a b a b a b Determine if " " and " " are equivalence relations.
11 11 5. (An Old Favorite) The equals relation " = " is the most familiar equivalence relation. What are the equivalence classes of the equals relation on the set A = 1, 2,3,4,5? { } 6.. (Equivalence Relation) The Cartesian product A = N N defines the points in the first quadrant with integer coordinates. Show the relationship between, c, d defined by ( a b ) and ( ) is an equivalence relation. (, ) (, ) a b c d b a = d c 7. (Graph of an Equivalence Relation) Figure 4 shows an equivalence relation A = 1,2,3, 4. What are the equivalence classes? on the set { } 8. (Projective Plane) Graph of an Equivalence Relation Figure 4 { } 2 (Projective Plane) Define A = ( 0,0) minus the origin. Define a relation between two points (, ) R the set of all points in the plane by x y and ( x, y ) saying they are related if and only if they lie on the same line passing through the origin. Show that this relation is an equivalence relation and draw a graphical representation of the equivalence classes by picking a representative from each class. The space of all equivalence classes under this relation is called the projective plane.
12 12 9. (Equivalence Classes in Logic) Define an equivalence relation on logical sentences by saying two sentences are equivalent if they have the same truth value. Find the equivalence classes in the following collection of sentences = 3 3 < x 2 < 0 for some real number. 2 2 sin x + cos x = 1 Georg Cantor was born in Leopold Kronecker was a big fan of Cantor. Cantor's theorem guarantees larger and larger infinite sets. 10. (Similar Matrices) Two matrices A, B if there is an invertible matrix M such that MAM B 1 =. a) Show that similarity of matrices is an equivalence relation. b) Let A =, M 4 1 = 1 1 find B. What common properties do A, B share? 11. (Equivalence Relation on R ) Let f : R R. Define a relation on R by a b f ( a) = f ( b) a) Show is an equivalence relation. f x = x? b) What are the equivalence classes for ( ) 2 c) What are the equivalence classes for f ( x) = sin x? 12. (Arithmetic in Modular Arithmetic) Suppose Show a c b d ( mod 5) ( mod 5)
13 13 ( ) ( ) ( ) a) a + b c + d mod 5 b) a b c d mod 5 c) ab cd mod (Equivalent Angles) We say two angles x, y are related if and only if 2 2 sin cos 1 xry x + y = Show that R is an equivalence relation and identify the equivalence classes. (Moduli in Modular Arithmetic) Note that 2 2 0( mod 4) 14. (Moduli in Modular Arithmetic) = but neither factor is zero. What is 2 4 modulo 8? Is there any product a b with neither factor a b 0 mod3? Can you form a conjecture about the moduli related to 0, but ( ) this phenomenon?
Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More information7 Relations and Functions
7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 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
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
More informationIncenter Circumcenter
TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationFigure 1.1 Vector A and Vector F
CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationChapter 2 Remodulization of Congruences Proceedings NCUR VI. è1992è, Vol. II, pp. 1036í1041. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker Department
More informationChapter 9. Systems of Linear Equations
Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationVocabulary Words and Definitions for Algebra
Name: Period: Vocabulary Words and s for Algebra Absolute Value Additive Inverse Algebraic Expression Ascending Order Associative Property Axis of Symmetry Base Binomial Coefficient Combine Like Terms
More informationClock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More informationReading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
More information. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9
Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationPatterns in Pascal s Triangle
Pascal s Triangle Pascal s Triangle is an infinite triangular array of numbers beginning with a at the top. Pascal s Triangle can be constructed starting with just the on the top by following one easy
More information5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of Equations-Graphically and Algebraically Solving Systems - Substitution Method Solving Systems - Elimination Method Using -Dimensional Graphs to Approximate
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationAlex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory
More informationSettling a Question about Pythagorean Triples
Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More information26 Ideals and Quotient Rings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationLINEAR EQUATIONS IN TWO VARIABLES
66 MATHEMATICS CHAPTER 4 LINEAR EQUATIONS IN TWO VARIABLES The principal use of the Analytic Art is to bring Mathematical Problems to Equations and to exhibit those Equations in the most simple terms that
More informationMathematical Conventions Large Print (18 point) Edition
GRADUATE RECORD EXAMINATIONS Mathematical Conventions Large Print (18 point) Edition Copyright 2010 by Educational Testing Service. All rights reserved. ETS, the ETS logo, GRADUATE RECORD EXAMINATIONS,
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationMathematical Conventions. for the Quantitative Reasoning Measure of the GRE revised General Test
Mathematical Conventions for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview The mathematical symbols and terminology used in the Quantitative Reasoning measure
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationChapter 4.1 Parallel Lines and Planes
Chapter 4.1 Parallel Lines and Planes Expand on our definition of parallel lines Introduce the idea of parallel planes. What do we recall about parallel lines? In geometry, we have to be concerned about
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationSouth Carolina College- and Career-Ready (SCCCR) Pre-Calculus
South Carolina College- and Career-Ready (SCCCR) Pre-Calculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationNumber Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures
Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it
More informationIn mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.
MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationPOLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
More informationChapter 1 A Pri Characterization of T m e Pairs w in Proceedings NCUR V. (1991), Vol. I, pp. 362{366. Jerey F. Gold Department of Mathematics, Department of Physics University of Utah DonH.Tucker Department
More informationCubes and Cube Roots
CUBES AND CUBE ROOTS 109 Cubes and Cube Roots CHAPTER 7 7.1 Introduction This is a story about one of India s great mathematical geniuses, S. Ramanujan. Once another famous mathematician Prof. G.H. Hardy
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationMultiplication and Division with Rational Numbers
Multiplication and Division with Rational Numbers Kitty Hawk, North Carolina, is famous for being the place where the first airplane flight took place. The brothers who flew these first flights grew up
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationTo define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions
Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationNOT AN OFFICIAL SCORE REPORT. Summary of Results
From SAT TEST MARCH 8, 214 Summary of Results Page 1 of 1 Congratulations on taking the SAT Reasoning Test! You re showing colleges that you are serious about getting an education. The SAT is one indicator
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationFURTHER VECTORS (MEI)
Mathematics Revision Guides Further Vectors (MEI) (column notation) Page of MK HOME TUITION Mathematics Revision Guides Level: AS / A Level - MEI OCR MEI: C FURTHER VECTORS (MEI) Version : Date: -9-7 Mathematics
More informationMODERN APPLICATIONS OF PYTHAGORAS S THEOREM
UNIT SIX MODERN APPLICATIONS OF PYTHAGORAS S THEOREM Coordinate Systems 124 Distance Formula 127 Midpoint Formula 131 SUMMARY 134 Exercises 135 UNIT SIX: 124 COORDINATE GEOMETRY Geometry, as presented
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More informationTrigonometric Functions: The Unit Circle
Trigonometric Functions: The Unit Circle This chapter deals with the subject of trigonometry, which likely had its origins in the study of distances and angles by the ancient Greeks. The word trigonometry
More information