I know at least one method of constructing a convex valuation ring of rank n (but it is rather complicated).. What are the easiest methods of doing this.. given a natural number n I want to have a valuation ring (preferably convex) whose rank is n. I have heard you can do this with polynomials and power series, but I am not really sure how this is done.
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
1
|
|||||||||||||
|
|
7
|
Here is a way to build a convex valuation ring with valuation group any ordered abelian group. This is inspired by Gerald Edgar's notes on transseries, which I learned about here. If we take $(G, \prec)$ to be $\mathbb{Z}^n$ ordered by lexicographic order, we will get a valuation of rank $n$. Let $G$ be any ordered abelian group. Define $\mathbb{R}((G))$ to be the field of formal power series of the form
For example, $\mathbb{R}((\mathbb{Z}))$ is the field of formal Laurent series. We add, multiply and divide such formal series by the obvious formal manipulations. We leave it to the reader to check that the sum or product of such power series is another such power series, as is the reciprocal of such a series, and that we never need to add more than finitely many coefficients together, so there are no issues of convergence. There is a valuation $v:\mathbb{R}((G)) \to G$, sending a power series to the least $g$ for which $t^G$ appears with nonzero coefficient. The valuation ring of this valuation is clearly $\mathbb{R}[[G]]$; the ring of power series where $h$ (above) is nonnegative. Finally, I have to tell you the ordering on $\mathbb{R}((G))$. A power series $f$ is positive if the coefficient of $t^{v(f)}$ is positive. |
||||||||||||
|

