The first question I have is simple, but when I attempted it, I got stuck.(adsbygoogle = window.adsbygoogle || []).push({});

I'm trying to prove that if f:X->Y and A & B are subsets of X, that f(A intersect B) is a subset of f(A) intersect f(B).

I started by trying to show set containment, beginning with an arbitrary element in f(A intersect B). However, I cannot figure out how to transition into the right hand side of the problem.

----------------------------

The second question I have is proving that if A and B are finite sets having the same cardinality and f:A->B is one-to-one then f is onto.

I missed class this day and can't figure out what cardinality is by reading the chapter.

Someone please help! =\

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Stumped on 2 easy function problems!

Loading...

Similar Threads for Stumped easy function | Date |
---|---|

B Given a success rate of 1% and 100 tries.... | Mar 27, 2018 |

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

Stumped on a logical equivalence proof | Nov 19, 2014 |

Is my Handout wrong? Stumped Conditional Probability | Sep 20, 2009 |

Stumped on a deduction problem | Mar 1, 2005 |

**Physics Forums - The Fusion of Science and Community**