Alphabeta Math
Pipeline-generated
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.

Koszul Euler Characteristics and Hilbert–Samuel Multiplicity — Examples

1 · Prerequisites

2 · Summary

These calculations isolate three conventions in the Euler/multiplicity bridge: an empty sequence computes length, a nonzero annihilator contributes a necessary subtraction, and a redundant zero generator changes the coefficient index even when the generated ideal stays the same. The two DVR examples display every differential and homology module and compute the Hilbert–Samuel polynomial directly. No general dimension theorem or power-series-ring construction is needed.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

koszul euler characteristic empty sequence

Example

Assume AC. For any finite-length module M over a commutative Noetherian local ring (R,m), the empty sequence satisfies χ(K(;M))=e0(0,M)=R(M). For the concrete instance M=R/m, both numbers are 1. For M=0, both are 0.

Facts & Assumptions

Given: AC, a commutative Noetherian local ring (R,m), a finite-length R-module M, and the empty sequence. The displayed special instances are M=R/m and M=0.

[A1]

We assume The Axiom of Choice for the bridge theorem cited below.

[F1]

The empty sequence has complex M[0], ideal zero, and constant polynomial: koszul euler characteristic and degree indexed multiplicity.

[F2]

The coefficient indexed by the sequence length equals the Koszul Euler characteristic: degree-r Hilbert–Samuel coefficient as Koszul Euler characteristic.

Verification

technique · direct
1.1

The empty Koszul complex has K0=M, all other terms zero and all differentials zero. Thus H0=M and Hi=0 for i0, giving χ(K)=R(M).

F1given
2.1

For every n0, 0n+1M=0, so M/0n+1M=M and P(T)=R(M). Hence e0=0![T0]P=R(M). A composition series also makes M finitely generated: take a lift of one nonzero generator of each simple factor; induction through the finite series shows these finitely many lifts generate M. The module-relative hypothesis is exactly finite length of M, so the bridge theorem with r=0 applies under AC and agrees with this direct calculation.

A1F1F2step 1.1
3.1

In particular take M=k=R/m. Its only submodules are zero and k, since any nonzero vector spans this one-dimensional k-space; its length is 1. We obtain H0=k, P=1 and χ=e0=1. With M=0 the empty series has length zero and the same calculation gives P=χ=e0=0.

F1step 1.1step 2.1algebra

Remarks

This is a locally calculated design example, not a named example attributed to a source. The empty-sequence convention is consistent with Hochster printed p.166 (the zero-generator case) and with Stacks 43.15.4 at index zero. The general bridge is only a consistency check here; the homology and polynomial were calculated directly.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

koszul euler characteristic annihilator correction

Example

Assume AC. Let R be a discrete valuation ring with uniformizer t and residue field k=R/(t). Take M=Rk and the one-element sequence (t). Then H0(K(t;M))kk, H1(K(t;M))k, and all other homology vanishes. Moreover P(t),M(T)=T+2, so e1((t),M)=χ(K(t;M))=1. Omitting the annihilator correction from first-element reduction would give the incorrect value 2.

Facts & Assumptions

Given: AC, a DVR R with uniformizer t and residue field k=R/(t), M=Rk, and the sequence (t).

[A1]

We assume The Axiom of Choice for the two comparison results.

[F1]

The Koszul/multiplicity bridge holds for finite modules with finite-colength sequence ideals: degree-r Hilbert–Samuel coefficient as Koszul Euler characteristic.

[F2]

First-element reduction subtracts the Euler characteristic with annihilator coefficients: koszul euler characteristic first element reduction.

[F3]

In a DVR, R(R/(ta))=a for every integer a0: Length and valuation in a DVR.

[F4]

The one-element Koszul differential is multiplication by that element: Koszul Complex Of A Sequence With Coefficients.

[F5]

Euler characteristic and degree-indexed coefficients use R(M/In+1M): koszul euler characteristic and degree indexed multiplicity.

[F6]

Length adds in a short exact sequence: Module length is additive in short exact sequences.

Verification

technique · direct
1.1

The complex is 0RktRk0, in degrees 1,0, and the map is (a,b)(ta,0). Since a DVR is a domain and t0, its kernel is 0k and its image is tR0. Thus H1k, H0(R/tR)k=kk, and all remaining homology is zero.

F4given
2.1

The DVR length formula at a=1 gives R(k)=1, and the split sequence 0kkkk0 gives length 2. Therefore M/tM has finite length and χ(K)=21=1.

F3F5F6step 1.1
3.1

For every n0, tn+1M=tn+1R0. Hence M/tn+1MR/(tn+1)k has length (n+1)+1=n+2. Thus P(T)=T+2 and e1=1![T]P=1. The DVR is Noetherian local, M is finite, and the finite-colength hypothesis was verified above, so the bridge theorem under AC gives the same value 1.

A1F1F3F5F6step 2.1
4.1

Removing t leaves the empty sequence with coefficients C=M/tM=kk and T=0:Mt=0k. For an empty sequence its Euler characteristic is the coefficient module's length. Thus the first-element identity reads χ(K(t;M))=R(C)R(T)=21=1. Both lengths are finite, so all its hypotheses hold. The nonzero annihilator term is exactly the discrepancy with R(C)=2.

A1F2F5step 1.1step 2.1step 3.1

Remarks

Locally calculated design example. The general correction formula is supported by Hochster printed p.165; Stacks 43.15.5 supplies the comparison context. The actual instance uses the published DVR length interface and explicit multiplication maps, with no formal power-series construction assumed.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

koszul euler characteristic redundant zero generator

Example

Assume AC. Over a discrete valuation ring R with uniformizer t and residue field k=R/(t), the sequence (t,0) on M=R generates I=(t) and has H0k, H1k, H2=0. Thus χ(K(t,0;R))=e2((t),R)=0, although R has dimension one and its degree-one leading multiplicity e1((t),R) is 1.

Facts & Assumptions

Given: AC, a DVR R with uniformizer t and residue field k=R/(t), M=R, and the ordered sequence (t,0).

[A1]

We assume The Axiom of Choice for the comparison lemmas.

[F1]

A sequence of length r computes the coefficient er: degree-r Hilbert–Samuel coefficient as Koszul Euler characteristic.

[F2]

First-element reduction retains quotient minus annihilator: koszul euler characteristic first element reduction.

[F3]

DVR quotients satisfy R(R/(ta))=a: Length and valuation in a DVR.

[F4]

Every nonzero ideal of the DVR is (ta) for a unique a0: Ideals in a DVR are powers of the maximal ideal.

[F5]

The ordered deletion differential is fixed in Koszul Complex Of A Sequence With Coefficients.

[F6]

The coefficients and Euler characteristic are defined in koszul euler characteristic and degree indexed multiplicity.

[F7]

Verification

technique · direct
1.1

In the ordered bases e1,e2 and e1e2, the complex is 0Rd2R2d1R0 with d1(a,b)=ta and d2(c)=(0,tc), because deletion gives te20e1. Their composite is zero. Since t is nonzero in a domain, kerd2=0 and kerd1=0R. Consequently H2=0, H1=(0R)/(0tR)k and H0=R/tR=k.

F5given
2.1

The length formula gives R(k)=1. Hence both nonzero homology modules have length one, and χ(K)=11+0=0. The homology has total length 2 by additivity, so its alternating cancellation is not acyclicity.

F3F6F7step 1.1
3.1

For n0 we have R(R/In+1)=n+1, so P(T)=T+1. Thus e2=2![T2]P=0 and e1=1![T]P=1. The DVR is Noetherian local, R is finite over itself and R/I=k has finite length. The bridge theorem applies under AC with the actual sequence length r=2, agreeing with χ=0.

A1F1F3F6step 2.1
4.1

To identify the dimension without a general Hilbert–Samuel dimension theorem, let p be a nonzero prime ideal. It has the form (ta) with a1 because it is proper. Since tap, repeated primality gives tp. Thus p=(t), as (t) is maximal. Also (0) is prime because R is a domain, and t0 makes (0)(t). These are all primes, so the largest number of strict inclusions in a prime chain is one. Therefore the dimension is one, and the coefficient at that dimension is the e1=1 already calculated.

F4step 3.1
5.1

The first-element identity provides another explicit check: removing t gives C=k and T=0 since multiplication by t on R is injective. The remaining sequence is (0), whose complex on k is 0k0k0. It has one copy of k in each homology degree, so χ(K(0;k))=11=0, whereas K(0;0) is zero. The reduction formula is therefore 00=0, with C/0C=k finite length. This confirms that the redundant generator changes the coefficient index, not the generated ideal.

A1F2F5F6step 1.1step 2.1step 3.1

Remarks

Locally calculated design example. Source context: Stacks 43.15.5 and Hochster printed pp.106–108, 165. The ordered two-element differential and the prime-chain calculation are supplied explicitly; no general theorem equating Hilbert degree and support dimension is used.

Sources