Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

One cocycle carried through the residue realization of Serre duality

Example

Assume the Axiom of Choice as inherited from the cited duality, residue and cohomology suppliers (The Axiom of Choice). Let k be a perfect field, let C=Pk1 have coordinate t=x1/x0 on U0, fix d≥0, and put L=O(−d−2). Its dual canonical twist is ωC⊗L−1≅O(d).

For 1≤j≤d+1, the local tail in the U0 frame of L, cj=[t−j⊗x0−d−2]∈H1(C,L), is a finite-support principal-part class. For 0≤m≤d, the section of the dual twist is σm=tmdt⊗x0d+2on U0,σm=−sd−mds⊗x1d+2on U1, where s=1/t. The second expression shows it is regular at infinity and corresponds to x0d−mx1m under ωC≅O(−2).

The positive residue pairing evaluates at the supported rational point: ⟨cj,σm⟩=res⁡0(tm−jdt)=δj,m+1. With rows j=1,…,d+1 and columns m=0,…,d, this is the diagonal identity matrix. Reversing the section order to m=d,…,0 makes it anti-diagonal. Since the sections form a basis, this invertible matrix also proves that the classes cj form a basis. The fixed normalized Serre pairing is its negative, so its matrix has entries −δj,m+1; it is perfect. At d=0 its value on c1 and σ0 is −1, which equals 1 in characteristic two.

The Axiom of Choice enters through the cited suppliers; the displayed computations make no additional choices.

Facts & Assumptions

Given: the Axiom of Choice, a perfect field k, C=Pk1 with coordinate t=x1/x0, an integer d≥0, and L=O(−d−2).

[F1]

The Axiom of Choice is inherited through the duality, residue and projective-cohomology suppliers; this computation makes no further selection. (The Axiom of Choice)

[F2]

The canonical bundle is ωC≅O(−2). Under the standard charts, dt=−s−2ds and the canonical-bundle identification sends dt to x0−2 and ds to −x1−2. The sheaves O(r) are invertible, satisfy O(r)−1≅O(−r), and their frames obey x0r=srx1r on the overlap. (Canonical bundle and canonical divisors, Twisting sheaf on Proj)

[F3]

The cohomology of the twists gives H1(O(−d−2)) the Laurent basis x0e0x1e1 with e0,e1<0 and e0+e1=−d−2, and gives H0(O(d)) the basis x0d−mx1m, 0≤m≤d. (Cohomology of O(d) on projective space)

[F4]

Principal parts compute H1 as finite-support local tails modulo principal parts of global meromorphic sections (including zero); in particular each tail t−j in the frame x0−d−2 represents the class cj. (H^1 of a line bundle on a curve as principal parts modulo meromorphic and regular sections)

[F5]

At a rational point with parameter t, residue is the coefficient of t−1dt. Over a perfect field, the positive residue pairing is the sum of these local residues. (Residue of a rational differential at a separable closed point, The residue pairing of a line bundle with the dual canonical twist, Perfect fields: every irreducible polynomial is separable)

[F6]

Over a perfect field, the fixed normalized Serre pairing is the negative of the positive residue pairing. (Serre duality for line bundles on a smooth proper curve, and the residue realization, Normalization of the trace for Serre duality on a curve)

[F7]

For a smooth proper geometrically integral curve, h1(C,ωC)=h0(C,OC). (h^1 of a line bundle equals the dimension of the space of dual sections)

Verification

Proof technique: represent the tails and global sections in their actual line-bundle frames, evaluate the positive local coefficient, and apply the fixed-trace sign comparison.

1.1F1F2F3F4

By [F2], ωC⊗L−1≅O(d), and [F3] gives dim⁡kH1(C,L)=dim⁡kH0(C,O(d))=d+1. For each 1≤j≤d+1, the tail t−j in the U0 frame has finite support at the rational origin and represents cj by [F4].

2.1F1F2F3step 1.1

The standard section x0d−mx1m is tmx0d on U0, so under dt↦x0−2 it is represented by σm=tmdt⊗x0d+2. With s=1/t, dt=−s−2ds and x0d+2=sd+2x1d+2, this becomes −sd−mds⊗x1d+2, regular for 0≤m≤d. Thus the σm form the displayed section basis.

3.1F1F5F6step 1.1step 2.1

Multiplying the local representative of cj by σm cancels the line-bundle frames and gives tm−jdt at the origin. By [F5], its positive residue is 1 when m−j=−1 and 0 otherwise, namely δj,m+1. By [F6], the fixed normalized Serre value is −δj,m+1.

4.1F1F3step 1.1step 2.1step 3.1algebra

For ascending section order m=0,…,d, the matrix δj,m+1 is diagonal; for reversed order m=d,…,0 it is anti-diagonal. Since the sections form a basis by step 2.1, invertibility of this positive residue matrix proves that the cj are independent; their number is d+1=dim⁡kH1(C,L) by step 1.1, so they form a basis. The normalized matrix is its negative and is invertible, so both pairings are perfect.

5.1F1F2F6F7step 3.1∎

For d=0, [F7] gives h1(C,ωC)=1, and step 3.1 gives normalized trace −1 on [t−1⊗x0−2] paired with dt⊗x02. In characteristic two this value is 1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

129 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