Math 2.0

statement theorem

Correspondence between equivalence relations and partitions

Statement

Let AA be a set. Send each equivalence relation ∼\sim on AA to its set of equivalence classes A/∼A/{\sim}. This map is a bijection from the set of equivalence relations on AA to the set of partitions of AA. Its inverse sends a partition PP to the relation ∼P\sim_P with a∼Pba \sim_P b when aa and bb are in the same block of PP.

Remarks

The relation ∼P\sim_P is an equivalence relation, and its classes are the blocks of PP. A smaller equivalence relation, one that relates fewer pairs, gives a finer partition. The number of partitions of a set with nn elements is the Bell number BnB_n. For example, B3=5B_3 = 5.

Explanations

L1 human

An equivalence relation and a partition are two descriptions of the same thing. From the relation you get the boxes, and from the boxes you get the relation "is in the same box as".

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/Partition_of_a_set, Partitions and equivalence relations