Sign inSign in
ConceptMathematics

Surjective function

A function where every element in the codomain is mapped to by at least one element of the domain.
as Casey Rodriguez defines itMITThe wording closest to all 10 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

5

Each in their own terms, from the easiest level.

  • Vicky Neale

    University of Oxford · Introductory

    A function is surjective if for every element in the codomain there is at least one element in the domain that maps to it.
    • 20:10Functions
    • 40:03Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
    • 38:37Binary Relations, Partitions & Equivalence Relations
    • 14:24Functions, Injections, Surjections, Bijections & Inverses
  • Casey Rodriguez

    MIT · Undergraduate

    A function is surjective if every element in the codomain has at least one element in the domain that maps to it.
    • 13:46Cantor's Theory of Cardinality (Size)
    • 11:18Cantor's Remarkable Theorem and the Rationals' Lack of the Least Upper Bound Property
  • Marten van Dijk

    MIT · Undergraduate

    A function is surjective if every single element of the range Y is mapped to at least once.
  • Bartosz Milewski

    Undergraduate

    A function whose image covers the entire codomain, meaning every element in the codomain has at least one pre-image in the domain.
    • 32:20Category Theory: Functions and Epimorphisms
  • Peter Shor

    MIT · Undergraduate

    A function where every element in the codomain is mapped to by at least one element in the domain.

Lectures that assume it

2

Connections

21

The lectures that define it or assume it, and the concepts next to it.

5 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.