BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR 11 th 12 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC 1.2 RELATIONS CHAPTER AT GLANCE
|
|
- Scot Cooper
- 5 years ago
- Views:
Transcription
1 BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC.2 RELATIONS CHAPTER AT GLANCE. RELATIONS : Let A and B be two non- empty sets. A relation from set A to set B is a subset of A B. Thus, if R is a relations from A to B then R A B. Also, if ( a, b ) R, then we say that a is R related to be and denote this by a R b. In particular, if B = A then the subsets of A A are called relations from the set A to the set or simply as relations in the set A Illustrations: (i) Let A = {,3,5,7}, B = { 6,8 }, Let R be the relations is less than from A to B. R 6, R8, 3R6, 3R8, 5R6, 5R8, 7R8. Equivalently, R = { (,6), (,8), (3,6), (3,8), (5,6),(5,8), ( 7, 8)}. (ii) Let A = {,2,3,..,32}. Let R be the relation is one fourth of ;; in A. R4, 2R8,3R2,4R6, 5R20, 6R24, 7R28, 8R32 Equivalent, R = { (,4), (2,8), (3,2), (4,6), (5,20), (6,24), (7,28), (8,32) }, 2. DOMAIN AND RANGE : If R is a relation from A to B, then the set of first elements of elements in R is called the domain of R and the set of second element of elements in R is called the range of R. Symbolically, Domain of R = { x : ( x, y ) R } ; Range of R { y: (x, y } R}. Domain of R is a subset of A and range of R is a subset of B. For example, R = { 4, 7), ( 5,8), (6, 0 }. A = {,2,3.4,5,6} to the set B = { 6,7,8,9, 0 }. Domain of R = { 4,5,6}. this is a subset of A.Range of R = { 7,8, 0}. This is a subset of B. 3. NUMBER OF RELATIONS: Let A and B be two non- empty finite sets consisting of m and n elements respectively. A B contain mn ordered pairs Total number of subsets of A B is 2 mn Since each relation from A to B is a subset of A B, the total number of relations from A to B is 2 mn 4, TYPES OF RELATIONS: (i) A relation R in a set A is called the universal relation in a if R = A A. for example, if A = { 2, 6 }, then the universal relation in A is the set { (2,2), (2,6), (6,2), (6,6)}. (ii) A relation R is a set A is called the identity relation in A if R= { (a,a) ; a A }.For example if A = ( a,b,c) } then the identity relation in A is the set { (a,a), (b,b), (c, c)}. (iii) a relation R in a set A is called a void relation in A if R = O/. For example if A = {,2,3} and let R be the relation defined by a R b if a b = 2. The relation R = O/ A A is a void relation. (iv) A relation R in a set called a reflexive relation if ( a, a) R a A, i.e.., a Ra a A. For example, if A = { 2, 4, 7 } then the relation {(2,2), (4,4), (7,7)} is reflexive. (v) A relation R in a set A is called a symmetric relation if (a,b) R, i.e.., a Rb implies b Ra. For example, if A = { 2,4,7}, then the relation {(2,4), (4,2),(7,7)} is symmetric.
2 BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC (vi) A relation R in a set A is called transitive if (a,b) (b,c) R then ( a, c) R, i.e., a Rb, brc Implies a Rc. For example, if A = { 2,4,7}, then the relation { 2,4),(4,7),(2,7), (4,4)} is transitive. (vii) A relation R in a set A is called an equivalence relation if R is reflexive, symmetric and transitive. For an equivalence relation R in A, we have (i) ara a A (ii)a Rb bra (iii)arb and b Rc arc For example, if A = {,3,4,7}, then the relation { (,),(,3),(3,),(3,3),(4,4),(7,7),(4,7),(7,4) is an equivalence relation (vii) A relation R in a set A is called an anti- symmetric relation if (a,b), (b,a) R, then a = b. (ix) If R is a relation from A to B, then the inverse relation of R is a relation from b to A and is defined as { (y,x): (x, y ) R }, The inverse relation in A,, then R = {(4,), (5,9), (2,0)}is the inverse relation of R. (x) Let R and S be two relation from the sets A to B to C respectively, we define a relation So R from A to C as follows : ( a,c) So R if (a,b) R and ( b, c) S for some b B. This relation SoR is called the composition of the relations R and S. For example, let A = {2,3,4}, B= {,5,7}, C = {,3,6,8}. Let R = { (2,), (2,5), (3,5), (4,), (4,7) } be a relation from A to B. Let S = { (,3), (5,3), (5,6), (7,6), (7,8)} be a relation from B to C. SoR = {(2,3),(5,3), (3,3), (4,3),(4,6), (4,8)} is a relation from A to C Note: ( 4,6),(4,8) SoR because (4,7) R and (7,6),(7,8) S. 5. CONGRUEN MODULOM m : Let m be an arbitrary but fixed integer. Two integers a and b are said to be congruence modulo m if a b is divisible by m. We write this as a b mod m. For example 24 3 mod 7 because 24-3= 2 is divisible by 7. Example : Show that congruence modulo m is an equivalence relation in the set Z. Solution : Let R denotes the relation congruence module m. Let a Z a a = 0 is divisible by m. a a mod m i.e., a Ra R is reflexive Let ( a, b ) R. a b mod m m/a b, m / - ( b a ), m /b a b a mod m, ( b,a) R R is symmetric Let ( a, b), ( b, c) R a b mod m, b c mod m m/ ( a b, m / b c ) m/ ( a b ) ( b c), m /a c a c mof m, ( a, c ) R R is transitive R is an equivalence relation 6. EQUIVALENCE CLASS: Let R be an equivalence in a set A. If a A, then the subset {x A:xRa} of A is called the equivalence class corresponding to a and it is denoted by [ a] Properties : (i) a [a ] a A (ii) a [b] if and only if [a] = [b]
3 BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC (iii) If a,b A, then either [a] [b] = O/ or [a] = [b] Example : Let A = {,2,3} and R = { (,), (2,2), (3,3), (,2), (2,),(2,3),(3,2), (3,), (,3)} is an equivalence Relation in A. [] = {,2,3} because (,) (2,),(3,) are in R [2] = { 2,,3} because (2,2), (,2), (3,2) are in R [3] = {3, 2,} because (3,3), (2,3), (,3) are in R Example 2 : Let A = {,2,3 } and R = { (,), (2,2), (3,3), (,2), (2,) } is an equivalence relation in A [] = {,2} because (,) (2,) are in R [2] = { 2,} because ( 2,2), (,2) are in R [3] = { 3} because (3,3} is in R SOME SPECIAL TIPS ( ) ( ). Total number of relation from set A to set B is equal to 2 nanb. 2. The universal relation on a non-empty set is always reflexive, symmetric and transitive. 3. The identity relation on a non-empty set is always reflexive, symmetric and transitive 4. The identity relation on a non-empty set is always anti symmetric. 5. If R is a relation from A to B and S is a relation from B to C then ( ) ROS = S OR. 6. For two relations R and S, the composite relation RoS, may be void relation. 7. A relation R in the set A is symmetric if and only if R = R. OBJECTIVE QUESTION SET -. Let A = {,2,3, 45} and R be the relation is square of in A. which of the following is false? (i) R = {(,), (4,2), (9,3), (6,4), (25,5), (36,6)} (ii) Domain of R = {(,4,9,6,25,36)} (iii) Range of R = {(,2,3,4,5,6)} (iv) At least one is false 2. In number of element in sets A and B are m and n respectively, then number of relations from A to be is () 2 m+ n (2) 2 mn (3) m + n (4) mn 3. Let R be a reflexive relation in a finite set having n element and let there be m ordered pairs in R. Then () m n (2)m n (3) m = n (4) none of these 4. If R is a relation from a set p to set Q, then () R P Q (2) R Q P (3) R = P Q (4) R =P Q 5. If A is a finite set having n elements, then number of relations which can be defined is A is () 2 n 2 2 (2) n (3) 2 n n (4) n 6. If the relation R : A R, where A = {,2,3} and B = {,3,5} is defined by A = {(x,y):x<y, x
4 BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC A, y B }, then () R = { (,3), (,5), ( 2,5), (3,5) } (2) R = {(,),(,5),(2,3),(3,5) } (3) R = { (3,), (5,),(3,2),(5,3)} (4) R = { (,), (5,), (3,2), (5,3)} 7. If n/m means that n is a factor m, the relation I in Z {0} is () reflexive and symmetric (2) symmetric and transitive (3) reflexive, symmetric and transitive (4) reflexive, transitive and not symmetric 8. Let R {(x,y) } : x + y = x,y R} be a relation in R. The relation R is () reflexive (2) symmetric (3) transitive (4) anti-symmetric 9. Let X be a family of sets and R be a relation in X defined by A is disjoint from B, The relation R is () reflexive (2) symmetric (3) transitive (4) anti-symmetric 0. For real numbers x and y, we define x R y if x y + 5 is an irrational number. The relation R is () reflexive (2) symmetric (3) transitive (4) none of these. Let denotes the set of all straight lines in a plane. Let a relation R be defined by Rβ α β αβ, L. The relation r is () reflexive (2) symmetric (3) transitive (4) none of these 2. Let R be a relation in the set N of natural numbers defined by the relation n Rm n is a factor of m The relation R is () reflexive and symmetric only (2) symmetric and transitive only (3) reflexive and transitive only (4) an equivalence relation 3. Two point A and B in a plane are related if OA= OB, where O is a fixed Point. This relation is () reflexive but not symmetric (2) symmetric but not transitive (3) an equivalence relation (4) none of these 4. Let A be the set of first ten natural numbers and let R be a relation in A defined by ( x, y ) R if an Only if x + 2y = 0. Which of the following is false? () R = { (2,4), (4,3), (6,2), (8,)} (2) domain of R = {(2,4,6,8) } (3) range of R = { (,2,3,4)} (4) at least one is false 5. Let A={,2,3,4} and let R = {(2,2), (3,3), (4,4), (,2)} be a relation in A. Then R is () reflexive (2) symmetric (3) transitive (4) none of these 6. A relation R is defined in the set Z of integers as follows : ( x, y ) R if x + y = 9. which of the Following is false? () R = { (0,3), (0,-3), (3,0), (-3, 0)} (2) domain of R = { -3,0,3} (3) range of R = {-3,0,3} (4) at least one is false 7. An integer m is said to be related to another integer n if m is a multiple o n. This relation is () reflexive and symmetric (2) reflexive an transitive (3) symmetric and transitive (4) an equivalence relation a b 5 8. The relation R defined in A = {,2,3} by a Rb if which of the following is false? () R = { (,), (2,2), (3,3), (2,), (,2), (2,3), (3, 2) }
5 BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC (2) R = R (3) domain of R = {,2,3} (4) range of R = {5} 2 9. Let R be a relation in N defined by R = { ( + x, + x ) : x 5, x N}. Which of the following is false? () R = { (2,2), (3,5), (4,0), (5,7), (6,25)} (2) domain of R = { 2,3,4,5,6} (3) range of R = { 2,5,0,7,26} (4) at least one is false 20. Let A = {,2,3 }, B = {, 3,5}. If relation R from A to B is given by { (,3), (2,5), (3,3) }, then is () { ( 3,3), (3, ), (5, 3 )} (2) { (,3), (2,5), (3, 3)} (3) { (3,3), (4,3), (5,4),(3,4)} (4) none of these 2. The relation R defined in the set A = {,2,3,4,5} by R { x,y) : x y < 6 } is given by () { {,), (2,), (3,), (4,), (2, 3 )} (2) { (2,2), (3,2), (4,2), (2, 4 ) } (3) { (3,3), (4,3), ( 5,4), (3,4) } (4) none of these 22. R is a relation from {,2,3 } to { 8,0,2} defined by y = x 3. The relation () { (,8), (3, 0)} (2) {(8, ), ( 0, 3)} (3) { (8, ), (9,2), (0,3)} (4) none of these 23. Let R be a relation in N defined by R= { (x, y) : x + 2y = 8 }.The range of R is ( ) { 2,4,6} (2) {,2,3} (3) {,2,3,4,6} (4) none of these 24. IF R = { ( x, y ) : x, y Z, x + y 4 } is a relation in Z, domain of R is () { 0,,2} (2) { -2-,0} (3) { -2-,0,,2} (4) none of these 25. If A {,2,3}, then the relation r {(2,3)} in a is () symmetric and transitive only (2) symmetric only (3) transitive only (4) none of these 26. Let X be a family of sets and R be a relation in X, defined by A is disjoint from B.Then R is () reflexive (2) symmetric (3) anti-symmetric (4) transitive 27. A relation R from C to R is defined by x Ry if x = y. Which of the following is correct? () ( 2+ 3i) R 3 (2) 3 R (-3) (3) (+i) R 2 (4) ir 28. The void relation in a set A is () reflexive (2) reflexive and symmetric (3) reflexive and transitive (4) symmetric and transitive 29. If R is a relation from a set A to the set B and S is a relation from B to C, then the relation SoR () is from C to A (2) is from A to C (3) does not exit (4) none of these 30. If R be an anti-symmetric relation in a set A such that ( a, b), ( b, a) R, then () a b (2) a b (3) a = b (4) none of these 3. Let S be a non-empty set. In P (S), Let R be a relation defined as ARB A B O/. The relation R is () reflexive (2) symmetric (3) transitive (4) none of these R is R
1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More information9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics
MATH10111 - Foundations of Pure Mathematics 9 RELATIONS 9.1 Reflexive, symmetric and transitive relations Let A be a set with A. A relation R on A is a subset of A A. For convenience, for x, y A, write
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More information14 Equivalence Relations
14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes
More informationRelations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)
Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered
More informationChapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler
Chapter VI Relations Assumptions are the termites of relationships. Henry Winkler Studying relationships between objects can yield important information about the objects themselves. In the real numbers,
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationMath 2534 Solution to Test 3A Spring 2010
Math 2534 Solution to Test 3A Spring 2010 Problem 1: (10pts) Prove that R is a transitive relation on Z when given that mrpiff m pmod d (ie. d ( m p) ) Solution: The relation R is transitive, if arb and
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More information(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics
King Saud University College of Science Department of Mathematics 151 Math Exercises (4.2) Equivalence Relations Malek Zein AL-Abidin 1440 ه 2018 Equivalence Relations DEFINITION 1 A relation on a set
More informationRelations, Functions & Binary Operations
Relations, Functions & Binary Operations Important Terms, Definitions & Formulae 0 TYPES OF INTERVLS a) Open interval: If a and b be two real numbers such that a b then, the set of all the real numbers
More informationMath Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationDeviations from the Mean
Deviations from the Mean The Markov inequality for non-negative RVs Variance Definition The Bienaymé Inequality For independent RVs The Chebyeshev Inequality Markov s Inequality For any non-negative random
More informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationLESSON RELATIONS & FUNCTION THEORY
2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More informationRelations. P. Danziger. We may represent a relation by a diagram in which a line is drawn between two elements if they are related.
- 10 Relations P. Danziger 1 Relations (10.1) Definition 1 1. A relation from a set A to a set B is a subset R of A B. 2. Given (x, y) R we say that x is related to y and write xry. 3. If (x, y) R we say
More informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationIntroduction to Cryptography CS 355 Lecture 3
Introduction to Cryptography CS 355 Lecture 3 Elementary Number Theory (1) CS 355 Fall 2005/Lecture 3 1 Review of Last Lecture Ciphertext-only attack: Known-plaintext attack: Chosen-plaintext: Chosen-ciphertext:
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
More informationHL Topic. Sets, relations and groups. (Further Mathematics SL Topic 3) Sets Ordered pairs Functions Binary operations Groups Further groups
HL Topic (Further Mathematics SL Topic 3) 9 This topic explores the fundamental nature of algebraic structures and the relationships between them. Included is an extension of the work covered in the Core
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More informationQUESTION BANK II PUC SCIENCE
QUESTION BANK II PUC SCIENCE I. Very Short answer questions. (x9=9). Define Symmetric relation. Ans: A relation R on the set A is said to be symmetric if for all a, b, A, ar b Implies bra. i.e. (a, b)
More informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationMATHEMATICS. IMPORTANT FORMULAE AND CONCEPTS for. Final Revision CLASS XII CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION.
MATHEMATICS IMPORTANT FORMULAE AND CONCEPTS for Final Revision CLASS XII 2016 17 CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION Prepared by M. S. KUMARSWAMY, TGT(MATHS) M. Sc. Gold Medallist (Elect.),
More information2 Equivalence Relations
2 Equivalence Relations In mathematics, we often investigate relationships between certain objects (numbers, functions, sets, figures, etc.). If an element a of a set A is related to an element b of a
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationEQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs
More informationChapter12. Relations, Functions, and Induction
. Relations. Functions. Seuences.4 Mathematical Induction.5 Recurrence Relations Chapter Review Chapter Relations, Functions, and Induction In this chapter we introduce the concepts of a relation and a
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
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 informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More information( ) 3 = ab 3 a!1. ( ) 3 = aba!1 a ( ) = 4 " 5 3 " 4 = ( )! 2 3 ( ) =! 5 4. Math 546 Problem Set 15
Math 546 Problem Set 15 1. Let G be a finite group. (a). Suppose that H is a subgroup of G and o(h) = 4. Suppose that K is a subgroup of G and o(k) = 5. What is H! K (and why)? Solution: H! K = {e} since
More informationCHAPTER 1 POLYNOMIALS
1 CHAPTER 1 POLYNOMIALS 1.1 Removing Nested Symbols of Grouping Simplify. 1. 4x + 3( x ) + 4( x + 1). ( ) 3x + 4 5 x 3 + x 3. 3 5( y 4) + 6 y ( y + 3) 4. 3 n ( n + 5) 4 ( n + 8) 5. ( x + 5) x + 3( x 6)
More informationDERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine
DERIVATIONS Introduction to non-associative algebra OR Playing havoc with the product rule? PART VI COHOMOLOGY OF LIE ALGEBRAS BERNARD RUSSO University of California, Irvine FULLERTON COLLEGE DEPARTMENT
More informationLecture 4.3: Closures and Equivalence Relations
Lecture 4.3: Closures and CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren Course Admin Mid-Term 2 Exam Solution will be posted soon Should have the results
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationReading 11 : Relations and Functions
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationGENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXV, 2(1996), pp. 247 279 247 GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS J. HEDLÍKOVÁ and S. PULMANNOVÁ Abstract. A difference on a poset (P, ) is a partial binary
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More information1 Alphabets and Languages
1 Alphabets and Languages Look at handout 1 (inference rules for sets) and use the rules on some examples like {a} {{a}} {a} {a, b}, {a} {{a}}, {a} {{a}}, {a} {a, b}, a {{a}}, a {a, b}, a {{a}}, a {a,
More informationChapter 6. Relations. 6.1 Relations
Chapter 6 Relations Mathematical relations are an extremely general framework for specifying relationships between pairs of objects. This chapter surveys the types of relations that can be constructed
More informationHomework 7 Solutions, Math 55
Homework 7 Solutions, Math 55 5..36. (a) Since a is a positive integer, a = a 1 + b 0 is a positive integer of the form as + bt for some integers s and t, so a S. Thus S is nonempty. (b) Since S is nonempty,
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Section 9.1 Rela%onships Relationships between elements of sets occur in many contexts. Every day we deal with relationships such as those between a business and its telephone number, an employee and his
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
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 informationMATHEMATICS. MINIMUM LEVEL MATERIAL for CLASS XII Project Planned By. Honourable Shri D. Manivannan Deputy Commissioner,KVS RO Hyderabad
MATHEMATICS MINIMUM LEVEL MATERIAL for CLASS XII 05 6 Project Planned By Honourable Shri D. Manivannan Deputy Commissioner,KVS RO Hyderabad Prepared by M. S. KUMARSWAMY, TGT(MATHS) M. Sc. Gold Medallist
More informationReal Numbers. Real numbers are divided into two types, rational numbers and irrational numbers
Real Numbers Real numbers are divided into two types, rational numbers and irrational numbers I. Rational Numbers: Any number that can be expressed as the quotient of two integers. (fraction). Any number
More informationKnot semigroups: a new algebraic approach to knots and braids
Knot semigroups: a new algebraic approach to knots and braids Alexei Vernitski University of Essex On the picture: the logo of a shopping centre in Colchester presents what in this talk we shall treat
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationIn mathematics there are endless ways that two entities can be related
CHAPTER 16 Relations In mathematics there are endless ways that two entities can be related to each other. Consider the following mathematical statements. 5 < 10 5 5 6 = 30 5 5 80 7 > 4 x y 8 3 a b ( mod
More informationQuestion 1: Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0?
Class IX - NCERT Maths Exercise (.) Question : Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0? q Solution : Consider the definition of a rational number.
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationOrders and Equivalences
and Equivalences Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 9, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) and Equivalences Gazihan Alankuş (Based
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More information1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings
More informationExample. Addition, subtraction, and multiplication in Z are binary operations; division in Z is not ( Z).
CHAPTER 2 Groups Definition (Binary Operation). Let G be a set. A binary operation on G is a function that assigns each ordered pair of elements of G an element of G. Note. This condition of assigning
More informationSolutions to In Class Problems Week 4, Mon.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions
More informationRelations. Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B.
Chapter 5 Relations Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B. If A = B then a relation from A to B is called is called a relation on A. Examples A relation
More informationSYMBOL NAME DESCRIPTION EXAMPLES. called positive integers) negatives, and 0. represented as a b, where
EXERCISE A-1 Things to remember: 1. THE SET OF REAL NUMBERS SYMBOL NAME DESCRIPTION EXAMPLES N Natural numbers Counting numbers (also 1, 2, 3,... called positive integers) Z Integers Natural numbers, their
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 informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Let R be the relation defined below. Determine which properties, reflexive, irreflexive, symmetric, antisymmetric, transitive, the relation satisfies. Prove each answer.
More informationRELATIONS AND FUNCTIONS-I
Relations -I MDULE - I RELATINS AND FUNCTINS-I In our daily life, we come across many patterns that characterise relations such as brother and sister, father and son, teacher and student etc. In mathematics
More informationAutomata Theory for Presburger Arithmetic Logic
Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationLogic, Set Theory and Computability [M. Coppenbarger]
7 Relations (Handout) Definition 7-1: A set r is a relation from X to Y if r X Y. If X = Y, then r is a relation on X. Definition 7-2: Let r be a relation from X to Y. The domain of r, denoted dom r, is
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationMATHEMATICS IN EVERYDAY LIFE 8
MATHEMATICS IN EVERYDAY LIFE 8 Chapter : Playing with Numbers ANSWER KEYS. Generalised form: (i) 8 = 0 8 + EXERCISE. (ii) 98 = 00 + 0 9 + 8 (iii) 7 = 00 7 + 0 + (iv) = 00 0 +. Usual form: (i) 0 + 7 = 0
More informationReview Let A, B, and C be matrices of the same size, and let r and s be scalars. Then
1 Sec 21 Matrix Operations Review Let A, B, and C be matrices of the same size, and let r and s be scalars Then (i) A + B = B + A (iv) r(a + B) = ra + rb (ii) (A + B) + C = A + (B + C) (v) (r + s)a = ra
More informationAlgebra I. Book 2. Powered by...
Algebra I Book 2 Powered by... ALGEBRA I Units 4-7 by The Algebra I Development Team ALGEBRA I UNIT 4 POWERS AND POLYNOMIALS......... 1 4.0 Review................ 2 4.1 Properties of Exponents..........
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationDefinition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson
Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.
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 informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
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 informationThe number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.
The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class
More informationWorksheet on Relations
Worksheet on Relations Recall the properties that relations can have: Definition. Let R be a relation on the set A. R is reflexive if for all a A we have ara. R is irreflexive or antireflexive if for all
More information,
NATIONAL ACADEMY DHARMAPURI 97876 60996, 7010865319 Unit-II - Real Analysis Cardinal numbers - Countable and uncountable cordinals - Cantor s diagonal process Properties of real numbers - Order - Completeness
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More informationRelations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3) CmSc 365 Theory of Computation 1. Relations Definition: Let A and B be two sets. A relation R from A to B is any set of ordered pairs
More information(vi) xry iff x y 2 (see the previous exercise); (iii) xry iff xy 0;
Final: Practice problems Relations Properties Exercise: For the following relations on Z, investigate the four basic properties. (i) arb iff a = b ; (v) arb iff a = b+; (ii) arb iff a b; (vi) arb iff a
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationReal Numbers. Real numbers are divided into two types, rational numbers and irrational numbers
Real Numbers Real numbers are divided into two types, rational numbers and irrational numbers I. Rational Numbers: Any number that can be expressed as the quotient of two integers. (fraction). Any number
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More information