Difference between revisions of "Function"
From Maths
m |
m |
||
| Line 1: | Line 1: | ||
A function {{M|f}} is a special kind of [[Relation|relation]] | A function {{M|f}} is a special kind of [[Relation|relation]] | ||
| − | + | __TOC__ | |
| − | == | + | ==Definition== |
| − | A function | + | A function is a special kind [[relation]]<ref name="API">Analysis - Part 1: Elements - Krzysztof Maurin</ref>, for a relation: |
| − | = | + | * {{M|f\subseteq X\times Y}} |
| − | + | We must have: | |
| − | * | + | * {{M|f}} being a ''right-unique'' relation, recall that is: |
| − | * | + | ** For a relation {{M|\mathcal{R}\subseteq X\times Y}} we have {{M|1=\forall x\in X\forall y,z\in Y[(x\mathcal{R}y\wedge x\mathcal{R}z)\implies y=z]}} |
| − | + | * Everything maps to something | |
| − | + | Then we write: {{M|f:X\rightarrow Y}}<ref name="API"/> | |
| − | + | Furthermore, if {{M|(x,y)\in f}} (which is to say {{M|xfy}} or {{M|f}} relates {{M|x}} to {{M|y}}) we write: | |
| + | * {{M|1=f(x)=y}} or {{M|f:x\mapsto y}} | ||
| + | ==Notation when [[Tuple|tuples]] are involved== | ||
| + | It is often convenient to write things like {{M|f:(A,B)\rightarrow(C,D,E)}} where {{M|(A,B)}} is a space with some useful property, this always means {{M|f:A\rightarrow C}}, for example: | ||
* If we have say two [[Topological space|topological spaces]] {{M|(X,\mathcal{J})}} and {{M|(Y,\mathcal{K})}} then we may write: | * If we have say two [[Topological space|topological spaces]] {{M|(X,\mathcal{J})}} and {{M|(Y,\mathcal{K})}} then we may write: | ||
** {{M|f:(X,\mathcal{J})\rightarrow(Y,\mathcal{K})}} and mean {{M|f:X\rightarrow Y}} | ** {{M|f:(X,\mathcal{J})\rightarrow(Y,\mathcal{K})}} and mean {{M|f:X\rightarrow Y}} | ||
* '''That is to say that as a general rule given a function {{M|f:(A_1,A_2,\cdots)\rightarrow(B_1,B_2,\cdots)}} take it as a function {{M|f:A_1\rightarrow B_1}}''' | * '''That is to say that as a general rule given a function {{M|f:(A_1,A_2,\cdots)\rightarrow(B_1,B_2,\cdots)}} take it as a function {{M|f:A_1\rightarrow B_1}}''' | ||
| − | ** A [[Tuple|tuple]] makes no sense there anyway, for multiple arguments we | + | ** A [[Tuple|tuple]] makes no sense there anyway, for multiple arguments we write the [[Cartesian product]], so {{M|f:A\times B\rightarrow C\times D\times 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==== | ||
| + | * <math>f:\mathbb{R}\rightarrow\mathbb{R}</math> given by <math>f(x)=\frac{1}{x}</math> isn't defined at <math>0</math>, it should be: {{M|f:\mathbb{R}-\{0\}\rightarrow\mathbb{R} }} with {{M|f:x\rightarrow\frac{1}{x} }} | ||
| + | * <math>f:\mathbb{R}\rightarrow\mathbb{R}</math> given by <math>f(x)=x^2</math> is correct, it is not [[Surjection|surjective]] though, because nothing maps onto the negative numbers, however <math>f:\mathbb{R}\rightarrow\mathbb{R}_{\ge 0}</math> with <math>f(x)=x^2</math> is a surjection. It is not an [[Injection|injective function]] as only <math>0</math> maps to one point. | ||
| + | ==Alternative names== | ||
| + | A function may {{AKA}}: | ||
| + | * mapping<ref name="API"/> | ||
| + | * map<ref name="API"/> | ||
| + | * correspondence | ||
| + | ==See also== | ||
| + | * [[Surjection]] | ||
| + | * [[Bijection]] | ||
| + | * [[Injection]] | ||
==References== | ==References== | ||
<references/> | <references/> | ||
{{Definition|Set Theory}} | {{Definition|Set Theory}} | ||
Revision as of 18:36, 28 August 2015
A function f is a special kind of relation
Contents
[<hidetoc>]Definition
A function is a special kind relation[1], for a relation:
- f⊆X×Y
We must have:
- f being a right-unique relation, recall that is:
- For a relation R⊆X×Y we have ∀x∈X∀y,z∈Y[(xRy∧xRz)⟹y=z]
- Everything maps to something
Then we write: f:X→Y[1] Furthermore, if (x,y)∈f (which is to say xfy or f relates x to y) we write:
- f(x)=y or f:x↦y
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:A→C, 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:X→Y
- That is to say that as a general rule given a function f:(A1,A2,⋯)→(B1,B2,⋯) take it as a function f:A1→B1
- A tuple makes no sense there anyway, for multiple arguments we write the Cartesian product, so f:A×B→C×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:R→R given by f(x)=1x isn't defined at 0, it should be: f:R−{0}→R with f:x→1x
- f:R→R given by f(x)=x2 is correct, it is not surjective though, because nothing maps onto the negative numbers, however f:R→R≥0 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:
See also
References
- ↑ Jump up to: 1.0 1.1 1.2 1.3 Analysis - Part 1: Elements - Krzysztof Maurin
