Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28

Slides:



Advertisements
Similar presentations
Equivalence Relations
Advertisements

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.
Equivalence Relations
Equivalence Relations
Lecture 1 RMIT University, Taylor's University Learning Objectives
Chap6 Relations Def 1: Let A and B be sets. A binary relation from A
Relations.
Applied Discrete Mathematics Week 11: Graphs
Congruence of Integers
Relations Chapter 9.
Equivalence Relations MSU CSE 260. Outline Introduction Equivalence Relations –Definition, Examples Equivalence Classes –Definition Equivalence Classes.
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.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Section 7.5 Equivalence Relations Longin Jan Latecki Temple University, Philadelphia
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.
8.5 Equivalence Relations
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
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.
Equivalence Relations Lecture 45 Section 10.3 Fri, Apr 8, 2005.
MAT 2720 Discrete Mathematics Section 3.3 Relations
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 7 Relations.
Set Operations Section 2.2.
§ 第 3 周起每周一交作业,作业成绩占总成绩的 15% ; § 平时不定期的进行小测验,占总成绩的 15% ; § 期中考试成绩占总成绩的 20% ;期终考试成绩占总成绩的 50% § 张宓
Divisibility and Modular Arithmetic
Equivalence Relations
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
Relations and Their Properties
Citra Noviyasari, S.Si, MT
Introduction to Relations
Equivalence Relations
Relations Chapter 9.
RELATION KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS )
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 9 Relations Slides are adopted from.
Applied Discrete Mathematics Week 9: Equivalence Relations
CS2210 Discrete Structures Relations
Discrete Math (2) Haiming Chen Associate Professor, PhD
Equivalence Relations
Applied Discrete Mathematics Week 6: Relations/Digraphs
Advanced Algorithms Analysis and Design
4.5 Equivalence Relations
Equivalence Relations
RAYAT SHIKSHAN SANSTHA’S S. M. JOSHI COLLEGE HADAPSAR, PUNE
Equivalence Relations
Equivalence Relations
RAYAT SHIKSHAN SANSTHA’S S.M.JOSHI COLLEGE HADAPSAR, PUNE
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Matrices Introduction.
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Basic Definitions of Set Theory
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Equivalence Relations
RAYAT SHIKSHAN SANSTHA’S S.M.JOSHI COLLEGE HADAPSAR, PUNE
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Algebra 5 Congruence Classes.
Chapter 8 (Part 2): Relations
Presentation transcript:

Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28 Department of Mathematics Power Point Presentation Topic – Equivalence Class Prof. Darekar S.R

Introduction Equivalence Relations Equivalence Classes Equivalence Classes and Partitions

Introduction Consider the relation R on the set of MSU students: a R b  a and b are in the same graduating class. R is reflexive, symmetric and transitive. Relations which are reflexive, symmetric and transitive on a set S, are of special interest because they partition the set S into disjoint subsets, within each of which, all elements are all related to each other (or equivalent.)

Equivalence Relations Definition. A relation on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Two elements related by an equivalence relation are called equivalent.

Example Consider the Congruence modulo m relation R = {(a, b)  Z | a  b (mod m)}. Reflexive. a  Z a R a since a - a = 0 = 0  m Symmetric. a, b  Z If a R b then a - b = km. So b - a = (-k) m. Therefore, b R a. Transitive. a, b, c  Z If a R b  b R c then a - b = km and b - c = lm. So (a-b)+(b-c) = a-c = (k+l)m. So a R c. R is then an equivalence relation.

Equivalence Classes Definition. Let R be an equivalence relation on a set A. The set of all elements related to an element a of A is called the equivalence class of a, and is denoted by [a]R. [a]R = {xA | (a, x)  R} Elements of an equivalence class are called its representatives.

Example What are the equivalence classes of 0, 1, 2, 3… for congruence modulo 4? [0]4 = {…, -8, -4, 0, 4, 8, …} [1]4 = {…, -7, -3, 1, 5, 9, …} [2]4 = {…, -6, -2, 2, 6, 10, …} [3]4 = {…, -5, -1, 3, 7, 11, …} The other equivalence classes are identical to one of the above. [a]m is called the congruence class of a modulo m.

Equivalence Classes & Partitions Theorem. Let R be an equivalence relation on a set S. The following statements are logically equivalent: a R b [a] = [b] [a][b]  

Definition. A partition of a set S is a collection {Ai | i  I} of pairwise disjoint nonempty subsets that have S as their union. i,jI Ai  Aj = , and iI Ai = S. Theorem. Let R be an equivalence relation on a set S. Then the equivalence classes of R form a partition of S. Conversely, for any partition {Ai | i  I} of S there is an equivalence relation that has the sets Ai as its equivalence classes.

Example Every integer belongs to exactly one of the four equivalence classes of congruence modulo 4: [0]4 = {…, -8, -4, 0, 4, 8, …} [1]4 = {…, -7, -3, 1, 5, 9, …} [2]4 = {…, -6, -2, 2, 6, 10, …} [3]4 = {…, -5, -1, 3, 7, 11, …} Those equivalence classes form a partition of Z. [0]4  [1]4  [2]4  [3]4 = Z [0]4, [1]4, [2]4 and [3]4 are pairwise disjoint.

Thank You