weak approximation theorem
The weak approximation theorem allows selection, in a Dedekind ring, of an element having specific valuations at a specific finite set
of primes, and nonnegative valuations at all other primes. It is essentially a generalization
of the Chinese Remainder theorem
, as is evident from its proof.
Theorem 1 (Weak ).
Let A be a Dedekind domain with fraction field K. Then for any finite set p1,…,pk of primes of A and integers a1,…,ak, there is x∈K⋆ such that νpi((x))=ai and for all other prime ideals
p, νp((x))≥0. Here νp is the p-adic valuation associated with a prime ideal p.
Proof.
Assume first that all ai≥0. By the Chinese Remainder Theorem,
A/𝔭a1+11×⋯A/𝔭ak+1k≅A/𝔭a1+11⋯𝔭ak+1k |
Thus the map
A→A/𝔭a1+11×⋯A/𝔭ak+1k |
is surjective. Now choose xi∈paii,xi∉pai+1i; this is possible since these two ideals are unequal by unique factorization
. Choose x∈A with image (x1,…,xk). Clearly ν𝔭i((x))=ai. But x∈A, so all other valuations are nonnegative.
In the general case, assume wlog that we are given a set 𝔭1,…,𝔭r of primes of A and integers a1,…,ar≥0, and a set 𝔮1,…,𝔮t of primes with integers b1,…,bt<0. First choose y∈K⋆ (using the case already proved above) so that
{ν𝔭((y))=0𝔭=𝔭iν𝔭((y))=-bi𝔭=𝔮jν𝔭((y))≥0otherwise |
Now, there are only a finite number of primes 𝔭′k such that 𝔭′k is not the same as any of the 𝔮j and ν𝔭′k((y))>0. Let ν𝔭′k((y))=ck>0. Again using the case proved above, choose x∈K⋆ such that
{ν𝔭((x))=ai𝔭=𝔭iν𝔭((x))=0𝔭=𝔮jν𝔭((x))=ck𝔭=𝔭′kν𝔭((x))≥0otherwise |
Then x/y is the required element. ∎
Title | weak approximation theorem |
---|---|
Canonical name | WeakApproximationTheorem |
Date of creation | 2013-03-22 18:35:21 |
Last modified on | 2013-03-22 18:35:21 |
Owner | rm50 (10146) |
Last modified by | rm50 (10146) |
Numerical id | 6 |
Author | rm50 (10146) |
Entry type | Theorem |
Classification | msc 13F05 |
Classification | msc 11R04 |
Related topic | IndependenceOfTheValuations |
Related topic | ChineseRemainderTheoremInTermsOfDivisorTheory |