Reflexivity, Symmetry, and Transitivity Lecture 44 Section 10.2 Thu, Apr 7, 2005.

Slides:

Advertisements

Similar presentations

Reflexive example: AB = AB Symmetric example: AB = BA

Advertisements

Binary Relations Binary Relations on Real Numbers.

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.

Discussion #27 Chapter 5, Sections /15 Discussion #27 Closures & Equivalence Relations.

1 Chapter Equivalence, Order, and Inductive Proof.

Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.

Properties of Real Numbers

Week 8 - Wednesday.  What did we talk about last time?  Cardinality  Countability  Relations.

Properties of Real Numbers

1 2.5:Reason Using Properties from Algebra Goal:Use algebraic properties in logical arguments.

Geometry Notes Sections 2-6. Solve the following equation: m – 17 = 8.

8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.

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

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Chapter 2 Section 4 Reasoning in Algebra. Properties of Equality Addition Property of Equality If, then. Example: ADD 5 to both sides! Subtraction Property.

Growth of Functions. 2 Analysis of Bubble Sort 3 Time Analysis – Best Case The array is already sorted – no swap operations are required.

Section 4.4 Properties of Relations. Order Relations Draw an arrow diagram for the relation R defined on the set {1,2,3,4} such that

Section 5.5 The Real Zeros of a Polynomial Function.

Reasoning With Properties of Algebra

Section 1.3 Properties. Properties of Equality Reflexive Property: a=a Symmetric Property: If 3=x, then x=3 Transitive Property: If x=y and y=4 then x=4.

1.2 Field Axioms (Properties) Notes on a Handout.

Section 3.4 – Zeros of a Polynomial. Find the zeros of 2, -3 (d.r), 1, -4.

1 Section 4.2 Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST).

Equivalence Relations Lecture 45 Section 10.3 Fri, Apr 8, 2005.

Lesson 3: Properties Algebra 1 CP Mrs.Mongold. Identity and Equality Properties Additive Identity- any number plus zero equals that number.

Properties of Equality. Operations We’ve used these properties to solve our bell work problems: Addition Property: If x = 4, then x + 3 = Subtraction.

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

§R1∪R2§R1∪R2 §R 1 ∩R 2 R1-R2R1-R2 2.4 Operations on Relations.

Intro to Proofs Unit IC Day 2. Do now Solve for x 5x – 18 = 3x + 2.

1.3 Properties of Numbers 8/24/16. Common Core State Standards Interpret complicated expressions by viewing one or more of their parts as a single entity.

Geometry: Section 2.4 Algebraic Reasoning. What you will learn: 1. Use Algebraic Properties of Equality to justify the steps in solving an equation. 2.

Section 2.2 Day 1. A) Algebraic Properties of Equality Let a, b, and c be real numbers: 1) Addition Property – If a = b, then a + c = b + c Use them 2)

2-1 Basic Assumptions Objective: To use number properties to simplify expressions.

Equivalence Relations

Reflexivity, Symmetry, and Transitivity

Notes Over 3.4 The Rational Zero Test

Number Theory and Modular Arithmetic

Chapter Notes: Properties and Algebraic Proofs

Proving Statements about Segments

Discrete Math (2) Haiming Chen Associate Professor, PhD

Reasoning With Properties of Algebra

Section 4.1: Vector Spaces and Subspaces

Section 4.1: Vector Spaces and Subspaces

8.5 Equivalence Relations

Distributing, Sets of Numbers, Properties of Real Numbers

Equivalence Relations

Relations: representation and closures

8.5 Equivalence Relations and 8.6 Partial Ordering

Reasoning With Properties of Algebra

2.6 Proving Statements about Angles

PROPERTIES OF ALGEBRA.

Proving things about Angles

Properties of Real Numbers

Lecture 43 Section 10.1 Wed, Apr 6, 2005

Equivalence Relations

Congruence and Triangles

CSE 321 Discrete Structures

Fundamental Theorem of Algebra

Properties of Equality

2.5 The Real Zeros of a Polynomial Function

2.6 Proving Statements about Angles

9.5 Equivalence Relations

Proving Statements about Segments

Advanced Algorithms Analysis and Design

Section 6.3 – Polynomial Division

Proving things about Angles

Graphing Key Equations

Clements MAΘ October 30th, 2014

Proving Statements about Angles

Equivalence Relations

Presentation transcript:

Reflexivity, Symmetry, and Transitivity Lecture 44 Section 10.2 Thu, Apr 7, 2005

Reflexivity, Symmetry, and Transitivity Let R be a relation on a set A. R is reflexive if  x  A, (x, x)  R. R is symmetric if  x, y  A, (x, y)  R  (y, x)  R. R is transitive if  x, y, z  A, (x, y)  R and (y, z)  R  (x, z)  R.

Examples Which of the following relations are reflexive? symmetric? transitive? a  b, on Z. A  B, on  (U). p  q, on a set of statements. a  b (mod 10), on Z. gcd(a, b) > 1, on Z. p  q = p, on a set of statements.

Examples Which of the following relations are reflexive? symmetric? transitive? R  R, on R. , on R.

The Reflexive Closure of a Relation Let R be a relation on a set A. Define the reflexive closure of R to be the relation R r defined by R r = R  {(a, a) | a  A}. Then R r is the “smallest” relation that includes R and is reflexive.

The Reflexive Closure of a Relation The reflexive closure of < (on R ) is . The reflexive closure of  is . The reflexive closure of a  b (mod 10) on Z is itself.

The Symmetric Closure of a Relation Let R be a relation on a set A. Define the symmetric closure of R to be the relation R s defined by R s = R  {(a, b) | (b, a)  R}. Then R s is the “smallest” relation that includes R and is symmetric.

The Symmetric Closure of a Relation What is the symmetric closure of a  b, on Z ? What is the symmetric closure of gcd(a, b) > 1, on Z ?

The Transitive Closure of a Relation Let R be a relation on a set A. The transitive closure of R is a relation R t with the following properties. R t is transitive. R  R t. If S is a transitive relation on A and R  S, then R t  S, i.e., R t is the “smallest” transitive relation that contains R.

Finding the Transitive Closure of a Relation Given a relation R on a set A, the following algorithm will produce the transitive closure of R. Let n = 1 and R 0 =  and R 1 = R. While R n  R n – 1 Let R n + 1 = R n  {(a, c)  (a, b), (b, c)  R n for some a, b, c  A} n = n + 1 End While

Closures of a Relation Let P be the set of all polynomials with real coefficients. Define the relation R on P by (f, g)  R if df/dx = g. What is the reflexive closure of R? What is the symmetric closure of R? What is the transitive closure of R? What is the reflexive-transitive closure of R? Call it R *.