Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Normality of the symmetric determinantal ring

Statement

Assume the Axiom of Choice. Under the hypotheses and notation of Straightening basis for generic symmetric determinantal rings, the ring k[zij]/Im+1 is an integrally closed domain for every 0≤m≤t.

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice) and the standard-monomial basis proved in Straightening basis for generic symmetric determinantal rings.

[F1]

Straightening basis for generic symmetric determinantal rings: the standard products form a basis of the quotient by Im+1, its Gram substitution is injective, and each minor has the explicit column-first leading monomial stated there, with coefficient one. Its proof derives the Cauchy–Binet expansion from Leibniz expansion.

[F2]

Under the Axiom of Choice, a commutative Noetherian ring is normal exactly when it satisfies R1 and S2 (serre normality criterion). In particular a normal local domain of dimension at most one is regular.

[F3]

For a finite module over a Noetherian local ring, depth at a prime plus the dimension of the prime quotient is at least the original depth (Localization gives the stated depth inequality). A regular element in the maximal ideal lowers depth by exactly one on quotienting (Depth drops by one after quotienting by a regular element). Both suppliers assume Choice.

[F4]

Finite polynomial rings over fields are Noetherian by iteration of Hilbert basis theorem: if R is Noetherian then R[x] is Noetherian; their quotients and localizations are Noetherian by Every quotient and every localisation of a Noetherian ring is Noetherian. These apply to all finite-type algebras and all essentially finite-type local rings below.

[F5]

Under Choice, a prime minimal over a principal ideal in a Noetherian ring has height at most one (Krull's principal ideal theorem). For a finite-type k-domain D and a prime p, ht⁡p+trdeg⁡kFrac⁡(D/p)=trdeg⁡kFrac⁡D (The dimension formula for affine domains). Apply the latter formula to both D and its prime quotients to obtain ht⁡Q−ht⁡q=ht⁡(Q/q); localization below Q preserves these heights.

[F6]

Under Choice, prime localizations of regular local rings are regular (localisations of regular local rings are regular). For a nonzero Noetherian local ring its embedding dimension is the least number of generators of its maximal ideal, and its dimension is at most its embedding dimension (embedding dimension is minimal maximal ideal generator number, dimension at most embedding dimension).

[F7]

The integral closure in its fraction field of any finite-type domain over a field is a finite module (A finite-type domain over a field has finite normalization). This algebraic statement needs neither algebraic closedness nor Choice.

[F8]

Every finite-variable polynomial ring over a field is integrally closed (Finite-variable polynomial algebras over fields are integrally closed). The subgroup L⊆Zmt used below is free of finite rank by A submodule of a free module of finite rank over a PID is free of no larger rank, applied to the PID Z; a basis identifies k[L] with a Laurent polynomial ring.

Proof

Given: Choice and the basis assertion [F1], including its full range of ranks. Choice is used in the Serre, depth, dimension, and regular-local suppliers [F2]–[F6]; the combinatorial and finite-normalization arguments do not use it.

1.1givenF1algebra

Put P=k[xir:1≤i≤t,1≤r≤m] and map Z to XXT. Order the variables lexicographically, with x11>⋯>xt1>x12>⋯>xtm. For ∣A∣=∣B∣=s≤m, The explicit determinant expansion in [F1] gives p(A,B)(XXT)=∑∣C∣=sdet⁡XA,Cdet⁡XB,C. The leading term of a determinant with increasing row and column sets pairs their first indices, then their second indices, and so on: at the first column, the lexicographically largest variable available has its smallest row index. The largest summand in Cauchy–Binet has C=(1,…,s), by comparing the first column belonging to exactly one of two column sets. Consequently the leading monomial of this Gram minor, with coefficient one, is ∏r=1sxarrxbrr.

1.2F2F3F4F5F6algebra

We record the local normality transfer used here. If A is a local domain essentially of finite type over k, h is a nonzero element of its maximal ideal, and A/hA is normal, then A is normal. The nonzero normal local ring A/hA is a domain, so hA is prime. To check the assertion with Serre's criterion, first take a prime Q containing h. The ring and its localizations are Noetherian by [F4]. By [F5], quotienting these local domains by the nonzero prime element h lowers dimension by one: apply the principal ideal theorem to its prime ideal and then the affine-domain dimension formula before localization. The depth formula [F3] for a nonzerodivisor gives depth⁡AQ=1+depth⁡(A/hA)Q/hA≥min⁡(3,dim⁡AQ). If dim⁡AQ≤2, its quotient is regular by the R1 direction of [F2]; lift its dim⁡AQ−1 maximal-ideal generators and adjoin h. The maximal ideal of AQ is generated by at most dim⁡AQ elements, so [F6] makes AQ regular. For a prime q not containing h, choose Q minimal over q+(h) in A. Such a prime exists since A is local and h belongs to its maximal ideal. The element h has nonzero image in the domain A/q, and Q/q is minimal over that image. The principal ideal theorem and dimension formula [F5] therefore give dim⁡AQ=dim⁡Aq+1 and dim⁡(AQ/qAQ)=1. If dim⁡Aq=1, AQ is regular by the preceding observation, and so is its localization Aq by [F6]. If dim⁡Aq≥2, the depth localization inequality [F3], applied to AQ and qAQ, gives depth⁡Aq≥depth⁡AQ−1≥2. The zero-prime localization is a field. Together with the primes containing h, this proves R1 and S2, hence normality by [F2].

2.1F1step 1.1construct

For a standard product discard empty factors and write its columns in reverse order, Bq,Aq,…,B1,A1. This is a tableau with weakly increasing rows, strictly increasing columns, nonincreasing column lengths, and columns of each length occurring an even number of times. Its row lengths are therefore even. Conversely such a tableau has pairs of consecutive columns of equal length, and reversing its columns and grouping these pairs recovers exactly one standard product. The exponents of its leading monomial record the entries in every row; weak increase reconstructs those rows uniquely. Distinct standard products thus have distinct leading monomials. All (m+1)-minors vanish under the Gram map, and [F1] now shows that the induced map R=k[zij]/Im+1⟶P is injective. In particular R is a domain.

3.1step 2.1algebra

Describe these leading exponents as arrays a=(ari)∈Nmt. Set cr(u)=∑i≤uari, with cr(0)=0. The necessary and sufficient conditions are that every cr(t) is even and cr+1(u)≤cr(u−1) for 1≤r<m and 1≤u≤t. Indeed the latter inequalities say exactly that the jth entry of row r is strictly smaller than the jth entry of row r+1, whenever the latter exists: count entries at most u to obtain necessity, and apply the inequality with u equal to that lower entry to obtain sufficiency. They imply nonincreasing row lengths. Even row lengths make their consecutive differences even, so the resulting columns have the required paired lengths. Thus these arrays form exactly the semigroup S of leading monomials of R. It is closed under addition. If a∈gp⁡(S) and Na∈S for a positive integer N, its entries are nonnegative, the displayed inequalities hold after division by N, and its row sums are even since every element of gp⁡(S) has that parity. Hence a∈S: this is saturation in the actual group of the semigroup, rather than saturation in the larger unrestricted integer lattice.

4.1F8step 3.1algebra

The algebra k[S] is integrally closed. Here is the lattice argument. Write L=gp⁡(S) and let C be the cone cut out by nonnegativity and the inequalities in step 3.1. That step proves S=C∩L. Inside k[L], each integral linear inequality ℓ≥0 defines a valuation by vℓ(∑baxa)=min⁡ba≠0ℓ(a); the product rule follows because the associated lowest-weight Laurent polynomials have nonzero product. Its nonnegative subring is a valuation ring intersected with k[L]. The Laurent polynomial ring k[L] is integrally closed by [F8] and denominator clearing: if f is integral over a localization U−1D of an integrally closed domain D, choose u∈U clearing all coefficients of its monic equation; then uf is integral over D, hence belongs to D, so f∈U−1D. This also proves the localization assertion used below. Valuation rings are integrally closed as well: a monic equation for an element of negative valuation has its highest power of strictly smallest valuation, which is impossible. The intersection of these rings, inside their common fraction field, is precisely k[C∩L], by the monomial independence in k[L]. Intersections of integrally closed subrings of a field are integrally closed.

4.2F1F4step 1.1step 2.1step 3.1construct

We construct a finite weight degeneration, to make the normality transfer explicit. The finitely many Gram minors generate R, because they include all its degree-one generators zij. By steps 2.1 and 3.1 their leading monomials generate S: every standard monomial is a product of those leading monomials. Introduce one variable for each nonempty Gram minor, mapped to its leading monomial. The kernel of this monomial map is generated by finitely many binomials. This follows from Noetherianity [F4] of the finite polynomial ring, and the kernel is spanned by binomials because monomials with the same image exponent are the only linear dependencies. For each of these finitely many binomials substitute the actual Gram minors; their largest terms cancel. Repeatedly subtract the uniquely matching standard product to cancel the largest remaining term, using [F1] and step 2.1. This process terminates: all polynomials involved have one fixed ordinary degree in the x's and there are only finitely many monomials of that degree. Choose a positive integer weight on the x variables realizing all the strict lexicographic comparisons in this finite list of reductions and all the minor expansions; sufficiently separated positive powers realize any finite list of lexicographic comparisons.

5.1step 4.2algebra

For this weight the minors still form a basis for leading-term subduction: if highest-weight terms in a polynomial expression in the minors cancel, its highest-weight symbolic part belongs to the toric kernel from step 4.2. Express it in the finitely many binomial generators, and replace each by its recorded reduction. Each replacement lowers the weight of the cancelling part. All weights are nonnegative integers; this induction terminates. It proves that the associated graded algebra for the weight filtration on R⊂P is k[S]. For FdR={f∈R:deg⁡wf≤d}, its Rees algebra T=⨁d≥0(FdR)hd⊂R[h] is generated by h and the finitely many hdjpj, where dj is the weight of the leading monomial of the jth minor. Subduction proves this last assertion by induction on weight. We have T/hT=k[S], T[h−1]=R[h,h−1], and h is a nonzerodivisor. The h grading makes T a positively graded finite algebra with T0=k, since all variable weights are positive.

6.1F7F8step 4.1step 5.1step 1.2algebra∎

Apply step 1.2 to the local ring of T at its homogeneous maximal ideal M=T>0. Its quotient by h is a localization of the normal ring in step 4.1, so TM is normal. To pass from the local assertion to all of T, let B be its normalization in its fraction field; it is finite by [F7], since step 5.1 makes T a finite-type domain. For every b∈B, the same monic equation shows that its image belongs to the normal local ring TM; hence (B/T)M=0. As B/T is finite, multiplying denominators for a finite generating set produces s∉M with s(B/T)=0. Let J=Ann⁡T(B/T). For each c∈k×, grading gives the automorphism γc(ad)=cdad of T and its fraction field. It preserves B by applying it to monic equations; therefore it preserves J. If a=∑d∈Dad∈J has finite homogeneous support, every ∑dcdad lies in J. The distinct functions c↦cd are linearly independent on the infinite field k (a nonzero polynomial has finitely many roots); choosing finitely many evaluation points with invertible evaluation matrix and solving gives ad∈J for every d. Thus J is homogeneous. If B/T≠0, then J is proper; since T0=k, a proper homogeneous ideal is contained in M. This contradicts s∈J∖M. Hence B=T, so T is normal. Its localization R[h,h−1] is normal by the denominator-clearing argument in step 4.1. An element of Frac⁡(R) integral over R is then in R[h,h−1]∩Frac⁡(R)=R, as comparison of Laurent coefficients shows. This proves normality for 1≤m<t. For m=0, the ideal of entries has quotient k; for m=t, the ideal is zero and its quotient is a polynomial ring, which is integrally closed.

Depends on

Used by

Dependency tree · two levels

88 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