---
title: Nagata's Factoriality Theorem
url: https://www.emergentmind.com/topics/nagata-s-factoriality-theorem
type: topic
---

# Nagata's Factoriality Theorem

Nagata's factoriality theorem is a localization criterion for factoriality, that is, for the unique factorization domain property. In the corrected form emphasized by recent formalization work, it states that if \(R\) is a noetherian integral domain and \(S \subseteq R\) is a prime-generated submonoid such that the localization \(S^{-1}R\) is a UFD, then \(R\) itself is a UFD [2604.05238]. The theorem identifies a precise descent mechanism: factoriality can pass from a localization back to the original ring when the inverted elements are finite products of primes already lying in the submonoid.

## 1. Statement and algebraic content

The theorem is formulated for a noetherian integral domain \(R\) and a submonoid \(S \subseteq R\). Its modern precise form is:

\[
\text{If } R \text{ is a noetherian integral domain, } S \subseteq R \text{ is prime-generated, and } S^{-1}R \text{ is a UFD, then } R \text{ is a UFD.}
\]

The decisive hypothesis is that \(S\) is **prime-generated**. This means that every element of \(S\) is a finite product of elements of \(S\) that are prime in \(R\). In the formalized presentation, this is expressed as

\[
\mathit{PrimeGenerated}(S)
\;:=\;
\forall\, s\in S,\;
\exists f:\mathrm{Multiset}(R),\;
\Bigl(\forall q\in f,\ q\in S \wedge \mathrm{Prime}(q)\Bigr)\wedge \prod f=s.
\]

The theorem is therefore not a statement about arbitrary localizations. It is a theorem about localizations at multiplicative systems whose elements are built from primes in a controlled way. In that sense, it is a descent theorem for factoriality rather than a general permanence theorem under localization [2604.05238].

## 2. Why the hypotheses are structured as they are

Recent work makes explicit that the superficially simpler condition

\[
\forall s\in S,\quad \mathrm{Prime}(s)\ \lor\ \mathrm{IsUnit}(s)
\]

is too restrictive. If \(p,q\in S\) are distinct nonunit primes, then \(pq\in S\) because \(S\) is a submonoid, but \(pq\) is typically neither prime nor a unit. For that reason, the prime-or-unit condition effectively collapses to essentially one-prime situations such as

\[
S=\{1,p,p^2,\dots\}.
\]

The prime-generated condition is the mathematically correct replacement: it allows products of primes in \(S\) without requiring those products themselves to be prime [2604.05238].

The noetherian hypothesis also has a specific role in the proof. It is used to place \(R\) in the setting of a well-founded divisibility monoid, so that every nonzero nonunit factors into irreducibles. The theorem then reduces factoriality to a primality statement for irreducibles. This shows that Nagata's theorem is not merely about localization; it depends equally on a factorization framework internal to the original ring.

A common misconception is that factoriality should descend from any UFD localization. Nagata's theorem does not assert this. The prime-generated hypothesis is the mechanism that allows divisibility data to be transferred back across localization.

## 3. Proof strategy and descent of primality

The proof strategy described in current formalizations is the classical one. Since \(R\) is noetherian, every nonzero nonunit factors into irreducibles. By the UFD criterion used there, it remains to prove that every irreducible element of \(R\) is prime [2604.05238].

Let \(p\in R\) be irreducible. The argument splits into two cases.

In the first case, \(p\mid s\) for some \(s\in S\). Because \(s\) factors into primes from \(S\), the irreducibility of \(p\) forces \(p\) into the prime-generated structure of \(S\). This yields primality of \(p\) directly.

In the second case, \(p\) avoids the multiplicative system. The formalization isolates this as the predicate

\[
\mathit{Avoids}(S,p)=\forall s\in S,\ \neg(p\mid s).
\]

Under this avoidance hypothesis, \(p/1\) remains irreducible in the localization \(S^{-1}R\). Since \(S^{-1}R\) is assumed to be a UFD, \(p/1\) is therefore prime there. The remaining step is to descend primality from the localization back to \(R\).

The basic divisibility bridge is

\[
\iota(a)\mid \iota(b) \iff \exists s\in S,\ a\mid s\cdot b,
\]

where \(\iota:R\to S^{-1}R\) is the localization map. This interface allows one to translate a divisibility relation in the localization into a divisibility relation in the original ring after clearing denominators. The prime-generated structure is then used prime-by-prime to control those denominators. Thus the proof shows that an irreducible \(p\) avoiding \(S\) is prime because its image \(p/1\) is prime in \(S^{-1}R\), and that primality can be lifted back through the localization map.

## 4. Polynomial-ring consequences

A standard application formalized in detail is the proof that \(R[X]\) is a UFD whenever \(R\) is a noetherian UFD. Two distinct Nagata-based proofs are packaged [2604.05238].

The first proof localizes at the powers of \(X\):

\[
S=\{1,X,X^2,\dots\}.
\]

Since \(X\) is prime in \(R[X]\), this submonoid is prime-generated. The localization \(S^{-1}R[X]\) is identified with the Laurent polynomial ring \(R[X,X^{-1}]\), and the formalization proves that if \(R\) is a UFD, then \(R[X,X^{-1}]\) is a UFD. Nagata's theorem then descends factoriality from the Laurent polynomial ring back to \(R[X]\).

The second proof localizes at the submonoid generated by constant primes in \(R[X]\). This localization is compared with \(\mathrm{Frac}(R)[X]\), which is a polynomial ring over a field and hence a UFD. Again the conclusion is obtained by Nagata descent.

The same package yields the iterated polynomial corollary

\[
R[X][Y]\text{ is a UFD}.
\]

A notable feature of the recent treatment is that the theorem is supplied both for the concrete localization type \(\mathrm{Localization}\,S\) and for abstract targets satisfying `IsLocalization`. This makes the theorem reusable in downstream constructions rather than tying it to a single presentation of the localization.

## 5. Extensions and Nagata-style analogues

Nagata's theorem has generated a broader factoriality philosophy: control of height-one primes, divisor classes, and stable localizations can force factoriality in settings far from ordinary commutative algebra.

In invariant theory, Hashimoto develops an equivariant analogue of the total ring of fractions, denoted \(Q_F(S)\), and uses it to generalize classical results of Popov on invariant and semiinvariant rings [1009.5152]. The main theorems show that, under connectedness and character-group hypotheses, the invariant ring is a UFD once the relevant \(G\)-stable height-one primes contract principally. The underlying idea is explicitly Nagata-style: factoriality of invariants is governed by stable divisors and class-group data rather than by bare localization alone.

In algebraic geometry, related divisor-theoretic criteria appear in singular projective settings. For complete intersection threefolds with isolated singularities, factoriality and \(\mathbf Q\)-factoriality coincide in the precise setting studied in "On factoriality of threefolds with isolated singularities" [1305.4371]. In a different direction, "Factoriality of normal projective varieties" proves that for a normal projective local complete intersection with singular locus of codimension at least \(3\), \(\mathbf Q\)-factoriality already implies factoriality, and combines this with a topological formula for the \(\mathbf Q\)-factoriality defect to recover a projective form of Grothendieck's theorem in codimension at least \(4\) [2601.13151]. These results are not instances of Nagata's theorem in the literal commutative-algebraic sense, but they follow the same structural principle: factoriality is detected by the disappearance of divisor-theoretic obstructions.

## 6. Formalization, scope, and terminological distinctions

A recent Lean 4 development provides a prime-generated formalization of Nagata's factoriality theorem and packages the result both for the concrete type `Localization S` and for abstract `IsLocalization` formulations [2604.05238]. The formalization is significant because it forced a correction of the hypothesis from the degenerate prime-or-unit condition to the mathematically stable prime-generated condition. It also produced reusable APIs for predicates such as `PrimeGenerated` and `Avoids`, together with transfer lemmas for divisibility, irreducibility, and primality. The authors state that no public formalization of this result is known to them in Lean, Coq, or Isabelle.

The name "Nagata's theorem" can also refer to different results. In "Nagata type statements," the central theorem attributed to Nagata asserts that if \(\delta\ge 4\) and \(p_1,\dots,p_{\delta^2}\) are very general points in \(\mathbb P^2\), then for \(Z=p_1+\cdots+p_{\delta^2}\),

\[
\alpha(I(mZ))>\delta m\qquad\text{for all }m\ge 1.
\]

That theorem belongs to the geometry of fat points, invariant rings, Rees algebras, Mori cones, and Waldschmidt constants, and is part of the line of work surrounding Hilbert's \(14\)-th problem [1707.00583]. It is distinct from Nagata's factoriality theorem, although both results exemplify a broader Nagata-style method: translate an algebraic finiteness or factorization problem into structural control over prime or divisor data.

In its commutative-algebraic form, Nagata's factoriality theorem remains a canonical descent result. Its enduring content is that factoriality of a ring can be recovered from a localization, but only when the inverted multiplicative system is generated, in the precise prime-theoretic sense, by primes already visible in the original ring.

Source: https://www.emergentmind.com/topics/nagata-s-factoriality-theorem