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 normal basis of over
Example
Let , a field of order , let be the class of , and let generate . Put
Then the conjugate list
is a normal basis of over (Normal bases of a finite Galois extension).
Not every element works. The generator itself does not: its conjugate list is , whose three members sum to , so they are linearly dependent over and are not a basis.
Facts & Assumptions
Given: The field with the class of , so and ; squaring is additive in characteristic two.
has no root in , so it is irreducible (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field) and is a field (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible); it is the minimal polynomial of (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element), so with power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree , The degree of a finite field extension).
A list of length is an ordered basis of if and only if every has exactly one coordinate list with (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, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
For a linear map with finite-dimensional, (Rank-nullity: ).
Every finite Galois extension with cyclic Galois group has a normal basis (Every finite cyclic extension has a normal basis).
Verification
By [L1] and [L2] the space is a three-dimensional -vector space with basis , and acts by .
The conjugate list of is with ; hence . A vanishing combination with all coefficients is nontrivial, so this list is linearly dependent over and is not a basis.
The conjugates of are , and .
The seven nonzero -combinations of are nonzero: the three single terms are , and ; the three pairwise sums are , and ; and the total sum is . None of these seven is , as each has a nonzero coordinate list in the basis .
So the -linear map sending to has trivial kernel by step 4.1; both spaces have dimension three by step 1.1, so [L4] makes surjective as well, hence bijective, and [L3] makes an ordered basis of over .
That list is the family of conjugates of under by step 3.1, so it is a normal basis, as [L5] guarantees exists for this cyclic extension.
Remarks
- A conjugate family of the right size can still fail. The list has three distinct members and is a single Galois orbit, yet it is not a basis; what fails is independence, not the orbit condition. The normal basis theorem asserts that some element works, never that every element does (FALSE: every basis of a finite field over a subfield is a normal basis).
Depends on
- Every finite cyclic extension has a normal basis
- Normal bases of a finite Galois extension
- A finite extension of a finite field of order $q$ is Galois with cyclic Galois group generated by $x\mapsto x^q$
- The relative Frobenius $x\mapsto x^q$ of an extension of finite fields
- For a degree-$n$ extension of a field of order $q$, the $q$-power map has order exactly $n$
- For a nonconstant $p$ in $F[x]$, the ideal $(p)$ is maximal and $F[x]/(p)$ is a field exactly when $p$ is irreducible
- A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- 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
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- The degree $[K:F]=\dim_F K$ of a finite field extension
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
71 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, Linear Independence of Characters (expository blurb), Section 3 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, the normal basis theorem (standard reference, not scraped)