Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

The associated graded ring of a regular local ring and of a cusp local ring can be computed explicitly

Example

Let R1:=k[x,y](x,y) with maximal ideal m=(x,y). Then gr⁡m(R1)≅k[X,Y], because mn/mn+1 has basis given by degree-n monomials in the initial classes of x and y.

For the cusp local ring R2:=k[x,y](x,y)/(y2−x3), the initial form of the relation has degree 2, so gr⁡m(R2)≅k[X,Y]/(Y2).

Facts & Assumptions

Given: A field k, the local rings R1 and R2 above, and the maximal-ideal filtrations.

[L1]

The associated graded ring is gr⁡m(R)=⨁n≥0mn/mn+1 (The associated graded ring and associated graded module of an ideal-adic filtration).

Verification

technique · direct
1.1L1givenalgebra

In R1, the classes of x and y in m/m2 generate every graded piece: the images of the degree-n monomials xn−iyi form a basis of mn/mn+1. Therefore the map k[X,Y]→gr⁡m(R1) sending X,Y to the initial classes of x,y is a graded isomorphism.

1.2L1algebra

In R2, the relation y2−x3 lies in m2 and its lowest-degree term is y2. Hence the only initial relation in degree 2 is Y2=0. As in the remaining monomials Xn and Xn−1Y survive and span the graded pieces, so gr⁡m(R2)≅k[X,Y]/(Y2).

2.1algebra∎

These explicit computations exhibit the regular local and cusp cases.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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