Discrete Structures
Lecture Notes, 5 Nov 2010
Last Update: 5 November 2010
Note:
or
material is highlighted
|
Note: A username and password may be required to access certain
documents.
Please
contact
Bill Rapaport.
Index to all lecture notes
…Previous lecture
§2.3: Functions (cont'd)
- 1–1 Correspondence:
- Reminders:
- function f : A → B
- 1–1 function f : A → B
-
(∀a,a′∈A)[f(a)=f(a′) → a=a′]
- or: a≠a′ → f(a)≠f(a′)
- i.e.) same O/P → same I/P
- i.e.) different I/P → different O/P
- onto function f : A → B
-
(∀b∈B)(∃a∈A)[f(a)=b]
- i.e.) every element of co-domain is in range
- or: every "target" is hit by some "archer"
- Now we put these together:
- Def:
Let A,B be sets.
Let f : A → B be a total function
Then f is a 1–1 correspondence between A and B
(or: is a bijection)
f is 1–1 and onto.
- E.g., the identity function
ιA : A → A s.t.
(∀a ∈ A)[ιA(a) = a]
is a 1–1 correspondence
- Inverses of Functions:
- Def:
Let A,B be sets.
Let f : A → B.
then the inverse of f, denoted f–1 (a relation from B → A)
{(b, a) | (a, b) ∈ f }
- Now, f is a function (by
hypothesis).
But is f–1 a function, or merely a
non-functional relation?
- I.e., can we write: f–1(b)
= a ↔ f(a) =
b?
- Thm (You Can Go Home Again):
Let A,B be sets.
Then relation f–1 : B → A is a total function
f : A → B is a 1–1 correspondence.
proof sketch:
Case 1: Show f–1 is a total function →
f is 1–1:
Use proof by contrapositive:
f not 1–1 → ∃b ∈ B
that is image of >1 a ∈ A
∴ f–1 not a function;
i.e., you can't go home again, because you don't know which is your
home.
Case 2: Show f–1 is a total function →
f is onto:
Another proof by contrapositive:
f not onto → ∃b ∈ B
that is not image of any a ∈ A;
i.e., you can't go home again, because there's no home to go to.
Case 3: Show f is a 1–1 correspondence →
f–1 is a total function:
QED
- Function Composition:
- ∃ operations on functions:
-
i.e., ∃ an "algebra" of functions
-
Def:
Let A,B,C be sets.
Let g : A → B.
Let f : B → C.
Then the composition of f with g
—denoted "(f o g) : A → C"
& read "f of g"—
=def {(a, c) |
(∃b ∈ B)[(g(a) = b)
∧ (f(b) = c)]
- i.e., (f o g)(a) =
f(g(a))
- E.g.:
Next lecture…
Text copyright © 2010 by William J. Rapaport
(rapaport@buffalo.edu)
Cartoon links and screen-captures appear here for your enjoyment.
They are not meant to infringe on any copyrights held by the creators.
For more information on any cartoon, click on it, or contact me.
http://www.cse.buffalo.edu/~rapaport/191/F10/lecturenotes-20101105.html-20101103-2