Exercise · ZW-SURJECTIVE-FUNCTION-003 · ★☆☆ Basic

What is the logical form of the definition of a surjective function?

Choose one option.

Show answer
  • C. \(\forall b\in B\,\exists a\in A\,(f(a)=b)\)

Explanation

Every \(b\) in the codomain needs some \(a\) in the domain that reaches it; the order of the quantifiers matters. The negation of surjectivity is the option stating that some \(b\) is reached by no \(a\), and the one comparing images describes injectivity. The option with a single \(a\) for all \(b\) swaps the quantifiers.

Study Set theory in ZWMath →

Review the concept: Surjective function

Function \(f\colon A\to B\) whose image is the whole codomain \(B\).

\[\forall b\in B\,\exists a\in A\,(f(a)=b)\]

More practice problems: surjective function

← ZW-SURJECTIVE-FUNCTION-002 ZW-SURJECTIVE-FUNCTION-004 →