Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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, xqnx is the product of all monic irreducibles whose degrees divide n

Statement

Let Fq be a finite field and let n1. In Fq[t],

tqnt=P monic irreducible degPnP(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 r1 (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 n1, a field with pn elements exists).

[L3]

A field of order Q is the full root set and a splitting field of tQt (A field with q elements is the splitting field of xqx over its prime subfield).

[L4]

The subfields of a field of order ps have orders pu with us (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,,an1 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.1

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 tqnt.

givenL1L2L3choose
1.2

Let P be monic irreducible of degree d1. 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.

givenL1L5L8L9
2.1

The derivative of tqnt is 1, which vanishes nowhere. Every irreducible factor of tqnt 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.

step 1.1givenL7algebra
2.2

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

step 1.2L3L9algebra
2.3

Conversely, if P divides tqnt, 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 rdrn, and cancellation yields dn.

step 1.1step 1.2L4choose
3.1

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.

step 2.2step 2.3step 2.1L6

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 134 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources