Search results

Page title matches

• Bijective function
  ...t each element of one set has its unique counterpart in the second set. A bijective function from a set X to itself is also called a '''permutation''' of the set X. The most important property of a bijective function is the existence of an [[inverse function]] which ''undoes'' the operation
  4 KB (618 words) - 22:24, 7 February 2010
• Bijective function/Definition
  122 bytes (17 words) - 13:14, 13 November 2008
• Bijective function/Related Articles
  907 bytes (142 words) - 14:42, 2 November 2008

Page text matches

• One-to-one correspondence
  #REDIRECT [[Bijective function]]
  32 bytes (3 words) - 12:38, 2 November 2008
• Bijection
  #REDIRECT [[Bijective function]]
  32 bytes (3 words) - 12:38, 2 November 2008
• Inverse function
  ...first. Not every function has an inverse, and those that do are called [[bijective function|invertible]] (or bijective).
  1 KB (173 words) - 20:09, 27 November 2008
• Homeomorphism
  ...t maps one [[topological space]] to another with the property that it is [[bijective function|bijective]] and both the function and its [[inverse function|inverse]] are #f is a bijective function (i.e., it is [[injective function|one-to-one]] and [[surjective function|on
  2 KB (265 words) - 07:44, 4 January 2009
• Bijective function
  ...t each element of one set has its unique counterpart in the second set. A bijective function from a set X to itself is also called a '''permutation''' of the set X. The most important property of a bijective function is the existence of an [[inverse function]] which ''undoes'' the operation
  4 KB (618 words) - 22:24, 7 February 2010
• Surjective function
  * [[Bijective function]]
  710 bytes (120 words) - 13:08, 13 November 2008
• Inverse function/Related Articles
  {{r|Bijective function}}
  739 bytes (92 words) - 17:31, 11 January 2010
• Injective function
  * [[Bijective function]]
  894 bytes (148 words) - 12:23, 13 November 2008
• Calculus/Related Articles
  {{r|Bijective function}}
  1 KB (136 words) - 11:36, 11 January 2010
• Identity function/Related Articles
  {{r|Bijective function}}
  568 bytes (70 words) - 17:23, 11 January 2010
• Cardinal number/Related Articles
  {{r|Bijective function}}
  370 bytes (47 words) - 17:50, 26 June 2009
• Injective function/Related Articles
  {{r|Bijective function}}
  907 bytes (142 words) - 13:06, 13 November 2008
• Surjective function/Related Articles
  {{r|Bijective function}}
  906 bytes (142 words) - 13:12, 13 November 2008
• Function (mathematics)/Related Articles
  {{r|Bijective function}}
  1 KB (172 words) - 15:25, 15 May 2011
• Conjugation (group theory)
  Since <math>T_y</math> is thus a [[bijective function]], with [[inverse function]] <math>T_{y^{-1}}</math>, it is an [[automorph
  2 KB (294 words) - 04:53, 19 November 2008
• Integer/Related Articles
  {{r|Bijective function}}
  2 KB (247 words) - 17:28, 11 January 2010
• Schröder-Bernstein theorem
  then there is a bijective function from ''A'' onto ''B''. The bijective function between the two sets can be explicitly constructed from the two injective f
  8 KB (1,281 words) - 15:39, 23 September 2013
• Schröder-Bernstein theorem/Citable Version
  then there is a bijective function from ''A'' onto ''B''. The bijective function between the two sets can be explicitly constructed from the two injective f
  8 KB (1,275 words) - 15:34, 23 September 2013
• Galileo's paradox
  ...f the other. (This is an early use, though not the first, of a proof by [[bijective function|one-to-one correspondence]] of infinite sets.)
  1 KB (198 words) - 01:29, 12 July 2008
• Field automorphism
  ...e [[algebraic structure]] of a [[field (mathematics)|field]], that is, a [[bijective function]] from the field onto itself which respects the fields operations of additi
  3 KB (418 words) - 12:18, 20 December 2008