Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-30
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 line bundle and trace datum of a smooth projective variety

Definition

Assume the Axiom of Choice. Let k be a field and let X be a projective k-scheme of finite type which is smooth of pure relative dimension n: every point of X has an open neighbourhood on which ΩX/k1 is locally free of rank n, which by the in-run theorem thm-differentials-smooth-locally-free of the flat/smooth/etale A page holds for every smooth X→Spec⁡k of pure relative dimension n. Here ΩX/k1 is the sheaf of relative differentials of Sheaf of relative Kähler differentials and Hq(X,−) is sheaf cohomology as in Sheaf cohomology as right derived global sections.

Dualizing line bundle. The sheaf ωX:=det⁡ΩX/k1:=⋀nΩX/k1 is the n-th exterior power of the locally free sheaf ΩX/k1 of rank n; it is a locally free OX-module of rank one, called the dualizing line bundle (or canonical bundle) of X. Its formation is functorial in the following weak sense: an isomorphism φ:X→X′ of smooth projective n-dimensional k-schemes induces a canonical isomorphism φ∗ωX′≅ωX.

Projective-space model. For X=Pkn with the standard homogeneous coordinates x0,…,xn, the dualizing bundle is ωPn≅O(−n−1). To see the bundle identity directly, on Ui=D+(xi) use the ordered coordinates xℓ/xi for ℓ≠i and the local generator ηi=(−1)i⋀ℓ≠id(xℓ/xi), with the indices in increasing order. The coordinate change on Ui∩Uj gives ηj=(xj/xi)−n−1ηi: its Jacobian has the displayed power, and the signs (−1)i remove the ordering sign. The standard frames xi−n−1 of O(−n−1) have this same transition, so sending xi−n−1 to ηi glues to the asserted isomorphism. For n=0 the empty wedge is 1 and both bundles are trivial on Pk0=Spec⁡k. By Cohomology of O(d) on projective space the group Hn(Pkn,O(−n−1)) is one dimensional with Laurent generator (x0⋯xn)−1. The Laurent-coefficient residue trace is the k-linear map tPn:Hn(Pkn,ωPn)⟶k which, on that monomial basis, sends the class with Laurent tail (x0⋯xn)−1 to 1∈k. Compatibility of this normalisation with cup products is the content of the twisting-sheaf duality theorem proved later on this page.

Normalized Serre trace. Let X be smooth projective of pure dimension n over k. A normalized Serre trace for X is a k-linear map tX:Hn(X,ωX)⟶k such that:

  1. after any closed immersion j:X↪PkN over k with pure codimension c=N−n, the Gysin map Gj:Hn(X,ωX)→HN(PkN,ωPN) is formed by the adjunction and regular-immersion identification Hn(X,ωX)≅Ext⁡PNN(j∗OX,ωPN) followed by the map on Ext induced contravariantly by the unit OPN→j∗OX and the identification Ext⁡PNN(OPN,ωPN)≅HN(PkN,ωPN); the normalization condition is the typed equality tX=tPN∘Gj;
  2. for every finite locally free OX-module E the evaluation pairing Hq(X,E)×Hn−q(X,E∨⊗ωX)⟶k,(α,β)⟼tX(α∪β), is a perfect pairing of k-vector spaces for every 0≤q≤n.

The existence of a normalized Serre trace, its nondegeneracy and its independence of the chosen embedding j are claims of thm-serre-duality-smooth-projective-variety-locally-free-sheaves proved later on this page; this definition only fixes the data, the sign convention ωX=det⁡ΩX/k1 and the projective-space normalisation. In particular the trace is not part of the definition of ωX and no existence statement is made here.

Depends on

Used by

Dependency tree · two levels

51 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