Math 2.0

statement proposition

Every element of a finite field of order q satisfies x^q = x

Statement

Let FF be a finite field of order qq. Then aq=aa^q = a for every a∈Fa \in F, and xq−x=∏a∈F(x−a)in F[x].x^q - x = \prod_{a \in F} (x - a) \quad \text{in } F[x].

Remarks

The proof: the group of units F×F^\times has order q−1q - 1, so aq−1=1a^{q-1} = 1 for a≠0a \neq 0, by Lagrange's theorem. Then aq=aa^q = a for all aa, also for a=0a = 0. So the qq elements of FF are qq distinct roots of xq−xx^q - x, which has degree qq. This gives the factorisation. For q=pq = p prime, ap=aa^p = a in Z/pZ\mathbb{Z}/p\mathbb{Z} is Fermat's little theorem.

Explanations

L1 human

In a field with qq elements, raising to the power qq changes nothing. So the polynomial xq−xx^q - x has every element of the field as a root.

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 8 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. Ring definition
  3. Commutative ring definition
  4. Unit of a ring definition
  5. Field definition
  6. Group of units of a ring definition
  7. Finite field definition
  8. Every element of a finite field of order q satisfies x^q = x statement

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Finite_field, Multiplicative structure