Difference between revisions of "Surjection"
From Maths
m |
m (→Theorems) |
||
Line 6: | Line 6: | ||
* Equivalently <math>\forall y\in Y</math> the set <math>f^{-1}(y)</math> is non-empty. That is <math>f^{-1}(y)\ne\emptyset</math> | * Equivalently <math>\forall y\in Y</math> the set <math>f^{-1}(y)</math> is non-empty. That is <math>f^{-1}(y)\ne\emptyset</math> | ||
==Theorems== | ==Theorems== | ||
− | |||
{{Begin Theorem}} | {{Begin Theorem}} | ||
− | + | The composition of surjective functions is surjective | |
{{Begin Proof}} | {{Begin Proof}} | ||
Let {{M|f:X\rightarrow Y}} and {{M|g:Y\rightarrow Z}} be surjective maps, then their composition, {{M|1=g\circ f=h:X\rightarrow Z}} is surjective. | Let {{M|f:X\rightarrow Y}} and {{M|g:Y\rightarrow Z}} be surjective maps, then their composition, {{M|1=g\circ f=h:X\rightarrow Z}} is surjective. |
Revision as of 17:19, 10 May 2015
Surjective is onto - for f:A→B every element of B is mapped onto from at least one thing in A
Contents
[hide]Definition
Given a function f:X→Y, we say f is surjective if:
- ∀y∈Y∃x∈X[f(x)=y]
- Equivalently ∀y∈Y the set f−1(y) is non-empty. That is f−1(y)≠∅
Theorems
[Expand]
The composition of surjective functions is surjective
See also
References
- Jump up ↑ Alec Teal's (own) work