Injection

From Maths
Revision as of 11:53, 26 September 2016 by Alec (Talk | contribs) (Added navbox... this page does need updating though)

Jump to: navigation, search

An injective function is 1:1, but not nessasarally onto.

Definition

For a function f:X\rightarrow Y every element of X is mapped to an element of Y and no two distinct things in X are mapped to the same thing in Y. That is[1]:

  • \forall x_1,x_2\in X[f(x_1)=f(x_2)\implies x_1=x_2]

Or equivalently:

  • \forall x_1,x_2\in X[x_1\ne x_2\implies f(x_1)\ne f(x_2)] (the contrapositive of the above)

Statements

Notes

Terminology

  • An injective function is sometimes called an embedding[1]
  • Just as surjections are called 'onto' an injection may be called 'into'[2] however this is rare and something I frown upon.
    • This is French, from "throwing into" referring to the domain, not elements themselves (as any function takes an element into the codomain, it need not be one-to-one)
    • I do not like using the word into but do like onto - I say:
      "But f maps A onto B so...."
      "But f is an injection so...."
      "As f is a bijection..."
    • I see into used rarely to mean injection, and in fact any function f:X\rightarrow Y being read as f takes X into Y without meaning injection[1][3]

Properties

  • The cardinality of the inverse of an element y\in Y may be no more than 1
    • Note this means it may be zero
      In contrast to a bijection where the cardinality is always 1 (and thus we take the singleton set f^{-1}(y)=\{x\} as the value it contains, writing f^{-1}(y)=x)

See also

References

  1. Jump up to: 1.0 1.1 1.2 Analysis: Part 1 - Elements - Krzysztof Maurin
  2. Jump up http://mathforum.org/library/drmath/view/52454.html
  3. Jump up Real and Abstract Analysis - Edwin Hewitt and Karl Stromberg