Mathematical Thinking: Problem-Solving and Proofs (2nd Edition)

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 13 - MATH 310 0101 - Summer I 2010 - Due by Thursday, June 25 For each of the following relations, determine whether it is reflexive, symmetric, and/or transitive. In each case either prove it satisfies the property or display a counterexample. Use this to determine whether or not each relation is an equivalence relation. 1. Let F ( R ) be the set of real-valued functions on R and let S R . Define a relation on F ( R ) by f g if and only if f ( x ) = g ( x ) for every x S . 2. Define another relation on
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: F ( R ) by f ∼ g if and only if f ( x ) = g ( x ) for some x ∈ R . 3. The relation < on R . 4. Given a set S , | S | ≥ 2, define a relation on P ( S ) by A ∼ B if and only if A ∩ B 6 = ∅ . 5. Define a relation on N by m | n , read “ m divides n ”, if and only if n = k · m for some k ∈ N . 6. Given f : A → B , define a relation on A by x ∼ y if and only if x and y have the same image under f ....
View Full Document

This document was uploaded on 03/25/2011.

Ask a homework question - tutors are online