Find the smallest counterexample to the
statement:
Let and
Find
if it
exists and if it
exists.
Let .
Write the contrapositive of the following statement: If and
are both
positive then or
Prove the
following by either the Method of Smallest Counterexample or by the Method
of Mathematical Induction.
Prove the following by the Method of Proof by
Contradiction: If and are sets such
that then
Let be a set. Let Prove: If is onto then is onto.
Let be
given by Determine
if is one-to-one
and onto.
Prove your assertions. (That is, either give a proof if the property does
hold or a counterexample if it does not.)
Either give an example that satisfies the stated
conditions or explain why it is impossible to do so. (You
may give your examples in the form of a function diagram, as long as
everything in the diagram is clear and fully labeled.)
A function such
that is
one-to-one, but not onto.
A pair of sets and
and a
function that is onto but not one-to-one.
Sets and and
functions and such that is
one-to-one but is not one-to-one.