8.5 Equivalence Relations

Slides:

Advertisements

Similar presentations

Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.

Advertisements

Equivalence Relations

Equivalence Relations

Relations Relations on a Set. Properties of Relations.

2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.

Representing Relations Using Matrices

Applied Discrete Mathematics Week 11: Graphs

Relations & Their Properties. Copyright © Peter Cappello2 Introduction Let A & B be sets. A binary relation from A to B is a subset of A x B. Let R be.

CSE115/ENGR160 Discrete Mathematics 05/03/11 Ming-Hsuan Yang UC Merced 1.

Sets, Relation and Functions A set is a collection of objects (elements) or a container of objects. Defining sets –Empty set (Ø): no elements –Universal.

Regular Expression (EXTRA)

Congruence of Integers

Discrete Mathematics Lecture#11.

1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.

Relations Chapter 9.

Equivalence Relations MSU CSE 260. Outline Introduction Equivalence Relations –Definition, Examples Equivalence Classes –Definition Equivalence Classes.

Exam 2 Review 8.2, 8.5, 8.6, Thm. 1 for 2 roots, Thm. 2 for 1 root Theorem 1: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1.

CS Discrete Mathematical Structures Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, 9:30-11:30a Fall 2002KSU - Discrete Structures1.

Ordered Sets. Relations. Equivalence Relations 1.

Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.

Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.

2.6 Equivalence Relation §1.Equivalence relation §Definition 2.18: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric,

Chapter 9. Section 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.

April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.

Lecture 4.3: Closures and Equivalence Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.

Discrete Mathematics Lecture # 15 Types of Relations (contd.)

Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.

Chapter 8 Equivalence Relations Let A and B be two sets. A relation R from A to B is a subset of AXB. That is, R is a set of ordered pairs, where the first.

Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.

1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.

SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)

Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.

1 Equivalence relations Binary relations: –Let S1 and S2 be two sets, and R be a (binary relation) from S1 to S2 –Not every x in S1 and y in S2 have such.

1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 7 Relations.

Mathematics. Session Set, Relation & Function Session - 2.

Sets and Basic Operations on Sets Notation A set will usually be denoted by a capital letter, such as, A,B,X, Y,..., whereas lower-case letters, a, b,

Chapter8 Relations 8.1: Relations and their properties.

Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.

The Relation Induced by a Partition

Representing Relations Using Digraphs

Discrete Mathematical

Relations and Their Properties

Citra Noviyasari, S.Si, MT

CSE15 Discrete Mathematics 05/03/17

Equivalence Relations

Relations Chapter 9.

Lecture # 14 Types of Relations

Dr. Ameria Eldosoky Discrete mathematics

Reflexivity, Symmetry, and Transitivity

Lecture 4.3: Closures and Equivalence Relations

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 9 Relations Slides are adopted from.

Question Suppose exists, find the limit: (1) (2) Sol. (1) (2)

Relations and Their Properties

8.1 Relations and Their Properties

Discrete Math (2) Haiming Chen Associate Professor, PhD

8.1 Relations and Their Properties

The sum of any two even integers is even.

8.5 Equivalence Relations and 8.6 Partial Ordering

Applied Discrete Mathematics Week 6: Relations/Digraphs

Lecture 4.3: Closures and Equivalence Relations

4.5 Equivalence Relations

MCS680: Foundations Of Computer Science

9.5 Equivalence Relations

Equivalence relations

Basics of Relations.

Chapter 8 (Part 2): Relations

Lecture # 16 Inverse of Relations

Presentation transcript:

8.5 Equivalence Relations

Equivalence Relations DEFINITION 1 A relation on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. DEFINITION 2 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 2 Let R be the relation on the set of real numbers such that a R b if and only if a - b is an integer. Is R an equivalence relation? Solution: Because a - a = 0 is an integer for all real numbers a, aRa for all real numbers a . Hence, R is reflexive. Now suppose that aRb. Then a - b is an integer, so b - a is also an integer. Hence, bRa. It follows that R is symmetric. If a R b and b R c, then a - b and b - c are integers. Therefore, a - c = (a - b) + (b - c) is also an integer. Hence, aRc. Thus, R is transitive. Consequently, R is an equivalence relation.

Homework Page 562 1 (a,c)