Difference between revisions of "Functions:Bijective"
Jump to navigation
Jump to search
Line 7: | Line 7: | ||
* <math> f:A\to B, A = \{a, b, c\}, B = \{1, 2, 3, 4, 5\}</math> such that <math> f(a) = 1 </math>, <math> f(b) = 2 </math>, and <math> f(c) = 3 </math> (each input has a unique output, but not all elements of the codomain are mapped to) | * <math> f:A\to B, A = \{a, b, c\}, B = \{1, 2, 3, 4, 5\}</math> such that <math> f(a) = 1 </math>, <math> f(b) = 2 </math>, and <math> f(c) = 3 </math> (each input has a unique output, but not all elements of the codomain are mapped to) | ||
* <math> f:\N\to\N, f(n) = n^2 </math> | * <math> f:\N\to\N, f(n) = n^2 </math> | ||
− | * <math> f:{x\in\R, x \ge 0}\to\R, f(x) = x^2 + 100 </math> | + | * <math> f:\{x\in\R, x \ge 0\}\to\R, f(x) = x^2 + 100 </math> |
Surjective, not injective: | Surjective, not injective: | ||
* <math> f:A\to B, A = \{a, b, c, d\}, B = \{1, 2, 3\} </math> such that <math> f(a) = 1 </math>, <math> f(b) = 1 </math>, <math> f(c) = 2 </math>, and <math> f(d) = 3 </math> | * <math> f:A\to B, A = \{a, b, c, d\}, B = \{1, 2, 3\} </math> such that <math> f(a) = 1 </math>, <math> f(b) = 1 </math>, <math> f(c) = 2 </math>, and <math> f(d) = 3 </math> | ||
− | * <math> f:\R\to{x\in\R, x \ge 0}, f(n) = |x| </math> | + | * <math> f:\R\to\{x\in\R, x \ge 0\}, f(n) = |x| </math> |
* <math> f:\R\to\R, f(x) = x^2 + 2x + 1 </math> (<math> -2 </math> and <math>0</math> map to the same output, so not injective; range is <math> (-\infty, \infty) = \R </math>, so surjective) | * <math> f:\R\to\R, f(x) = x^2 + 2x + 1 </math> (<math> -2 </math> and <math>0</math> map to the same output, so not injective; range is <math> (-\infty, \infty) = \R </math>, so surjective) | ||
Revision as of 15:10, 27 September 2021
A function is bijective if it is both injective and surjective. That is, a bijective function maps each element of the domain to a distinct element in the codomain, and every element in the codomain is mapped to by exactly one element of the domain.
Examples
Injective, not surjective:
- such that , , and (each input has a unique output, but not all elements of the codomain are mapped to)
Surjective, not injective:
- such that , , , and
- ( and map to the same output, so not injective; range is , so surjective)
Bijections:
- such that , , and
Resources
- Course Textbook, pages 154-164