Math 2.0

statement corollary

Groups of prime order are cyclic

Statement

Let pp be a prime number and let GG be a group of order pp. Then GG is cyclic, and each element of GG other than the identity generates GG.

Remarks

If g≠eg \neq e, then the order of ⟨g⟩\langle g \rangle is greater than 11 and divides pp by Lagrange's theorem, so it is pp. Thus each group of order pp is isomorphic to Z/pZ\mathbb{Z}/p\mathbb{Z}. A group of prime order has no subgroups except {e}\{e\} and itself.

Explanations

L1 human

When the size of a group is a prime, there is no room for proper subgroups other than the trivial one. Any element other than the identity generates a subgroup larger than 11, so it generates everything. Thus, for example, each group with 77 elements is a clock with 77 hours.

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. Cyclic group definition
  10. Order of a cyclic subgroup equals the order of its generator statement
  11. Groups of prime order are cyclic statement

Sources

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