Editing Bijection

{{short description|One-to-one correspondence}}
{{redirect|One-to-one correspondence|one-to-one function|injective function}}
{{Use dmy dates|date=July 2022}}
[[Image:Bijection.svg|thumb|A bijective function, ''f'': ''X'' → ''Y'', where set X is {1, 2, 3, 4} and set Y is {A, B, C, D}. For example, ''f''(1) = D.]]
{{Functions}}

In [[mathematics]], a '''bijection''', '''bijective function''', or '''one-to-one correspondence''' is a [[function (mathematics)|function]] between two [[set (mathematics)|sets]] such that each element of the second set (the [[codomain]]) is the image of exactly one element of the first set (the [[domain of a function|domain]]). Equivalently, a bijection is a [[binary relation|relation]] between two sets such that each element of either set is paired with exactly one element of the other set.

A function is bijective if it is [[inverse function|invertible]]; that is, a function <math>f:X\to Y</math> is bijective if and only if there is a function <math>g:Y\to X,</math> the ''inverse'' of {{mvar|f}}, such that each of the two ways for [[function composition|composing]] the two functions produces an [[identity function]]: <math>g(f(x)) = x</math> for each <math>x</math> in <math>X</math> and <math>f(g(y)) = y</math> for each <math>y</math> in <math>Y.</math>

For example, the ''multiplication by two'' defines a bijection from the [[integer]]s to the [[even number]]s, which has the ''division by two'' as its inverse function.

A function is bijective if and only if it is both [[injective]] (or ''one-to-one'')—meaning that each element in the codomain is mapped from at most one element of the domain—and [[surjective]] (or ''onto'')—meaning that each element of the codomain is mapped from at least one element of the domain. The term ''one-to-one correspondence'' must not be confused with ''[[one-to-one function]]'', which means injective but not necessarily surjective.

The elementary operation of [[counting]] establishes a bijection from some [[finite set]] to the first [[natural number]]s {{math|(1, 2, 3, ...)}}, up to the number of elements in the counted set. It results that two finite sets have the same number of elements if and only if there exists a bijection between them. More generally, two sets are said to have the same [[cardinal number]] if there exists a bijection between them.

A bijective function from a set to itself is also called a [[permutation]],<ref>{{harvnb|Hall|1959|p=3}}</ref> and the set of all permutations of a set forms its [[symmetric group]].

Some bijections with further properties have received specific names, which include [[automorphism]]s, [[isomorphism]]s, [[homeomorphism]]s, [[diffeomorphism]]s, [[permutation group]]s, and most [[geometric transformation]]s. [[Galois correspondence]]s are bijections between sets of [[mathematical object]]s of apparently very different nature.

==Definition==
For a [[binary relation]] pairing elements of set ''X'' with elements of set ''Y'' to be a bijection, four properties must hold:
# each element of ''X'' must be paired with at least one element of ''Y'',
# no element of ''X'' may be paired with more than one element of ''Y'',
# each element of ''Y'' must be paired with at least one element of ''X'', and
# no element of ''Y'' may be paired with more than one element of ''X''.

Satisfying properties (1) and (2) means that a pairing is a [[Function (mathematics)|function]] with [[Domain of a function|domain]] ''X''. It is more common to see properties (1) and (2) written as a single statement: Every element of ''X'' is paired with exactly one element of ''Y''. Functions which satisfy property (3) are said to be "[[onto]] ''Y'' " and are called [[Surjective function|surjections]] (or ''surjective functions''). Functions which satisfy property (4) are said to be "[[one-to-one function]]s" and are called [[Injective function|injections]] (or ''injective functions'').<ref>There are names associated to properties (1) and (2) as well. A relation which satisfies property (1) is called a ''total relation'' and a relation satisfying (2) is a ''single valued relation''.</ref> With this terminology, a bijection is a function which is both a surjection and an injection, or using other words, a bijection is a function which is both "one-to-one" and "onto".<ref>{{Cite web|url=https://brilliant.org/wiki/bijection-injection-and-surjection/|title=Bijection, Injection, And Surjection {{!}} Brilliant Math & Science Wiki|website=brilliant.org|language=en-us|access-date=2019-12-07}}</ref>

==Examples==

=== Batting line-up of a baseball or cricket team===
Consider the [[Batting order (baseball)|batting line-up]] of a baseball or [[cricket]] team (or any list of all the players of any sports team where every player holds a specific spot in a line-up). The set ''X'' will be the players on the team (of size nine in the case of baseball) and the set ''Y'' will be the positions in the batting order (1st, 2nd, 3rd, etc.) The "pairing" is given by which player is in what position in this order. Property (1) is satisfied since each player is somewhere in the list. Property (2) is satisfied since no player bats in two (or more) positions in the order. Property (3) says that for each position in the order, there is some player batting in that position and property (4) states that two or more players are never batting in the same position in the list.

=== Seats and students of a classroom===
In a classroom there are a certain number of seats. A group of students enter the room and the instructor asks them to be seated. After a quick look around the room, the instructor declares that there is a bijection between the set of students and the set of seats, where each student is paired with the seat they are sitting in. What the instructor observed in order to reach this conclusion was that:
# Every student was in a seat (there was no one standing),
# No student was in more than one seat,
# Every seat had someone sitting there (there were no empty seats), and
# No seat had more than one student in it. 
The instructor was able to conclude that there were just as many seats as there were students, without having to count either set.

==More mathematical examples==
[[File:A bijection from the natural numbers to the integers.png|thumb|A bijection from the [[natural number]]s to the [[integer]]s, which maps 2''n'' to −''n'' and 2''n'' − 1 to ''n'', for ''n'' ≥ 0.]]
* For any set ''X'', the [[identity function]] '''1'''<sub>''X''</sub>: ''X'' → ''X'', '''1'''<sub>''X''</sub>(''x'') = ''x'' is bijective.
* The function ''f'': '''R''' → '''R''', ''f''(''x'') = 2''x'' + 1 is bijective, since for each ''y'' there is a unique ''x'' = (''y'' − 1)/2 such that ''f''(''x'') = ''y''. More generally, any [[linear function]] over the reals, ''f'': '''R''' → '''R''', ''f''(''x'') = ''ax'' + ''b'' (where ''a'' is non-zero) is a bijection. Each real number ''y'' is obtained from (or paired with) the real number ''x'' = (''y'' − ''b'')/''a''.
* The function ''f'': '''R''' → (−π/2, π/2), given by ''f''(''x'') = arctan(''x'') is bijective, since each real number ''x'' is paired with exactly one angle ''y'' in the interval (−π/2,&nbsp;π/2) so that tan(''y'') = ''x'' (that is, ''y'' = arctan(''x'')). If the [[codomain]]  (−π/2,&nbsp;π/2) was made larger to include an integer multiple of π/2, then this function would no longer be onto (surjective), since there is no real number which could be paired with the multiple of π/2 by this arctan function.
* The [[exponential function]], ''g'': '''R''' → '''R''', ''g''(''x'') = e<sup>''x''</sup>, is not bijective: for instance, there is no ''x'' in '''R''' such that ''g''(''x'') = −1, showing that ''g'' is not onto (surjective). However, if the codomain is restricted to the positive real numbers <math>\R^+ \equiv \left(0, \infty\right)</math>, then ''g'' would be bijective; its inverse (see below) is the [[natural logarithm]] function ln.
* The function ''h'': '''R''' → '''R'''<sup>+</sup>, ''h''(''x'') = ''x''<sup>2</sup> is not bijective: for instance, ''h''(−1) = ''h''(1) = 1, showing that ''h'' is not one-to-one (injective). However, if the [[domain of a function|domain]] is restricted to <math>\R^+_0 \equiv \left[0, \infty\right)</math>, then ''h'' would be bijective; its inverse is the positive square root function.
*By [[Schröder–Bernstein theorem]], given any two sets ''X'' and ''Y'', and two injective functions ''f'': ''X → Y'' and ''g'': ''Y → X'', there exists a bijective function ''h'': ''X → Y''.

==Inverses==
A bijection ''f'' with domain ''X'' (indicated by ''f'': ''X → Y'' in [[Function (mathematics)#Notation|functional notation]]) also defines a [[converse relation]] starting in ''Y'' and going to ''X'' (by turning the arrows around). The process of "turning the arrows around" for an arbitrary function does not, ''in general'', yield a function, but properties (3) and (4) of a bijection say that this inverse relation is a function with domain ''Y''. Moreover, properties (1) and (2) then say that this inverse ''function'' is a surjection and an injection, that is, the [[inverse function]] exists and is also a bijection. Functions that have inverse functions are said to be [[Invertible function|invertible]]. A function is invertible if and only if it is a bijection.

Stated in concise mathematical notation, a function ''f'': ''X → Y'' is bijective if and only if it satisfies the condition
:for every ''y'' in ''Y'' there is a unique ''x'' in ''X'' with ''y'' = ''f''(''x'').

Continuing with the baseball batting line-up example, the function that is being defined takes as input the name of one of the players and outputs the position of that player in the batting order. Since this function is a bijection, it has an inverse function which takes as input a position in the batting order and outputs the player who will be batting in that position.

==Composition==
[[Image:Bijective composition.svg|thumb|300px|A bijection composed of an injection (X → Y) and a surjection (Y → Z).]]

The [[Function composition|composition]] <math>g \,\circ\, f</math> of two bijections ''f'': ''X → Y'' and ''g'': ''Y → Z'' is a bijection, whose inverse is given by <math>g \,\circ\, f</math> is <math>(g \,\circ\, f)^{-1} \;=\; (f^{-1}) \,\circ\, (g^{-1})</math>.

Conversely, if the composition <math>g \, \circ\, f</math> of two functions is bijective, it only follows that ''f'' is [[Injective function|injective]] and ''g'' is [[surjective function|surjective]].

==Cardinality==
If ''X'' and ''Y'' are [[finite set]]s, then there exists a bijection between the two sets ''X'' and ''Y'' [[if and only if]] ''X'' and ''Y'' have the same number of elements. Indeed, in [[axiomatic set theory]], this is taken as the definition of "same number of elements" ([[equinumerosity]]), and generalising this definition to [[infinite set]]s leads to the concept of [[cardinal number]], a way to distinguish the various sizes of infinite sets.

== Properties ==
* A function ''f'': '''R''' → '''R''' is bijective if and only if its [[graph of a function|graph]] meets every horizontal and vertical line exactly once.
* If ''X'' is a set, then the bijective functions from ''X'' to itself, together with the operation of functional composition (<math>\circ</math>), form a [[group (algebra)|group]], the [[symmetric group]] of ''X'', which is denoted variously by S(''X''), ''S<sub>X</sub>'', or ''X''! (''X'' [[factorial]]).
* Bijections preserve [[cardinalities]] of sets: for a subset ''A'' of the domain with cardinality |''A''| and subset ''B'' of the codomain with cardinality |''B''|, one has the following equalities:
*:|''f''(''A'')| = |''A''| and |''f''<sup>−1</sup>(''B'')| = |''B''|.
*If ''X'' and ''Y'' are [[finite set]]s with the same cardinality, and ''f'': ''X → Y'', then the following are equivalent:
*# ''f'' is a bijection.
*# ''f'' is a [[surjection]].
*# ''f'' is an [[injection (mathematics)|injection]].
*For a finite set ''S'', there is a bijection between the set of possible [[total ordering]]s of the elements and the set of bijections from ''S'' to ''S''.  That is to say, the number of [[permutation]]s of elements of ''S'' is the same as the number of total orderings of that set—namely, ''n''!.

==Category theory==
Bijections are precisely the [[isomorphism]]s in the [[category theory|category]] ''[[Category of sets|Set]]'' of [[Set (mathematics)|sets]] and set functions.  However, the bijections are not always the isomorphisms for more complex categories.  For example, in the category ''[[Category of groups|Grp]]'' of [[Group (mathematics)|groups]], the morphisms must be [[homomorphism]]s since they must preserve the group structure, so the isomorphisms are ''group isomorphisms'' which are bijective homomorphisms.

==Generalization to partial functions==
The notion of one-to-one correspondence generalizes to [[partial functions]], where they are called ''partial bijections'', although partial bijections are only required to be injective. The reason for this relaxation is that a (proper) partial function is already undefined for a portion of its domain; thus there is no compelling reason to constrain its inverse to be a [[total function]], i.e. defined everywhere on its domain. The set of all partial bijections on a given base set is called the [[symmetric inverse semigroup]].<ref name="Hollings2014">{{cite book|author=Christopher Hollings|title=Mathematics across the Iron Curtain: A History of the Algebraic Theory of Semigroups|url=https://books.google.com/books?id=O9wJBAAAQBAJ&pg=PA251|date=16 July 2014|publisher=American Mathematical Society|isbn=978-1-4704-1493-1|page=251}}</ref>

Another way of defining the same notion is to say that a partial bijection from ''A'' to ''B'' is any relation 
''R'' (which turns out to be a partial function) with the property that ''R'' is the [[Graph of a function|graph of]] a bijection ''f'':''{{prime|A}}''→''{{prime|B}}'', where ''{{prime|A}}'' is a [[subset]] of ''A'' and ''{{prime|B}}'' is a subset of ''B''.<ref name="Borceux1994">{{cite book|author=Francis Borceux|title=Handbook of Categorical Algebra: Volume 2, Categories and Structures|url=https://books.google.com/books?id=5i2v9q0m5XAC&pg=PA289|year=1994|publisher=Cambridge University Press|isbn=978-0-521-44179-7|page=289}}</ref>

When the partial bijection is on the same set, it is sometimes called a ''one-to-one partial [[transformation (function)|transformation]]''.<ref name="Grillet1995">{{cite book|author=Pierre A. Grillet|title=Semigroups: An Introduction to the Structure Theory|url=https://books.google.com/books?id=yM544W1N2UUC&pg=PA228|year=1995|publisher=CRC Press|isbn=978-0-8247-9662-4|page=228}}</ref> An example is the [[Möbius transformation]] simply defined on the complex plane, rather than its completion to the extended complex plane.<ref name="Campbell2007">{{cite book|editor=C.M. Campbell |editor2=M.R. Quick |editor3=E.F. Robertson |editor4=G.C. Smith|title=Groups St Andrews 2005 Volume 2|year=2007|publisher=Cambridge University Press|isbn=978-0-521-69470-4|page=367|chapter=Groups and semigroups: connections and contrasts |author=John Meakin}} [http://www.math.unl.edu/~jmeakin2/groups%20and%20semigroups.pdf preprint] citing {{Cite journal
 | doi = 10.1006/jabr.1997.7242
| title = The Möbius Inverse Monoid
| journal = Journal of Algebra
| volume = 200
| issue = 2
| pages = 428–438
| year = 1998
| last1 = Lawson | first1 = M. V. 
| doi-access = free
}}</ref>

== Gallery ==
{{Gallery
|align=center
|Image:Injection.svg|An injective non-surjective function (injection, not a bijection)
|Image:Bijection.svg|An injective surjective function ('''bijection''')
|Image:Surjection.svg|A non-injective surjective function (surjection, not a bijection)
|Image:Not-Injection-Surjection.svg|A non-injective non-surjective function (also not a bijection)
}}

==See also==
{{Portal|Mathematics}}
* [[Ax–Grothendieck theorem]]
* [[Bijection, injection and surjection]]
* [[Bijective numeration]]
* [[Bijective proof]]
* [[Category theory]]
* [[Multivalued function]]

==Notes==
{{reflist}}

==References==
This topic is a basic concept in set theory and can be found in any text which includes an introduction to set theory. Almost all texts that deal with an introduction to writing proofs will include a section on set theory, so the topic may be found in any of these:

* {{cite book|first=Marshall Jr. |last=Hall|author-link=Marshall Hall (mathematician)|title=The Theory of Groups|year=1959|publisher=MacMillan}}
* {{cite book|last=Wolf|title=Proof, Logic and Conjecture: A Mathematician's Toolbox|year=1998|publisher=Freeman}}
* {{cite book|last=Sundstrom|title=Mathematical Reasoning: Writing and Proof|year=2003|publisher=Prentice-Hall}}
* {{cite book|last1=Smith|last2=Eggen|last3=St.Andre|title=A Transition to Advanced Mathematics (6th Ed.)|year=2006|publisher=Thomson (Brooks/Cole)}}
* {{cite book|last=Schumacher|title=Chapter Zero: Fundamental Notions of Abstract Mathematics|year=1996|publisher=Addison-Wesley}}
* {{cite book|last=O'Leary|title=The Structure of Proof: With Logic and Set Theory|year=2003|publisher=Prentice-Hall}}
* {{cite book|last=Morash|title=Bridge to Abstract Mathematics|publisher=Random House}}
* {{cite book|last=Maddox|title=Mathematical Thinking and Writing|year=2002|publisher=Harcourt/ Academic Press}}
* {{cite book|last=Lay|title=Analysis with an introduction to proof|year=2001|publisher=Prentice Hall}}
* {{cite book|last1=Gilbert|last2=Vanstone|title=An Introduction to Mathematical Thinking|year=2005|publisher=Pearson Prentice-Hall}}
* {{cite book|last1=Fletcher|last2=Patty|title=Foundations of Higher Mathematics|publisher=PWS-Kent}}
* {{cite book|last1=Iglewicz|last2=Stoyle|title=An Introduction to Mathematical Reasoning|publisher=MacMillan}}
* {{cite book|last=Devlin|first=Keith|title=Sets, Functions, and Logic: An Introduction to Abstract Mathematics|year=2004|publisher=Chapman & Hall/ CRC Press}}
* {{cite book|last1=D'Angelo|last2=West|title=Mathematical Thinking: Problem Solving and Proofs|year=2000|publisher=Prentice Hall}}
* {{cite book|last=Cupillari|author-link= Antonella Cupillari |title=The Nuts and Bolts of Proofs|year= 1989 |url=https://archive.org/details/nutsboltsofproof00anto|url-access=registration|publisher=Wadsworth|isbn= 9780534103200 }}
* {{cite book|last=Bond|title=Introduction to Abstract Mathematics|publisher=Brooks/Cole}}
* {{cite book|last1=Barnier|last2=Feldman|title=Introduction to Advanced Mathematics|year=2000|publisher=Prentice Hall}}
* {{cite book|last=Ash|title=A Primer of Abstract Mathematics|publisher=MAA}}

==External links==
{{Commons category|Bijectivity}}
* {{springer|title=Bijection|id=p/b016230}}
* {{MathWorld|title=Bijection|urlname=Bijection}}
* [http://jeff560.tripod.com/i.html Earliest Uses of Some of the Words of Mathematics: entry on Injection, Surjection and Bijection has the history of Injection and related terms.]

{{Set theory}}
{{Mathematical logic}}

[[Category:Functions and mappings]]
[[Category:Basic concepts in set theory]]
[[Category:Mathematical relations]]
[[Category:Types of functions]]