Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passverified 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.

In dimension zero the Hilbert-Samuel polynomial is constant and equals the module length

Example

Let (R,m) be a zero-dimensional Noetherian local ring and let M be a finite R-module. Then some power of m annihilates M, so for all sufficiently large n, M/mn+1M≅M. Hence the Hilbert-Samuel polynomial is the constant polynomial Pm,M(n)=ℓR(M).

Facts & Assumptions

Given: A zero-dimensional Noetherian local ring (R,m) and a finite R-module M.

[L1]

The length ℓR(M) is defined for finite-length modules (Composition series and length of a module).

[L2]

In a Noetherian ring the nilradical is nilpotent (The nilradical of a Noetherian ring is nilpotent).

Verification

technique · direct
1.1L2givenalgebra

In a zero-dimensional local ring every prime ideal is maximal, hence the only prime is m. Its nilradical is therefore m, and [L2] gives mN=0 for some N≥1. Hence for every n≥N−1, M/mn+1M=M.

2.1L1step 1.1algebra

The finite module M has finite length over the zero-dimensional Noetherian local ring: the filtration by powers of the nilpotent maximal ideal has finitely many quotients, each a finite-dimensional vector space over R/m. Thus ℓR(M) is defined by [L1]. Step 1.1 shows that the Hilbert-Samuel function is eventually the constant polynomial ℓR(M), uniquely so because two polynomials agreeing at all large integers are equal.

3.1step 2.1∎

This is exactly the zero-dimensional case.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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