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.
Normal bases of a finite Galois extension
Definition
Let be a finite Galois extension (Finite Galois extensions and ) of degree (The degree of a finite field extension), and list its Galois group as
which has exactly elements because for a finite Galois extension (Equivalent characterizations of a finite Galois extension). Scalar multiplication by makes an -vector space of dimension .
An element is a normal basis generator for when the list
is an ordered basis of as an -vector space (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). Such a list is called a normal basis of over : a basis that is a single orbit of the Galois group.
Two conditions, not one. A list is an ordered basis when it is injective and its image is a basis, so a normal basis generator must in particular have distinct conjugates . Neither half implies the other: a basis of over need not be a Galois orbit, and a Galois orbit of size need not be a basis.
The list is indexed by the group, not ordered by it. Reordering permutes the list and leaves the property of being a basis unchanged, since a basis is a property of the underlying set together with injectivity of the list (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). The automorphisms are those of Relative field automorphisms and .
Depends on
- Finite Galois extensions and $\operatorname{Gal}(K/F)$
- Relative field automorphisms and $\operatorname{Aut}(K/F)$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Equivalent characterizations of a finite Galois extension
- The degree $[K:F]=\dim_F K$ of a finite field extension
Used by
- {1+i, 1-i} is a normal basis of ℂ/ℝ while {1,i} is not Example
- A normal basis of F₈ over F₂ Example
- FALSE: every basis of a finite field over a subfield is a normal basis False statement
- Every finite cyclic extension has a normal basis Theorem
- Every finite Galois extension has a normal basis Theorem
- Every finite Galois extension of an infinite field has a normal basis Theorem
Dependency tree · two levels
30 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
- J. S. Milne, Fields and Galois Theory, v5.10, Definition 5.17 (standard reference, not scraped)
- P. L. Clark, Field Theory (course notes/monograph), Chapter 8, Section 5 (standard reference, not scraped)