Let be a UFD, and consider the family of primitive polynomials in .
Definition.
A polynomial is primitive if .
Equivalently, for every irreducible element , is not in the kernel of the map
Hence the set of non‑primitive polynomials is
Each is a prime ideal.
Proposition. The product is primitive if and only if both and are primitive.
Proof. Since is non‑primitive precisely when for some , and each is prime, it follows that or . Hence is primitive if and only if neither factor lies in any .
Viewing the monoid as a tensor category, the set of non‑primitive polynomials forms a prime ideal, and thus the primitive polynomials form a tensor‑closed subcategory. This completes the proof.
This example inspires a general result in tensor categories.
Proposition. Let be a tensor category, and let be a family of ideals in . Then
is also an ideal. Moreover, if each is prime, then is prime.
Proof. Trivial.
Recall that many pathological properties give rise to prime ideals. We say a property of objects in is bad if the class of objects satisfying forms a prime ideal, denoted . The proposition above implies that if and are bad properties, then their join is also bad. Thus, bad properties form a monoid under .
No comments:
Post a Comment