Alphabeta Math
LemmaStatement: 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.

Empty Proj and irrelevant torsion

Statement

Assume the Axiom of Choice for the prime-ideal criterion (The Axiom of Choice). Let S=⨁d≥0Sd be a commutative nonnegatively graded ring with Proj⁡S as in Points of Proj of a graded ring, and let M be a graded S-module with associated sheaf M~ on Proj⁡S (Associated sheaf of a graded module on Proj). Then:

  1. Proj⁡S=∅ if and only if every homogeneous element of S+=⨁d>0Sd is nilpotent.
  2. If S+ is finitely generated as an ideal, this is equivalent to S+ being nilpotent: S+N=0 for some N≥0.
  3. If m∈M satisfies S+ rm=0 for some r≥0, then for every homogeneous f∈S+ of positive degree the image of m in the full localisation Mf is zero. Consequently every degree-zero fraction with such a numerator is zero in M(f)=Γ(D+(f),M~). No converse is asserted without degree-one generation of S over S0.

The zero ring S=0 and the case S+=0 are included: both are covered by statement 1 and 2 with Proj⁡S=∅.

Facts & Assumptions

Given: A commutative nonnegatively graded ring S, a graded S-module M, elements f∈S+ homogeneous of positive degree, and the Axiom of Choice.

[A1]

The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)

[F1]

Proj⁡S is the set of homogeneous prime ideals p with S+⊈p, and every prime ideal contains the nilradical, so contains all nilpotent elements. (Points of Proj of a graded ring)

[F2]

Over ZF the Axiom of Choice is equivalent to Zorn's lemma: a nonempty poset in which every chain has an upper bound has a maximal element. (The Axiom of Choice and Zorn's lemma are equivalent, Zorn's lemma)

[F3]

Every maximal ideal of a commutative ring is prime, and every maximal ideal is proper. (Every maximal ideal of a commutative ring is prime, Prime ideals and maximal ideals in a commutative ring)

[F4]

For a prime ideal q⊆S(f) the set P(q)={a∈S homogeneous:adeg⁡f/fdeg⁡a∈q} spans a homogeneous prime ideal p(q)⊆S with f∉p(q). (Prime correspondence on a Proj chart)

[F5]

For homogeneous f∈S+ of positive degree there is a canonical identification Γ(D+(f),M~)=M(f)=(M[f−1])0, and the sections on the charts determine M~. (Sections of a graded-module sheaf on a standard open)

Proof

technique · direct: relate emptiness of Proj to nilpotency through the standard charts and prime existence, convert finite generation into a nilpotency exponent by a pigeonhole count on monomials, and localise an element killed by $S_+$
1.1F1cases: all nilpotent

Empty Proj from all-nilpotent. Suppose every homogeneous element of S+ is nilpotent and let p⊆S be a homogeneous prime. All nilpotents lie in p by [F1], so S+⊆p and p is not a point of Proj⁡S; hence Proj⁡S=∅, which is the easy half of (1).

1.2algebracases: finitely generated

Finite generation forces a nilpotency exponent. Assume S+=(f1,…,fm) is finitely generated as an ideal with each fi homogeneous of positive degree, and assume every homogeneous element of S+ is nilpotent. If m=0, then S+=0 and S+1=0, so take N=1. Otherwise choose exponents ei≥1 with fiei=0 and put N=e1+⋯+em. The ideal S+N is spanned by the monomials fi1⋯fiN: expanding each of N factors of a product of elements of S+ as an S-combination of the generators exhibits every element of S+N as an S-combination of such monomials. For a monomial let ci be the number of occurrences of fi; then c1+⋯+cm=N, so if ci≤ei−1 for all i we would get N≤N−m<N, a contradiction; hence some ci≥ei, the monomial is divisible by fiei=0, and the monomial vanishes. Thus S+N=0.

1.3F5algebra

Irrelevant torsion is invisible on every chart. Let m∈M with S+ rm=0 and let f∈S+ be homogeneous of positive degree. Then fr∈S+ r, so frm=0 in M, hence the class of m in the full localisation Mf is zero. If a degree-zero fraction m/fk is formed from such a homogeneous m, it too is zero in the degree-zero component M(f)=(M[f−1])0, which by [F5] is Γ(D+(f),M~). As f was arbitrary, claim (3) follows on every standard chart.

2.1A1F1F2F3F4step 1.1cases: nonnilpotent element

Nonempty chart from a nonnilpotent element. Suppose f∈S+ is homogeneous of positive degree and not nilpotent. Then 1=fdeg⁡f/fdeg⁡f≠0 in the degree-zero localisation S(f), because S(f)=0 would force f to be nilpotent; hence S(f) is a nonzero commutative ring, its proper ideals form a nonempty poset in which every chain has an upper bound, and Zorn's lemma [F2] provides a maximal ideal q⊆S(f), which is prime by [F3]. By [F4] there is a homogeneous prime p(q)⊆S with f∉p(q); since f∈S+ this gives S+⊈p(q), so p(q)∈Proj⁡S and Proj⁡S≠∅. Together with step 1.1 this proves (1).

2.2step 1.2cases: zero ring

Converse and zero cases. If S+N=0 then every element of S+ is nilpotent, so the two conditions of (2) are equivalent; this argument also covers m=0, where S+=0=S+1, and the zero ring S=0, where Proj⁡S=∅ by [F1] and S+ is nilpotent.

3.1

Conclusion. Steps 1.1 and 2.1 prove the emptiness criterion (1), steps 1.2 and 2.2 the finite-generation form (2), and step 1.3 the local vanishing of irrelevant torsion (3). The Axiom of Choice [A1] is used exactly once, through Zorn's lemma [F2], to produce a prime ideal in the nonzero ring S(f) in step 2.1; steps 1.2 and 1.3 are choice-free. No converse of (3) is claimed: without degree-one generation an element can vanish in every chart localisation without being annihilated by a power of S+, and this boundary is not decided here. [A1, F2, step 1.2, step 2.1, step 1.3] \qed

Depends on

Used by

Dependency tree · two levels

30 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