The ordinary-prime omission theorem concerns systems that retain most of the ordinary primes. Here is an upper bound in a different class. It explains the limitation of using a fixed number field and requiring the conjugates in every other embedding to have absolute value at most one.
Theorem. Let be a fixed number field of degree greater than one. Let be a multiplicatively independent set of algebraic integers in greater than one, with for every and every embedding other than the given real embedding. There is a constant , independent of , such that for all sufficiently large ,
Multiplicative independence follows from the separation hypothesis in Shapiro's question. The theorem itself does not require any quantitative separation.
Allowed prime ideals
Write the archimedean places as , with the given real place. Write at a real place and at a complex place. An allowed satisfies
Every prime ideal dividing for has norm at most . Fix . If a prime ideal of norm greater than divides , then . Indeed, any other integral ideal factor with norm greater than one multiplies its norm by at least two.
Define the logarithmic vector
in the hyperplane . By the Dirichlet unit theorem, the vectors for units form a full lattice in . The class of modulo depends only on the principal ideal . For with in the indicated norm range, this class belongs to the image in of
The condition on the other places gives . Also . Since has a real place and degree greater than one, . Choose sufficiently small that this simplex projects injectively to the torus and its normalised Haar measure is less than .
Counting prime ideals in the allowed region
The logarithmic classes of principal prime ideals equidistribute in as their norms increase. Here is the Hecke-character argument in these coordinates. Each character of gives a unitary character of principal ideals via . It extends to a Hecke character of fractional ideals, with finite conductor one. To extend it, choose ideal representatives for a cyclic decomposition of the finite ideal class group and choose roots of the values on their principal powers. On principal ideals the character is still the prescribed archimedean monomial of the absolute values.
For a nontrivial torus character, this extension and any twist by a class-group character are inequivalent to finite-order characters under twisting by . A finite-order character has zero logarithmic archimedean coefficients. On principal ideals the coefficient of in the logarithmic character is zero. A norm twist with the same property must have . To compare these coefficients, the archimedean images of elements of are dense in the product of the real and complex completions by rational approximation of the coordinates on a field basis. The remaining coefficients can all be zero only for the trivial torus character. The Hecke prime ideal theorem therefore gives cancellation for each nontrivial torus character, also after restriction to principal primes by class-group orthogonality. For the trivial character the principal prime count is asymptotic to , where is the class number. Weyl's criterion gives the asserted equidistribution. The boundary of has Haar measure zero.
- Maynard, Primes represented by incomplete norm forms, Lemma 4.5
- Rajan, Distribution of values of Hecke characters of infinite order
Subtracting the count at from the count at , the number of possibly usable prime ideals with norm in this interval is at most
The number at norm at most is by the prime ideal theorem. If an independent set of elements is supported on prime ideals, its size is at most . Indeed, the ideal valuation map takes values in and its kernel is contained in the unit group of rank . This proves the theorem with, for example, .