Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 finite-type field has finite relative algebraic constants

Statement

Let K/k be a finitely generated field extension, and set kalg:={a∈K:a is algebraic over k}. Then kalg is a finite extension of k.

Facts & Assumptions

Given: A field extension K/k generated as a field by a finite list.

[F1]

There are a1,…,am∈K with K=k(a1,…,am); the list may be empty (Finitely generated field extensions F(a1,…,ar)).

[F2]

F(S) denotes the smallest subfield containing F and a set S; in particular k(T) and L(a) have their generated-field meanings (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions).

[F3]

The set kalg=acl⁡K(k) consists of the elements of K algebraic over k and is a subfield (The relative algebraic closure of F in an extension K, The elements of an extension algebraic over the base field form a subfield).

[F4]

A field generated by finitely many elements algebraic over a base field is finite over that base (An extension generated by finitely many algebraic elements is finite).

[F5]

A finite field extension is algebraic (Every finite field extension is algebraic).

[F6]

An element x is algebraic over F exactly when F(x)/F is finite (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[F7]

In a tower of finite field extensions degrees multiply: [M:k]=[M:F][F:k] for k⊆F⊆M (Tower law for finite extensions: [L:F]=[L:K][K:F]).

[F8]

Algebraicity is transitive in a tower of field extensions (Algebraicity is transitive in towers of field extensions).

[F9]

A set T is algebraically independent over a field exactly when the evaluation map from the polynomial ring with variables indexed by T is injective (Algebraic independence in a field extension).

[F10]

An element is algebraic over a field when it is a root of a nonzero polynomial over that field; transcendental means not algebraic (Algebraic and transcendental elements and algebraic extensions).

[F12]

[M:F] is the finite dimension of M as an F-vector space when M/F is finite (The degree [K:F]=dim⁡FK of a finite field extension).

Proof

technique · direct
1.1F1F2F9F10algebra

Fix a finite generating list a1,…,am from [F1]. [construct] Scan the list in order, starting with T0=∅. At stage i, adjoin ai to the selected set exactly when it is transcendental over the field generated by the previously selected elements. The selected set stays algebraically independent: if adjoining ai created a nonzero polynomial relation, its degree in ai would be positive, since a relation of degree zero would contradict independence of the preceding tuple. Write it as a polynomial in ai; independence of the preceding tuple makes a nonzero coefficient remain after evaluation, so this would make ai algebraic over its generated field, a contradiction. Every omitted generator is algebraic over the field generated at its stage and stays algebraic after enlarging that field. Thus the final finite set T is algebraically independent over k, and every ai is algebraic over k(T). This finite scan uses no choice principle.

2.1F1F2F4F12step 1.1

The field K=k(T)(a1,…,am) is generated over k(T) by finitely many elements algebraic over that field. [step 1.1, algebra] Hence [F4] makes K/k(T) finite. Set n:=[K:k(T)]; since both are fields, n≥1. If m=0, then K=k, T is empty and n=1.

2.2

Let E be any algebraic intermediate field k⊆E⊆K. The tuple T remains algebraically independent over E. [step 1.1, algebra] Otherwise choose a nonempty subset T′⊆T of least cardinality that is algebraically dependent over E, and choose t∈T′. The tuple T′∖{t} is independent over E. A nonzero polynomial relation on T′ can be viewed as a polynomial in t with coefficients in the other variables; independence of T′∖{t} ensures at least one coefficient stays nonzero after evaluation. The relation must have positive degree in t, since degree zero would give a relation on the independent tuple T′∖{t}. Hence it gives a nonzero polynomial over E(T′∖{t}) vanishing at t, so t is algebraic over that field.

The extension E(T′∖{t})/k(T′∖{t}) is algebraic. Each of its elements belongs to the field generated over k(T′∖{t}) by some finite list e1,…,er∈E. Each ej is algebraic over k and therefore over the larger base k(T′∖{t}). By [F4], the field generated by this finite list is finite over that base, and [F5] makes each of its elements algebraic over the base. This proves the extension is algebraic. Transitivity [F8] would then make t algebraic over k(T′∖{t}), contradicting the algebraic independence of T over k. If T is empty there is no nonempty dependent subset, so the same conclusion holds vacuously. [F2, F4, F5, F8, F9, F10, step 1.1, algebra]

3.1F2F9F11F12step 1.1step 2.1step 2.2algebra

Let L be any finite intermediate extension k⊆L⊆K, write d=[L:k], and choose a k-basis b1,…,bd of L. [step 1.1, step 2.1, step 2.2, algebra] Since L/k is finite, [F5] makes it algebraic, so step 2.2 applies and T is algebraically independent over L. Suppose ∑i=1dbiλi=0,λi∈k(T). Let P=k[Xt:t∈T] and let ev⁡k:P→K evaluate each Xt at t. By step 1.1 and [F9], ev⁡k is injective, so ev⁡k(g)≠0 for every nonzero g∈P. The quotients ev⁡k(f)/ev⁡k(g), where f,g∈P and g≠0, form the subfield generated by k and T: they form a subfield containing those elements, and every subfield containing them contains all these quotients. By [F2], this is k(T). Choose a common denominator g and numerators f1,…,fd∈P with λi=ev⁡k(fi)/ev⁡k(g). Multiplying the displayed relation by its nonzero denominator gives ∑ibiev⁡k(fi)=0. Algebraic independence over L means the evaluation map L[Xt:t∈T]→K is injective, so the polynomial ∑ibifi(X) in that ring is zero. For each monomial its coefficient is a k-linear combination of b1,…,bd; their basis independence makes every coefficient in every fi zero. Thus all λi are zero, and b1,…,bd are linearly independent over k(T) inside K. Since K has an n-element spanning set over k(T), [F11] gives [L:k]=d≤n.

4.1F12step 3.1choosealgebra

Let D be the set of degrees [L:k] of finite intermediate fields k⊆L⊆K. [step 3.1, choose] It is nonempty because k itself has degree 1. Every degree in D is a positive integer, since an intermediate field contains 1≠0. Step 3.1 therefore puts D inside {1,…,n}. Start with the attained value 1∈D and inspect 2,…,n in order, replacing the current value by r exactly when r∈D. This finite scan yields a greatest member d0∈D. By the definition of D, there is a finite intermediate field L with [L:k]=d0; fix one such witness. This is one existential choice from a nonempty set, not a choice function on a family.

5.1F2F3F5F6F7step 4.1algebra

Take any a∈kalg. [step 4.1, algebra] It is algebraic over k and therefore over L, since its nonzero polynomial over k remains nonzero over L. By [F6], L(a)/L is finite; since L/k is finite, [F7] makes L(a)/k finite and [L(a):k]=[L(a):L][L:k]. Because L(a)⊆K, this degree lies in D, so it is at most d0=[L:k]. The tower formula and [L(a):L]≥1 force [L(a):L]=1, whence L(a)=L and a∈L. Thus kalg⊆L. Conversely [F5] makes every element of the finite extension L/k algebraic over k, so L⊆kalg. Therefore kalg=L and is a finite extension of k.

6.1step 1.1step 2.1step 2.2step 3.1step 4.1step 5.1∎

This proof includes the empty generator list and empty transcendence tuple. [step 1.1, step 2.1, step 2.2, step 3.1, step 4.1, step 5.1, algebra] If n=1, the only possible finite intermediate degree is 1 and the maximum argument gives kalg=k. No characteristic, separability, or perfectness hypothesis is used. AC is not used: the generator scan and degree bound are finite, and the basis and maximal-degree witness are each fixed only for one arbitrary finite intermediate field.

Depends on

Used by

Dependency tree · two levels

35 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