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.
A monic irreducible of degree over has the distinct roots
Statement
Let be a finite field of order , let be monic irreducible of degree , and let be a root of in some extension field of . Then is a finite field of order , the elements
are pairwise distinct roots of lying in ,
and is a splitting field of over (Polynomials that split and splitting fields of a polynomial or a family of polynomials), of degree over (The degree of a finite field extension). In particular these elements are pairwise conjugate over (Conjugate algebraic elements over a field) and form a single orbit of the relative Frobenius. The list starts at , so its first member is itself, and at it is the single element .
Facts & Assumptions
Given: A finite field of order , a monic irreducible of degree (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree), a root of in an extension field, and the field .
If is a field extension and is algebraic, there is a unique monic irreducible with , and for every one has if and only if (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
If is algebraic over with minimal polynomial of degree , then (An element is algebraic over if and only if its simple extension is finite).
If , then has an ordered -basis of length , and every element of has a unique coordinate list in that basis (The degree of a finite field extension, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
An extension of finite fields of degree is Galois with cyclic of order , where (A finite extension of a finite field of order is Galois with cyclic Galois group generated by , The relative Frobenius of an extension of finite fields).
Let be a commutative ring, and . Then if and only if divides in (Factor theorem over a commutative ring).
A nonzero polynomial of degree over an integral domain has at most distinct roots in that domain (A nonzero polynomial of degree over an integral domain has at most distinct roots).
If is a field with elements, then every satisfies (A field with elements is the splitting field of over its prime subfield).
Two elements algebraic over are conjugate over when they have the same minimal polynomial over (Conjugate algebraic elements over a field).
Proof
is the minimal polynomial of over : since , [L1] gives , and is irreducible while is monic of degree at least one, so . Hence by [L2].
Fix the length- basis supplied by [L3]. Unique coordinates give a bijection , so and is a finite field. Now [L4] applies: is Galois with cyclic of order , where .
Each fixes the coefficients of , which lie in , so applying the field homomorphism to the equation gives : every is a root of lying in .
The elements are pairwise distinct. Suppose with and apply the automorphism : since for every by [L7] and step 2.1, this yields with and . The set is the fixed set of the automorphism , hence a subfield of ; it contains by [L7] and contains , so . But is the root set in of the nonzero polynomial , so by [L6], giving because and . This is impossible.
The product divides in . Indeed, listing the distinct roots as , [L5] writes ; for the equation and in the field give , so the same step applies to with the remaining distinct roots, and after such steps for some .
Both and are monic of degree , so is monic of degree , that is and .
Consequently splits over , and is generated over by the root ; since the subfield of generated over by all the roots of contains , it contains and hence equals , so is a splitting field of over . All roots share the minimal polynomial by step 1.1 and [L1], so they are pairwise conjugate over by [L8], and step 3.1 exhibits them as one orbit of .
Remarks
-
The index starts at zero. The orbit is , so the factor is present in the product; dropping the term would leave a polynomial of degree that is not .
-
Where irreducibility is used. It enters twice: to identify with the minimal polynomial of in step 1.1, and through that identification to force , which is what makes the count in step 4.1 tight. For a reducible the conclusion fails outright, as over shows: its roots and are not a Frobenius orbit.
Depends on
- A finite extension of a finite field of order $q$ is Galois with cyclic Galois group generated by $x\mapsto x^q$
- For a degree-$n$ extension of a field of order $q$, the $q$-power map has order exactly $n$
- The relative Frobenius $x\mapsto x^q$ of an extension of finite fields
- Conjugate algebraic elements over a field
- An element is algebraic over $F$ if and only if its simple extension $F(a)/F$ is finite
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- Factor theorem over a commutative ring
- A nonzero polynomial of degree $n$ over an integral domain has at most $n$ distinct roots
- A field with $q$ elements is the splitting field of $x^q-x$ over its prime subfield
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
- The degree $[K:F]=\dim_F K$ of a finite field extension
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered basis
Used by
Dependency tree · two levels
54 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
- K. Conrad, Finite Fields (expository blurb), Theorem 5.5 (standard reference, not scraped)
- K. Conrad, Roots and Irreducibles (expository blurb), Theorem 5.4 (standard reference, not scraped)