A graded ring decomposes as a direct sum R = R₀ ⊕ R₁ ⊕ R₂ ⊕ ··· where each Rₙ is an additive subgroup and RₘRₙ ⊆ Rₘ₊ₙ. The polynomial ring k[x₁, ..., xₙ] is the prototypical example, graded by total degree. Grading introduces a notion of "degree" that is compatible with ring operations, enabling dimension counting through Hilbert functions and connecting algebra to projective geometry.
You already know that the polynomial ring k[x₁, ..., xₙ] has a natural notion of degree: each monomial x₁^{a₁}···xₙ^{aₙ} has total degree a₁ + ··· + aₙ, and the product of a degree-d monomial with a degree-e monomial has degree d + e. A graded ring abstracts this structure. A ring R is graded (by non-negative integers) if it decomposes as R = R₀ ⊕ R₁ ⊕ R₂ ⊕ ··· where each Rₙ is an additive subgroup and multiplication respects the grading: if a ∈ Rₘ and b ∈ Rₙ, then ab ∈ Rₘ₊ₙ. Elements of Rₙ are called homogeneous of degree n.
The polynomial ring k[x, y] illustrates the structure concretely. R₀ = k (the constants), R₁ = kx + ky (linear forms), R₂ = kx² + kxy + ky² (quadratic forms), and so on. Each Rₙ is a finite-dimensional k-vector space, and the dimension dim_k(Rₙ) = n + 1 counts the monomials of degree n in two variables. Every polynomial decomposes uniquely as a sum of homogeneous components. The homogeneous ideals — those generated by homogeneous elements, equivalently those closed under taking homogeneous components — are the algebraically "natural" ideals in this setting.
Graded rings arise naturally in two contexts. In projective algebraic geometry, the coordinate ring of projective space is a graded polynomial ring, and projective varieties correspond to homogeneous prime ideals. Points, curves, and surfaces in projective space are described by homogeneous polynomials, and the grading encodes the scaling symmetry of projective coordinates. In invariant theory, the ring of polynomial invariants under a group action inherits a grading from the ambient polynomial ring.
The main algebraic tool for studying graded rings is the Hilbert function H(R, n) = dim_k(Rₙ), which measures how the graded components grow. For polynomial rings, this growth is polynomial in n, and the Hilbert function eventually agrees with a polynomial — the Hilbert polynomial — whose degree equals the Krull dimension minus one. This connection between combinatorial data (dimensions of graded pieces) and geometric data (dimension of the corresponding variety) is one of the deepest themes in commutative algebra and algebraic geometry.
No topics depend on this one yet.