Everything About ___
Live briefing

Everything about Surjective function

Mathematical function such that every output has at least one input

In mathematics, a surjective function (also known as surjection, or onto function ) is a function f such that, for every element y of the function's codomain, there exists at least one element x in the function's domain such that f(x) = y. In other words, for a function f : X → Y, the codomain Y is the image of the function's domain X. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Surjective functionA 5-minute orientation
  2. Skim a recent paper: On stability of almost surjective functional equations of uniformly convex Banach spacesInfluential work since 2022
  3. Pick up a classic book: Discrete mathematicsThe most-reprinted book on the subject
  4. Read the landmark paper: Uncountably Generated Algebras of Everywhere Surjective FunctionsCited 15 times
  5. Go sideways: Bijection, injection and surjectionA closely related topic
  6. Go sideways: Injective functionA closely related topic

📖 Definitions

Noun Synonym of surjection.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics