Math 2.0

statement proposition

Orbits partition the set

Statement

Let a group GG act on a set XX. The relation x∼yx \sim y if and only if y=g⋅xy = g \cdot x for some g∈Gg \in G is an equivalence relation on XX. Its equivalence classes are the orbits, so each point of XX lies in exactly one orbit.

Remarks

Reflexivity uses e⋅x=xe \cdot x = x, symmetry uses x=g−1⋅(g⋅x)x = g^{-1} \cdot (g \cdot x), and transitivity uses h⋅(g⋅x)=(hg)⋅xh \cdot (g \cdot x) = (hg) \cdot x. If XX is finite, then ∣X∣|X| is the sum of the sizes of the distinct orbits. The cosets of a subgroup and the conjugacy classes of a group are examples of orbits.

Explanations

L1 human

The group action cuts the set into separate pieces, the orbits. Inside one piece, each point can reach each other point. No point can reach a point of another piece.

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. Group concept
  2. Group homomorphism definition
  3. Symmetric group definition
  4. Group action definition
  5. Orbit definition
  6. Orbits partition the set statement

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Group_action, Orbits and stabilizers