Math 2.0

definition

Multiplication of natural numbers

Definition

Let N\mathbb{N} be the set of natural numbers, let SS be the successor function and let ++ be the addition of N\mathbb{N}. Multiplication is the function ⋅ ⁣:N×N→N\cdot \colon \mathbb{N} \times \mathbb{N} \to \mathbb{N}, (a,b)↦a⋅b(a, b) \mapsto a \cdot b, with these two properties for all aa and bb in N\mathbb{N}: a⋅0=0,a⋅S(b)=a⋅b+a.a \cdot 0 = 0, \qquad a \cdot S(b) = a \cdot b + a.

Remarks

For each aa, these equations are a definition by recursion on bb. Thus exactly one such function exists. From the definition, a⋅1=a⋅0+a=aa \cdot 1 = a \cdot 0 + a = a. We often write abab for a⋅ba \cdot b.

Explanations

L1 human

Multiplication is repeated addition: 3⋅43 \cdot 4 is 3+3+3+3=123 + 3 + 3 + 3 = 12. The definition says this in two rules: zero copies give 00, and one more copy adds one more aa.

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

To read this node, read these 6 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. Definition by recursion concept
  2. Natural numbers object
  3. Peano axioms concept
  4. Successor function definition
  5. Addition of natural numbers definition
  6. Multiplication of natural numbers definition

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Multiplication, Product of two natural numbers
  2. Web https://en.wikipedia.org/wiki/Peano_axioms, Multiplication