Math 2.0

proof

Proof that cyclic groups are abelian

Proof

  1. Let GG be a cyclic group with generator gg.
  2. Let xx and yy be elements of GG. Then there are integers mm and nn with x=gmx = g^m and y=gny = g^n.
  3. By the laws of exponents, xy=gmgn=gm+nxy = g^m g^n = g^{m+n}.
  4. In the same way, yx=gngm=gn+myx = g^n g^m = g^{n+m}.
  5. Since m+n=n+mm + n = n + m, xy=yxxy = yx. Thus GG is abelian.

Idea

Every element is a power of one generator, and powers of the same element commute.

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 9 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. Binary operation definition
  2. Group concept
  3. Commutativity definition
  4. Laws of exponents in a group statement
  5. Subgroup definition
  6. Abelian group definition
  7. Cyclic subgroup generated by an element definition
  8. Cyclic group definition
  9. Proof that cyclic groups are abelian proof

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Group_(mathematics), Cyclic groups