# 9.5 Equivalence Relations

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same number. They may look different; they may be called different names; but they are all equal. The idea of grouping together things that look different but are really the same is the central idea of equivalence relations. A partition of a set S is a finite or infinite collection of nonempty, mutually disjoint subsets whose union is S. Definition. A partition of a set S is a collection of disjoint nonempty subsets of S that have S as their union. In other words, the collection of subsets A i, i I (where I is an index set) forms a partition of S if and only if (i) A i for i I, (ii) A i A j = when i j, and (iii) A i = S. (Here the notation i I represents the union of the sets A i for all i I.) i I Definition 2. A relation on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Recall:. R is reflexive if, and only if, x A, x R x. 2. R is symmetric if, and only if, x, y A, if x R y then y R x. 3. R is transitive if, and only if, x, y, z A, if x R y and y R z then x R z. Definition 3. Two elements a and b that are related by an equivalence relation are called equivalent. The notation a b is often used to denote that a and b are equivalent elements with respect to a particular equivalence relation. Example. Are these equivalence relations on {0,, 2}? (a) {(0, 0), (, ), (0, ), (, 0)} (b) {(0, 0), (, ), (2, 2), (0, ), (, 2)} (c) {(0, 0), (, ), (2, 2), (0, ), (, 2), (, 0), (2, )} (d) {(0, 0), (, ), (2, 2), (0, ), (0, 2), (, 0), (, 2), (2, 0), (2, )} (e) {(0, 0), (, ), (2, 2)} Solution. (a) R is not reflexive: (2, 2) / R. Thus, by definition, R is not an equivalence relation. (b) R is not symmetric: (, 2) R but (2, ) / R. Thus R is not an equivalence relation. (c) R is not transitive: (0, ), (, 2) R, but (0, 2) / R. Thus R is not an equivalence relation. (d) R is reflexive, symmetric, and transitive. Thus R is an equivalence relation.

2 (e) R is reflexive, symmetric, and transitive. Thus R is an equivalence relation. Example 2. Which of these relations on the set of all functions on Z Z are equivalence relations? (a) R = {(f, g) f() = g()}. (b) R = {(f, g) f(0) = g(0) or f() = g()}. Solution. (a) f() = f(), so R is reflexive. If f() = g(), then g() = f(), so R is symmetric. If f() = g() and g() = h(), then f() = h(), so R is transitive. R is reflexive, symmetric, and transitive, thus R is an equivalence relation. (b) f() = f(), so R is reflexive. If f() = g() or f(0) = g(0), then g() = f() or g(0) = f(0), so R is symmetric. However, R is not transitive: if f(0) = g(0) and g() = h(), it does not necessarily follow that f() = h() or that f(0) = h(0). Thus R is not an equivalence relation. Example 3. Let R be the relation on Z Z such that Show that R is an equivalence relation. ((a, b), (c, d)) R a + d = b + c. Solution. R is reflexive: Suppose (a, b) is an ordered pair in Z Z. [We must show that (a, b) R (a, b).] We have a + b = a + b. Thus, by definition of R, (a, b) R (a, b). R is symmetric: Suppose (a, b) and (c, d) are two ordered pairs in Z Z and (a, b) R (c, d). [We must show that (c, d) R (a, b).] Since (a, b) R (c, d), a + d = b + c. But this implies that b + c = a + d, and so, by definition of R, (c, d) R (a, b). R is transitive: Suppose (a, b), (c, d), and (e, f) are elements of Z Z, (a, b) R (c, d), and (c, d) R (e, f). [We must show that (a, b) R (e, f).] Since (a, b) R (c, d), a + d = b + c, which means a b = c d, and since (c, d) R (e, f)c, c + f = d + e, which means c d = e f. Thus a b = e f, which means a + f = b + e, and so, by definition of R, (a, b) R (e, f). Definition 4. Suppose A is a set and R is an equivalence relation on A. For each element a in A, the equivalence class of a, denoted [a] and called the class of a for short, is the set of all elements x in A such that x is related to a by R. In symbols, [a] = {x A x R a}. The procedural version of this definition is x A, x [a] x R a. When several equivalence relations on a set are under discussion, the notation [a] R is often used to denote the equivalence class of a under R. Theorem. Let R be an equivalence relation on a set A. Let a, b A. The following are equivalent (TFAE): (i) a R b (ii) [a] = [b] (iii) [a] [b]. 2

3 Proof. [(i) (ii)]: Assume that a R b. We will prove that [a] = [b] by showing [a] [b] and [b] [a]. Suppose c [a]. Then a R c. Because a R b and R is symmetric, we know that b R a. Furthermore, because R is transitive and b R a and a R c, it follows that b R c. Hence, c [b]. This shows that [a] [b]. The proof that [b] [a] is similar. [(ii) (iii)]: Assume that [a] = [b]. It follows that [a] [b] because [a] is nonempty (because a [a] because R is reflexive). [(iii) (i)]: Suppose that [a] [b]. Then there is an element c with c [a] and c [b]. In other words, a R c and b R c. By the symmetric property, c R b. Then by transitivity, because a R c and c R b, we have a R b. Because (i) implies (ii), (ii) implies (iii), and (iii) implies (i), the three statements, (i), (ii), and (iii), are equivalent. Corollary. If A is a set, R is an equivalence relation on A, and a and b are elements of A, then either [a] [b] = or [a] = [b]. That is, any two equivalence classes of an equivalence relation are either mutually disjoint or identical. Theorem 2. Let R be an equivalence relation on a set A. Then the equivalence classes of R form a partition of A. Conversely, given a partition {A i i I} of the set A, there is an equivalence relation R that has the sets A i, i I, as its equivalence classes. The proof of Theorem 2 is divided into two parts: first, a proof that A is the union of the equivalence classes of R and second, a proof that the intersection of any two distinct equivalence classes is empty. The proof of the first part follows from the fact that the relation is reflexive. The proof of the second part follows from the corollary above. Proof. Suppose A is a set and R is an equivalence relation on A. For notational simplicity, we assume that R has only a finite number of distinct equivalence classes, which we denote A, A 2,..., A n, where n is a positive integer. (When the number of classes is infinite, the proof is identical except for notation.) (A = A A 2 A n ): [We must show that A A A 2 A n and A A 2 A n A.] To show that A A A 2 A n, suppose x is an arbitrary element of A. [We must show that x A A 2 A n.] By reflexivity of R, x R x. But this implies that x [x] by definition of class. Since x is in some equivalence class, it must be in one of the distinct equivalence classes A, A 2,..., or A n. Thus x A i for some index i, and hence x A A 2 A n by definition of union [as was to be shown]. To show that A A 2 A n A, suppose x A A 2 A n. [We must show that x A.] Then x A i for some i =, 2,..., n, by definition of union. But each A i is an equivalence class of R. And equivalence classes are subsets of A. Hence A i A and so x A [as was to be shown]. Since A A A 2 A n and A A 2 A n A, then by definition of set equality, A = A A 2 A n. (The distinct classes of R are mutually disjoint): Suppose that A i and A j are any two distinct equivalence classes of R. [We must show that A i and A j are disjoint.] Since A i and A j are distinct, then A i A j. And since A i and A j are equivalence classes of R, there must exist elements a and b in A such that A i = [a] and A j = [b]. By the corollary to theorem, either [a] [b] = or [a] = [b]. But [a] [b] because A i A j. Hence [a] [b] =. Thus A i A j =, and so A i and A j are disjoint [as was to be shown]. 3

4 There are m different congruence classes modulo m, corresponding to the m different remainders possible when an integer is divided by m. The m congruence classes are also denoted by [0] m, [] m,..., [m ] m. They form a partition of the set of integers. [a] m = {x Z x a (mod m)}. Example 4. What is equivalence class of, 2 for congruence modulo 5? Let R = {(a, b) a b (mod 5)}. Solution. For each integer a, [a] = {x Z x R a} = {x Z 5 (x a)} = {x Z x a = 5k, for some integer k}. Therefore, In particular, [a] = {x Z x = 5k + a, for some integer k}. [] = {x Z x = 5k +, for some integer k} = {..., 4, 9, 4,, 6,, 6, 2,...} and [2] = {x Z x = 5k + 2, for some integer k} = {..., 3, 8, 3, 2, 7, 2, 7, 22,...}. Example 5. How many distinct equivalence classes are there modulo 5? Solution. There are five distinct equivalence classes, modulo 5: [0], [], [2], [3], and [4]. The last examples above illustrate a very important property of equivalence classes, namely that an equivalence class may have many different names. In the above example, for instance, the class of 0, [0], may also be called the class of 5, [5], or the class of 0, [ 0]. But what the class is, is the set {x Z x = 5k, for some integers k}. Definition 5. Suppose R is an equivalence relation on a set A and S is an equivalence class of R. representative of the class S is any element a such that [a] = S. A If a is any element of an equivalence class S, then S = [a]. Hence every element of an equivalence class is a representative of that class. Example 6. Let A be the set of all ordered pairs of integers for which the second element of the pair is nonzero. Symbolically, A = Z (Z {0}). Define a relation R on A as follows: (a, b), (c, d) A, (a, b) R (c, d) ad = bc. The fact is that R is an equivalence relation. Describe the distinct equivalence classes of R. 4

5 Solution. There is one equivalence class for each distinct rational number. Each equivalence class consists of all ordered pairs (a, b) that, if written as fractions a b, would equal each other. The reason for this is that the condition for two rational numbers to be equal is the same as the condition for two ordered pairs to be related. For instance, the class of (, 2) is because [(, 2)] = {(, 2), (, 2), (2, 4), ( 2, 4), (3, 6), ( 3, 6),...} 2 = 2 = 2 4 = 2 4 = 3 6 = 3 6 =. It is possible to expand this result to define operations of addition and multiplication on the equivalence classes of R that satisfy all the same properties as the addition and multiplication of rational numbers. It follows that the rational numbers can be defined as equivalence classes of ordered pairs of integers. 5

CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation

### Binary Relations McGraw-Hill Education

Binary Relations A binary relation R from a set A to a set B is a subset of A X 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. We can also represent

### Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special

### CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation

CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation

### Section 6.3: Further Rules for Counting Sets

Section 6.3: Further Rules for Counting Sets Often when we are considering the probability of an event, that event is itself a union of other events. For example, suppose there is a horse race with three

### T. Background material: Topology

MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 T. Background material: Topology For convenience this is an overview of basic topological ideas which will be used in the course. This material

### Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set

### 2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members

### TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.

TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead

### Cardinality Lectures

Cardinality Lectures Enrique Treviño March 8, 014 1 Definition of cardinality The cardinality of a set is a measure of the size of a set. When a set A is finite, its cardinality is the number of elements

1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory

### Logic and Discrete Mathematics. Section 2.5 Equivalence relations and partitions

Logic and Discrete Mathematics Section 2.5 Equivalence relations and partitions Slides version: January 2015 Equivalence relations Let X be a set and R X X a binary relation on X. We call R an equivalence

### CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam

### CSC Discrete Math I, Spring Sets

CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its

### 1 Elementary number theory

Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},

### 2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to

2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of

### Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.

### Chapter 3. Set Theory. 3.1 What is a Set?

Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any

### Topology notes. Basic Definitions and Properties.

Topology notes. Basic Definitions and Properties. Intuitively, a topological space consists of a set of points and a collection of special sets called open sets that provide information on how these points

### Lecture : Topological Space

Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous

### Topology Homework 3. Section Section 3.3. Samuel Otten

Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that

### Power Set of a set and Relations

Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}

### Assignment 4 Solutions of graph problems

Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of

### Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.

1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one

### What Is A Relation? Example. is a relation from A to B.

3.3 Relations What Is A Relation? Let A and B be nonempty sets. A relation R from A to B is a subset of the Cartesian product A B. If R A B and if (a, b) R, we say that a is related to b by R and we write

### CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam

### Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference

### Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in

### CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for

### Homework Set #2 Math 440 Topology Topology by J. Munkres

Homework Set #2 Math 440 Topology Topology by J. Munkres Clayton J. Lungstrum October 26, 2012 Exercise 1. Prove that a topological space X is Hausdorff if and only if the diagonal = {(x, x) : x X} is

### 11 Sets II Operations

11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric

### THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of

### SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,

### [Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {

### 1 Elementary number theory

1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...}, along with their most basic arithmetical and ordering properties.

### Slides for Faculty Oxford University Press All rights reserved.

Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,

### Notes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia

Notes on metric spaces and topology Math 309: Topics in geometry Dale Rolfsen University of British Columbia Let X be a set; we ll generally refer to its elements as points. A distance function, or metric

### Discrete Mathematics Lecture 4. Harper Langston New York University

Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a

### Chapter 4 Concepts from Geometry

Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining

### 2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of

### Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

The first exam will be on Wednesday, September 22, 2010. The syllabus will be sections 1.1 and 1.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive

### Solutions to Homework 10

CS/Math 240: Intro to Discrete Math 5/3/20 Instructor: Dieter van Melkebeek Solutions to Homework 0 Problem There were five different languages in Problem 4 of Homework 9. The Language D 0 Recall that

### 1.1 - Introduction to Sets

1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018

### Cantor s Diagonal Argument for Different Levels of Infinity

JANUARY 2015 1 Cantor s Diagonal Argument for Different Levels of Infinity Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely Abstract These notes develop the classic Cantor

### Nim-Regularity of Graphs

Nim-Regularity of Graphs Nathan Reading School of Mathematics, University of Minnesota Minneapolis, MN 55455 reading@math.umn.edu Submitted: November 24, 1998; Accepted: January 22, 1999 Abstract. Ehrenborg

### 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).

Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,

### Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

### The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )

The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)

### The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )

1 The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)

### A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.

2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from

### SET DEFINITION 1 elements members

SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes

### This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.

Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection

### Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

### MATH 271 Summer 2016 Assignment 4 solutions

MATH 7 ummer 06 Assignment 4 solutions Problem Let A, B, and C be some sets and suppose that f : A B and g : B C are functions Prove or disprove each of the following statements (a) If f is one-to-one

### Cardinality of Sets. Washington University Math Circle 10/30/2016

Cardinality of Sets Washington University Math Circle 0/0/06 The cardinality of a finite set A is just the number of elements of A, denoted by A. For example, A = {a, b, c, d}, B = {n Z : n } = {,,, 0,,,

### MITOCW watch?v=kvtlwgctwn4

MITOCW watch?v=kvtlwgctwn4 PROFESSOR: The idea of congruence was introduced to the world by Gauss in the early 18th century. You've heard of him before, I think. He's responsible for some work on magnetism

### Johns Hopkins Math Tournament Proof Round: Point Set Topology

Johns Hopkins Math Tournament 2019 Proof Round: Point Set Topology February 9, 2019 Problem Points Score 1 3 2 6 3 6 4 6 5 10 6 6 7 8 8 6 9 8 10 8 11 9 12 10 13 14 Total 100 Instructions The exam is worth

### Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:

Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have

### Topology I Test 1 Solutions October 13, 2008

Topology I Test 1 Solutions October 13, 2008 1. Do FIVE of the following: (a) Give a careful definition of connected. A topological space X is connected if for any two sets A and B such that A B = X, we

### 10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings

Sometimes, relations define an order on the elements in a set. Definition: A relation R on a set S is called a partial ordering or partial order if it is reflexive, antisymmetric, and transitive. A set

### Math Introduction to Advanced Mathematics

Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.

### DISCRETE MATHEMATICS

DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The

### Modular Arithmetic. Marizza Bailey. December 14, 2015

Modular Arithmetic Marizza Bailey December 14, 2015 Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find a quicker

### SPERNER S LEMMA MOOR XU

SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements

### r=1 The Binomial Theorem. 4 MA095/98G Revision

Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the

### Section 17. Closed Sets and Limit Points

17. Closed Sets and Limit Points 1 Section 17. Closed Sets and Limit Points Note. In this section, we finally define a closed set. We also introduce several traditional topological concepts, such as limit

### Introduction to Graph Theory

Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /

### Lectures on Order and Topology

Lectures on Order and Topology Antonino Salibra 17 November 2014 1 Topology: main definitions and notation Definition 1.1 A topological space X is a pair X = ( X, OX) where X is a nonempty set and OX is

### The Further Mathematics Support Programme

Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements

### Generell Topologi. Richard Williamson. May 6, 2013

Generell Topologi Richard Williamson May 6, 2013 1 8 Thursday 7th February 8.1 Using connectedness to distinguish between topological spaces I Proposition 8.1. Let (, O ) and (Y, O Y ) be topological spaces.

### Ramsey s Theorem on Graphs

Ramsey s Theorem on Graphs 1 Introduction Exposition by William Gasarch Imagine that you have 6 people at a party. We assume that, for every pair of them, either THEY KNOW EACH OTHER or NEITHER OF THEM

CHAPTER 7 FUNCTIONS Copyright Cengage Learning. All rights reserved. SECTION 7.1 Functions Defined on General Sets Copyright Cengage Learning. All rights reserved. Functions Defined on General Sets We

### Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np

Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be

### It All Depends on How You Slice It: An Introduction to Hyperplane Arrangements

It All Depends on How You Slice It: An Introduction to Hyperplane Arrangements Paul Renteln California State University San Bernardino and Caltech April, 2008 Outline Hyperplane Arrangements Counting Regions

### Ambiguous Grammars and Compactification

Ambiguous Grammars and Compactification Mridul Aanjaneya Stanford University July 17, 2012 Mridul Aanjaneya Automata Theory 1/ 44 Midterm Review Mathematical Induction and Pigeonhole Principle Finite Automata

### CS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department

CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of

### A.1 Numbers, Sets and Arithmetic

522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,

### Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example

Sets Slides by Christopher M. ourke Instructor: erthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

### Byzantine Consensus in Directed Graphs

Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.2 Direct Proof and Counterexample II: Rational Numbers Copyright Cengage Learning. All

### Pebble Sets in Convex Polygons

2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

### Point-Set Topology II

Point-Set Topology II Charles Staats September 14, 2010 1 More on Quotients Universal Property of Quotients. Let X be a topological space with equivalence relation. Suppose that f : X Y is continuous and

### Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

### On Sequential Topogenic Graphs

Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary

### SFU CMPT Lecture: Week 8

SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing

### However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating

### Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

Math 532, 736I: Modern Geometry Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel Part 1: 1. Axioms for a finite AFFINE plane of order n. AA1: There exist at least 4 points, no

### Metric and metrizable spaces

Metric and metrizable spaces These notes discuss the same topic as Sections 20 and 2 of Munkres book; some notions (Symmetric, -metric, Ψ-spaces...) are not discussed in Munkres book.. Symmetric, -metric,

### Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

### HW Graph Theory SOLUTIONS (hbovik)

Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length

### 1.2 Venn Diagrams and Partitions

1.2 Venn Diagrams and Partitions Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 1.2 Venn Diagrams and Partitions 2010 1 / 9 Outline 1 Venn Diagrams 2 Partitions 3 Fundamentals of Counting Mark

### Fundamental Properties of Graphs

Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,

### Recognizing Interval Bigraphs by Forbidden Patterns

Recognizing Interval Bigraphs by Forbidden Patterns Arash Rafiey Simon Fraser University, Vancouver, Canada, and Indiana State University, IN, USA arashr@sfu.ca, arash.rafiey@indstate.edu Abstract Let

### 3 Fractional Ramsey Numbers

27 3 Fractional Ramsey Numbers Since the definition of Ramsey numbers makes use of the clique number of graphs, we may define fractional Ramsey numbers simply by substituting fractional clique number into