Let X and Y be finite sets with |X| = |Y| and let f : X ? Y be a function. Prove that if f is injective then it is surjective.
Added by Hannah S.
Close
Step 1
** Show more…
Show all steps
Your feedback will help us improve your experience
Joseph David and 86 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let X and Y be nonempty sets and suppose f: X → Y is a function. Define a new function F: ℘(Y) → ℘(X) by F(B) = PreIm_f(B). Prove that F is injective if and only if f is surjective.
Sri K.
Let f : A → B and g : B → C be functions. a) Prove that if g ∘ f is injective, then f is injective. b) Prove that if g ∘ f is surjective, then g is surjective. c) Find an explicit example where g ∘ f is bijective, but neither f nor g is bijective.
Ishana K.
Let $f : \mathbb{R} \rightarrow \mathbb{R}$ defined by $f(x)=a x+b,$ where $a, b \in \mathbb{R}$ and $a \neq 0$ . Show that $f$ is surjective; that is, find a real number $x$ such that $f(x)=c$
Functions and Matrices
Properties of Functions
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD