Difference between revisions of "Bijection"
m (anchor) |
m |
||
| (5 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| − | + | A '''bijection''', or ''one-to-one correspondence '', is a [[function]] which is both [[injection|injective]] (or ''one-to-one'') and [[surjection|surjective]] (or ''onto''). A function has a [[Function#The_Inverse_of_a_Function|two-sided inverse]] exactly when it is a bijection between its [[domain]] and [[range]]. | |
| + | |||
| + | Bijections are useful in a variety of contexts. In particular, bijections are frequently used in [[combinatorics]] in order to count the elements of a set whose size is unknown. Bijections are also very important in [[set theory]] when dealing with arguments concerning [[infinite]] sets or in permutation and probability (e.g. 2008 AMC 12B #22). | ||
| + | |||
| + | |||
| + | {{stub}} | ||
Revision as of 03:45, 1 March 2017
A bijection, or one-to-one correspondence , is a function which is both injective (or one-to-one) and surjective (or onto). A function has a two-sided inverse exactly when it is a bijection between its domain and range.
Bijections are useful in a variety of contexts. In particular, bijections are frequently used in combinatorics in order to count the elements of a set whose size is unknown. Bijections are also very important in set theory when dealing with arguments concerning infinite sets or in permutation and probability (e.g. 2008 AMC 12B #22).
This article is a stub. Help us out by expanding it.
