Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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