Logic, Set Theory and Computability [M. Coppenbarger]

Size: px
Start display at page:

Download "Logic, Set Theory and Computability [M. Coppenbarger]"

Transcription

1 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 defined as dom r = { x : (x,y) r for some y Y }. The range of r, denoted ran r, is defined as ran r = { y : (x,y) r for some x X }. Definition 7-3: Let r be a relation from X to Y. Let A X. The image of A through r, denoted r(a), is defined as r(a) = { y : (x,y) r for some x A }. Let B Y. The preimage of B through r, denoted r (B), is defined as r (B) = { x : (x,y) r for some y B }. Definition 7-4: Let r be a relation from X to Y. The inverse of r, denoted r 1, is defined as r 1 = { (y,x) : (x,y) r }. Definition 7-5: Given a set X, the identity relation, denoted i X, is a relation on X and is defined as i X = { (x,x) : x X }. Definition 7-6: Let r be a relation from X to Y 1 and s a relation from Y 2 to Z. The composition of r and s, denoted s r, is a relation from X to Z and is defined by s r = { (x,z) : (x,y) r and (y,z) s for some y Y 1 Y 2 }. Definition 7-7: Let r be a relation on X. The power of r is a sequence of relations r 0, r 1, r 2, r 3, where each is defined as r 0 = i X, r 1 = r, r 2 = r r 1, and r 3 = r r 2, and so on Definition 7-8: Let r be a relation from X to Y and let A X. The restriction of r to A, denoted r A, is the relation r A = r (A Y). Definition 7-9: Let A X and let s be a relation from A to Y. If there exists a relation r from X to Y such that s = r A, then r is called an extension of s. Definition 7-10 (Properties of Relations): A relation r on X is (Property I) reflexive for all x X, (x,x) r (Property I ) irreflexive for all x X, (x,x) r (Property II) symmetric (x,y) r implies (y,x) r (Property II ) asymmetric (x,y) r implies (y,x) r (Property III) antisymmetric (x,y),(y,x) r imply x = y (Property III ) antiasymmetric (x,y),(y,x) r imply x y (Property IV) transitive (x,y),(y,z) r imply (x,z) r (Property IV ) atransitive (x,y),(y,z) r imply (x,z) r (Property V) circular (x,y),(y,z) r imply (z,x) r (Property V ) acircular (x,y),(y,z) r imply (z,x) r Definition 7-11: A relation is a quasi-ordering if it is reflexive and transitive. A quisi-ordering that is symmetric is an equivalence relation. A quasi-ordering that is anti-symmetric is an order. Definition 7-12: Let r be an equivalence relation on X. For any x X, the equivalence class of x, denoted x / r, is defined as x / r = { y : y X and (x,y) r }. Definition 7-13: The collection C is mutually disjoint if A,B C implies A B = or A = B. Definition 7-14: The collection C is a partition of a set X if C X such that «C = X and C is mutually disjoint. Theorem 7-15: Let r be an equivalence relation on X. Then the set { x / r : x X } is a partition of X.

2 Definition 7-16: Let r be an equivalence relation on X. The partition induced by r on X, denoted X / r, is defined as X / r = { x / r : x X }. Theorem 7-17: Let C be a partition of X and define a relation s on X by s = { (x,y) : x,y X and there exists A C such that x,y A }. Then s is an equivalence relation. Definition 7-18: Let C be a partition of X. The relation induced by C on X, denoted X / C, is defined by X / C = { (x,y) : x,y X and there exists A C such that x,y A }. Beginning Exercises 7-A-1. List all the relations from X = { a, b } to Y = { c }. 7-A-2. List all the relations on (a) the set 1; (b) the set 2. 7-A-3. List the ordered pairs in the relation r on 2 defined by r = { (A,B) : A,B 2 and A B }. 7-A-4. Let r be a relation from 5 to 6 defined by r = { (1,2), (1,4), (2,3), (3,1), (4,2), (4,4) }. Let A = 3. Determine each of the following. (a) dom r; (b) ran r; (c) r(a); (d) r (A); (e) r 1 ; (f) i 5 ; (g) (r r)(a); (h) r r; (i) r 3 ; (j) r A. 7-A-5. Let r be a relation from X to Y. (That is, r X Y.) Prove each of the following. (a) r (Y ) = dom r X. (b) r(x) = ran r Y. (c) r 1 is a relation from Y to X and (r 1 ) 1 = r. (d) If A X, then r(a) Y. 7-A-6. Let r be a relation from X to Y. Do any of the expressions ««r,»«r, r, or»»r simplify to dom r or ran r? 7-A-7. Let r be a relation on X. (That is, r X X.) Prove that dom r 1 = ran r and ran r 1 = dom r. Medium Exercises 7-B-1. Prove that the composition of two relations is a relation. 7-B-2. Let s be a relation from X to Y. Prove each of the following. (a) i dom s s 1 s (b) i ran s s s 1 (c) i Y s = s i X = s 7-B-3. Let s be a relation from X to Y 1 and t be a relation from Y 2 to Z with A, B X. Prove (t s)(a) = t (s (A)). 7-B-4. Let s be a relation from X to Y 1 and t be a relation from Y 2 to Z. Prove (t s) 1 = s 1 t 1. 7-B-5. Let r be a relation from X to Y 1, s be a relation from Y 2 to Z 1, and t be a relation from Y 3 to Z 2. Prove if s t, then s r t r. 7-B-6. Let r be a relation from X 1 to Y 1, s be a relation from X 2 to Y 2, and t be a relation from Y 3 to Z. Prove if r s, then t r t s.

3 7-B-7. Prove that the composition of relations is associative. That is, if r is a relation from W to X 1, s is a relation from X 2 to Y 1, and t is a relation from Y 2 to Z, then t (s r) = (t s) r. 7-B-8. Let r,s be relations on X. Determine if the following are true. If not, is one a subset of the other? Prove either case. (a) dom s r = dom r (b) ran s r = ran r 7-B-9. Let r be a relation from X to Y and let A X. Prove or disprove A = r ( r(a)). If false, prove or disprove A r ( r(a)) and r ( r(a)) A. Exercises Involving Collections and Relations 7-C-1. Let s be a relation from X to Y and suppose C X is a collection of subsets of X. Prove s («C) = «{ s(a) : A C }. 7-C-2. Let s be a relation from X to Y and suppose C X a nonempty collection of subsets of X. (a) Prove that s (»C)»{ s(a) : A C }. (b) Provide a counterexample of»{ s(a) : A C } s (»C). (c) Provide a necessary and sufficient condition (or conditions) for s (»C) =»{ s(a) : A C }. 7-C-3. Let s be a relation from X to Y and suppose C Y a collection of sets. Prove each of the following. (a) s («C) = «{ s (A) : A C } (b) If C is nonempty, then s (»C) =»{ s (A) : A C }. 7-C-4. Let R be a collection of relations from X to Y. Prove each of the following. (a) «R is a relation from X to Y and («R) 1 = «{ s 1 : s R } (b) If R is nonempty, then»r is a relation from X to Y and (»R) 1 =»{ s 1 : s R }. 7-C-5. Let r be a relation from X to Y and suppose R is a collection of relations from Y to Z. Prove each of the following. (a) («R) r = «{ s r : s R } (b) If R is nonempty, then (»R) r =»{ s r : s R }. 7-C-6. Let R be a collection of relations from X to Y and suppose t be a relation from Y to Z. Prove each of the following. (a) t («R) = «{ t s : s R } (b) If R is nonempty, then t (»R) =»{ t s : s R }. Exercises Applying Properties of Relations 7-D-1. Let r be a relation on 4 defined by r = { (0,1), (0,3), (1,2), (2,0), (3,1), (3,3) }. Which of the ten properties does r satisfy? 7-D-2. How many of the relations on the set 2 in your answer for Exercise 7-A-2(b) are (I) reflexive? (II) symmetric? (III) anti-symmetric? (IV) transitive? (V) circular? (I ) irreflexive? (II ) asymmetric? (III ) anti-asymmetric? (IV ) atransitive? (V ) acircular? 7-D-3. Let W be the set of all strings of English letters of finite length. Define a relation r on W as r = { (w 1, w 2 ) : w 1 and w 2 have no letters in common }. (a) Let S be the set containing only the strings CAT and DOG. Determine the sets:

4 (i) dom r; (ii) ran r; (iii) r(s); (iv) r (S); (v) r 1 ; (vi) i W ; (vii) (r r)(s); (viii) r r; (xi) r 3 ; (x) r S. 7-D-4. Let W be the set of all strings of English letters of finite length. Define a relation s on W as s = { (w 1, w 2 ) : w 1 and w 2 do not have the same length }. (a) Let S be the set containing only the strings CAT and DOG. Determine the sets: (i) dom s; (ii) ran s; (iii) s(s); (iv) s (S); (v) s 1 ; (vi) i W ; (vii) (s s)(s); (viii) s s; (xi) s 3 ; (x) s S. 7-D-5. Let W be the set of all strings of English letters of finite length. Define a relation t on W as t = { (w 1, w 2 ) : w 1 is longer than w 2 }. (a) Let S be the set containing only the strings CAT and DOG. Determine the sets: (i) dom t; (ii) ran t; (iii) t(s); (iv) t (S); (v) t 1 ; (vi) i W ; (vii) (t t)(s); (viii) t t; (xi) t 3 ; (x) t S. 7-D-6. Let L be the set of all lines in R 2 (that is, the xy-plane where R is the set of real numbers). Define a relation r on L as r = { ( 1, 2 ) : 1 and 2 are parallel }. (a) Let S be the set containing only the x-axis and the y-axis. Determine the sets: (i) dom r; (ii) ran r; (iii) r(s); (iv) r (S); (v) r 1 ; (vi) i L ; (vii) (r r)(s); (viii) r r; (xi) r 3 ; (x) r S. 7-D-7. Let L be the set of all lines in R 2 (that is, the xy-plane where R is the set of real numbers). Define a relation s on L as s = { ( 1, 2 ) : 1 and 2 are perpendicular }. (a) Let S be the set containing only the x-axis and the y-axis. Determine the sets: (i) dom s; (ii) ran s; (iii) s (S); (iv) s (S); (v) s 1 ; (vi) i L ; (vii) (s s)(s); (viii) s s; (xi) s 3 ; (x) s S. 7-D-8. Let L be the set of all lines in R 2 (that is, the xy-plane where R is the set of real numbers). Define a relation t on L as t = { ( 1, 2 ) : 1 and 2 intersect }. (a) Let S be the set containing only the x-axis and the y-axis. Determine the sets: (i) dom t; (ii) ran t; (iii) t(s); (iv) t (S); (v) t 1 ; (vi) i L ; (vii) (t t)(s); (viii) t t; (xi) t 3 ; (x) t S. 7-D-9. Let T be the set of all non-degenerate triangles in R 2 (that is, the xy-plane). Define a relation r on T by r = { (t 1, t 2 ) : t 1 and t 2 have an angle of the same measure }. (a) Let S be the singleton set containing only the triangle with vertices at (0,0), (1,0), and (0,1). Determine the sets: (i) dom r; (ii) ran r; (iii) r(s); (iv) r (S); (v) r 1 ; (vi) i T ; (vii) (r r)(s); (viii) r r; (xi) r 3 ; (x) r S.

5 7-D-10. Let Z be the set of integers. Define a relation r on Z by r = { (m,n) : m divides n }. [For m,n Z with m 0, we say that m divides n if there exists a unique k Z such that km = n.] (a) Let S = {2, 3}. Determine the sets: (i) dom r; (ii) ran r; (iii) r(s); (iv) r (S); (v) r 1 ; (vi) i Z ; (vii) (r r)(s); (viii) r r; (xi) r 3 ; (x) r S. 7-D-11. Let Z be the set of integers. Define a relation r on Z Z by r = { ( (a,b), (c,d) ) : a < c or [ a = c and b d ] }. (a) Let S = {(1,2), (5,7)}. Determine the sets: (i) dom r; (ii) ran r; (iii) r(s); (iv) r (S); (v) r 1 ; (vi) i Z Z ; (vii) (r r)(s); (viii) r r; (xi) r 3 ; (x) r S. 7-D-12. Let X be a set. Define the relation r on X by r = { (A,B) : A,B X and A B }. (a) Let S = {, X }. Determine the sets: (i) dom r; (ii) ran r; (iii) r(s); (iv) r (S); (v) r 1 ; (vi) i X ; (vii) (r r)(s), (viii) r r, (xi) r 3, and (x) r S. 7-D-13. Let X be a set and Y X. Define the relation r Y on X by r Y = { (A,B) : A Y = B Y }. Determine which of the ten relation properties that r Y satisfies. If a relation does not satisfy a property, then provide a counterexample to show that the property is not satisfied. Proofs are not 7-D-14. Let Q be the set of rational numbers. By Q[X] is meant the set of all polynomials in X with rational coefficients. Define a relation r on A = Q[X] Q as r = { (f, g) : f, g A and g = qf for some q A }. Determine which of the ten relation properties that r satisfies. If a relation does not satisfy a property, then provide a counterexample to show that the property is not satisfied. Proofs are not Next time Let C be the set of circles in the plane. Define the relation r on C by r = { (C 1,C 2 ) : C 1 is contained within C 2 }. Let C be the set of convex regions in the plane. Define the relation r on C by r = { (C 1,C 2 ) : C 1 is a subregion of C 2 }. Exercises Involving Proofs with Properties of Relations 7-E-1. Let s be a relation on X. Find a necessary and sufficient condition so that s satisfies the given property. Then prove that the condition is true. (a) reflexive (c) symmetric (e) antisymmetric (g) transitive (i) circular (b) irreflexive (d) asymmetric (f) antiasymmetric (h) atransitive (j) acircular (Conditions should be in terms of s along with one or more of the following: i X, X, inverse, relative complement, union, intersection, composition, subset, domain, range, image, and preimage.) 7-E-2. Let r be a relation on X. Find a necessary and sufficient condition for which the following relations are reflexive. (a) r 1 r

6 (b) r r 1 7-E-3. Let r be a relation on X. Prove each of the following. (a) r 1 r is symmetric. (b) r r 1 is symmetric. 7-E-4. Let r be a relation on X. Prove that the following are equivalent: (i) r is reflexive; (ii) r 1 is reflexive; (iii) X X r is irreflexive. 7-E-5. Let r be a nonempty relation on X. Suppose that r satisfies any two of the following properties: irreflexive, symmetric, and transitive. Prove that r cannot satisfy the third property. 7-E-6. Let s be a relation on X. Prove that if s is transitive and reflexive, then s 2 = s. Is the converse true? 7-E-7. Let r be a relation on X. Prove each of the following. (a) The relation t = r r 1 is symmetric and is the smallest symmetric relation containing r. [That is, if s is a symmetric relation such that r s t, then s = t.] (b) The relation t = r r 1 is symmetric and is the largest symmetric relation contained in r. [That is, if s is a symmetric relation such that t s r, then s = t.] For the next three exercises, let P be the set of all ten relation properties. That is, P = {reflexive, irreflexive, symmetric, asymmetric, anti-symmetric, anti-asymmetric, transitive, atransitive, circular, acircular} 7-E-8. Let s be a relation on X. For each p P, prove or disprove each of the following. (a) If s satisfies property p, then s 2 satisfies property p. (b) If s 2 satisfies property p, then s satisfies property p. 7-E-9. Let s and t be relations on X with s t. For each p P, prove or disprove each of the following. (a) If s satisfies property p, then t satisfies property p. (b) If t satisfies property p, then s satisfies property p. 7-E-10. Let s and t be relations on X and let = {,,, }. For each p P and each, prove or disprove: If s and t satisfy property p, then s t satisfies property p. Exercises Involving Equivalence Relations 7-E-1. Can be an equivalence relation? 7-E-2. Construct all equivalence relations on the set 3. 7-E-3. Which of the relations in the following exercises are equivalence relations? 7-D-3 7-D-4 7-D-5 7-D-6 7-D-7 7-D-8 7-D-9 7-D-10 7-D-11 7-D-12 Of those that are equivalence relations, describe the equivalence classes. 7-E-4. Let X be a set. Prove that the relation r = { (A, B) : A,B X and A = B } is an equivalence relation on X. 7-E-5. Let r and s be relations on X. Prove that r s is an equivalence relation iff r s = s r. 7-E-6. Let r be a relation on X. Prove that r is an equivalence relation iff (i X r 1 r 2 ) r. 7-E-7. Let s be an equivalence relation on X and t an equivalence relation on Y. Define a relation r on X Y as

7 r = { ( (x 1,y 1 ), (x 2,y 2 ) ) r : (x 1,x 2 ) s and (y 1,y 2 ) t }. Prove that r is an equivalence relation on X Y. 7-E-8. Let E be a collection of equivalence relations on a set X. (a) Prove that if E is nonempty, then»e is an equivalence relation. (b) Provide a counterexample to show that «E is not always an equivalence relation. (c) Provide a necessary and sufficient condition for «E to be an equivalence relation.

Topics in Logic, Set Theory and Computability

Topics in Logic, Set Theory and Computability Topics in Logic, Set Theory and Computability Homework Set #3 Due Friday 4/6 at 3pm (by email or in person at 08-3234) Exercises from Handouts 7-C-2 7-E-6 7-E-7(a) 8-A-4 8-A-9(a) 8-B-2 8-C-2(a,b,c) 8-D-4(a)

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

MAD 3105 PRACTICE TEST 2 SOLUTIONS

MAD 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 information

CSC Discrete Math I, Spring Relations

CSC 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

In Class Problem Set #15

In Class Problem Set #15 In Class Problem Set #15 CSE 1400 and MTH 2051 Fall 2012 Relations Definitions A relation is a set of ordered pairs (x, y) where x is related to y. Let denote a relational symbol. Write x y to express

More information

(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics

(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 information

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

Definition: 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 information

Relations. 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) 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 information

Automata and Languages

Automata 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 information

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example: Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

0 Sets and Induction. Sets

0 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

EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS

EQUIVALENCE 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 information

CHAPTER 1. Relations. 1. Relations and Their Properties. Discussion

CHAPTER 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

Axioms for the Real Number System

Axioms for the Real Number System Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,

More information

Problem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set?

Problem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set? Assignment 4 Solutions Problem1: (Section 2.1 Exercise 9) (a.) List all the subsets of the set {a, b, c, d} which contain: (i.) four elements (ii.) three elements (iii.) two elements (iv.) one element

More information

Section Summary. Relations and Functions Properties of Relations. Combining Relations

Section 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 information

Mathematics for linguists

Mathematics for linguists 1/17 Mathematics for linguists Gerhard Jäger gerhard.jaeger@uni-tuebingen.de Uni Tübingen, WS 2009/2010 November 3, 2009 2/17 Composition of relations and functions let R A B and S B C be relations new

More information

Algebraic Expressions

Algebraic Expressions Algebraic Expressions 1. Expressions are formed from variables and constants. 2. Terms are added to form expressions. Terms themselves are formed as product of factors. 3. Expressions that contain exactly

More information

Discrete Mathematics. 2. Relations

Discrete Mathematics. 2. Relations Discrete Mathematics 2. Relations Binary Relations Let A, B be any two sets. A binary relation R from A to B is a subset of A B. E.g., Let < : N N : {(n,m) n < m} The notation a R b or arb means (a,b)îr.

More information

Algebraic structures I

Algebraic 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 information

{x : P (x)} P (x) = x is a cat

{x : P (x)} P (x) = x is a cat 1. Sets, relations and functions. 1.1. Set theory. We assume the reader is familiar with elementary set theory as it is used in mathematics today. Nonetheless, we shall now give a careful treatment of

More information

Chapter 1. Sets and Mappings

Chapter 1. Sets and Mappings Chapter 1. Sets and Mappings 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 information

Practice Exam 1 CIS/CSE 607, Spring 2009

Practice Exam 1 CIS/CSE 607, Spring 2009 Practice Exam 1 CIS/CSE 607, Spring 2009 Problem 1) Let R be a reflexive binary relation on a set A. Prove that R is transitive if, and only if, R = R R. Problem 2) Give an example of a transitive binary

More information

Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006

Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006 Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006 Topics What is a set? Notations for sets Empty set Inclusion/containment and subsets Sample spaces and events Operations

More information

Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note

Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note Math 001 - Term 171 Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note x A x belongs to A,x is in A Between an element and a set. A B A is a subset of B Between two sets. φ

More information

COMP232 - Mathematics for Computer Science

COMP232 - Mathematics for Computer Science COMP232 - Mathematics for Computer Science Tutorial 11 Ali Moallemi moa ali@encs.concordia.ca Iraj Hedayati h iraj@encs.concordia.ca Concordia University, Fall 2015 Ali Moallemi, Iraj Hedayati COMP232

More information

MATH 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. 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 information

Sanjay Mishra. Topology. Dr. Sanjay Mishra. A Profound Subtitle

Sanjay Mishra. Topology. Dr. Sanjay Mishra. A Profound Subtitle Topology A Profound Subtitle Dr. Copyright c 2017 Contents I General Topology 1 Topological Spaces............................................ 7 1.1 Introduction 7 1.2 Topological Space 7 1.2.1 Topological

More information

Logic, Proof, Axiom Systems

Logic, Proof, Axiom Systems Logic, Proof, Axiom Systems MA 341 Topics in Geometry Lecture 03 29-Aug-2011 MA 341 001 2 Rules of Reasoning A tautology is a sentence which is true no matter what the truth value of its constituent parts.

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

CHAPTER 1 SETS AND EVENTS

CHAPTER 1 SETS AND EVENTS CHPTER 1 SETS ND EVENTS 1.1 Universal Set and Subsets DEFINITION: set is a well-defined collection of distinct elements in the universal set. This is denoted by capital latin letters, B, C, If an element

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

We define the multi-step transition function T : S Σ S as follows. 1. For any s S, T (s,λ) = s. 2. For any s S, x Σ and a Σ,

We define the multi-step transition function T : S Σ S as follows. 1. For any s S, T (s,λ) = s. 2. For any s S, x Σ and a Σ, Distinguishability Recall A deterministic finite automaton is a five-tuple M = (S,Σ,T,s 0,F) where S is a finite set of states, Σ is an alphabet the input alphabet, T : S Σ S is the transition function,

More information

1. (B) The union of sets A and B is the set whose elements belong to at least one of A

1. (B) The union of sets A and B is the set whose elements belong to at least one of A 1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to

More information

Math 203A - Solution Set 1

Math 203A - Solution Set 1 Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in

More information

9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics

9 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 information

Questions. Exercise (1)

Questions. Exercise (1) Questions Exercise (1) (1) hoose the correct answer: 1) The acute angle supplements. angle. a) acute b) obtuse c) right d) reflex 2) The right angle complements angle whose measure is. a) 0 b) 45 c) 90

More information

and e 2 ~ e 2 iff e 1

and e 2 ~ e 2 iff e 1 Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x

More information

The integers. Chapter 3

The integers. Chapter 3 Chapter 3 The integers Recall that an abelian group is a set A with a special element 0, and operation + such that x +0=x x + y = y + x x +y + z) =x + y)+z every element x has an inverse x + y =0 We also

More information

Relations. Relations. Definition. Let A and B be sets.

Relations. Relations. Definition. Let A and B be sets. Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called

More information

5. Introduction to Euclid s Geometry

5. Introduction to Euclid s Geometry 5. Introduction to Euclid s Geometry Multiple Choice Questions CBSE TREND SETTER PAPER _ 0 EXERCISE 5.. If the point P lies in between M and N and C is mid-point of MP, then : (A) MC + PN = MN (B) MP +

More information

Solutions to In Class Problems Week 4, Mon.

Solutions 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 information

Day 12. Thursday June 7, 2012

Day 12. Thursday June 7, 2012 Day 12 Thursday June 7, 2012 1 A Word on Well-Ordering We talked about the principle of induction. Given a formula ϕ(n) then to prove n.ϕ(n) then it is sufficent to prove ϕ(0). n.ϕ(n) ϕ(n + 1) We mentioned

More information

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas. SETS: set is a well-defined collection of objects. SET THEORY The objects in a set are called elements or members of the set. If x is an object of set, we write x and is read as x is an element of set

More information

Chapter 9: Relations Relations

Chapter 9: Relations Relations Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair

More information

1 Predicates and Quantifiers

1 Predicates and Quantifiers 1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College

More information

Chapter 1: Precalculus Review

Chapter 1: Precalculus Review : Precalculus Review Math 115 17 January 2018 Overview 1 Important Notation 2 Exponents 3 Polynomials 4 Rational Functions 5 Cartesian Coordinates 6 Lines Notation Intervals: Interval Notation (a, b) (a,

More information

Worksheet on Relations

Worksheet 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

RELATIONS AND FUNCTIONS

RELATIONS AND FUNCTIONS Chapter 1 RELATIONS AND FUNCTIONS There is no permanent place in the world for ugly mathematics.... It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we

More information

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 1 / 17 L545 Spring 2013 Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 2 / 17 Why set theory? Set theory sets the foundation for much of mathematics For us: provides precise

More information

Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)

Relations, 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

More Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com

More information

1 Chapter 1: SETS. 1.1 Describing a set

1 Chapter 1: SETS. 1.1 Describing a set 1 Chapter 1: SETS set is a collection of objects The objects of the set are called elements or members Use capital letters :, B, C, S, X, Y to denote the sets Use lower case letters to denote the elements:

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 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 information

MATH 145 LECTURE NOTES. Zhongwei Zhao. My Lecture Notes for MATH Fall

MATH 145 LECTURE NOTES. Zhongwei Zhao. My Lecture Notes for MATH Fall MATH 145 LECTURE NOTES Zhongwei Zhao My Lecture Notes for MATH 145 2016 Fall December 2016 Lecture 1, Sept. 9 Course Orientation and Organization About the Professor Stephen New MC 5419 Ext 35554 Email:

More information

' Liberty and Umou Ono and Inseparablo "

' Liberty and Umou Ono and Inseparablo 3 5? #< q 8 2 / / ) 9 ) 2 ) > < _ / ] > ) 2 ) ) 5 > x > [ < > < ) > _ ] ]? <

More information

SETS. set of natural numbers by N set of integers by Z set of rational numbers by Q set of irrational numbers by T

SETS. set of natural numbers by N set of integers by Z set of rational numbers by Q set of irrational numbers by T Chapter SETS. Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions... Set and their representations A set is

More information

14 Equivalence Relations

14 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 information

ECARES Université Libre de Bruxelles MATH CAMP Basic Topology

ECARES Université Libre de Bruxelles MATH CAMP Basic Topology ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,

More information

ANSWERS. CLASS: VIII TERM - 1 SUBJECT: Mathematics. Exercise: 1(A) Exercise: 1(B)

ANSWERS. CLASS: VIII TERM - 1 SUBJECT: Mathematics. Exercise: 1(A) Exercise: 1(B) ANSWERS CLASS: VIII TERM - 1 SUBJECT: Mathematics TOPIC: 1. Rational Numbers Exercise: 1(A) 1. Fill in the blanks: (i) -21/24 (ii) -4/7 < -4/11 (iii)16/19 (iv)11/13 and -11/13 (v) 0 2. Answer True or False:

More information

Comment: The induction is always on some parameter, and the basis case is always an integer or set of integers.

Comment: The induction is always on some parameter, and the basis case is always an integer or set of integers. 1. For each of the following statements indicate whether it is true or false. For the false ones (if any), provide a counter example. For the true ones (if any) give a proof outline. (a) Union of two non-regular

More information

Part IA. Numbers and Sets. Year

Part IA. Numbers and Sets. Year Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

COT3100 SI Final Exam Review

COT3100 SI Final Exam Review 1 Symbols COT3100 SI Final Exam Review Jarrett Wendt Spring 2018 You ve learned a plethora of new Mathematical symbols this semester. Let s see if you know them all and what they re used for. How many

More information

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»

More information

1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A.

1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. 1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. How to specify sets 1. to enumerate all of the elements

More information

Discrete Mathematics. Chapter 4. Relations and Digraphs Sanguk Noh

Discrete Mathematics. Chapter 4. Relations and Digraphs Sanguk Noh Discrete Mathematics Chapter 4. Relations and Digraphs Sanguk Noh Table Product sets and partitions Relations and digraphs Paths in relations and digraphs Properties of relations Equivalence relations

More information

Homework 1/Solutions. Graded Exercises

Homework 1/Solutions. Graded Exercises MTH 310-3 Abstract Algebra I and Number Theory S18 Homework 1/Solutions Graded Exercises Exercise 1. Below are parts of the addition table and parts of the multiplication table of a ring. Complete both

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture 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 information

MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces.

MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces. MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces. Linear operations on vectors Let x = (x 1, x 2,...,x n ) and y = (y 1, y 2,...,y n ) be n-dimensional vectors, and r R be a scalar. Vector sum:

More information

CSE 460: Computabilty and Formal Languages. Minimization of FA. S. Pramanik

CSE 460: Computabilty and Formal Languages. Minimization of FA. S. Pramanik CSE 46: Computabilty and Formal Languages Minimization of FA S. Pramanik Example of Minimum-State FA. Minimum-State FA for a regular language is an FA for the language that requires the minimum number

More information

Sets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions

Sets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.

More information

Foundations of Mathematics

Foundations of Mathematics Foundations of Mathematics Andrew Monnot 1 Construction of the Language Loop We must yield to a cyclic approach in the foundations of mathematics. In this respect we begin with some assumptions of language

More information

Sets and Motivation for Boolean algebra

Sets 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 information

Chapter 6. Worked-Out Solutions AB 3.61 AC 5.10 BC = 5

Chapter 6. Worked-Out Solutions AB 3.61 AC 5.10 BC = 5 27. onstruct a line ( DF ) with midpoint P parallel to and twice the length of QR. onstruct a line ( EF ) with midpoint R parallel to and twice the length of QP. onstruct a line ( DE ) with midpoint Q

More information

COMP 409: Logic Homework 5

COMP 409: Logic Homework 5 COMP 409: Logic Homework 5 Note: The pages below refer to the text from the book by Enderton. 1. Exercises 1-6 on p. 78. 1. Translate into this language the English sentences listed below. If the English

More information

Section 7.1 Relations and Their Properties. Definition: A binary relation R from a set A to a set B is a subset R A B.

Section 7.1 Relations and Their Properties. Definition: A binary relation R from a set A to a set B is a subset R A B. Section 7.1 Relations and Their Properties Definition: A binary relation R from a set A to a set B is a subset R A B. Note: there are no constraints on relations as there are on functions. We have a common

More information

Introduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam

Introduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere

More information

CHAPTER 0: Preliminary Topics

CHAPTER 0: Preliminary Topics (Exercises for Chapter 0: Preliminary Topics) E.0.1 CHAPTER 0: Preliminary Topics (A) means refer to Part A, (B) means refer to Part B, etc. (Calculator) means use a calculator. Otherwise, do not use a

More information

Relations, Functions, and Sequences

Relations, 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 information

CSE 20 DISCRETE MATH. Winter

CSE 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 information

Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7

Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7 Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7 Question 1: The goal of this exercise is to give some equivalent characterizations for the interior of a set. Let X be a topological

More information

LESSON 7.1 FACTORING POLYNOMIALS I

LESSON 7.1 FACTORING POLYNOMIALS I LESSON 7.1 FACTORING POLYNOMIALS I LESSON 7.1 FACTORING POLYNOMIALS I 293 OVERVIEW Here s what you ll learn in this lesson: Greatest Common Factor a. Finding the greatest common factor (GCF) of a set of

More information

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Discrete 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 information

A. H. Hall, 33, 35 &37, Lendoi

A. H. Hall, 33, 35 &37, Lendoi 7 X x > - z Z - ----»»x - % x x» [> Q - ) < % - - 7»- -Q 9 Q # 5 - z -> Q x > z»- ~» - x " < z Q q»» > X»? Q ~ - - % % < - < - - 7 - x -X - -- 6 97 9

More information

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to

More information

1 Implication and induction

1 Implication and induction 1 Implication and induction This chapter is about various kinds of argument which are used in mathematical proofs. When you have completed it, you should know what is meant by implication and equivalence,

More information

1.4 Equivalence Relations and Partitions

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 information

Exam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).

Exam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a). Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,

More information

Web Solutions for How to Read and Do Proofs

Web Solutions for How to Read and Do Proofs Web Solutions for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve University

More information

INFINITY: CARDINAL NUMBERS

INFINITY: CARDINAL NUMBERS INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets

More information

Math 203A - Solution Set 1

Math 203A - Solution Set 1 Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in

More information

Chapter 1. Sets and Numbers

Chapter 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 information

BASIC MATHEMATICAL TECHNIQUES

BASIC MATHEMATICAL TECHNIQUES CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing

More information

( ) Chapter 6 ( ) ( ) ( ) ( ) Exercise Set The greatest common factor is x + 3.

( ) Chapter 6 ( ) ( ) ( ) ( ) Exercise Set The greatest common factor is x + 3. Chapter 6 Exercise Set 6.1 1. A prime number is an integer greater than 1 that has exactly two factors, itself and 1. 3. To factor an expression means to write the expression as the product of factors.

More information

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

Definition: 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 information