โ† Discrete Mathematics learning path
Discrete Mathematics ยท Module 5 of 10

Functions

Injective, surjective, bijective and composition.

๐Ÿ“– Key ideas

  1. A function maps each element of the domain to exactly one element of the codomain.
  2. Injective (one-to-one): different inputs give different outputs.
  3. Surjective (onto): every codomain element is hit.
  4. Bijective: both; only bijections have inverses.
  5. Pigeonhole principle: if n + 1 items go into n boxes, some box holds at least two.
๐Ÿ’ก Real-life example: The pigeonhole principle: in any group of 13 people, at least two share a birth month.
InjectiveOne-to-one function
SurjectiveOnto function
BijectiveOne-to-one and onto
Pigeonhole principleMore items than boxes forces a shared box