Math 2.0

statement proposition

Associativity of composition

Statement

Let f ⁣:A→Bf \colon A \to B, g ⁣:B→Cg \colon B \to C and h ⁣:C→Dh \colon C \to D be functions. Then h∘(g∘f)=(h∘g)∘f.h \circ (g \circ f) = (h \circ g) \circ f.

Remarks

Both sides send each a∈Aa \in A to h(g(f(a)))h(g(f(a))), so they are equal. Because of this law, one can write h∘g∘fh \circ g \circ f without brackets. With the identity functions, the functions from a set to itself form a monoid under composition.

Explanations

L1 human

When three machines are chained, it does not matter which two you connect first. The input passes through ff, then gg, then hh in both cases.

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/Function_composition, Properties