lec0207 - CS 173 Discrete Mathematical Structures Cinda...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 173: Discrete Mathematical Structures Cinda Heeren [email protected] Rm 2213 Siebel Center Office Hours: W 9:30-11:30a
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Cs173 - Spring 2004 CS 173 Announcements Homework 4 available. Due 02/12, 8a. Midterm 1: 2/23/06, 7-9p, location SC 1404.
Background image of page 2
CS 173 Functions - misc. properties f( ) = f({a}) = {f(a)} f(A U B) = f(A) U f(B) f(A B) f(A) f(B) Michael Tito Janet Cindy Bobby Katherine Scruse Carol Brady Mother Teresa
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Cs173 - Spring 2004 CS 173 Functions - misc. properties f(A B) f(A) f(B)? B) = {x : 5 a (A B), f(a) = x} Choose an arbitrary b B), and show that it must also be an element of f(A) f(B). So, 5 B) such that f(a) = b. If a A (it is), then f(a) = b f(A). If a B (it is), then f(a) = b b f(A), and b f(B), so b
Background image of page 4
CS 173 Functions - misc. properties f -1 ( ) = f (A U B) = f (A) U f (B) f (A B) = f (A) f Michael Tito Janet Cindy Bobby Katherine Scruse Carol Brady Mother Teresa
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS 173 Functions - injection A function f: A B is one-to-one (injective, an injection) if 2200 a,b,c, (f(a) = b f(c) = b) a = c Every b B has at most 1 preimage. Michael Tito Janet Cindy Bobby Katherine Scruse Carol Brady Mother Teresa
Background image of page 6
CS 173 Functions - surjection A function f: A B is onto (surjective, a surjection) if 2200 b B, 5 a A f(a) = b Not onto Every b B has at least 1 preimage. Michael Tito Janet Cindy Bobby Katherine Scruse Carol Brady Mother Teresa
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Cs173 - Spring 2004 CS 173 Functions - bijection A function f: A B is bijective if it is one-to-one and onto. Isaak Bri Lynette Aidan Evan Every b B has exactly 1 preimage. An important implication of this characteristic: The preimage (f -1 ) is a function! Cinda Dee Deb Katrina Dawn
Background image of page 8
Cs173 - Spring 2004 CS 173 Functions - examples Suppose f: R + R + , f(x) = x 2 .
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/15/2008 for the course CS 173 taught by Professor [email protected] during the Spring '08 term at University of Illinois at Urbana–Champaign.

  • Spring '08
  • [email protected]

Page1 / 37

lec0207 - CS 173 Discrete Mathematical Structures Cinda...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online