Alphabeta Math
CorollaryStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-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.

Transcendence degree is additive in finite towers

Statement

Let kKL be a tower of field extensions. Assume that trdegkK and trdegKL are finite. Then

trdegkL=trdegkK+trdegKL.

Facts & Assumptions

Given: A tower kKL with finite transcendence degrees.

[L1]

An algebraically independent subset over which the ambient field is algebraic is a transcendence basis (A maximal algebraically independent set is a transcendence basis).

[L2]

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

Proof

technique · direct
1.1

Choose a transcendence basis S={s1,,sr} of K over k and a transcendence basis T={t1,,tm} of L over K. Then r and m are the two given transcendence degrees.

givenchoose
2.1

The union ST is algebraically independent over k. Indeed, a polynomial relation over k among ST would also be a relation over K, contradicting algebraic independence of T over K. Moreover L is algebraic over K(T), and K is algebraic over k(S), so [L2] shows that L is algebraic over k(S,T). Therefore [L1] makes ST a transcendence basis of L over k.

L1L2step 1.1
3.1

Since ST is a transcendence basis of L over k with r+m elements, trdegkL=r+m=trdegkK+trdegKL.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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