Onto Or Surjective Function
Onto or Surjective function
graph TB
A[Onto or Surjective function]
A --> B[Definition]
A --> C[Properties]
A --> D[Examples]
B --> E["A function f: X -> Y is said to be onto or surjective if every element of Y has a pre-image in X"]
C --> F["Every onto function has a right inverse"]
C --> G["If f: X -> Y is onto and X is finite, then Y is finite"]
D --> H["f: R -> R defined by f(x) = 2x + 3 is surjective"]
D --> I["f: Z -> Z defined by f(n) = 2n is not surjective"]
