Sign inSign in
ConceptMathematics

Bijective function

A function is bijective if it is both injective and surjective.
as Casey Rodriguez defines itMITThe wording closest to all 7 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

3

Each in their own terms, from the easiest level.

  • Vicky Neale

    University of Oxford · Introductory

    A function is bijective if it is both injective and surjective.
    • 20:37Functions
    • 41:11Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
    • 15:23Functions, Injections, Surjections, Bijections & Inverses
  • Casey Rodriguez

    MIT · Undergraduate

    A function that is both one-to-one (injective) and onto (surjective).
    • 8:36Cantor's Remarkable Theorem and the Rationals' Lack of the Least Upper Bound Property
    • 30:03The Uncountabality of the Real Numbers
  • Marten van Dijk

    MIT · Undergraduate

    A function is bijective if every element of Y is mapped to exactly once, which means it is both surjective and injective.

Connections

13

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

3 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.