Math 2.0

definition

Left inverse

Definition

Let f ⁣:A→Bf \colon A \to B be a function. A left inverse of ff is a function g ⁣:B→Ag \colon B \to A such that g∘f=idAg \circ f = \mathrm{id}_A, that is, g(f(a))=ag(f(a)) = a for each a∈Aa \in A.

Remarks

A function with a nonempty domain has a left inverse exactly when it is injective. See injective iff it has a left inverse. A left inverse is in general not unique. Its values on B∖f(A)B \setminus f(A) can be any elements of AA. If gg is a left inverse of ff, then ff is a right inverse of gg.

Explanations

L1 human

Let f ⁣:N→Nf \colon \mathbb{N} \to \mathbb{N} be f(n)=n+1f(n) = n + 1. The function gg with g(n)=n−1g(n) = n - 1 for n≥1n \ge 1 and g(0)=0g(0) = 0 is a left inverse: g(f(n))=ng(f(n)) = n. But f(g(0))=1≠0f(g(0)) = 1 \neq 0, so gg is not an inverse on both sides.

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.

What depends on this

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Inverse_function, Left inverses