Abstract Algebra
Commutative Algebra
When Hilbert proved his basis theorem in 1888, Gordan exclaimed: "This is theology, not mathematics!"-because Hilbert proved a finite basis exists without constructing it. Today, Buchberger's algorithm builds Gröbner bases explicitly, and commutative algebra has become a computational science.
- Computer algebra systems (Mathematica, Sage): Gröbner bases solve polynomial systems-a direct application of Noetherian-ness
- Robotics and kinematics: the configuration space of a robot is an algebraic variety whose ideal is computed via Gröbner bases
- Number theory: rings of algebraic integers are Noetherian; Minkowski's lattice basis theorem
Предварительные знания
Primary Ideals and Primary Decomposition
A **primary ideal** q ⊊ R is an ideal where ab ∈ q implies a ∈ q or b^n ∈ q for some n ≥ 1. Its radical √q is a prime ideal. Analogy: prime ideals are like prime numbers; primary ideals are like prime powers (p^k). **Lasker-Noether theorem:** In a Noetherian ring, every ideal I decomposes as an intersection of primary ideals: I = q₁ ∩ q₂ ∩ ... ∩ qₙ (primary decomposition). This is the ideal-theoretic analog of prime factorization for integers! **Isolated vs. embedded components:** √qᵢ = pᵢ is the associated prime. The component qᵢ is isolated if pᵢ contains no other pⱼ. Embedded components correspond geometrically to "components with multiplicity".
**Uniqueness:** The isolated components of a primary decomposition are uniquely determined (Noether's theorem). Embedded components are not unique; their choice depends on the decomposition. This algebraically encodes the notion of "multiplicity": a point of tangency has an embedded component of the zero cycle.