Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

The projective-space twist pairing in Serre duality

Statement

Assume the Axiom of Choice. Let k be a field and consider Pk2 with the residue trace of Residue pairing between H^0 and top cohomology of projective space. Then the class x02∈H0(Pk2,O(2)) pairs to 1 with the class x0−3x1−1x2−1∈H2(Pk2,O(−5)) and to 0 with every other monomial basis class of H2(Pk2,O(−5)); in particular the pairing H0(O(2))×H2(O(−5))→k of Serre duality for twisting sheaves on projective space is nondegenerate on the basis monomial x02, and the six monomial basis classes of H2(O(−5)) are each detected by a degree-two monomial.

Facts & Assumptions

Given: the field k, the projective plane Pk2 with homogeneous coordinates x0,x1,x2, and the two monomial classes displayed in the statement.

[F1]

For n≥1 and d≥0 the pairing H0(Pkn,O(d))×Hn(Pkn,O(−n−1−d))→k is the coefficient of (x0⋯xn)−1 in the product of the representing monomials; H0(O(d)) has as a k-basis the degree-d monomials and Hn(O(−n−1−d)) the all-negative monomials of total degree −n−1−d. (Residue pairing between H^0 and top cohomology of projective space)

[F2]

For every d and q the evaluation pairing Hq(O(d))×Hn−q(O(−d−n−1))→k using the residue trace is perfect. (Serre duality for twisting sheaves on projective space)

[F3]

The Axiom of Choice is The Axiom of Choice.

Proof

1.1F1

The two bases. For n=2 and d=2 the first space H0(Pk2,O(2)) has the six degree-two monomials x02,x0x1,x0x2,x12,x1x2,x22 as a basis, and the second space H2(Pk2,O(−5)) has the six all-negative monomials of total degree −5 as a basis, namely x0e0x1e1x2e2 with e0,e1,e2<0 and e0+e1+e2=−5: writing fi=−ei≥1 gives f0+f1+f2=5, so there are (5−12)=6 such classes, among them x0−3x1−1x2−1.

1.2F1F2

The nonzero pairing. Multiplying the two displayed classes gives x02⋅x0−3x1−1x2−1=x0−1x1−1x2−1, whose coefficient in x0−1x1−1x2−1 is 1; by the coefficient description of the pairing in [F1] one has ⟨x02,x0−3x1−1x2−1⟩=1, and t(x02∪x0−3x1−1x2−1)=1 for the residue trace t of [F2].

2.1F1step 1.1step 1.2

All cross pairings vanish. Let x0e0x1e1x2e2 be a basis class of H2(O(−5)) different from x0−3x1−1x2−1. Its product with x02 has exponent vector (2+e0,e1,e2), and the coefficient of x0−1x1−1x2−1 in that monomial is 1 exactly when (2+e0,e1,e2)=(−1,−1,−1), that is e0=−3, e1=e2=−1; if e0≠−3 the first coordinate is wrong and the pairing is 0, while if e0=−3 the total-degree condition e0+e1+e2=−5 forces e1+e2=−2 with e1,e2<0, so e1=e2=−1 and the class is the one already treated. Hence the pairing of x02 with every other basis class is 0 by the coefficient description of [F1].

3.1F1F2F3step 1.2step 2.1∎

Nondegeneracy on the displayed class. Step 1.2 exhibits a class pairing to 1 with x02, so x02 is detected by the pairing; conversely, for each of the six basis classes xe‾ of H2(O(−5)) the monomial xa‾ of degree 2 with ai=−1−ei≥0 satisfies ⟨xa‾,xe‾⟩=1 by the bijection of [F1], so every basis class is detected, in accordance with the perfectness of the pairing recorded in [F2]. The Axiom of Choice is assumed in the statement and declared as the dependency The Axiom of Choice ([F3]); it is inherited through the two named suppliers and no further choice is made.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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