Math 2.0

statement theorem

Rule of product

Statement

Let AA and BB be finite sets. Then the Cartesian product A×B={(a,b):a∈A,b∈B}A \times B = \{(a, b) : a \in A, b \in B\} is finite and ∣A×B∣=∣A∣⋅∣B∣|A \times B| = |A| \cdot |B|.

More generally, for finite sets A1,…,AkA_1, \dots, A_k, the product A1×⋯×AkA_1 \times \dots \times A_k has ∣A1∣⋯∣Ak∣|A_1| \cdots |A_k| elements.

Remarks

A common form of the rule: a choice is made in kk steps, and step ii has nin_i options, whatever the earlier steps are. Then there are n1n2⋯nkn_1 n_2 \cdots n_k choices in total. The number of functions between finite sets is a direct consequence.

Explanations

L1 human

If you choose one item from a first group and then one item from a second group, you multiply the sizes. For example, with 3 shirts and 4 trousers there are 3⋅4=123 \cdot 4 = 12 outfits.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (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. Cardinality of a finite set definition
  2. Rule of product statement

What depends on this

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

Sources

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