Math 2.0

definition

Associativity

Definition

Let SS be a set and let ∗\ast be a binary operation on SS. The operation ∗\ast is associative when (a∗b)∗c=a∗(b∗c)(a \ast b) \ast c = a \ast (b \ast c) for all a,b,c∈Sa, b, c \in S.

Remarks

Addition and multiplication of real numbers are associative. Subtraction of integers is not associative: (1−1)−1=−1(1 - 1) - 1 = -1, but 1−(1−1)=11 - (1 - 1) = 1. Composition of maps from a set to itself is associative. For an associative operation, each way to put parentheses in a1∗a2∗⋯∗ana_1 \ast a_2 \ast \cdots \ast a_n gives the same result.

Explanations

L1 human

Associativity says that you can do the operations in a chain in any grouping. For example, (2+3)+4(2 + 3) + 4 and 2+(3+4)2 + (3 + 4) are both 99. Thus we can write 2+3+42 + 3 + 4 without parentheses.

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 this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Binary operation definition
  2. Associativity definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Associative_property, Definition