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.
Normalization of the t³,t⁴,t⁵ monomial curve
Statement
Let be any field, let be an indeterminate and let be the -subalgebra generated by . Then the integral closure of in the rational function field is exactly , and is a finite -module. The conductor ideal of in is and is strictly smaller than ; it is not the object computed here.
Facts & Assumptions
Given: a field and the -subalgebras of the polynomial ring in one indeterminate and its fraction field.
For a field and elements of a -algebra, the subalgebra generated by them is written and is the smallest subring containing and the ; is the fraction field of a domain (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras, Field extensions, generated subrings , generated subfields , and simple extensions, The field of fractions of an integral domain).
The polynomial ring over a field is an integral domain with fraction field (A polynomial ring over an integral domain is an integral domain, Zero divisor, and integral domain: a commutative ring with and no zero divisors, The field of fractions of an integral domain).
For every field and the polynomial ring is an integrally closed domain (Finite-variable polynomial algebras over fields are integrally closed, Integral closure in an extension ring and integrally closed domains).
Integrality over a subring means being a root of a monic polynomial over that subring; integrality is transitive along domain inclusions; integral elements form a subring; an integrally closed domain contains every integral element of its fraction field (Integral elements over a commutative ring and algebraic integers, Integral extensions are transitive, Integral elements over a nonzero base ring form a subring, Integral closure in an extension ring and integrally closed domains).
Proof
is a quotient of two elements of with , so by [L1]; hence , and by [L2] because . Thus .
The element is integral over , being a root of the monic polynomial ; and is a finite -module, because every polynomial in is a finite -linear combination of powers of and the relation reduces the exponents modulo : with and . Hence every element of is integral over .
As in the cusp computation: if is integral over , every monic equation for over also has coefficients in , so is integral over , and since is integrally closed in its fraction field by [L3] and [L2], . With step 1.2 this shows that the integral closure of in is exactly , a finite -module. The conductor ideal is a proper ideal of contained in , not in the closure beyond , and plays no role in the identification of the closure.
Depends on
- Finite-variable polynomial algebras over fields are integrally closed
- Integral closure in an extension ring and integrally closed domains
- Integral elements over a commutative ring and algebraic integers
- Integral elements over a nonzero base ring form a subring
- Integral extensions are transitive
- The field of fractions $\operatorname{Frac}(D)=(D\setminus\{0\})^{-1}D$ of an integral domain
- A polynomial ring over an integral domain is an integral domain
- Zero divisor, and integral domain: a commutative ring with $1 \ne 0$ and no zero divisors
- Field extensions, generated subrings $F[S]$, generated subfields $F(S)$, and simple extensions
- Subalgebra generated by a subset, algebras of finite type, and module-finite algebras
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
42 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, Algebraic Geometry, Proposition 8.3 (standard reference, not scraped)
- Stacks Project, Lemma 10.161.13 (polynomial N-2) (standard reference, not scraped)