Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

regular local hilbert samuel multiplicity one

Statement

For a regular local ring (R,m,k) of dimension d and every integer n0, R(R/mn+1)=(n+dd). Consequently em(R)=1.

Facts & Assumptions

Given: The objects and hypotheses in the statement. We work with the Axiom of Choice; cited dependent-choice and resolution-existence hypotheses are retained.

[F1]

associated graded ring of a regular local ring: If (R,m,k) is regular local of dimension d, any cotangent basis induces a graded isomorphism k[X1,,Xd]grmR. Conversely, if the associated graded ring of a nonzero Noetherian local ring is isomorphic as a graded k-algebra to k[X1,,Xd] with standard grading, then R is regular of dimension d.

[F2]

Hilbert-Samuel multiplicity as the factorial-scaled leading coefficient: Let (R,m) be a Noetherian local ring, let M be a finite R-module, and let I be an ideal of definition for M. If M=0, define eI(M):=0. If M0, let PI,M be the eventual Hilbert-Samuel polynomial from thm-existence-of-hilbert-samuel-polynomial, and let d=degPI,M. Because Im and M0, Nakayama's lemma makes M/In+1M nonzero for every n, so PI,M is not the zero polynomial and d is defined. The Hilbert-Samuel multiplicity of M with respect to I is eI(M):=d!(leading coefficient of PI,M). Equivalently, when M0 and PI,M(n)=eI(M)d!nd+lower-degree terms, then eI(M) is the integer scaling the top term.

Proof

1.1

The filtration of R/mn+1 has factors mj/mj+1 for 0jn. The graded polynomial description identifies their total dimension with the number of monomials in d variables of degree at most n. Introducing a slack exponent identifies these with (d+1)-tuples of nonnegative integers summing to n, counted by (n+dd).

F1algebra
2.1

The leading coefficient is 1/d!, so multiplying it by d! gives multiplicity one. If d=0, the only monomial is 1, and the constant polynomial has leading coefficient one and 0!=1. The formula also gives length one at n=0.

F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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