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.
Added by Jes-S L.
Close
Step 1
We want to show that f is surjective. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 65 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 finite sets with |X| = |Y| and let f : X → Y be a function. Prove that if f is injective then it is surjective.
Joseph D.
Consider f: A → B. Prove that f is injective if and only if X = f⁻¹(f(X)) for all X ⊆ A.
Sri K.
If $g \circ f$ is injective, then $f$ is injective.
Functions and Matrices
Composition 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