Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 K/F be a finite Galois extension (Finite Galois extensions and Gal(K/F)) of degree n=[K:F] (The degree [K:F]=dimFK of a finite field extension), and list its Galois group as

Gal(K/F)={σ1,,σn},

which has exactly n elements because Gal(K/F)=[K:F] for a finite Galois extension (Equivalent characterizations of a finite Galois extension). Scalar multiplication by F makes K an F-vector space of dimension n.

An element αK is a normal basis generator for K/F when the list

(σ1α, σ2α, , σnα)

is an ordered basis of K as an F-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 K over F: 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 n distinct conjugates σiα. Neither half implies the other: a basis of K over F need not be a Galois orbit, and a Galois orbit of size n need not be a basis.

The list is indexed by the group, not ordered by it. Reordering σ1,,σn 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 Aut(K/F).

Depends on

Used by

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