CS-7081 Irreflexive – (13 - 8). CS-7082 Example – (13 - 9)

Slides:



Advertisements
Similar presentations
Relations - review A binary relation on A is a subset of A×A (set of ordered pairs of elements from A) Example: A = {a,b,c,d,e} R = { (a,a),(a,b),(b,b),(b,c),
Advertisements

Discrete Mathematics Lecture # 16 Inverse of Relations.
Discrete Mathematics Lecture#11.
1 Representing Relations Epp section ??? CS 202 Aaron Bloomfield.
EXAMPLE 1 Find partial sums SOLUTION S 1 = 1 2 = 0.5 S 2 = = S 3 = Find and graph the partial sums S n for n = 1,
Relations (1) Rosen 6 th ed., ch. 8. Binary Relations Let A, B be any two sets. A binary relation R from A to B, written (with signature) R:A↔B, is a.
CHAPTER (6) RELATIONS. RELATIONS : - Let A and B be sets. A binary relation from A to B is subset of A* B …
EXAMPLE 3 Find the inverse of a 3 × 3 matrix Use a graphing calculator to find the inverse of A. Then use the calculator to verify your result. 2 1 – 2.
5.4 – Solving Compound Inequalities. Ex. Solve and graph the solution.
Set Operations and Compound Inequalities. 1. Use A = {2, 3, 4, 5, 6}, B = {1, 3, 5, 7, 9}, and C = {2, 4, 6, 8} to find each set.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Relations.
3.6 Solving Absolute Value Equations and Inequalities
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Class 7: Answers 1 (C) Which of the following matrices below is in reduced row echelon form? A B C D. None of them.
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
1 Chapter Equivalence, Order, and Inductive Proof.
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
Relations Discrete Structures (CS 173)
EXAMPLE 2 Add and subtract matrices 5 –3 6 – –4 + a. –3 + 2
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.
1 Beginning & Intermediate Algebra – Math 103 Math, Statistics & Physics.
1 Section 4.1 Properties of Binary Relations A binary relation R over a set A is a subset of A  A. If (x, y)  R we also write x R y. Example. Some sample.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Relations.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
Section 7.3: Representing Relations In this section, we will cover two ways to represent a relation over a finite set other than simply listing the relation.
EXAMPLE 3 Use matrices to rotate a figure SOLUTION STEP 1Write the polygon matrix: Trapezoid EFGH has vertices E(–3, 2), F(–3, 4), G(1, 4), and H(2, 2).
Example 1 Graph of an Inequality Chapter 8.1 Graph the solution of the inequality.  2009 PBLPathways.
Practice 6.7. Solve the inequality and graph your solution #1 AND OR.
Reducing a Set Covering Matrix. S I T E S Cost Areas
Notes Over 1.6 Solving an Inequality with a Variable on One Side Solve the inequality. Then graph your solution. l l l
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
CSNB 143 Discrete Mathematical Structures
Graph Representations
3.3 – Solving Systems of Inequalities by Graphing
6-6 Systems of Linear Inequalities
Notes Over 2.1 Graph the numbers on a number line. Then write two inequalities that compare the two numbers and and 9 l l l.
BACK SOLUTION:
Here is the graph of a function
Systems of Inequalities
CS200: Algorithm Analysis
CS2210 Discrete Structures Relations
Solutions to Systems of Equations
Discrete Math & Fixed points
EXAMPLE 5 Use matrix multiplication to reflect a polygon
Relations and Their Properties
8.1 Relations and Their Properties
Absolute Value inequalities
[ ] [ ] [ ] [ ] EXAMPLE 3 Scalar multiplication Simplify the product:
Relations: representation and closures
EXAMPLE 2 Add and subtract matrices 5 –3 6 – –4 + a. –3 + 2
A graphing calculator is required for some problems or parts of problems 2000.
Final Review.
Graph 2x + 4y = 16 by finding the x and y intercepts.
CSE 321 Discrete Structures
Compound Inequalities and their Graphs
Chapter 12.
DiGraph Definitions Adjacency Matrix Adjacency List
Systems of Equations Solve by Graphing.
Combining relations via relational composition
Where do these graphs intersect
GRAPHING LINEAR EQUATIONS
Ordered Pair – (11 - 2) CS-708.
Intersection Method of Solution
Line Graphs.
Notes Over 6.1 Graphing a Linear Inequality Graph the inequality.
Chapter 12.
Lecture # 16 Inverse of Relations
Project report cs331.
4.4 Properties of Relations
Presentation transcript:

CS-7081 Irreflexive – (13 - 8)

CS-7082 Example – (13 - 9)

CS-7083 Example – (13 – 9a)

CS-7084 Example – (13 – 9b)

CS-7085 Directed Graph of Irreflexive Relation – ( )

CS-7086 Example – (13 – 10a)

CS-7087 Comparison – (13 – 10b)

CS-7088 Matrix Representation of an Irreflexive Relation – ( )

CS-7089 Example – (13 – 11a)

CS Antisymmetric Relation – ( )

CS Remark – (13 – 13a)

CS Example – ( )

CS Solution – (13 – 14a)

CS Solution – (13 – 14b)

CS Directed Graph of an Antisymmetric Relation – ( )

CS Example – (13 – 15b)

CS Matrix Representation of an Antisymmetric Relation – ( )

CS Example – (13 – 16a)

CS Partial Order Relation – ( )

CS Example – ( )

CS Example – (13 – 18b)

CS Example – (13 – 18c)