Lecture 43 Section 10.1 Wed, Apr 6, 2005

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

DEFINITION Let f : A  B and let X  A and Y  B. The image (set) of X is f(X) = {y  B : y = f(x) for some x  X} and the inverse image of Y is f –1 (Y)
Equivalence Relations
Application: The Pigeonhole Principle Lecture 37 Section 7.3 Wed, Apr 4, 2007.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Direct Proof and Counterexample II Lecture 12 Section 3.2 Thu, Feb 9, 2006.
1 Diagonalization Fact: Many books exist. Fact: Some books contain the titles of other books within them. Fact: Some books contain their own titles within.
TR1413: INTRO TO DISCRETE MATHEMATICS LECTURE 2: MATHEMATICAL INDUCTION.
Congruence of Integers
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
(CSC 102) Discrete Structures Lecture 10.
Lecture 9. Arithmetic and geometric series and mathematical induction
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
Chapter 6 Mathematical Induction
Numbers, Operations, and Quantitative Reasoning.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Solving Second-Order Recursive Relations Lecture 36 ½ Section 8.3 Wed, Apr 19, 2006.
6.3 Permutation groups and cyclic groups  Example: Consider the equilateral triangle with vertices 1 , 2 , and 3. Let l 1, l 2, and l 3 be the angle bisectors.
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
The Binomial Theorem Lecture 29 Section 6.7 Mon, Apr 3, 2006.
Math 3121 Abstract Algebra I Lecture 5 Finish Sections 6 + Review: Cyclic Groups, Review.
Reflexivity, Symmetry, and Transitivity Lecture 44 Section 10.2 Thu, Apr 7, 2005.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 10/7/2008.
Properties of Real Numbers
Cardinality with Applications to Computability Lecture 33 Section 7.5 Wed, Apr 12, 2006.
MA/CSSE 473 Day 08 Extended Euclid's Algorithm Modular Division Fermat's little theorem.
Systematic Sampling Lecture 9 – Part 1 Sections 2.8 Wed, Jan 30, 2008.
Application: Algorithms Lecture 20 Section 3.8 Wed, Feb 21, 2007.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Direct Proof and Counterexample III
Types of Proof Lecture 4 Sections 0.4 Wed, Aug 29, 2007.
SECTION 8 Groups of Permutations Definition A permutation of a set A is a function  ϕ : A  A that is both one to one and onto. If  and  are both permutations.
SECTION 10 Cosets and the Theorem of Lagrange Theorem Let H be a subgroup of G. Let the relation  L be defined on G by a  L b if and only if a -1 b 
Chapter 13 Mathematic Structures 13.1 Modular Arithmetic Definition 1 (modulo). Let a be an integer and m be a positive integer. We denoted by a mod m.
Equivalence Relations Lecture 45 Section 10.3 Fri, Apr 8, 2005.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Lecture 34 Section 6.7 Wed, Mar 28, 2007
Mathematical Induction I Lecture 19 Section 4.2 Mon, Feb 14, 2005.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Direct Proof and Counterexample III Part 2 Lecture 16 Section 3.3 Tue, Feb 13, 2007.
Multiplication and Division of Powers
Translation Theorems and Derivatives of a Transform
Great Theoretical Ideas In Computer Science
Chapter 3 The Real Numbers.
Analytic Number Theory MTH 435
Indirect Argument: Contradiction and Contraposition
Discrete Math for CS CMPSC 360 LECTURE 4 Last time and recitations:
Math 3121 Abstract Algebra I
Chapter 2.4/2.6 Notes: Multiplying and Dividing Real Numbers
Direct Proof and Counterexample III
Direct Proof and Counterexample IV
Countable and Countably Infinite Sets
The sum of any two even integers is even.
Direct Proof and Counterexample II
Statements Containing Multiple Quantifiers
Direct Proof and Counterexample III
One-to-One and Onto, Inverse Functions
I. Finite Field Algebra.
Lecture 37 Section 7.2 Tue, Apr 3, 2007
Composition of Functions
Direct Proof and Counterexample I
One-to-One and Onto, Inverse Functions
{(1, 1), (2, 4), (3, 9), (4, 16)} one-to-one
One-to-One and Onto, Inverse Functions
Direct Proof and Counterexample IV
Counting Elements of Disjoint Sets: The Addition Rule
Mathematical Induction II
Presentation transcript:

Lecture 43 Section 10.1 Wed, Apr 6, 2005 Relations on a Set Lecture 43 Section 10.1 Wed, Apr 6, 2005

Relations on a Set A relation from a set A to a set B is a subset of A  B. A relation on a set A is a relation from A to A, i.e., a subset of A  A.

Examples: Relations on a Set Define the relation < on the real numbers as x < y if x is less than y. Define the relation  on the integers as a  b if a divides b. Define the relation  on Z as m  n if m – n is even. Define the relation  on the set of all statements as p  q if p  q  p.

Inverse Relations Let R be a relation from A to B. The inverse relation, denoted R–1, is defined by (a, b)  R–1 if and only if (b, a)  R.

Examples: Inverse Relations The inverse of the relation < on the real numbers is the relation >. The inverse of the relation  on the integers is the relation “is a multiple of.” The inverse of the relation  on Z is itself. The inverse of the relation  on statements, defined by p  q  p, is the relation defined by p  q  p.

Inverse of p  q  p Theorem: If p  q  p, then p  q  q. Proof: Suppose that p  q  p. Then (p  q)  p  p or p. (p  p)  (q  p)  p  p. T  (q  p)  T. q  p  T.

Inverse of p  q  p (q  p)  q  T  q. (q  q)  (p  q)  q. F  (p  q)  q. p  q  q. p  q  q.