โ Discrete Mathematics learning pathDiscrete Mathematics ยท Module 5 of 10
Functions
Injective, surjective, bijective and composition.
๐ Key ideas
- A function maps each element of the domain to exactly one element of the codomain.
- Injective (one-to-one): different inputs give different outputs.
- Surjective (onto): every codomain element is hit.
- Bijective: both; only bijections have inverses.
- 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