Function

From Maths
Revision as of 18:36, 28 August 2015 by Alec (Talk | contribs)

Jump to: navigation, search

A function f is a special kind of relation

Definition

A function is a special kind relation[1], for a relation:

  • fX×Y

We must have:

  • f being a right-unique relation, recall that is:
    • For a relation RX×Y we have xXy,zY[(xRyxRz)y=z]
  • Everything maps to something

Then we write: f:XY[1] Furthermore, if (x,y)f (which is to say xfy or f relates x to y) we write:

  • f(x)=y or f:xy

Notation when tuples are involved

It is often convenient to write things like f:(A,B)(C,D,E) where (A,B) is a space with some useful property, this always means f:AC, for example:

  • If we have say two topological spaces (X,J) and (Y,K) then we may write:
    • f:(X,J)(Y,K) and mean f:XY
  • That is to say that as a general rule given a function f:(A1,A2,)(B1,B2,) take it as a function f:A1B1
    • A tuple makes no sense there anyway, for multiple arguments we write the Cartesian product, so f:A×BC×D×E say.

Conventions

We've now covered the formal definition of a function, however conventionally sometimes these are broken

Functions and their domain

A function ought be defined for everything in its domain, that's for every point in the domain the function maps the point to something. Often mathematicians don't bother (as Mathematicians are lazy) especially if the number of undefined points is finite.

Examples

  • f:RR given by f(x)=1x isn't defined at 0, it should be: f:R{0}R with f:x1x
  • f:RR given by f(x)=x2 is correct, it is not surjective though, because nothing maps onto the negative numbers, however f:RR0 with f(x)=x2 is a surjection. It is not an injective function as only 0 maps to one point.

Alternative names

A function may AKA:

  • mapping[1]
  • map[1]
  • correspondence

See also

References

  1. Jump up to: 1.0 1.1 1.2 1.3 Analysis - Part 1: Elements - Krzysztof Maurin