Math 2.0

Combinatorics Theorem

Rule of product

Builds on Cardinality of a finite set

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.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cardinality of a finite set definition
  2. Rule of product statement

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Rule_of_product, lead section
About this page
Tag0VPK4X73Q0
URIm2://0VPK4X73Q0
Aliasesmultiplication-principle, product-rule
Kindstatement, theorem
WritingW1 stated
MSC05A05
StatusThis copy of the site has no build data. Run m2 status 0VPK4X73Q0.
UsesCardinality of a finite set
Same as

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

Used by