Math 2.0

definition

Function composition

Definition

Let f ⁣:A→Bf \colon A \to B and g ⁣:B→Cg \colon B \to C be functions. The composition of gg and ff is the function g∘f ⁣:A→Cg \circ f \colon A \to C with (g∘f)(a)=g(f(a))(g \circ f)(a) = g(f(a)) for each a∈Aa \in A.

Remarks

Read g∘fg \circ f as "gg after ff": ff acts first. In general g∘f≠f∘gg \circ f \neq f \circ g. For f(x)=x+1f(x) = x + 1 and g(x)=2xg(x) = 2x on R\mathbb{R}, (g∘f)(x)=2x+2(g \circ f)(x) = 2x + 2 and (f∘g)(x)=2x+1(f \circ g)(x) = 2x + 1. Composition is associative. See associativity of composition.

Explanations

L1 human

Composition chains two machines: the output of ff goes into gg. For g∘fg \circ f to make sense, the values of ff must lie in the domain of gg.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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

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

Sources

  1. Web https://en.wikipedia.org/wiki/Function_composition, lead section