Math 2.0

statement corollary

g to the order of the group is the identity

Statement

Let GG be a finite group with identity element ee, and let g∈Gg \in G. Then g∣G∣=eg^{|G|} = e.

Remarks

The order of gg divides ∣G∣|G| by this corollary, and a power is ee when the order divides the exponent. For the group (Z/pZ)×(\mathbb{Z}/p\mathbb{Z})^\times of order p−1p - 1, with pp prime, this gives Fermat's little theorem ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p for p∤ap \nmid a. For the group (Z/nZ)×(\mathbb{Z}/n\mathbb{Z})^\times of order φ(n)\varphi(n), it gives Euler's theorem.

Explanations

L1 human

If a group has nn elements, then the nnth power of each element is the identity. For example, in a group of order 66, each element gg satisfies g6=eg^6 = e. This simple fact proves Fermat's little theorem in number theory.

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 11 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. Lagrange's theorem statement
  3. Laws of exponents in a group statement
  4. Order of a group definition
  5. Subgroup definition
  6. Order of an element definition
  7. Cyclic subgroup generated by an element definition
  8. g to the n equals 1 iff the order divides n statement
  9. Order of a cyclic subgroup equals the order of its generator statement
  10. Order of an element divides the order of the group statement
  11. g to the order of the group is the identity statement

Sources

  1. Web https://en.wikipedia.org/wiki/Lagrange's_theorem_(group_theory), Applications