\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{valuation ring}

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{definition_and_properties}{Definition and Properties}\dotfill \pageref*{definition_and_properties} \linebreak
\noindent\hyperlink{example_germs_of_definable_functions}{Example: germs of definable functions}\dotfill \pageref*{example_germs_of_definable_functions} \linebreak
\noindent\hyperlink{the_valuation_function}{The valuation function}\dotfill \pageref*{the_valuation_function} \linebreak
\noindent\hyperlink{example_rates_of_growth}{Example: rates of growth}\dotfill \pageref*{example_rates_of_growth} \linebreak
\noindent\hyperlink{valuation_rings_from_valuation_functions}{Valuation rings from valuation functions}\dotfill \pageref*{valuation_rings_from_valuation_functions} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{literature}{Literature}\dotfill \pageref*{literature} \linebreak


\hypertarget{definition_and_properties}{}\subsection*{{Definition and Properties}}\label{definition_and_properties}

A \textbf{valuation ring} is a commutative\footnote{There are also noncommutative versions, which the nLab may get around to at some point.}  [[integral domain]] $O$ which satisfies any of the following equivalent conditions:

\begin{enumerate}%
\item for every nonzero element $x$ in its [[field of fractions]] $K$, either $x \in O$ or $x^{-1} \in O$;


\item the ideals of $O$ are totally ordered by inclusion;


\item the principal ideals of $O$ are totally ordered by inclusion.



\end{enumerate}
These equivalences are not difficult to establish. For example, if 1. holds and $I, J$ are distinct ideals, then some element $x$ belongs to one but not the other, say $x \in J$, $x \notin I$. Then for each $y \in I$, the condition $x/y \in O$ leads to $x = y(x/y) \in I$ which is false; therefore $y/x \in O$, whence $y = x(y/x) \in J$, and we conclude $I \subset J$. That 2. implies 3. is trivial, and if 3. holds and $x \in K$, write $x = a/b$ where $a, b \in O$, and conclude either $(a) \subseteq (b)$ or $(b) \subseteq (a)$, where $x \in O$ in the former case and $x^{-1} \in O$ in the latter.

\begin{prop}
\label{}\hypertarget{}{}
A valuation ring $O$ is a [[local ring]]. Its maximal ideal is said to be the [[valuation ideal]].

\end{prop}
\begin{proof}
Suppose $x$, $y$ are nonzero non-invertible elements of $O$. Either $x/y$ or $y/x$ belongs to $O$, say $x/y$. Then $(x+y)/y$ belongs to $O$ as well. If $x+y$ were a unit of $O$, it would follow that $1/y$ belongs to $O$, i.e., both $y$ and $1/y$ belong to $O$, so that $y$ is a unit of $O$, contradiction. It follows that non-unit elements of $O$ are closed under addition. It is also clear that if $x$ is a non-unit element of $O$ and $y$ is any element of $O$, then $x y$ is a non-unit element of $O$. Therefore the non-units form an ideal of $O$, clearly the unique maximal ideal of $O$.

\end{proof}
\begin{prop}
\label{}\hypertarget{}{}
A valuation ring $O$ is integrally closed in its field of fractions $F$.

\end{prop}
\begin{proof}
Suppose $x \in F$ satisfies an equation $x^n + a_{n-1}x^{n-1} + \ldots + a_0 = 0$ where the $a_i$ belong to $O$. Either $x$ or $1/x$ belongs to $O$, and if $1/x$ belongs to $O$, then so does $x$ because

\begin{displaymath}
-x = a_{n-1} + a_{n-1}x^{-1} + \ldots + a_0 x^{-n+1}
\end{displaymath}
and this completes the proof.

\end{proof}
\begin{theorem}
\label{}\hypertarget{}{}
A valuation ring is a [[Prüfer domain]].

\end{theorem}
\begin{proof}
There are many characterizations of Pr\"u{}fer domains, but one is that the [[lattice]] of [[ideals]] is [[distributive lattice|distributive]], which is obviously the case if the lattice is [[linear order|linearly ordered]].

\end{proof}
\hypertarget{example_germs_of_definable_functions}{}\subsubsection*{{Example: germs of definable functions}}\label{example_germs_of_definable_functions}

Local rings often arise as stalks of sheaves of real or complex-valued functions, and similarly, some of the more interesting examples of valuation rings arise by considering germs of functions at an ``ideal'' point, for example at an ultrafilter or infinite point where the functions are not formally defined. Examples such as these are often rich sources of rings and fields with \emph{infinitesimal elements}. The following example should give the flavor of this phenomenon.

Consider the class of all functions $\mathbb{R} \to \mathbb{R}$ which can be defined by a first-order formula, starting with the basic operations $+, -, \cdot, \exp$, any constant $a \in \mathbb{R}$, and the relations $\lt$ and $=$. This is an enormous class of functions: it includes the [[logarithm]] function and any function which can be built from [[polynomials]], [[exponential map|exponentials]], and logarithms using the four basic arithmetic operations and composition, and also implicitly defined functions such as:

\begin{displaymath}
f(x) = max \{y: y^5 - (e^{e^x - (\log x)^2 + 1/x})y^2 + \log(1 + x^{\sqrt{2}}))y - 17 = 0\}
\end{displaymath}
and many, many more. Of interest are \emph{rates of growth} (cf. [[O notation]]) of these functions, or, at an even more refined level, the precise ordering of these functions $f(x) \leq g(x)$ when $x$ is large. A quite remarkable and deep fact is the following:

\begin{uthm}
Any such definable function $f(x)$ is either positive for all sufficiently large $x$, $0$ for all sufficiently large $x$, or negative for all sufficiently large $x$.

\end{uthm}
This theorem implies that the germs at infinity of such functions ($\sim$-equivalence classes of functions where $f \sim g$ if $f(x) = g(x)$ for all sufficiently large $x$) form a totally [[ordered field]], in fact a [[real closed field]]. The real numbers are embedded in this field as germs of constant functions, but lying between ordinary real numbers are other ``numbers'' infinitesimally close to reals, such as $2 - [1/x]$, $1 + [1/\log \log(x)]$, as well as infinite numbers such as $[e^x]$.

Sitting inside this field $Germ(\mathbb{R}_{exp})$ is the valuation ring of germs of bounded definable functions, in other words the ring of finite ``numbers'', which contains infinitesimals of incredibly rich variety.

Such examples are close in spirit to [[hyperreal number]]s, which form a considerably larger real closed field. In this case, the procedure is similar, except that one takes germs of \emph{all} functions $\mathbb{N} \to \mathbb{R}$ in the neighborhood of a non-principal ultrafilter on $\mathbb{N}$, which can be considered an ideal point at ``infinity''. This is called an [[ultrapower]] of the standard real numbers. Again the finite hyperreals form a valuation ring sitting inside.

\hypertarget{the_valuation_function}{}\subsection*{{The valuation function}}\label{the_valuation_function}

(also called multiplicative or exponential valuation)

The nonzero elements of $K$ may be partially ordered as follows: write $x \leq y$ if $x/y$ belongs to $O$. For any two nonzero elements $x$, $y$ of $K$, exactly one of the following conditions holds:

\begin{itemize}%
\item $x/y$ is a non-unit of $O$;


\item $x/y$ is a unit of $O$: $x/y$ and $y/x$ belong to $O$;


\item $y/x$ is a non-unit of $O$.



\end{itemize}
We call this the \emph{trichotomy law}. Thus, if we write $O^*$ for the units of $R$, it follows from trichotomy that the partial order on $K^*$ descends to a [[total order]] on the quotient group $G = K^*/O^*$. This totally ordered group is called the \textbf{value group} of the valuation ring $O$. When the value group is isomorphic to $\mathbb{Z}$, the ring $O$ is called a \textbf{discrete valuation ring}. Many local rings which arise in practice, for example localizations of rings of [[algebraic integer]]s $O$ with respect to a prime ideal $\mathcal{p}$, or their completions as rings of $\mathcal{p}$-adic integers $O_{(\mathcal{p})}$, are discrete valuation rings.

We may then define a \textbf{valuation} function

\begin{displaymath}
v: K \to K^*/O^* \cup \{0\}
\end{displaymath}
where $v(x)$ is the coset $x O^*$ if $x \in K^*$, and $v(0) = 0$. The codomain becomes a totally ordered monoid if $0$ is regarded as the bottom element and is \emph{absorbent} ($0 x = 0$ for all $x$). This function satisfies the following conditions:

\begin{enumerate}%
\item $v(x) = 0$ if and only if $x = 0$;


\item $v(x y) = v(x)v(y)$;


\item $v(x + y) \leq \max \{v(x), v(y)\}$


\item $v$ is surjective.



\end{enumerate}
\hypertarget{example_rates_of_growth}{}\subsubsection*{{Example: rates of growth}}\label{example_rates_of_growth}

Let us return to our earlier example of a valuation ring $O$, consisting of germs of bounded functions which are first-order definable in the theory of the reals as ordered field with exponentiation. Two ``numbers'' $[f]$, $[g]$ have the same coset, $[f]O^* = [g]O^*$, if both $[f/g]$ and $[g/f]$ are bounded. But this is precisely to say $f$ is $O(g)$ and $g$ is $O(f)$.

Thus, the elements of the value group in this case can be described as the various ``rates of growth'' of definable functions. The order relation is that $[f]O^* \leq [g]O^*$ if $f$ is $O(g)$. Thus the classical analysis notion of `O notation' fits within the theory of valuation rings.

Rates of growth, as elements of the value group $K^*/O^*$, can also be regarded as ``numbers'' containing infinitesimal and infinite quantities. Thus, ordinary real numbers $a$ would correspond to rates of growth of power functions $x^a$, whereas the rate of growth $\log x$ is infinitesimal and the rate of growth of $e^x$ is infinite. The fact that rates of growth of definable functions are totally ordered is essentially due to G.H. Hardy, and in his honor, fields of germs of definable functions are frequently called ``Hardy fields''.

\begin{itemize}%
\item Hardy actually studied the class of functions definable from polynomials, exponential, and logarithmic functions using the four arithmetic operations and composition. This of course is a small subclass of the definable functions considered above, but contains all functions likely to be of interest in analytic number theory (for example).

\end{itemize}
\hypertarget{valuation_rings_from_valuation_functions}{}\subsection*{{Valuation rings from valuation functions}}\label{valuation_rings_from_valuation_functions}

Quite generally, we may define a \textbf{valuation} on a field $K$ to be a function

\begin{displaymath}
v: K \to G \cup \{0\}
\end{displaymath}
(where $G$ is a totally ordered group, extended to a totally ordered monoid $G \cup \{0\}$ as above), satisfying conditions 1 - 4 listed above. Two valuations $v$, $v'$ are \textbf{equivalent} if there is an isomorphism

\begin{displaymath}
\phi: G \cup \{0\} \to G' \cup \{0\}
\end{displaymath}
of totally ordered monoids such that $v' = \phi \circ v$. In fact, valuations $v$ may be [[preorder|preordered]]: if we regard $v$ as a special sort of group homomorphism $v: K^* \to G$, then define $v \leq v'$ if there is a surjective homomorphism of ordered groups $\phi: G \to G'$ such that $v' = \phi \circ v$.

From the data of a valuation on $K$, we may construct a valuation ring $O_v$ inside $K$:

\begin{displaymath}
O_v = \{x \in K: v(x) \leq 1\}
\end{displaymath}
where $1$ is the identity element of $G$. (The fact that $O_v$ is a ring follows straightforwardly from the axioms 1 - 3, and that $O_v$ is a valuation ring follows from the fact that $G$ is totally ordered.)

In summary, we have the following result whose proof is straightforward:

\begin{uprop}
There is a natural bijective correspondence between equivalence classes of valuations on $K$ and valuation rings in $K$.

\end{uprop}
To express the naturality more precisely: there are two functors

\begin{displaymath}
V: Field^{op} \to Pos, \qquad V': Field^{op} \to Pos
\end{displaymath}
from fields to posets. Here $V$ assigns to a field $K$ the poset of equivalence classes of valuations on $K$, where the partial order is inherited from the preorder described above; $V'$ assigns to a field $K$ the poset of valuation rings inside $K$, ordered by inclusion. If $i: K \to K'$ is a field homomorphism, then $V'(i): V'(K') \to V'(K)$ takes a valuation ring $O' \subseteq K$ to the valuation ring $i^{-1}(O') \subseteq K$, and $V(i)$ is defined similarly. The proposition asserts that the functors $V$, $V'$ are naturally isomorphic. We freely conflate them, denoting either functor as $Val: Field^{op} \to Pos$.

\hypertarget{examples}{}\subsubsection*{{Examples}}\label{examples}

\begin{enumerate}%
\item The algebraic notion of Riemann surface from 19th century is constructed in a way in which valuations are used to construct points of Riemann surfaces over various fields. See [[Riemann surface via valuations]].


\item There is a very general construction which takes as input an arbitrary field $k$ and a totally ordered abelian group $G$, and produces as output a valuation ring whose value group is naturally identified with $G$. This is the ring of [[Hahn series]], see there.



\end{enumerate}
\hypertarget{literature}{}\subsection*{{Literature}}\label{literature}

Related entries: [[valuation]], [[discrete valuation]], [[class field theory]]

\begin{itemize}%
\item A. Fr\"o{}hlich, J. W. S. Cassels (editors), \emph{Algebraic number theory}, Acad. Press 1967, with many reprints; Fr\"o{}hlich, Cassels, Birch, Atiyah, Wall, Gruenberg, Serre, Tate, Heilbronn, Rouqette, Kneser, Hasse, Swinerton-Dyer, Hoechsmann, systematic lecture notes from the instructional conference at Univ. of Sussex, Brighton, Sep. 1-17, 1965.


\item Serge Lang, \emph{Algebraic number theory}. GTM 110, Springer 1970, 2000


\item O. Zariski, Samuel, \emph{Commutative algebra}



\end{itemize}
[[!redirects valuation rings]]



\end{document}