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 , is the product of all monic irreducibles whose degrees divide
Statement
Let be a finite field and let . In ,
where each monic irreducible occurs once.
Facts & Assumptions
Given: A finite field and a positive integer .
The order of a finite field is a prime power; write with (Every finite field has order for a unique prime characteristic and positive integer ).
For every prime and positive integer , a field of order exists (For every prime and , a field with elements exists).
A field of order is the full root set and a splitting field of (A field with elements is the splitting field of over its prime subfield).
The subfields of a field of order have orders with (The subfields of are the unique fields for positive divisors of ).
If an algebraic element has minimal polynomial of degree , its simple extension has degree and the corresponding power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Every nonzero nonunit polynomial over a field factors into irreducibles (Every nonzero nonunit polynomial over a field factors into irreducible polynomials).
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).
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).
For an algebraic element there is a unique monic irreducible with , and for every one has exactly when (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Proof
By [L1], write . Use [L2] to choose a field of order . By [L3], is the full root set and a splitting field of .
Let be monic irreducible of degree . By [L8] it has a root in some extension of ; since is monic irreducible and annihilates , the uniqueness in [L9] makes the minimal polynomial of . By [L5], has degree over and hence has elements.
The derivative of is , which vanishes nowhere. Every irreducible factor of has a root in the splitting field of step 1.1, and a repeated factor would make that root repeated; so [L7] shows that no irreducible factor repeats.
If , write . Applied to the field , [L3] gives ; iterating this identity times gives . So vanishes at , and since is its minimal polynomial by step 1.2, [L9] gives .
Conversely, if divides , choose its root in the splitting field from step 1.1. Then is a subfield of with order , so [L4] gives , and cancellation yields .
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
- Every finite field has order $p^n$ for a unique prime characteristic $p$ and positive integer $n$
- For every prime $p$ and $n\ge1$, a field with $p^n$ elements exists
- A field with $q$ elements is the splitting field of $x^q-x$ over its prime subfield
- The subfields of $\mathbb F_{p^n}$ are the unique fields $\mathbb F_{p^d}$ for positive divisors $d$ of $n$
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- Every nonzero nonunit polynomial over a field factors into irreducible polynomials
- A root is repeated exactly when it is also a root of the formal derivative
- Kronecker's one-root step: adjoining a root removes a linear factor and lowers the remaining degree
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
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
- K. Conrad, Finite Fields, Appendix A (standard reference, not scraped)