Bijective function: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(minor upgrade)
imported>Richard Pinch
(subpages)
Line 1: Line 1:
{{subpages}}
'''Bijective function''' is a [[function (mathematics)|function]] that establishes a ''one-to-one correspondence'' between elements of two given [[set]]s. Loosely speaking, ''all'' elements of those sets can be matched up in pairs so that each element of one set has its counterpart in the second set.
'''Bijective function''' is a [[function (mathematics)|function]] that establishes a ''one-to-one correspondence'' between elements of two given [[set]]s. Loosely speaking, ''all'' elements of those sets can be matched up in pairs so that each element of one set has its counterpart in the second set.



Revision as of 13:38, 2 November 2008

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

Bijective function is a function that establishes a one-to-one correspondence between elements of two given sets. Loosely speaking, all elements of those sets can be matched up in pairs so that each element of one set has its counterpart in the second set.

More formally, a function Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f} from set Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle X} to set Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle Y} is called a bijection if and only if for each Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle y} in Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle Y} there exists exactly one Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x} in Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle X} such that Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f(x)=y} .

For example, a function from set to set defined by formula is bijection.

Less obvious example is function from the set of all pairs (x,y) of positive integers to the set of all positive integers given by formula .

Function is another example of bijection.

A bijective function from a set X to itself is also called a permutation of the set X.

Composition

If and are bijections than so is their composition .

A function is a bijective function if and only if there exists function such that their compositions and are identity functions on relevant sets. In this case we call function an inverse function of and denote it by .

Bijections and the concept of cardinality

Two finite sets have the same number of elements if and only if there exists a bijection from one set to another. Georg Cantor generalized this simple observation to infinite sets and introduced the concept of cardinality of a set. We say that two set are equinumerous (sometimes also equipotent or equipollent) if there exists a bijection from one set to another. If this is the case, we say the set have the same cardinality or the same cardinal number. Cardinal number can be thought of as a generalization of number of elements of final set.

Some more examples

  1. A function is a bijection iff it is both an injection and a surjection.
  2. The quadratic function is neither injection nor surjection, hence is not bijection. However if we change its domain and codomain to the set Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle [0,+\infty)} than the function becomes bijective and the inverse function Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \sqrt\colon [0,+\infty)\to[0,+\infty),\ x\mapsto \sqrt{x}} exists. This procedure is very common in mathematics, especially in calculus.
  3. A continuous function from the closed interval Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle [a,b]} in the real line to closed interval Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle [c,d]} is bijection if and only if is monotonic funtion with f(a) = c and f(b) = d.