Alphabeta Math
TheoremStatement: 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.

The Hodge index theorem for an ample class

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 H be an ample invertible OX-module (Absolute ampleness by affine section opens) and let L be an invertible OX-module with L⋅H=0. Then:

(a) L⋅L≤0; (b) L⋅L=0 if and only if L is numerically trivial (Numerical equivalence and the Neron-Severi space of a surface).

Facts & Assumptions

Given: a field k, an integral smooth projective surface X over k, an ample invertible sheaf H, and an invertible sheaf L with L⋅H=0.

[F1]

The intersection product is symmetric and Z-bilinear, so (L⊗H⊗m)⋅(L⊗H⊗m)=L⋅L+m2(H⋅H) because L⋅H=0, and (L⊗H⊗m)⋅L=L⋅L; the product is trivial against the structure sheaf and depends only on isomorphism classes (Intersection numbers of Cartier divisors on a smooth projective surface, The surface intersection product is symmetric and bilinear, Invertible sheaves, Tensor product of sheaves of modules, Dual of a line bundle is its tensor inverse).

[F2]

Large ample twists of L are very ample: there is m0 such that L⊗H⊗m is closed H-very ample, hence H-very ample and ample, for every m≥m0 (Large ample twists of a line bundle are very ample, Relative very ampleness implies relative ampleness, Absolute ampleness by affine section opens). In particular H⋅H>0 (Ample divisors meet nonzero effective divisors positively).

[F3]

Positive square and positive ample intersection force an effective multiple: if A is ample and M is invertible with M⋅M>0 and M⋅A>0, then H0(X,M⊗n)≠0 for some n≥1 (Positive square and positive ample intersection force an effective multiple).

[F4]

Sections and positivity: a nonzero global section of an invertible sheaf M on the integral X is regular, its zero scheme Z is an effective Cartier divisor with OX(Z)≅M, and if Z=∅ then M≅OX (A regular global section of an invertible sheaf glues to an effective Cartier divisor, Zero scheme of a line-bundle section, Ample divisors meet nonzero effective divisors positively). A nonzero effective Cartier divisor D satisfies H⋅D>0, and H⋅D=deg⁡D(H∣D) (Ample divisors meet nonzero effective divisors positively, Intersection with a curve is the degree of the restriction).

[F5]

Numerical triviality: L is numerically trivial exactly when L⋅N=0 for every invertible N; otherwise there is an invertible Q with Q⋅L≠0 (Numerical equivalence and the Neron-Severi space of a surface).

[F6]

The Axiom of Choice is inherited from the embedding, positive-square and positivity suppliers of [F2]–[F4]; the integer m and the sign of n below are chosen from finitely described data.

Proof

technique · direct: reduce part (a) to the positive-square lemma via a large ample twist, then handle the equality case of part (b) by a two-parameter perturbation
1.1F1F2F3

Part (a), first reduction. Suppose L⋅L>0. By [F2] choose m≥m0 and put L′:=L⊗H⊗m, an ample invertible sheaf. By [F1], L′⋅L′=L⋅L+m2(H⋅H)>0 and L′⋅L=L⋅L>0. Applying [F3] with the ample class L′ and the sheaf L, we obtain n≥1 with H0(X,L⊗n)≠0.

2.1F1F4step 1.1

Part (a), contradiction. Let n≥1 and let s be a nonzero global section of L⊗n; by [F4] its zero scheme Z is an effective Cartier divisor with OX(Z)≅L⊗n, and L⊗n⋅H=n(L⋅H)=0 by [F1]. If Z≠∅, then H⋅Z>0 by [F4], contradicting H⋅Z=L⊗n⋅H=0. Hence Z=∅ and L⊗n≅OX by [F4]; then L⋅L=n−2(L⊗n⋅L⊗n)=0 by [F1], contradicting L⋅L>0. Therefore L⋅L≤0, proving (a).

3.1F1F2F5step 2.1

Part (b). If L is numerically trivial then L⋅L=0 by definition [F5]. Conversely assume L⋅L=0 and suppose L is not numerically trivial; by [F5] choose an invertible Q with Q⋅L≠0. Put R:=Q⊗(H⋅H)⊗H⊗−(Q⋅H), an invertible sheaf with R⋅H=(H⋅H)(Q⋅H)−(Q⋅H)(H⋅H)=0,R⋅L=(H⋅H)(Q⋅L)−(Q⋅H)(H⋅L)=(H⋅H)(Q⋅L)≠0, using H⋅L=0, H⋅H>0 and bilinearity [F1, F2]. For an integer n put L′:=L⊗n⊗R; then L′⋅H=n(L⋅H)+R⋅H=0 and L′⋅L′=n2(L⋅L)+2n(L⋅R)+R⋅R=2n(L⋅R)+R⋅R, which is positive for a suitable sign of n because L⋅R≠0. Part (a) applied to L′ then gives L′⋅L′≤0, a contradiction. Hence L is numerically trivial, and part (b) follows in both directions.

4.1F6step 2.1step 3.1∎

Conclusion and choice accounting. Step 2.1 proves (a) and step 3.1 proves (b); the Axiom of Choice is inherited from the suppliers recorded in [F6].

Depends on

Used by

Dependency tree · two levels

89 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