Let \(A,B,C\) be sets. The following lemma shows that the composition of relations preserves the properties of a function.

Lemma: Composition of Functions

Let \(f:A\mapsto B\) and \(g:B\mapsto C\) be functions. The composition $g\circ f\subseteq A\times C$ of the corresponding relations $f\subseteq A\times B$ and $g\subseteq B\times C$ is also a function defined by

$$(g\circ f):A\to C,\;(g\circ f)(a):=g(f(a))$$

and called the composition of functions.

Examples

composition

If, for instance, $A=\mathbb R\to \mathbb R, f(x)=x^2$ and $g:\mathbb R\to \mathbb R, g(x)=x+2$, then $$(g\circ f)(x)=g(f(x))=g(x^2)=x^2+2,$$ and $$(f\circ g)(x)=f(g(x))=f(x+2)=x^2+2{x}+4.$$

Proofs: 1

  1. Proposition: Composition of Functions is Associative
  2. Proposition: Composition of Surjective Functions is Surjective
  3. Proposition: Composition of Injective Functions is Injective
  4. Proposition: Composition of Bijective Functions is Bijective
  5. Proposition: Injective, Surjective and Bijective Compositions
  6. Proposition: The Inverse Of a Composition

Definitions: 1 2 3 4 5 6 7
Examples: 8
Parts: 9
Proofs: 10 11 12 13 14 15 16 17 18 19
Propositions: 20 21 22 23 24 25 26 27 28 29 30


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

  1. Reinhardt F., Soeder H.: "dtv-Atlas zur Mathematik", Deutsche Taschenbuch Verlag, 1994, 10th Edition