Prove This

  • Thread starter algonewbee
  • Start date
  • #1
algonewbee
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|
 

Answers and Replies

  • #2
HallsofIvy
Science Advisor
Homework Helper
41,833
956
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|?
 

Related Threads on Prove This

  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
17
Views
4K
  • Last Post
Replies
8
Views
5K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
4
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
10
Views
2K
Replies
5
Views
3K
  • Last Post
Replies
3
Views
2K
Top