Explicit polynomial bounds on prime ideals in polynomial rings over fields
Abstract
Suppose I is an ideal of a polynomial ring over a field, I⊂eq k[x1,…,xn], and whenever fg∈ I with degree ≤ b, then either f∈ I or g∈ I. When b is sufficiently large, it follows that I is prime. Schmidt-G\"ottsch proved that "sufficiently large" can be taken to be a polynomial in the degree of generators of I (with the degree of this polynomial depending on n). However Schmidt-G\"ottsch used model-theoretic methods to show this, and did not give any indication of how large the degree of this polynomial is. In this paper we obtain an explicit bound on b, polynomial in the degree of the generators of I. We also give a similar bound for detecting maximal ideals in k[x1,…,xn].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.