Onto (Surjective Function)
Duration: 3 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
The video lecture explains "Onto" or "Surjective" functions. The instructor defines a surjective function f from set X to Y, stating that for every y in Y, there is at least one x in X such that f(x) = y. He clarifies x need not be unique. The lecture uses diagrams to illustrate onto vs non-onto functions. Key conditions for finite sets are derived, specifically that the cardinality of the co-domain must be less than or equal to the cardinality of the domain.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the definition: "A function f from a set X to a set Y is surjective... if for every element y in the co-domain Y of f, there is at least one element x in the domain X of f such that f(x) = y." He presents three diagrams. The first shows element 'A' unmapped, marked with a red cross as not onto. The second and third show all Y elements covered, marked with red ticks as onto. He writes "Range of f = B". Finally, he writes "If A and B are finite sets, then onto function from A->B is possible, |B| <= |A|" and circles it.
2:00 – 2:58 02:00-02:58
The instructor elaborates on the cardinality condition. He writes |A| >= |B| to reinforce that the domain must have at least as many elements as the co-domain. He points to the third diagram where multiple elements map to the same target, showing onto functions don't require uniqueness. He concludes: "If |A| = |B|, then every onto function from A to B is also one-to-one function." This connects surjectivity with injectivity when set sizes are equal. He uses red annotations to track covered elements.
The lecture builds understanding of surjective functions from definition to application. It starts with the formal definition requiring every co-domain element to have a pre-image. It uses visual mapping diagrams to distinguish onto from non-onto functions, emphasizing "Range = Co-domain". The instructor derives a necessary condition for finite sets (|Domain| >= |Co-domain|) and links surjectivity to injectivity when set cardinalities are equal. This moves from abstract definition to concrete visual verification and theoretical implications.