Math 2.0

proof

Proof of Lagrange's theorem

Proof

  1. Let GG be a finite group and let HH be a subgroup of GG.
  2. For a,b∈Ga, b \in G, let a∼ba \sim b when a−1b∈Ha^{-1}b \in H. Since HH contains the identity, inverses and products, this relation is reflexive, symmetric and transitive.
  3. The class of aa under ∼\sim is the left coset aHaH, because a−1b∈Ha^{-1}b \in H exactly when b∈aHb \in aH.
  4. The equivalence classes form a partition of GG. Thus GG is the disjoint union of kk distinct left cosets for some integer k≥1k \ge 1.
  5. [[Each left coset has ∣H∣|H| elements|0DKMBWTD7P]].
  6. Thus ∣G∣=k ∣H∣|G| = k\,|H|, and ∣H∣|H| divides ∣G∣|G|.

Idea

The left cosets of the subgroup cut the group into blocks of equal size. The order of the group is the number of blocks times the size of one block.

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 depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Lagrange%27s_theorem_(group_theory), Proof