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.
The integral closure of a Dedekind domain in a finite separable extension is Dedekind
Statement
Assume the Axiom of Choice. Let be a Dedekind domain with fraction field , let be a finite separable field extension, and let be the integral closure of in . Then is a Dedekind domain.
Facts & Assumptions
Given: A Dedekind domain with fraction field , a finite separable extension , and the integral closure of in .
A Dedekind domain is a Noetherian integrally closed domain of dimension (Dedekind domains).
The integral closure is a finite -module (Finite separable integral closures over normal Noetherian domains are module-finite).
Assuming Choice, an injective integral extension of nonzero commutative rings preserves Krull dimension (Injective integral extensions preserve Krull dimension).
Proof
By [L1], the ring is a finite -module, hence integral over . Since is Noetherian by [F1], every ideal of is an -submodule of the finite -module , so is Noetherian. If is integral over , then transitivity of integrality makes integral over , so the defining property of forces . Thus is integrally closed.
The inclusion is an injective integral extension of nonzero domains. Since [F1] gives , [L2] gives .
Steps 1.1 and 1.2 show that is a Noetherian integrally closed domain of dimension . Hence [F1] makes a Dedekind domain.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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, A Primer of Commutative Algebra, §20 (standard reference, not scraped)
- Mircea Mustata, Introduction to Commutative Algebra, §8.5 (standard reference, not scraped)