Let f and g be functions from a finite set X to itself. Prove or disprove: if f ◦ g is bijective, g is surjective.
Added by Gabrielle G.
Step 1
Step 1: Assume that f ◦ g is bijective. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Mohamed Mohamed and 78 other Algebra 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
If $g \circ f$ is bijective, then $f$ is injective and $g$ is surjective.
Functions and Matrices
Composition of Functions
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 $g: mathbb{Z} imes mathbb{Z} o mathbb{Z} imes mathbb{Z}$ be defined by $(a, b) mapsto (a + b, a + 2b)$. Prove that $g$ is injective and surjective.
Adi S.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD