Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck 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.

Over an infinite base field, no nonzero polynomial vanishes at the conjugate tuple of every element

Statement

Let K/F be a finite Galois extension of degree n whose base field F is infinite, and list Gal⁡(K/F)={σ1,…,σn}. Then for every nonzero f∈K[x1,…,xn] (Polynomial rings in finitely many commuting indeterminates by iteration) there exists α∈K with

f(σ1α,…,σnα)≠0.

Facts & Assumptions

Given: A finite Galois extension K/F of degree n with F infinite and Gal⁡(K/F)={σ1,…,σn}; by [L4] the F-vector space K has dimension n, so an ordered F-basis (α1,…,αn) of K exists (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[L1]

Let S be an integral domain and R⊆S an infinite subring. If g∈S[x1,…,xm] satisfies g(a1,…,am)=0 for all a1,…,am∈R, then g=0 (A polynomial vanishing at every tuple from an infinite subdomain is the zero polynomial).

[L2]

For a finite Galois extension K/F of degree n with Gal⁡(K/F)={σ1,…,σn} and α1,…,αn∈K, the list (α1,…,αn) is an ordered F-basis of K if and only if the matrix A with Aij=σi(αj) is invertible (For a finite Galois extension, (αj) is a base-field basis exactly when the matrix (σiαj) is invertible).

[L3]

For commutative rings R,S, a unital ring homomorphism φ ⁣:R→S and s∈S, there is a unique unital ring homomorphism R[x]→S extending φ on constants and sending x to s (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism). Iterating this along Polynomial rings in finitely many commuting indeterminates by iteration gives, for any commutative K-algebra T and any t1,…,tn∈T, a unique K-algebra homomorphism K[x1,…,xn]→T sending xi to ti.

[L5]

A∈Mn(K) is invertible when some B∈Mn(K) satisfies AB=In=BA; such a B is unique and written A−1 (Invertible matrices and the general linear group GL⁡n(F), Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

Proof

technique · contrapositive
1.1contrapositive-reduceassume-hyp

It suffices to prove the contrapositive: if f∈K[x1,…,xn] satisfies f(σ1α,…,σnα)=0 for every α∈K, then f=0. Assume that hypothesis on f.

1.2L2L4L5given

Fix an ordered F-basis (α1,…,αn) of K and put Aij=σi(αj); by [L2] the matrix A is invertible, with inverse A−1 as in [L5].

2.1step 1.2given

For c∈Fn write α(c):=∑jcjαj; then c↦α(c) is a bijection Fn→K because the αj form a basis, and σi(α(c))=∑jcjσi(αj)=(Ac)i since each σi fixes F pointwise and is additive.

2.2step 1.2L3

Let ψ ⁣:K[x1,…,xn]→K[x1,…,xn] be the unique K-algebra homomorphism with ψ(xi)=∑jAijxj, and ψ′ the unique one with ψ′(xi)=∑j(A−1)ijxj; both exist by [L3].

3.1step 1.1step 2.1step 2.2L3

For c∈Fn, the evaluation homomorphism K[x1,…,xn]→K at c composed with ψ sends xi to ∑jAijcj=(Ac)i, so by the uniqueness clause of [L3] it is evaluation at Ac; hence ψ(f) evaluated at c equals f(Ac)=f(σ1α(c),…,σnα(c)), which is 0 by the hypothesis of step 1.1.

4.1step 3.1L1given

So ψ(f) vanishes at every tuple from the infinite subring F of the integral domain K, and [L1] gives ψ(f)=0.

5.1step 2.2step 4.1L3L5discharge-contrapositive∎

The composite ψ′∘ψ is a K-algebra endomorphism sending xi to ∑jAij∑k(A−1)jkxk=∑k(AA−1)ikxk=xi, so it is the identity by the uniqueness clause of [L3]; applying ψ′ to step 4.1 therefore gives f=ψ′(ψ(f))=ψ′(0)=0, which is the contrapositive.

Remarks

  • Where infiniteness of F enters. Only in step 4.1, through [L1]. Over a finite base field the conclusion is false: with ∣F∣=q and n=[K:F], the nonzero polynomial x1qn−x1 vanishes at every conjugate tuple, since every element of K satisfies xqn=x. The finite case of the normal basis theorem is therefore proved by a different argument (Every finite cyclic extension has a normal basis).

Depends on

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