Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 cusp semigroup ring

Statement

Let k be any field, let t be an indeterminate and let A:=k[t2,t3]⊆k[t] be the k-subalgebra generated by t2 and t3. Then the integral closure of A in the rational function field k(t) is exactly k[t], and k[t]=A+At is a finite A-module.

Facts & Assumptions

Given: a field k and the k-subalgebras A=k[t2,t3]⊆k[t]⊆k(t) of the polynomial ring in one indeterminate and its fraction field.

[L1]

For a field k and a set S of elements of a k-algebra, the subalgebra generated by finitely many elements is written k[s1,…,sr], the smallest subring containing k and the si; Frac⁡(D) denotes the fraction field of a domain D (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras, Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

[L3]

For every field F and every finite d≥0 the polynomial ring F[y1,…,yd] is an integrally closed domain (Finite-variable polynomial algebras over fields are integrally closed, Integral closure in an extension ring and integrally closed domains).

[L4]

An element is integral over a subring when it is a root of a monic polynomial over that subring; integrality is transitive along domain inclusions; elements integral over a subring form a subring; an integrally closed domain contains every element of its fraction field integral over it (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).

[L5]

In a domain, a≠0 implies ab=ac if and only if b=c, so a nonzero element of an integral domain is not a zero divisor (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors, Divisibility and associates in an integral domain).

Proof

technique · direct
1.1

The element t is nonzero in the domain k[t], and then t2≠0 because a nonzero element of an integral domain is not a zero divisor by [L5]; so t=t3/t2 is a quotient of two elements of A with nonzero denominator, and t∈Frac⁡(A) by [L1]. Consequently k[t]=A[t]⊆Frac⁡(A), and since A⊆k[t]⊆Frac⁡(A) with Frac⁡(A) a field, k(t)=Frac⁡(k[t])⊆Frac⁡(A) by [L2]; the reverse inclusion is A⊆k[t]. Hence Frac⁡(A)=k(t).

L1L2L5given
1.2

The element t is a root of the monic polynomial T2−t2∈A[T], so t is integral over A by [L4]. Every element of k[t] is a finite sum ∑nantn with an∈k, and reducing exponents modulo 2 via t2=t2∈A expresses it as an A-linear combination of 1 and t: that is, k[t]=A+At is generated as an A-module by the two elements 1,t. Being a finite A-module generated by integral elements it is integral over A, so every element of k[t] is integral over A.

L4given
2.1

Suppose z∈k(t)=Frac⁡(A) is integral over A. A monic equation for z over A has coefficients in A⊆k[t], so z is integral over k[t]; since k[t] is integrally closed in its fraction field k(t) by [L3] and [L2], such a z lies in k[t]. Conversely every element of k[t] is integral over A by step 1.2. Therefore the integral closure of A=k[t2,t3] in k(t) is exactly k[t], which is the finite A-module A+At.

L2L3L4step 1.1step 1.2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

45 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