Course contentsShow
← Mathematics
Lesson 2567 of 3,12151. Discrete Math — Sets, Relations, FunctionsFree lesson

Composition and Function Properties

Analyze how injectivity, surjectivity, and bijectivity behave under function composition.

Composition and Function Properties

What You'll Learn

You'll discover how composing two functions affects their injectivity, surjectivity, and bijectivity—and why some properties "survive" composition while others require careful conditions.

The Core Idea

When you compose two functions g ∘ f (read "g after f"), you're chaining them together: first apply f, then apply g to the result. But what happens to the special properties we've studied?

For Injectivity (one-to-one): If both f and g are injective, then g ∘ f is injective. Think of it as a two-stage filter: if f never merges different inputs and g never merges different outputs from f, the combined journey keeps everything separate.

Conversely, if g ∘ f is injective, we can only conclude that f is injective—not necessarily g. Why? Because f does the "first filtering," so it must preserve distinctness. But g might map some elements to the same output; we just never see that overlap because f's range doesn't hit those problem spots.

For Surjectivity (onto): If both f and g are surjective, then g ∘ f is surjective. Every element in the final codomain gets hit because g covers everything in its codomain, and f provides all necessary inputs to g.

If g ∘ f is surjective, we can only conclude that g is surjective—not f. The composition reaches everything because g does the "final stretch," but f might miss parts of its own codomain.

For Bijectivity: Both f and g must be bijective for g ∘ f to be bijective—combining the requirements above.

Key Takeaway: Composition preserves injectivity and surjectivity when both functions have the property; but knowing only the composition is injective tells you just about f, while knowing it's surjective tells you just about g.