Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (gpt-6-sol)
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.

Polynomial extension preserves Cohen--Macaulayness

Statement

Assume the Axiom of Choice. Let R be Noetherian and M finite and globally Cohen--Macaulay. Then M[X] is globally Cohen--Macaulay over R[X].

Facts & Assumptions

Given: The Axiom of Choice; M is finite and globally Cohen--Macaulay over the Noetherian ring R.

[F1]

Global Cohen--Macaulayness is tested at primes in the support (Maximal and global Cohen--Macaulay modules).

[F2]

Regular sequences survive polynomial base change and localization when the terminal quotient remains nonzero (Localisation And Faithfully Flat Base Change Of Regular Sequences).

[F3]

Depth is bounded above by support dimension for nonzero finite local modules (Depth is bounded by support dimension).

[F4]

Support dimension is the least length of a tuple in the maximal ideal with finite-length quotient; tuples of this length are module systems of parameters (For a finite module, the dimension is the least size of an ideal of definition, and such tuples are systems of parameters).

[F5]

Under AC every parameter system of a nonzero finite local Cohen--Macaulay module is regular (Every system of parameters is regular in a Cohen--Macaulay module).

[F6]

Under AC, for a finite module T over a local ring (A,m), mT=T implies T=0; hence T/mT≠0 when T≠0, and T/gT≠0 when g∈m (Assuming the Axiom of Choice, Nakayama's lemma).

Proof

technique · direct
1.1F1F2F4F5F6givenconstruct

If M=0, then M[X]=0 and [F1] gives the claim vacuously. Otherwise fix P in the support of M[X], put p=P∩R, A=Rp, m=pA, B=A[X], P′=PB, and S=BP′. The nonzero module Mp is Cohen--Macaulay. Under the stated AC, [F4] and [F5] supply a regular parameter tuple f1,…,fd with d=dim⁡Mp and nonzero finite-length quotient N. Polynomial extension is faithfully flat, and localization preserves injectivity. The final quotient Q=N[X]P′ is nonzero: [F6] gives N/mN≠0, and its polynomial extension localized at P′⊇mB remains nonzero. Thus [F2] makes the tuple regular on M[X]P.

2.1F6step 1.1algebraconstruct

Since N is nonzero of finite length, its annihilator has radical m, and Supp⁡SQ=V(mS). This also follows by tensoring a finite composition series of N: its factors become copies of κ(p)[X]Pˉ, where Pˉ=P′/mB. If Pˉ=0, this is a field, so Q has finite length over S. If Pˉ≠0, write Pˉ=(gˉ) for a monic irreducible polynomial and lift its coefficients to a monic g∈A[X]. Since P′ is the inverse image of Pˉ, this lift lies in P′. Monicity makes multiplication by g injective on N[X] by highest-coefficient comparison, hence on Q. Moreover Q/gQ is supported only at the maximal ideal of S (reduce modulo m), and is nonzero by [F6] because Q is finite and nonzero and g∈P′S, the maximal ideal; it therefore has finite length.

3.1F1F3F4step 2.1∎

In the first case the regular tuple has length d and finite-length quotient; in the second, adjoining g gives a regular tuple of length d+1 and nonzero finite-length quotient. Write its length as l. The definition of depth gives depth⁡SM[X]P≥l, [F4] gives dim⁡SM[X]P≤l, and [F3] gives the reverse comparison between depth and dimension. Hence both equal l. Every localization in the support is Cohen--Macaulay, proving [F1].

Depends on

Used by

Dependency tree · two levels

24 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