Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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.

Global sections of projective twists

Statement

Assume the Axiom of Choice as inherited from the cited theorem (The Axiom of Choice). Let A be a commutative ring with 1 (Commutative ring), let n≥0 and d∈Z, and let OX(d) be the twisting sheaf on X=PAn (Relative projective space from standard charts, Twisting sheaf on Proj). Then for n>0, H0(X,OX(d))≅A[x0,…,xn]d  (d≥0),H0(X,OX(d))=0  (d<0), where A[x0,…,xn]d is the degree-d graded piece of the polynomial ring (Nonnegatively graded rings and modules, homogeneous elements, and twists), and for n=0, H0(PA0,O(d))≅Afor every d∈Z. The zero ring A=0 is allowed, in which case X=∅ and both sides are zero.

Facts & Assumptions

Given: The Axiom of Choice as inherited, a commutative ring A with 1, integers n≥0 and d, and the twisting sheaf O(d) on PAn.

[F1]

Cohomology of twists on projective space: for every commutative ring A, every n≥0 and every d∈Z, Hq(PAn,O(d))=0 unless q=0 or q=n; if n>0 then H0(PAn,O(d))≅A[x0,…,xn]d for d≥0 and H0(PAn,O(d))=0 for d<0; and for n=0, PA0=Spec⁡A with H0(PA0,O(d))≅A for every d and all higher groups zero, with A=0 allowed. (Cohomology of O(d) on projective space)

Proof

technique · direct: read the degree-zero part off the full computation of the cohomology of twists
1.1F1

Apply [F1] to A, n and d. In degree q=0 it states exactly the three assertions: for n>0 the group H0(PAn,O(d)) is A[x0,…,xn]d when d≥0 and 0 when d<0, while for n=0 it is A for every d; in the case A=0 the theorem records that PAn=∅ and all groups vanish, matching A[x0,…,xn]d=0.

2.1F1∎

Boundaries and choice accounting. The case d=0 is included and gives H0≅A for n≥0: for n>0 the degree-zero piece A[x0,…,xn]0 consists of the constant polynomials, and for n=0 the theorem gives A directly. The case n=0 is not deduced from the n>0 formula, which would give A only for d≥0, but taken from the theorem's separate clause for every sign of d. The Axiom of Choice is inherited from [F1] and nothing further is selected.

Depends on

Used by

Dependency tree · two levels

33 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