Math 2.0

statement proposition

Bijective iff it has a two-sided inverse

Statement

Let f ⁣:A→Bf \colon A \to B be a function. Then ff is bijective if and only if there is a function g ⁣:B→Ag \colon B \to A with g∘f=idAg \circ f = \mathrm{id}_A and f∘g=idBf \circ g = \mathrm{id}_B.

Remarks

The function gg is then unique. It is the inverse function f−1f^{-1}. This statement does not need the axiom of choice: for a bijection, g(b)g(b) is the unique aa with f(a)=bf(a) = b. If ff has a left inverse gg and a right inverse hh, then g=hg = h.

Explanations

L1 human

A bijection can be undone in both directions. Going from AA to BB and back gives the start point, and going from BB to AA and back gives the start point too.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Inverse_function, Two-sided inverses