Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-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.

Dualizing complexes and the normalized dualizing sheaf on a projective CM scheme

Definition

A dualizing complex on a Noetherian scheme X is an object DX∈DCohb(X) such that, locally on affine open neighborhoods U=Spec⁡B, its corresponding complex has finite injective dimension over B and the homothety map B→RHom⁡B(DX∣U,DX∣U) is an isomorphism. Here DCohb means bounded complexes with coherent cohomology, R ⁣Hom denotes derived internal Hom, and Ext⁡Xr(M,N)=Hom⁡D(X)(M,N[r]) is global Ext, rather than a sheaf Ext.

For a projective scheme over a field k, a normalization over k consists of a dualizing complex DX and a trace tX:RΓ(X,DX)→k for which the evaluation map induces natural isomorphisms Hom⁡D(X)(K,DX[r])≅Hom⁡k(H−r(X,K),k) for all K∈DCohb(X) and r∈Z. For a pure d-dimensional Cohen–Macaulay scheme (every local ring has depth equal to dimension), the normalized dualizing sheaf is ωX=H−d(DX). The local constructions on this page prove existence and DX≅ωX[d]; concentration is a conclusion, rather than an additional definition. The shift convention is Ha(K[b])=Ha+b(K). Pure dimension means every irreducible component has dimension d. A dualizing sheaf on a singular CM scheme need not be invertible.

Depends on

Used by

Dependency tree · two levels

17 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