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.

Vanishing of top cohomology past the canonical threshold

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let k be a field, let X be an integral smooth projective surface over k, let KX be a canonical divisor (The canonical divisor of a smooth projective surface), let H be an ample invertible OX-module (Absolute ampleness by affine section opens) and let M be an invertible OX-module with M⋅H>KX⋅H. Then H2(X,M)=0. Equivalently H0(X,ωX⊗M∨)=0.

Facts & Assumptions

Given: a field k, an integral smooth projective surface X over k, a canonical divisor KX, an ample invertible sheaf H, and an invertible sheaf M with M⋅H>KX⋅H.

[F1]

Serre duality: for the invertible sheaf M the pairing H2(X,M)×H0(X,M∨⊗ωX)→H2(X,ωX)→tXk is perfect and both groups are finite-dimensional (Serre duality for locally free sheaves on a smooth projective variety); hence h2(X,M)=h0(X,ωX⊗M∨) and H2(X,M)=0 if and only if H0(X,ωX⊗M∨)=0 (Euler characteristic of a coherent sheaf, Invertible sheaves, Tensor product of sheaves of modules).

[F2]

Positivity of ample classes: if D is a nonzero effective Cartier divisor, then H⋅D>0; and if an invertible sheaf N has a nonzero global section whose zero scheme is empty, then N≅OX (Ample divisors meet nonzero effective divisors positively).

[F3]

Zero schemes of sections: a nonzero global section of an invertible sheaf on the integral scheme X is regular, its zero scheme Z(s) is an effective Cartier divisor with OX(Z(s))≅N, and Z(s) is empty if and only if s is nowhere vanishing (A regular global section of an invertible sheaf glues to an effective Cartier divisor, Zero scheme of a line-bundle section).

[F4]

The intersection numbers KX⋅H and M⋅H are computed through the associated invertible sheaves ωX and M; they depend only on the linear equivalence classes and are additive, so that (KX−M)⋅H=KX⋅H−M⋅H (The canonical divisor of a smooth projective surface, Intersection numbers of Cartier divisors on a smooth projective surface, The surface intersection product is symmetric and bilinear).

[F5]

The Axiom of Choice is inherited from the Serre-duality and ample-positivity suppliers of [F1] and [F2]; the section used below, if it exists, is a single object.

Proof

technique · direct: pass to the Serre-dual space, suppose it has a nonzero section, and split into the nowhere-vanishing and effective-divisor cases
1.1F1F4

Duality reduction. Put N:=ωX⊗M∨. By [F1] it suffices to prove H0(X,N)=0.

1.2F2F3F4

A nonzero section leads to a contradiction. Suppose 0≠s∈H0(X,N) and let Z:=Z(s) be its zero scheme. By [F3], Z is either empty or an effective Cartier divisor with OX(Z)≅N. If Z=∅, then s is nowhere vanishing, so N≅OX by [F2]; tensoring with M gives ωX≅M, hence M⋅H=KX⋅H, contradicting the hypothesis. If Z≠∅, then Z is a nonzero effective Cartier divisor whose sheaf is OX(Z)≅ωX⊗M∨; by linear-equivalence invariance of the intersection product and positivity [F2], [F4], 0<Z⋅H=(KX−M)⋅H=KX⋅H−M⋅H, so M⋅H<KX⋅H, again contradicting the hypothesis.

2.1F5step 1.1step 1.2∎

Conclusion. Both cases of step 1.2 are impossible, so H0(X,ωX⊗M∨)=0 and hence H2(X,M)=0 by step 1.1. The Axiom of Choice is inherited from the suppliers recorded in [F5]; no family of sections is selected.

Depends on

Used by

Dependency tree · two levels

74 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