P-adic Norm

In number theory, the valuation or -adic order of an integer is the exponent of the highest power of the prime number that divides .
It is denoted $\nu_p(n)$.
Equivalently, $\nu_p(n)$ is the exponent to which $p$ appears in the prime factorization of $n$.

The -adic valuation is a valuation and gives rise to an analogue of the usual absolute value.
Whereas the completion of the rational numbers with respect to the usual absolute value results in the real numbers $\mathbb$, the completion of the rational numbers with respect to the $p$-adic absolute value results in the numbers $\mathbb_p$.

Definition and properties

Let be a prime number.

Integers

The -adic valuation of an integer $n$ is defined to be
:$\nu_p(n)= \begin \mathrm\ & \text n \neq 0\\ \infty & \text n=0, \end$
where $\mathbb$ denotes the set of natural numbers and $m \mid n$ denotes divisibility of $n$ by $m$. In particular, $\nu_p$ is a function $\nu_p \colon \mathbb \to \mathbb \cup\$.

For example, $\nu_2(-12) = 2$, $\nu_3(-12) = 1$, and $\nu_5(-12) = 0$ since $, , = 12 = 2^2 \cdot 3^1 \cdot 5^0$.

The notation $p^k \parallel n$ is sometimes used to mean $k = \nu_p(n)$.

If $n$ is a positive integer, then

:$\nu_p(n) \leq \log_p n$;

this follows directly from $n \geq p^$.

Rational numbers

The -adic valuation can be extended to the rational numbers as the function

:$\nu_p : \mathbb \to \mathbb \cup\$with the usual order relation, namely
:$\infty > n$,
and rules for arithmetic operations,
:$\infty + n = n + \infty = \infty$,
on the extended number line.

defined by

:$\nu_p\left(\frac\right)=\nu_p(r)-\nu_p(s).$

For example, $\nu_2 \bigl(\tfrac\bigr) = -3$ and $\nu_3 \bigl(\tfrac\bigr) = 2$ since $\tfrac = 2^\cdot 3^2$.

Some properties are:

:$\nu_p(r\cdot s) = \nu_p(r) + \nu_p(s)$
:$\nu_p(r+s) \geq \min\bigl\$

Moreover, if $\nu_p(r) \neq \nu_p(s)$, then

:$\nu_p(r+s)= \min\bigl\$

where $\min$ is the minimum (i.e. the smaller of the two).

-adic absolute value

The -adic absolute value on $\mathbb$ is the function
:$, \cdot, _p \colon \Q \to \R_$
defined by
:$, r, _p = p^ .$

Thereby, $, 0, _p = p^ = 0$ for all $p$ and
for example, $, , _2 = 2^ = \tfrac$ and $\bigl, \tfrac\bigr, _2 = 2^ = 8 .$

The -adic absolute value satisfies the following properties.

:
From the multiplicativity $, r s, _p = , r, _p, s, _p$ it follows that $, 1, _p=1=, -1, _p$ for the roots of unity $1$ and $-1$ and consequently also $, , _p = , r, _p .$
The subadditivity $, r+s, _p \leq , r, _p + , s, _p$ follows from the non-Archimedean triangle inequality $, r+s, _p \leq \max\left(, r, _p, , s, _p\right)$.

The choice of base in the exponentiation $p^$ makes no difference for most of the properties, but supports the product formula:
:$\prod_ , r, _p = 1$
where the product is taken over all primes and the usual absolute value, denoted $, r, _0$. This follows from simply taking the prime factorization: each prime power factor $p^k$ contributes its reciprocal to its -adic absolute value, and then the usual Archimedean absolute value cancels all of them.

The -adic absolute value is sometimes referred to as the "-adic norm", although it is not actually a norm because it does not satisfy the requirement of homogeneity.

A metric space can be formed on the set $\mathbb$ with a ( non-Archimedean, translation-invariant) metric
:$d \colon \Q \times \Q \to \R_$
defined by
:$d(r,s) = , r-s, _p .$
The completion of $\mathbb$ with respect to this metric leads to the set $\mathbb_p$ of -adic numbers.

See also

* -adic number
*Archimedean property
*Multiplicity (mathematics)
*Ostrowski's theorem

References

{{reflist

Algebraic number theory
p-adic numbers