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 maximal algebraically independent set is a transcendence basis
Statement
Let be a field extension, and let be algebraically independent over . Assume that is maximal for inclusion among algebraically independent subsets of . Then every element of is algebraic over the generated subfield , so is a transcendence basis of over .
Facts & Assumptions
Given: A field extension , a maximal algebraically independent subset , and the generated subfields from Field extensions, generated subrings , generated subfields , and simple extensions.
Evaluation of a polynomial at elements of a commutative target ring is defined coefficientwise; a root is an element where that value is zero (Evaluation and roots of a polynomial in a commutative target ring).
Proof
Fix . If , then and hence is algebraic over because it is a root of .
Assume . By maximality, is algebraically dependent over , so there is a nonzero polynomial and elements such that . The polynomial must involve , for otherwise would already satisfy a nontrivial polynomial relation over , contradicting algebraic independence of .
View as a nonzero polynomial in and then in . After dividing by its leading coefficient in the field , we obtain a monic polynomial with . Therefore is algebraic over .
Steps 1.1 and 2.1 cover every , so is algebraic. Hence is a transcendence basis of over .
Depends on
Used by
Dependency tree · two levels
8 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
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 9.12 (standard reference, not scraped)