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.

Depth at a prime is bounded by local support dimension

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let R be Noetherian, let M be finite, and let p∈Supp⁡R(M). Then depth⁡Rp(Mp)≤dim⁡Supp⁡Rp(Mp).

Facts & Assumptions

Given: The Axiom of Choice; Mp is a nonzero finite module over the Noetherian local ring Rp.

[L1]

A finite module has support V(Ann⁡N), and under Choice a radical ideal is the intersection of its containing primes (For a finite module, support is the set of primes containing the annihilator, The radical of an ideal is the intersection of the prime ideals containing it).

[L2]

In a Noetherian ring under the assumed AC, the radical of an ideal is the finite intersection of its minimal primes (A radical ideal in a Noetherian ring is a finite intersection of minimal primes).

[L3]

Under AC, Nakayama shows that a nonzero finite local module remains nonzero after quotienting by an ideal in its maximal ideal (Assuming the Axiom of Choice, Nakayama's lemma).

[L4]

The dimension of a nonzero finite local module is finite and equals the least length of a tuple in the maximal ideal making its quotient finite length (For a finite module, the dimension is the least size of an ideal of definition, and such tuples are systems of parameters).

[L5]

Depth is the supremum of lengths of regular sequences in the maximal ideal, and each successive quotient of such a sequence is nonzero (Depth with respect to an ideal, Regular Sequence On A Module).

Proof

technique · direct
1.1L1L3given

Put A=Rp. Let N be a nonzero finite A-module and let x lie in the maximal ideal and act injectively on N. By [L3], N/xN≠0. Localization and [L3] give Supp⁡A(N/xN)=Supp⁡A(N)∩VA(x): outside V(x) the quotient is zero, while at a support prime containing x its localized nonzero finite module cannot equal its x-multiple.

2.1L1step 1.1algebra

Let q be minimal in Supp⁡A(N). By [L1], it is minimal over Ann⁡A(N). In Aq the only support prime of Nq is qAq; [L1] therefore makes Ann⁡(Nq)=qAq. This maximal ideal is finitely generated, so some power annihilates Nq. If x∈q, a power of multiplication by x would be zero on the nonzero module Nq, contradicting injectivity after localization. Hence no minimal support prime contains x.

3.1L1L2step 1.1step 2.1

Take any strict chain r0⊊⋯⊊rs in Supp⁡A(N/xN). Since r0 contains Ann⁡N, the finite minimal-prime decomposition [L2] gives a minimal support prime q⊆r0. Because x∈r0 but x∉q by step 2.1, this inclusion is strict. Prepending q gives a chain of length s+1 in Supp⁡A(N). Thus dim⁡Supp⁡A(N/xN)≤dim⁡Supp⁡A(N)−1.

4.1L4step 3.1algebra

Conversely, by [L4] choose a parameter tuple of length e=dim⁡Supp⁡A(N/xN) for N/xN. Prepend x. The resulting quotient of N is the same finite-length module, so [L4] gives dim⁡Supp⁡A(N)≤e+1. Together with step 3.1, this shows that quotienting by an N-regular element in the maximal ideal lowers support dimension by exactly one.

5.1L5step 4.1∎

Starting with Mp, take any regular sequence of length r in the maximal ideal. Its successive quotients are nonzero by [L5], so step 4.1 applies r times and shows r≤dim⁡Supp⁡A(Mp). Taking the supremum over all regular sequences, exactly as depth is defined in [L5], proves the inequality. If the dimension is zero, only the empty regular sequence can occur, and both sides are zero.

Depends on

Used by

Dependency tree · two levels

25 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