Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Trace cokernels detect and bound normal surface H1

Statement

Assume AC and DC. Let R be regular Noetherian local of dimension two and A a finite normal local R-domain of dimension two with R↪A local, in the permitted class. For a projective normal modification X, put M=H1(X,OX). There is a canonical exact sequence 0→Γ(X,ωX)→tr⁡ωA→Ext⁡R2(M,R)→0, and the last module has the same A-annihilator as M. If one fixed nonzero d∈A annihilates every such trace cokernel, then A has bounded modification H1. If A is rational, the trace is an isomorphism and gives an adjoint evaluation f∗ωA→ωX.

Facts & Assumptions

Given: A regular Noetherian local ring R of dimension two, a finite normal local R-domain A of dimension two with R↪A local, in the permitted class, and a projective normal modification X→Spec⁡A with M=H1(X,OX).

[F1]

def-axiom-of-choice. The Axiom of Choice (AC) is the following statement. > Every family of nonempty sets has a choice function > (def-choice-function). Written out: for every set F all of whose members are nonempty, there exists a function g with domain F satisfying g(S)∈S for all S∈F. (The Axiom of Choice)

[F2]

def-dependent-choice. Let X be a set and let R⊆X×X be a binary relation on X. Call R entire on X when for every x∈X there is y∈X with xRy. The Axiom of Dependent Choice, written DC, is the following statement. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

[F3]

def-rational-normal-surface-singularity-and-bounded-modification-h1. Assume AC and DC. A normal two-dimensional Noetherian local domain A essentially of finite type over a field or complete equicharacteristic local base defines a rational singularity if H1(Y,OY)=0 for every normal integral proper modification Y→Spec⁡A. Bounded modification H1 means these modules have uniformly bounded A-length. (Rational normal surface singularities and bounded modification cohomology)

[F4]

lem-finite-length-duality-over-a-regular-local-base. Assume AC and DC. Let (R,m) be regular Noetherian local of dimension d and let (B,n) be a module-finite local R-algebra with the map local. For finite-length B-modules put T(M)=Ext⁡Rd(M,R) with its natural B-action. (Finite-length duality over a regular local base)

[F5]

lem-normal-projective-surface-dualizing-module-over-regular-local-base. Assume AC and DC. Let R be a regular Noetherian local ring of dimension two, let A be a finite normal local R-domain of dimension two, with R↪A local, and let X be a normal integral scheme of dimension two projective over R, with a proper birational map f:X→Spec⁡A. Put ωA=Hom⁡R(A,R). (Dualizing modules and trace pairing for normal projective surface modifications)

[F6]

lem-normal-surface-modification-uniform-principal-torsion-bound. Assume AC and DC. For a normal local surface domain A in the permitted finite-type class and 0≠a∈A, the lengths of H1(X,OX)[a] are uniformly bounded over all normal projective modifications X→Spec⁡A. (Uniform principal torsion bound for surface modification cohomology)

[F7]

lem-projective-normal-surface-grauert-riemenschneider-vanishing. Assume AC and DC. Let R be regular Noetherian local of dimension two, A a finite normal local R-domain of dimension two with R↪A local, and X→Spec⁡A a projective normal modification, in the permitted finite-type/completion class. For its normalized dualizing module ωX over ωA=Hom⁡R(A,R), H1(X,ωX)=0. (Grauert–Riemenschneider vanishing for the required normal surface modifications)

Proof

1.1F4F5F7given

As verified by the projectivity argument of [F7], the finite map Spec⁡A→Spec⁡R and the projective modification make X projective over R, so [F5] applies. The structure-sheaf cohomology of X has H0=A, H1=M of finite length and no other positive groups, so its truncation triangle is A→C→M[−1]→A[1]; dualizing over R uses that A is finite free over the regular local ring R and that finite-length duality is concentrated at Ext⁡R2.

2.1F5F7step 1.1

The normal-surface relative duality identifies the middle dual with RΓ(X,ωX), and Grauert--Riemenschneider vanishing makes that complex concentrated in degree zero; the long exact cohomology sequence is therefore exactly the short exact sequence 0→Γ(X,ωX)→tr⁡ωA→Ext⁡R2(M,R)→0, whose injection is the trace dual to A→C.

3.1F4F6step 2.1

Finite-length duality gives equality of A-annihilators of M and Ext⁡R2(M,R); if one fixed nonzero d∈A annihilates every such trace cokernel then it annihilates M, and the uniform principal-torsion bound bounds the length of M; normalized-point domination and the Leray injection extend the bound to all proper normal modifications.

4.1F1F2F3step 3.1∎

If A is rational then M=0 and the trace is an isomorphism, whose inverse identifies ωA with the global sections of ωX; the usual sheaf evaluation then produces the adjoint pullback map f∗ωA→ωX. The Axiom of Choice and the Axiom of Dependent Choice are inherited from the cited suppliers.

Remarks

  • All identifications are unit and evaluation pairings over the fixed regular base, not abstract module isomorphisms.
  • The cokernel of the trace dualizes H1, and the principal-torsion bound is what converts an annihilation statement into a uniform length bound.

Depends on

Used by

Dependency tree · two levels

37 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