Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Over Fq, xqn−x is the product of all monic irreducibles whose degrees divide n

Statement

Let Fq be a finite field and let n≥1. In Fq[t],

tqn−t=∏P monic irreducible deg⁡P∣nP(t),

where each monic irreducible occurs once.

Facts & Assumptions

Given: A finite field Fq and a positive integer n.

[L1]

The order of a finite field is a prime power; write q=pr with r≥1 (Every finite field has order pn for a unique prime characteristic p and positive integer n).

[L2]

For every prime p and positive integer s, a field of order ps exists (For every prime p and n≥1, a field with pn elements exists).

[L3]

A field of order Q is the full root set and a splitting field of tQ−t (A field with q elements is the splitting field of xq−x over its prime subfield).

[L4]

The subfields of a field of order ps have orders pu with u∣s (The subfields of Fpn are the unique fields Fpd for positive divisors d of n).

[L5]

If an algebraic element has minimal polynomial of degree d, its simple extension has degree d and the corresponding power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n).

[L6]

Every nonzero nonunit polynomial over a field factors into irreducibles (Every nonzero nonunit polynomial over a field factors into irreducible polynomials).

[L7]

A root is repeated exactly when the formal derivative also vanishes there (A root is repeated exactly when it is also a root of the formal derivative).

[L8]

A polynomial of degree at least one over a field has a root in some field extension (Kronecker's one-root step: adjoining a root removes a linear factor and lowers the remaining degree).

[L9]

For an algebraic element α there is a unique monic irreducible mα with mα(α)=0, and for every f one has f(α)=0 exactly when mα∣f (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Proof

technique · direct
1.1givenL1L2L3choose

By [L1], write q=pr. Use [L2] to choose a field E of order prn=qn. By [L3], E is the full root set and a splitting field of tqn−t.

1.2givenL1L5L8L9

Let P be monic irreducible of degree d≥1. By [L8] it has a root α in some extension of Fq; since P is monic irreducible and annihilates α, the uniqueness in [L9] makes P the minimal polynomial of α. By [L5], Fq(α) has degree d over Fq and hence has qd=prd elements.

2.1step 1.1givenL7algebra

The derivative of tqn−t is −1, which vanishes nowhere. Every irreducible factor of tqn−t has a root in the splitting field E of step 1.1, and a repeated factor would make that root repeated; so [L7] shows that no irreducible factor repeats.

2.2step 1.2L3L9algebra

If d∣n, write n=ed. Applied to the field Fq(α), [L3] gives αqd=α; iterating this identity e times gives αqn=α. So tqn−t vanishes at α, and since P is its minimal polynomial by step 1.2, [L9] gives P∣tqn−t.

2.3step 1.1step 1.2L4choose

Conversely, if P divides tqn−t, choose its root α in the splitting field E from step 1.1. Then Fq(α) is a subfield of E with order prd, so [L4] gives rd∣rn, and cancellation yields d∣n.

3.1step 2.2step 2.3step 2.1L6∎

Factor the polynomial by [L6]. Steps 2.2 and 2.3 identify exactly the monic irreducible factors, and step 2.1 gives multiplicity one. Since both sides are monic, their unit factors agree, proving the formula.

Depends on

Used by

Dependency tree · two levels

40 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources