Ideal approximation theorem (source code)

= Ideal approximation theorem

Let $R$ be a <Dedekind domain>, let $P_1,\ldots,P_r$ be distinct nonzero <prime ideals>, and choose nonnegative <integers> $n_1,\ldots,n_r$. There is a nonzero $a\in R$ with
$$
v_{P_i}((a))=n_i\qquad(1\leq i\leq r).
$$
Choose $c_i\in P_i^{n_i}\setminus P_i^{n_i+1}$. The <prime ideals> are maximal, so their powers are pairwise comaximal. The <Chinese remainder theorem> gives $a\equiv c_i\pmod{P_i^{n_i+1}}$ for every $i$, which gives exactly the requested <prime-ideal valuations in a Dedekind domain>. No restrictions are imposed on primes outside the list.

For example, $12$ has <valuation> two at the prime two and <valuation> one at the prime three in $\mathbb Z$. Prescribed negative <valuations> can likewise be realized in the <fraction field>: first clear them by a common nonzero denominator, apply the integral version, and divide back. The Dedekind-domain hypothesis supplies the <valuations> and the comaximality used in this argument.