Math 2.0

definition

Composition of relations

Definition

Let AA, BB and CC be sets, let R⊆A×BR \subseteq A \times B and let S⊆B×CS \subseteq B \times C be binary relations. The composition of RR and SS is the relation from AA to CC R;S={(a,c)∈A×C∣∃b∈B, aRb and bSc}.R \mathbin{;} S = \{(a, c) \in A \times C \mid \exists b \in B, \, a \mathrel{R} b \text{ and } b \mathrel{S} c\}.

Remarks

Many authors write S∘RS \circ R for R;SR \mathbin{;} S. This order agrees with function composition. Composition of relations is associative. A relation RR on a set is transitive exactly when R;R⊆RR \mathbin{;} R \subseteq R.

Explanations

L1 human

Let RR be "is a parent of" and let SS be "is a parent of" again. Then R;SR \mathbin{;} S is "is a grandparent of": you go from a person to a child, then from the child to a grandchild.

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/Composition_of_relations, lead section