Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge 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.

For a finite Galois extension, (αj) is a base-field basis exactly when the matrix (σiαj) is invertible

Statement

Let K/F be a finite Galois extension of degree n, list its Galois group as Gal(K/F)={σ1,,σn}, and let α1,,αnK. Let AMn(K) be the matrix with entries

Aij=σi(αj)(1i,jn).

Then (α1,,α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) if and only if A is invertible over K (Invertible matrices and the general linear group GLn(F)).

Facts & Assumptions

Given: A finite Galois extension K/F of degree n with Gal(K/F)={σ1,,σn}; elements α1,,αnK; the matrix AMn(K) with Aij=σi(αj) (Finite rectangular matrices over a commutative ring, their entries, rows and columns); and the F-linear map Φ ⁣:FnK given by Φ(a)=jajαj. Each σi is an F-automorphism of K (Relative field automorphisms and Aut(K/F)), hence additive and F-linear.

[L1]

For a finite Galois extension K/F with G=Gal(K/F) one has G=[K:F] (Equivalent characterizations of a finite Galois extension, Finite Galois extensions and Gal(K/F)); so dimFK=n (The degree [K:F]=dimFK of a finite field extension).

[L2]

Let G be a group and K a field. Every finite family of distinct group homomorphisms GK× is linearly independent over K as a family of functions (Dedekind's linear independence theorem for distinct characters).

[L3]

For a linear map T:VW of F-vector spaces with V finite-dimensional, dimFV=dimF(kerT)+dimF(imT) (Rank-nullity: dimFV=nullityT+rankT).

[L4]

For AMn(F) and LA(x)=Ax on Mn×1(F): A is invertible if and only if LA is a linear isomorphism (A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms).

[L5]

Let R be a commutative ring, n1, AMn(R). Then A is invertible if and only if det(A) is a unit of R (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).

[L6]

det(AT)=det(A) for every AMn(R) over a commutative ring (For every square matrix over a commutative ring, det(AT)=det(A)); the transpose is (AT)ji=Aij (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

Proof

technique · direct
1.1

By [L1] the F-vector space K has dimension n, and Φ is a map between F-vector spaces of dimension n; so by [L3] it is injective if and only if it is surjective, and (α1,,αn) is an ordered basis of K over F exactly when Φ is bijective.

L1L3
1.2

For the implication that a basis has an invertible matrix, suppose (α1,,αn) is an ordered basis, and let cKn satisfy ATc=0, that is iciσi(αj)=0 for every j. The map θ ⁣:KK, θ(x)=iciσi(x), is F-linear because each σi is, and it vanishes at every αj, hence on their F-span, which is K.

given
2.1

For the implication that a non-basis has a singular matrix, suppose (α1,,αn) is not an ordered basis. By step 1.1 the map Φ is not injective, so there is aFn with a0 and jajαj=0. Applying σi and using σi(aj)=aj for ajF gives jσi(αj)aj=0 for every i, that is Aa=0 with a0 in Kn. Were A invertible with inverse B, this would force a=B(Aa)=0; so A is not invertible.

step 1.1given
2.2

So iciσi is the zero function on K, in particular on K×. The restrictions σiK× ⁣:K×K× are group homomorphisms and are pairwise distinct, since two automorphisms of K agreeing on K× agree on K; so [L2] forces ci=0 for every i.

step 1.2L2
3.1

Hence the K-linear map xATx on Kn has zero kernel, so by [L3] over K it is also surjective and therefore a linear isomorphism; by [L4] the matrix AT is invertible, so det(AT) is a unit of K by [L5], and det(A)=det(AT) by [L6] is a unit, whence A is invertible by [L5].

step 2.2L3L4L5L6
4.1

Step 2.1 gives one implication, that a list which is not a basis has a matrix that is not invertible, and step 3.1 gives the other, that a list which is a basis has an invertible matrix; together they are the stated equivalence.

step 2.1step 3.1

Remarks

  • Why the transpose appears. The dependence relation among the αj produces a null vector on the right of A, while the Dedekind relation among the σi produces one on the right of AT. Only the determinant sees both, which is why the two halves are joined through For every square matrix over a commutative ring, det(AT)=det(A) rather than by a single rank computation.

  • Where the Galois hypothesis is used. Twice: to know that the group has exactly n=[K:F] elements, so that A is square, and to know that the σi are F-linear, which is what lets step 2.1 pull the scalars aj through.

Depends on

Used by

Dependency tree · two levels

60 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