Blog Archive

Thursday, April 17, 2025

Primitive polynomial and some basic property of prime ideal in tensor category

This post continues the ideas from the previous blog:

Ideals in Tensor Categories with applications to groups, rings and topology: the propagation of pathological properties

Let R be a UFD, and consider the family of primitive polynomials in R[X].

Definition.

A polynomial f=anXn++a0R[X] is primitive if gcd(a0,,an)=1.

Equivalently, for every irreducible element pR, f is not in the kernel of the map

πp:R[X](R/(p))[X].

Hence the set of non‑primitive polynomials is

p irreducibleker(πp).

Each ker(πp) is a prime ideal.

Proposition. The product fg is primitive if and only if both f and g are primitive.

Proof. Since fg is non‑primitive precisely when fgker(πp) for some p, and each ker(πp) is prime, it follows that fker(πp) or gker(πp). Hence fg is primitive if and only if neither factor lies in any ker(πp).

Viewing the monoid (R,) 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 (T,,I) be a tensor category, and let {Jn} be a family of ideals in T. Then

nJn

is also an ideal. Moreover, if each Jn is prime, then nJn is prime.

Proof. Trivial.

Recall that many pathological properties give rise to prime ideals. We say a property p of objects in T is bad if the class of objects satisfying p forms a prime ideal, denoted (p). The proposition above implies that if p and q are bad properties, then their join pq is also bad. Thus, bad properties form a monoid under .

No comments:

Post a Comment

Popular Posts