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.

Relative regularity, generation, and arbitrary base change

Statement

Assume AC and DC, inherited from the universal cohomology complex. Let T be any scheme, π:PTn→T, and F a finitely presented quasi-coherent sheaf flat over T. If all geometric fibres are m-regular, then for every r≥m, Riπ∗F(r)=0 for i>0, π∗F(r) is finite locally free, its formation commutes with every base change T′→T, and the evaluation π∗π∗F(r)→F(r) is surjective. Its rank is the fibre Hilbert polynomial evaluated at r. In an exact sequence 0→K→E→F→0 with E,F base-flat and finitely presented and fibrewise m-regular K,E,F, the direct-image sequence in each such degree is exact, locally free, and compatible with every base change.

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]

Fibre generation and vanishing follow from Regularity gives generation, multiplication, and vanishing. On each affine base the flat finitely presented sheaf has a bounded finite projective complex in nonnegative degrees computing cohomology after every coefficient-algebra change (Universal finite projective cohomology complex over any base). This supplier assumes AC and DC (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F2]

Nakayama's lemma is Assuming the Axiom of Choice, Nakayama's lemma. In a flat proper finitely presented family Euler characteristic is locally constant (Euler characteristic in a proper flat family is locally constant).

Proof

1.1F1algebra

Work on an affine open of T and make the complex in [F1] finite free locally. At any point its residue-field complex has zero positive cohomology by regularity. At the highest nonzero positive degree, exactness modulo the maximal ideal makes the incoming differential surjective; an invertible maximal minor splits off that final term together with an equal direct summand of the preceding term as a contractible pair. Repeat downwards. The remaining complex is a finite free module in degree zero. Every splitting survives arbitrary tensoring, so this description computes H0 after every algebra change and gives zero higher cohomology. The descriptions agree through the canonical cohomology comparison and glue.

2.1F1F2step 1.1algebra

The cokernel C of evaluation is of finite type. Formation of H0 commutes with residue-field extension by step 1.1, and each fibre evaluation is onto by [F1]. At a stalk above t, therefore Cx/mtCx=0. Since mtOx lies in the maximal ideal of the local ring Ox, Nakayama gives Cx=0. Evaluation is onto. The rank equals h0(Ft(r))=χ(Ft(r)) since all higher cohomology vanishes.

3.1step 1.1step 2.1algebra∎

The kernel K is base-flat: tensor the exact sequence by any base module; the Tor sequence and flatness of E,F show injectivity at the left and preservation of exactness, which is precisely flatness of K. Apply steps 1.1–2.1 to each sheaf and take the long exact direct-image sequence; R1π∗K(r)=0 gives the stated short exact sequence. The locally free quotient makes it split locally, hence every base change preserves it. The canonical cohomology comparisons identify the pulled-back sequence with that of the pulled-back sheaves.

Depends on

Used by

Dependency tree · two levels

87 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