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.

Regularity gives generation, multiplication, and vanishing

Statement

Assume AC and DC. If a coherent F on Pkn is m-regular, then Hi(F(t))=0 for i>0 and t≥m−i. For t≥m, F(t) is globally generated and the multiplication map H0(O(1))⊗kH0(F(t))→H0(F(t+1)) is surjective. These conclusions hold over every field.

Facts & Assumptions

Given: The hypotheses in the statement and AC and DC, inherited from the scheme, cohomology, and finite-module suppliers (The Axiom of Choice, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F1]

Cohomology commutes with field extension, which is faithfully flat (Flat field extension commutes with coherent cohomology). Serre vanishing and eventual global generation hold for coherent sheaves on projective space (Serre vanishing for coherent sheaves and ample twists, Eventual generation of coherent projective twists).

[F2]

A finite module over a Noetherian ring has finitely many associated primes; zero divisors are their union. This applies on the finite standard affine cover to associated points of a coherent sheaf (Finite modules over Noetherian rings have finitely many associated primes, Zero divisors on a module over a Noetherian ring are the union of its associated primes). Projective-space twists have the usual cohomology and cohomological dimension (Cohomology of O(d) on projective space, Projective n-space has quasi-coherent cohomological dimension at most n).

Proof

1.1F1F2construct

Extend the field to k(u) if necessary. By faithful flatness and [F1], both vanishing and surjectivity descend; generation descends by applying faithful flatness to the evaluation cokernel. We may therefore assume k infinite. There is a hyperplane H avoiding the finitely many associated points of F: hyperplanes containing a fixed associated point form a proper linear subset of the dual projective space, and a finite union of these subsets cannot exhaust its rational points over an infinite field. Multiplication by its equation gives 0→F(−1)→F→FH→0.

2.1step 1.1algebra

Induct on n, the case n=0 being immediate. The long exact sequence at twist m−i gives Hi(FH(m−i))=0, since its adjacent groups Hi(F(m−i)) and Hi+1(F(m−i−1)) vanish. Thus FH is m-regular. For each i>0, start at t=m−i and induct on t using Hi(F(t−1))→Hi(F(t))→Hi(FH(t)); the first term vanishes by the induction on t, and the last by induction on n. This proves all the stated vanishings.

3.1F2step 2.1algebra

For t≥m, H1(F(t−1))=0 makes H0(F(t))→H0(FH(t)) surjective. The restriction H0(O(1))→H0(OH(1)) is also surjective. Induction on n makes the multiplication on H surjective. Consequently every section of F(t+1) is the sum of a product of a linear form with a section of F(t) and a section in the kernel of restriction to H. This kernel is multiplication by the equation of H on H0(F(t)), and is itself in the image of multiplication. The desired multiplication is surjective.

4.1F1step 1.1step 3.1∎

Iterating multiplication shows that H0(F(t))⊗H0(O(a))→H0(F(t+a)) is surjective for a≥0. For sufficiently large a, F(t+a) is globally generated by [F1]. At a stalk, the products of sections all lie in the image of H0(F(t))⊗O(a)→F(t+a); this image is therefore the whole stalk. Tensoring by the inverse invertible twist gives generation of F(t). Field descent in step 1.1 completes the argument over arbitrary k.

Depends on

Used by

Dependency tree · two levels

108 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