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

Normalized trace and independence of a projective embedding

Statement

Assume AC. For a projective scheme X/k and a closed embedding i:X↪P=PkN, the dualizing complex Di=i!(ωP[N]) has a trace ti:RΓ(X,Di)→counitRΓ(P,ωP[N])→tPk. For K∈DCohb(X) this trace induces natural isomorphisms Hom⁡D(X)(K,Di[r])≅Hom⁡k(H−r(X,K),k)(r∈Z), by composition with a class OX→K[−r] and ti. Two embeddings give a unique isomorphism between their complexes which identifies these duality isomorphisms; it preserves the trace. Write the resulting normalized object as DX.

Facts & Assumptions

Given: X,k,i,K,r and AC.

[F1]

Construction and coherent biduality are Existence and biduality from a projective embedding.

[F2]

Closed-immersion adjunction and cohomology comparison are Derived adjunction for finite rings and closed immersions.

[F3]

Derived projective-space duality with its evaluation trace is Derived coherent duality on projective space; the Yoneda evaluation bijection identifies natural transformations from a representable functor with elements of the representing value (Evaluation at the identity gives Nat⁡(C(a,−),F)≅F(a) and proves that the natural-transformation collection is a set).

Proof

1.1F1F2F3construct

The adjunction [F2] identifies RHom⁡X(K,Di) with RHom⁡P(i∗K,ωP[N]). The pushforward i∗K is bounded coherent, so [F3] identifies the latter with RHom⁡k(RΓ(P,i∗K),k), which equals RHom⁡k(RΓ(X,K),k) by [F2]. Cohomology in degree r gives the displayed formula. The comparison is the evaluation pairing: for maps α:K→Di[r] and β:OX→K[−r], adjunction takes α to the ambient map followed by the counit. It takes β followed by i∗OX to the same ambient composition; pulling back the unit OP→i∗OX makes the equality immediate by evaluation at 1. Thus the paired scalar is ti(α[−r]∘β), not merely an unspecified vector-space isomorphism.

2.1F1F3step 1.1algebra∎

At r=0, each embedding gives a representation on DCohb(X) of the same contravariant functor K↦Hom⁡k(H0(X,K),k). Both representing objects lie in that category by [F1]. The Yoneda evaluation bijection [F3] supplies a unique isomorphism: evaluate the natural comparison at the first representing object on its identity, and do the reverse at the second; naturality says that the two composites are identities. The trace itself is recovered by evaluating the represented functional for a map OX→Di at 1∈H0(X,OX), so this isomorphism preserves it. Naturality under shifts then preserves every degree and triangle comparison. These unique isomorphisms compose transitively, proving independence of the embedding with its normalization; an unnormalized dualizing complex alone is not claimed to be uniquely isomorphic. AC is retained from [F1]–[F3].

Depends on

Used by

Dependency tree · two levels

32 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