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.
One element of a transcendence basis can be exchanged for a suitable rival
Statement
Let be a field extension, let and be transcendence bases of over , and let . Then there exists such that is again a transcendence basis of over .
Facts & Assumptions
Given: A field extension , transcendence bases and of over , and an element .
If a subset of is algebraically independent and is algebraic over the field it generates, then that subset is a transcendence basis (A maximal algebraically independent set is a transcendence basis).
Proof
Because is a transcendence basis, is algebraic over ; in particular is algebraic over . Choose a finite subset of minimal size such that is algebraic over .
Minimality forces . Choose a nonzero polynomial relation for over and clear denominators to obtain with nonzero. The variable must occur in ; otherwise the same relation would show that is algebraic over , contradicting minimality of . Therefore, viewing as a polynomial in over , we see that is algebraic over .
Put . If were algebraically dependent, then would be algebraic over . Together with step 2.1 this would make algebraic over , contradicting algebraic independence of . Hence is algebraically independent.
Step 2.1 shows that is algebraic over , so is algebraic over . Since is algebraic over , it is also algebraic over . By [L1], is a transcendence basis of over .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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, Lemma 9.6 (standard reference, not scraped)