Prove that a function f is surjective if and only if f(dom(f)) = cod(f).
Added by Mark H.
Step 1
This means that for every element y in the codomain of f, there exists at least one element x in the domain of f such that f(x) = y. Now, let's consider the set f(dom(f)), which is the image of the domain of f under the function f. Since f is surjective, we know Show more…
Show all steps
Close
Your feedback will help us improve your experience
Charles Machakwa and 91 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
Write the proof for the following: Assume f: A → B and g: B → A are functions such that f ◦ g = idB. Then g is injective and f is surjective.
Hoan N.
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
A function f is said to be surjective if, for every element y in the codomain of f, there exists an element x in the domain of f such that f(x) = y; that is, ∀y:∃x|(f(x) = y). Let f and g be functions. Complete the following: (1) Formalize the sentence "if f and g are surjective, then f◦g is surjective" (2) Give a direct (CP) proof of this formalization
Sri K.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD