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
Let be Noetherian, let be finite, and let . Then
Facts & Assumptions
Given: is a nonzero finite module over the Noetherian local ring .
Proof
Put . Let be a nonzero finite -module and let in the maximal ideal be -regular. Then by localization and Nakayama. A minimal prime of cannot contain : otherwise has support only at the maximal ideal of , so a power of annihilates it, contradicting injectivity on that nonzero localization. Any prime chain in can therefore be extended downward by a strict inclusion from a minimal prime of . Hence . Conversely, lift a parameter tuple for and prepend . Its quotient has finite length, so thm-dimension-and-parameters-for-modules gives . Thus the dimension drops exactly one, without any catenarity assumption. All dimensions are finite by that module-dimension theorem (ultimately the local height bound).
Starting with , every regular sequence of length has nonzero successive quotients by def-regular-sequence-on-a-module. Applying step 1.1 successively gives . Extending a sequence while possible must therefore stop, so a maximal sequence exists. The maximal ideal is the Jacobson radical, and Nakayama gives . Thus thm-depth-equals-maximal-regular-sequence-length identifies its length with depth, proving the asserted inequality. This also handles dimension zero, when the maximal sequence is empty.
Depends on
Used by
Dependency tree · two levels
15 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
- Depth and Cohen--Macaulay modules source treatment (standard reference, not scraped)