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.

A positively graded Noetherian algebra is finitely generated over its degree-zero part

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let A=⨁n≥0An be a graded commutative ring with A0 a field, and suppose A is Noetherian (Nonnegatively graded rings and modules, homogeneous elements, and twists, Left and right Noetherian rings). Then A is a finitely generated A0-algebra (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

Facts & Assumptions

Given: AC; a nonnegatively graded commutative ring A=⨁n≥0An with AnAm⊆An+m, whose degree-zero part A0 is a field, and which is Noetherian.

[F1]

Graded rings. A nonnegatively graded ring is a commutative ring S=⨁n≥0Sn with SnSm⊆Sn+m for all m,n≥0; an element of Sn is homogeneous of degree n (Nonnegatively graded rings and modules, homogeneous elements, and twists).

[F3]

Finite generation over the base. A commutative R-algebra A is of finite type over R, equivalently a finitely generated R-algebra, when A=R[a1,…,an] for some n∈N and some a1,…,an∈A; for n=0 this is the image of R (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

Proof

technique · direct
1.1F1F2given

Put A+=⨁n≥1An. Then A=A0⊕A+ as abelian groups, and A+ is an ideal of A: for a∈Am with m≥1 and b∈An one has ab∈Am+n with m+n≥1, and A+ is closed under sums by the direct-sum decomposition. Since A is Noetherian, the ideal A+ is finitely generated.

2.1F1step 1.1

Fix a finite generating list h1,…,hr of A+. Each hj is the finite sum of its homogeneous components, and because hj lies in A+=⨁n≥1An and this is a direct sum decomposition, the component of hj in Ad vanishes for d=0 and lies in Ad⊆A+ for d≥1; each hj is therefore the sum of its homogeneous components of positive degree. Discarding zero components and relabelling, we obtain finitely many homogeneous elements g1,…,gm∈A+ of positive degrees e1,…,em≥1 that still generate A+: every hj is an A-linear combination of the gi while each gi lies in A+=(h1,…,hr), so (h1,…,hr)⊆(g1,…,gm)⊆A+ and the two lists generate the same ideal.

3.1F1step 2.1

Every homogeneous element f∈Ad lies in the A0-subalgebra A0[g1,…,gm]. This is proved by induction on d. For d=0 one has f∈A0⊆A0[g1,…,gm]. For d≥1, step 2.1 gives f∈A+=(g1,…,gm), so f=∑irigi with ri∈A; taking the homogeneous component of degree d of this identity, and using that gi is homogeneous of degree ei, we may assume each ri lies in Ad−ei, which is the zero group when d−ei<0 because the grading is nonnegative. In the nonzero cases d−ei<d, so the induction hypothesis gives ri∈A0[g1,…,gm] and hence f=∑irigi∈A0[g1,…,gm].

4.1F1F3step 3.1∎

Let f∈A be arbitrary. Since A is the direct sum of the graded pieces Ad, the element f is a finite sum f=∑dfd of homogeneous elements fd∈Ad; by step 3.1 each fd lies in A0[g1,…,gm], hence so does f. Therefore A=A0[g1,…,gm] is generated as an A0-algebra by the finitely many elements g1,…,gm, that is, A is a finitely generated A0-algebra.

Remarks

  • The argument is the graded form of Nakayama: A+ is a homogeneous ideal, so it can be generated by homogeneous elements, and the top-degree part of a relation lowers the degree. This is the argument used by Brion in the proof of his Theorem 1.24(i) and by Popov–Vinberg in Theorem 3.6.
  • No choice is used beyond the finite generation supplied by the Noetherian hypothesis; with an empty generating list the conclusion reads A=A0=A0[∅].

Depends on

Used by

Dependency tree · two levels

20 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