Math 2.0

statement proposition

Injective iff it has a left inverse

Statement

Let AA be a nonempty set, let BB be a set and let f ⁣:A→Bf \colon A \to B be a function. Then ff is injective if and only if ff has a left inverse.

Remarks

The hypothesis that AA is nonempty is necessary. The empty function from ∅\varnothing to a nonempty set is injective, but there is no function from a nonempty set to ∅\varnothing. To build a left inverse, fix a0∈Aa_0 \in A. Send each b=f(a)b = f(a) to aa, and send each b∉f(A)b \notin f(A) to a0a_0.

Explanations

L1 human

An injective function loses no information, so you can go back from each value to its unique input. The values that ff never takes can go anywhere, and you need one point a0a_0 to send them to.

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, Left inverses