Mathematics

Mathematics

Problem

Which of the following gives the correct condition for a function f:A→Bf:A\to B to be surjective (onto)? a) For every x∈Ax\in A, there exists y∈By\in B such that f(x)=yf(x)=y. b) For every y∈By\in B, there exists a unique x∈Ax\in A such that f(x)=yf(x)=y. c) For every y∈By\in B, there exists x∈Ax\in A such that f(x)=yf(x)=y. d) For all x1,x2∈Ax_1,x_2\in A, f(x1)=f(x2)f(x_1)=f(x_2) implies x1=x2x_1=x_2.
Intuitive explanation

A function is surjective when every element in the codomain BB actually gets "hit" by at least one input from AA. The key insight is that surjectivity is about coverage: you're checking whether the range equals the codomain. Instead of thinking about individual mappings, ask yourself whether there's any element in BB left out—if no element is left out, the function is surjective.

Intuitive explanation

A function is surjective when every element in the codomain BB actually gets "hit" by at least one input from AA. The key insight is that surjectivity is about coverage: you're checking whether the range equals the codomain. Instead of thinking about individual mappings, ask yourself whether there's any element in BB left out—if no element is left out, the function is surjective.

Browse the problem library