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 is an object such that, locally on affine open neighborhoods , its corresponding complex has finite injective dimension over and the homothety map is an isomorphism. Here means bounded complexes with coherent cohomology, denotes derived internal Hom, and is global Ext, rather than a sheaf Ext.
For a projective scheme over a field , a normalization over consists of a dualizing complex and a trace for which the evaluation map induces natural isomorphisms for all and . For a pure -dimensional Cohen–Macaulay scheme (every local ring has depth equal to dimension), the normalized dualizing sheaf is . The local constructions on this page prove existence and ; concentration is a conclusion, rather than an additional definition. The shift convention is . Pure dimension means every irreducible component has dimension . A dualizing sheaf on a singular CM scheme need not be invertible.
Depends on
Used by
- Concentration of the projective dualizing complex on a pure CM scheme Lemma
- Dualizing complexes and coherent biduality for regular-ring quotients Lemma
- Existence and biduality from a projective embedding Lemma
- Normalized trace and independence of a projective embedding Lemma
- Serre duality for coherent sheaves on a projective Cohen–Macaulay scheme Theorem
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
- Stacks, Definition 47.15.1: local dualizing-complex conditions (standard reference, not scraped)
- Stacks, Lemma 48.27.1: normalization over a field (standard reference, not scraped)