Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Prove This

  1. Sep 17, 2008 #1
    Let A and B be finite sets, and let f:A->B be a function. Show that

    a)if f is injective, then |A|<=|B|
    b)if f is surjective, then |A|>=|B|
  2. jcsd
  3. Sep 18, 2008 #2


    User Avatar
    Science Advisor

    Are you in the wrong course? Whoever assigned these problems obviously expects that you know what "injective" and "surjective" mean! What are the definitions of those? How have you tried to apply those definitions? Do you know what it means to say that |A|= |B| for A and B sets? In particular what is the definition of |A|?
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Prove This
  1. Prove it (Replies: 6)

  2. Proves that (Replies: 3)

  3. Proving Inequalities (Replies: 8)

  4. Prove a = b (Replies: 5)

  5. How to prove this? (Replies: 1)