Alphabeta Math
LemmaStatement: 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.

A polynomial variable increases depth by one

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (R,m) be Noetherian local and 0≠M finite. Put S=R[X](m,X) and N=M[X](m,X). Then depth⁡S(N)=depth⁡R(M)+1,dim⁡S(N)=dim⁡R(M)+1.

Facts & Assumptions

Given: The Axiom of Choice; X belongs to the maximal ideal of S.

Proof

technique · direct
1.1given

Multiplication by X on M[X] is injective coefficientwise and its cokernel is M. These properties survive localization, so X is N-regular and N/XN≅M.

2.1step 1.1algebra

As an S-module, N/XN is M with X acting by zero; regular sequences from (m,X) on it are exactly regular sequences from m on M. Hence the regular-quotient depth formula gives depth⁡S(N)=depth⁡R(M)+1.

3.1step 1.1algebra∎

Put A=R/Ann⁡R(M). Then Supp⁡S(N)=Spec⁡(A[X])(mA,X). The Choice-qualified polynomial-dimension theorem applies under the given Axiom of Choice and gives dim⁡A[X]=dim⁡A+1; its lower chain is attained below (mA,X) because A is local. Therefore the displayed localization has dimension dim⁡A+1=dim⁡R(M)+1. This is the asserted dimension equality and does not require every support prime to be extended from R or to contain X.

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