Section 3.2 – Inverses and Compositions

Example

Let $f: A \mapsto B$,

and,

Solution

$f$ is one-to-one and onto since every element in $B$ is related to exactly one element in $A$, it is therefore a bijection. $g$ is not one-to-one since both $3$ and $4$ map to $c$ but it is onto since every element in $C$ is mapped to.

Reversing the order of each pair in $f$ gives its inverse $f^{-1}: B \mapsto A$, where,

$g$ does not have an inverse since it wouldn't be a function.

Inverses

definition: A function $f: A \mapsto B$ has an inverse,

if and only if the relation obtained by reversing $f$'s ordered pairs is a function and is defined by,

To find the inverse,

  1. Switch $x$ and $y$,
  2. Solve for $y$.

Example

Find $f^{-1}: \mathbb R \setminus { 1} \mapsto \mathbb R \setminus {2}$ where,

Solution

Proposition

A function $f$ has an inverse if and only if $f$ is a bijection (it's one-to-one and onto).

Fact

So every inverse is a bijection as well.

Compositions

definition: The composition of $g: B \mapsto C$ with $f: A \mapsto B$ is,

Example

Solution

Potatoes.

Notation

  • $f^2 = f \circ f$
  • $f^n = f \circ f \circ ... \circ f$

Proposition

if $f: A \mapsto B$ and $g: B \mapsto C$ are bijections, then $g \circ f$ is also a bijection.

Proof

(one-to-one) Supposed that $g \circ f(x_1) = g \circ f(x_2)$, for some $x_1, x_2 \in A$, or in another notation,

Since $g$ is one-to-one and $g(f(x_1)) = g(f(x_2))$,

then since, $f$ is one-to-one and $f(x_1) = f(x_2)$,

So $g \circ f$ is one-to-one.

(onto) Consider $c \in C$, since $g$ is onto,

and since $f$ is onto,

and $g \circ f$ is onto.

Since $g \circ f$ is one-to-one and onto it is a bijection.

Inverses and Identities

Proposition

Given two functions $f: A \mapsto B$ and $g: B \mapsto A$ are inverses if and only is their compositions are identities.

Example

Solution