Math 2.0

statement proposition

Tower law for indices

Statement

Let GG be a group, let HH be a subgroup of GG, and let KK be a subgroup of HH. Then [G:K]=[G:H]⋅[H:K][G : K] = [G : H] \cdot [H : K], where [⋅:⋅][\cdot : \cdot] is the index.

Remarks

The equation holds as an equation of cardinal numbers; in particular [G:K][G : K] is finite if and only if [G:H][G : H] and [H:K][H : K] are both finite. For example, in (Z,+)(\mathbb{Z}, +) with H=2ZH = 2\mathbb{Z} and K=6ZK = 6\mathbb{Z}, the indices are [Z:6Z]=6=2⋅3[\mathbb{Z} : 6\mathbb{Z}] = 6 = 2 \cdot 3.

Explanations

L1 human

Each coset of HH in GG splits into [H:K][H : K] cosets of KK. So the number of cosets of KK is the number of cosets of HH times [H:K][H : K]. It is like a box with several drawers, each with the same number of compartments.

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 5 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. Subgroup definition
  3. Left coset definition
  4. Index of a subgroup definition
  5. Tower law for indices statement

Sources

  1. Web https://en.wikipedia.org/wiki/Index_of_a_subgroup, Properties