Hubbry Logo
P-adic valuationP-adic valuationMain
Open search
P-adic valuation
Community hub
P-adic valuation
logo
8 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
P-adic valuation
P-adic valuation
from Wikipedia

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

The p-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 , the completion of the rational numbers with respect to the -adic absolute value results in the p-adic numbers .[1]

Distribution of natural numbers by their 2-adic valuation, labeled with corresponding powers of two in decimal. Zero has an infinite valuation.

Definition and properties

[edit]

Let p be a prime number.

Integers

[edit]

The p-adic valuation of an integer is defined to be

where denotes the set of natural numbers (including zero) and denotes divisibility of by . In particular, is a function .[2]

For example, , , and since .

The notation is sometimes used to mean .[3]

If is a positive integer, then

;

this follows directly from .

Rational numbers

[edit]

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

[4][5]

defined by

For example, and since .

Some properties are:

Moreover, if , then

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

Formula for the p-adic valuation of Integers

[edit]

Legendre's formula shows that .

For any positive integer n, and so .

Therefore, .

This infinite sum can be reduced to .

This formula can be extended to negative integer values to give:

p-adic absolute value

[edit]

The p-adic absolute value (or p-adic norm,[6] though not a norm in the sense of analysis) on is the function

defined by

Thereby, for all and for example, and

The p-adic absolute value satisfies the following properties.

Non-negativity
Positive-definiteness
Multiplicativity
Non-Archimedean

From the multiplicativity it follows that for the roots of unity and and consequently also The subadditivity follows from the non-Archimedean triangle inequality .

The choice of base p in the exponentiation makes no difference for most of the properties, but supports the product formula:

where the product is taken over all primes p and the usual absolute value, denoted . This follows from simply taking the prime factorization: each prime power factor contributes its reciprocal to its p-adic absolute value, and then the usual Archimedean absolute value cancels all of them.

A metric space can be formed on the set with a (non-Archimedean, translation-invariant) metric

defined by

The completion of with respect to this metric leads to the set of p-adic numbers.

See also

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In number theory, the p-adic valuation, denoted vpv_p, is a discrete valuation on the field of rational numbers Q\mathbb{Q} associated to a fixed prime number pp, defined for a nonzero rational x=a/bx = a/b in lowest terms as vp(x)=vp(a)vp(b)v_p(x) = v_p(a) - v_p(b), where vp(n)v_p(n) for a nonzero integer nn is the highest exponent kk such that pkp^k divides nn, and vp(0)=v_p(0) = \infty. This valuation extends naturally to the ring of integers and provides a measure of "divisibility by pp" that captures the multiplicity of pp in the prime factorization of elements in Q\mathbb{Q}. The p-adic valuation satisfies key properties that make it a non-Archimedean valuation: it is additive under , so vp(xy)=vp(x)+vp(y)v_p(xy) = v_p(x) + v_p(y) for all x,yQx, y \in \mathbb{Q}, and it obeys the ultrametric inequality vp(x+y)min{vp(x),vp(y)}v_p(x + y) \geq \min\{v_p(x), v_p(y)\} for addition, with equality holding if vp(x)vp(y)v_p(x) \neq v_p(y). From this, one defines the p-adic or norm xp=pvp(x)|x|_p = p^{-v_p(x)} for x0x \neq 0 (and 0p=0|0|_p = 0), which induces a metric d(x,y)=xypd(x, y) = |x - y|_p on Q\mathbb{Q}, turning it into an where the distance satisfies the strong d(x,z)max{d(x,y),d(y,z)}d(x, z) \leq \max\{d(x, y), d(y, z)\}. This metric allows the completion of Q\mathbb{Q} to yield the field of p-adic numbers Qp\mathbb{Q}_p, a complete normed field that extends and plays a central role in local . Beyond its foundational role in constructing Qp\mathbb{Q}_p, the p-adic valuation is instrumental in various applications, such as determining the p-adic order of factorials via Legendre's formula vp(n!)=k=1n/pkv_p(n!) = \sum_{k=1}^\infty \lfloor n / p^k \rfloor, analyzing Diophantine equations through lifting the exponent lemmas, and studying arithmetic in global fields via Ostrowski's theorem, which classifies all non-trivial absolute values on Q\mathbb{Q} as either the usual Archimedean one or the p-adic ones for primes p. In broader contexts, it facilitates p-adic analysis, interpolation (e.g., p-adic zeta functions), and connections to algebraic geometry over p-adic fields.

Definition

For integers

The pp-adic valuation, denoted vp(n)v_p(n), for a fixed pp and a nonzero nn, is defined as the highest non-negative kk such that pkp^k divides nn. Equivalently, nn can be expressed as n=±pkmn = \pm p^k m, where mm is an not divisible by pp, and thus vp(n)=kv_p(n) = k. For example, consider n=12n = 12 and p=2p = 2: since 12=22312 = 2^2 \cdot 3 and $2 does not divide $3, it follows that v2(12)=2v_2(12) = 2. Similarly, for p=3p = 3, 12=301212 = 3^0 \cdot 12 and $3 does not divide $12, so v3(12)=0v_3(12) = 0. The case n=0n = 0 is handled by convention as vp(0)=+v_p(0) = +\infty, which ensures consistency in arithmetic operations involving the valuation, such as treating divisions by zero appropriately in extended contexts. This concept was introduced by in 1897 as part of his foundational work on what would later be known as pp-adic numbers, motivated by the study of algebraic integers through expansions.

For rational numbers

The p-adic valuation on the rational numbers Q\mathbb{Q} extends the definition from the integers by accounting for the denominator in the fraction. For a nonzero rational number r=a/br = a/b, where aa and bb are nonzero integers, the p-adic valuation is defined as vp(r)=vp(a)vp(b)v_p(r) = v_p(a) - v_p(b), with vpv_p denoting the integer valuation. The valuation of zero is set to vp(0)=+v_p(0) = +\infty. This definition relies on the prior establishment of vpv_p on Z\mathbb{Z}, but it applies directly to Q\mathbb{Q} as the field of fractions of Z\mathbb{Z}. For example, consider p=2p = 2 and r=3/4r = 3/4. Here, v2(3)=0v_2(3) = 0 since 3 is odd, and v2(4)=2v_2(4) = 2 since 4=224 = 2^2. Thus, v2(3/4)=02=2v_2(3/4) = 0 - 2 = -2. This negative value reflects that the denominator introduces more factors of 2 than the numerator, highlighting how the valuation on Q\mathbb{Q} allows for negative exponents unlike on Z\mathbb{Z}. This extension yields a well-defined function on Q\mathbb{Q} independent of the choice of representation for rr. Suppose r=a/b=(ak)/(bk)r = a/b = (a k)/(b k) for some nonzero kk. Then vp(ak)vp(bk)=vp(a)+vp(k)(vp(b)+vp(k))=vp(a)vp(b)v_p(ak) - v_p(bk) = v_p(a) + v_p(k) - (v_p(b) + v_p(k)) = v_p(a) - v_p(b), so the value remains unchanged. This independence follows from the unique prime factorization in Z\mathbb{Z}, ensuring consistency across equivalent fractions.

Properties

Multiplicativity and additivity

The p-adic valuation vpv_p on the nonzero rational numbers satisfies the multiplicativity property vp(xy)=vp(x)+vp(y)v_p(xy) = v_p(x) + v_p(y) for all x,yQ×x, y \in \mathbb{Q}^\times. This follows directly from the definition of vpv_p on Q\mathbb{Q}, where any nonzero rational xx can be expressed uniquely (up to units) as x=±pvp(x)abx = \pm p^{v_p(x)} \cdot \frac{a}{b} with a,bZa, b \in \mathbb{Z} coprime to pp; multiplying such expressions for xx and yy yields the additive exponents for pp. Consequently, vpv_p defines a from the Q×\mathbb{Q}^\times to the additive group Z\mathbb{Z}. To see this multiplicativity explicitly for integers, note that the unique prime factorization theorem in Z\mathbb{Z} implies that if m,nZm, n \in \mathbb{Z} with prime factorizations involving pp to powers kk and \ell, respectively, then vp(mn)=k+=vp(m)+vp(n)v_p(mn) = k + \ell = v_p(m) + v_p(n). For rationals, the property extends via the quotient definition: vp(a/b)=vp(a)vp(b)v_p(a/b) = v_p(a) - v_p(b) for a,bZ{0}a, b \in \mathbb{Z} \setminus \{0\} with b0b \neq 0, so multiplicativity holds by combining the integer case. The multiplicativity also implies additivity under : for any x[Q](/page/Q)×x \in \mathbb{[Q](/page/Q)}^\times and n[0](/page/0)n \geq [0](/page/0), vp(xn)=nvp(x)v_p(x^n) = n \cdot v_p(x). This follows by induction on nn, using the base case n=[0](/page/0)n=[0](/page/0) where vp(1)=[0](/page/0)v_p(1) = [0](/page/0) and the inductive step vp(xn+1)=vp(xnx)=nvp(x)+vp(x)=(n+1)vp(x)v_p(x^{n+1}) = v_p(x^n \cdot x) = n v_p(x) + v_p(x) = (n+1) v_p(x). In the context of p-adic integers Zp\mathbb{Z}_p, the units—elements invertible within Zp\mathbb{Z}_p—are precisely those with vp(u)=[0](/page/0)v_p(u) = [0](/page/0). This reflects that such units are not divisible by pp, preserving the valuation under multiplication by other elements. For example, consider p=2p=2 and the product (3/4)(5/2)=15/8(3/4) \cdot (5/2) = 15/8. Here, v2(3/4)=v2(3)v2(4)=02=2v_2(3/4) = v_2(3) - v_2(4) = 0 - 2 = -2, v2(5/2)=v2(5)v2(2)=01=1v_2(5/2) = v_2(5) - v_2(2) = 0 - 1 = -1, and multiplicativity gives v2(15/8)=2+(1)=3v_2(15/8) = -2 + (-1) = -3, which matches the direct computation v2(15)v2(8)=03=3v_2(15) - v_2(8) = 0 - 3 = -3.

Non-Archimedean inequality

One of the defining properties of the p-adic valuation vpv_p on the rational numbers Q\mathbb{Q} is its behavior under addition, which satisfies the inequality vp(x+y)min(vp(x),vp(y))v_p(x + y) \geq \min(v_p(x), v_p(y)) for all x,yQx, y \in \mathbb{Q}. This contrasts with the additive property of the absolute value on the reals, where x+yx+y|x + y| \leq |x| + |y|, and highlights the "non-Archimedean" nature of vpv_p, as the valuation of a sum is at least as large as the smaller of the individual valuations, preventing the accumulation of "size" in the same way. To outline the proof for integers first, suppose without loss of generality that vp(x)vp(y)v_p(x) \leq v_p(y), so x=pvp(x)xx = p^{v_p(x)} x' and y=pvp(y)yy = p^{v_p(y)} y' with px,yp \nmid x', y'. Then x+y=pvp(x)(x+pvp(y)vp(x)y)x + y = p^{v_p(x)} (x' + p^{v_p(y) - v_p(x)} y'), where the term in parentheses is an integer not necessarily divisible by pp (unless cancellation occurs). Thus, vp(x+y)vp(x)=min(vp(x),vp(y))v_p(x + y) \geq v_p(x) = \min(v_p(x), v_p(y)). The result extends to rationals by clearing denominators and applying the integer case. Equality holds in the inequality precisely when vp(x)vp(y)v_p(x) \neq v_p(y), as the term with the smaller valuation dominates without cancellation. When vp(x)=vp(y)v_p(x) = v_p(y), the valuation of the sum may be strictly larger if the leading terms cancel pp. For example, with p=2p=2, v2(1+2)=v2(3)=0=min(v2(1),v2(2))=min(0,1)v_2(1 + 2) = v_2(3) = 0 = \min(v_2(1), v_2(2)) = \min(0, 1), showing equality under unequal valuations, while v_2([2 + 2](/page/2_+_2_=_?)) = v_2(4) = 2 > 1 = \min(v_2(2), v_2(2)), illustrating the strict inequality possible under equal valuations. This additive property implies the strict triangle inequality (or ultrametric inequality) for the associated p-adic xp=pvp(x)|x|_p = p^{-v_p(x)}, yielding x+ypmax(xp,yp)|x + y|_p \leq \max(|x|_p, |y|_p), which is stronger than the usual and underscores the non-Archimedean character. In general, a valuation on a field is called non-Archimedean if it satisfies this minimum inequality under addition, distinguishing it from Archimedean valuations like the one inducing the real .

p-adic absolute value

Definition and basic properties

The p-adic absolute value on the rational numbers Q\mathbb{Q} is defined using the p-adic valuation vpv_p. For a prime pp and xQx \in \mathbb{Q} with x0x \neq 0, write x=pvp(x)mnx = p^{v_p(x)} \cdot \frac{m}{n} where m,nZm, n \in \mathbb{Z} are coprime to pp; then xp=pvp(x)|x|_p = p^{-v_p(x)}, and by convention 0p=0|0|_p = 0 (noting that p=0p^{-\infty} = 0). This normalization, with base pp, ensures that pp=p1<1|p|_p = p^{-1} < 1, distinguishing it from other possible scalings of the valuation and facilitating consistency in the study of completions. The p-adic absolute value satisfies several foundational algebraic properties: it is multiplicative, so xyp=xpyp|xy|_p = |x|_p |y|_p for all x,yQx, y \in \mathbb{Q}; 1p=1|1|_p = 1; xp=xp|-x|_p = |x|_p for all xQx \in \mathbb{Q}; and xp=0|x|_p = 0 if and only if x=0x = 0. For example, with p=2p = 2, 42=22=14|4|_2 = 2^{-2} = \frac{1}{4} since v2(4)=2v_2(4) = 2, while 1/22=21=2|1/2|_2 = 2^{1} = 2 since v2(1/2)=1v_2(1/2) = -1. Unlike the usual absolute value on R\mathbb{R}, where nonzero integers have absolute value at least 1, the p-adic absolute value is non-trivial in the sense that there exist nonzero rationals xx with 0<xp<10 < |x|_p < 1, such as pp=p1|p|_p = p^{-1}.

Ultrametric inequality

The ultrametric inequality for the pp-adic absolute value states that for any rational numbers x,yQx, y \in \mathbb{Q} and prime pp, x+ypmax(xp,yp).|x + y|_p \leq \max(|x|_p, |y|_p). This is a stronger form of the , characteristic of non-Archimedean norms. The inequality follows directly from the corresponding property of the pp-adic valuation vpv_p. Specifically, vp(x+y)min(vp(x),vp(y))v_p(x + y) \geq \min(v_p(x), v_p(y)) for x,y0x, y \neq 0, with the convention vp(0)=v_p(0) = \infty. Since zp=pvp(z)|z|_p = p^{-v_p(z)} for zQz \in \mathbb{Q}, it follows that vp(x+y)min(vp(x),vp(y))=max(vp(x),vp(y)),-v_p(x + y) \leq -\min(v_p(x), v_p(y)) = \max(-v_p(x), -v_p(y)), so x+yp=pvp(x+y)pmax(vp(x),vp(y))=max(pvp(x),pvp(y))=max(xp,yp).|x + y|_p = p^{-v_p(x+y)} \leq p^{\max(-v_p(x), -v_p(y))} = \max(p^{-v_p(x)}, p^{-v_p(y)}) = \max(|x|_p, |y|_p). To derive the valuation inequality, express x=pvp(x)xx = p^{v_p(x)} x' and y=pvp(y)yy = p^{v_p(y)} y' where x,yQx', y' \in \mathbb{Q} are not divisible by pp. , assume vp(x)vp(y)v_p(x) \leq v_p(y), so x+y=pvp(x)(x+pvp(y)vp(x)y)x + y = p^{v_p(x)}(x' + p^{v_p(y) - v_p(x)} y'). The term in parentheses has valuation at least $0,yielding, yielding v_p(x + y) \geq v_p(x) = \min(v_p(x), v_p(y))$. Equality holds in the ultrametric inequality if xpyp|x|_p \neq |y|_p. In this case, the term with the larger (smaller valuation) dominates the sum, so x+yp|x + y|_p equals the maximum. For instance, with p=2p=2, 1+22=32=1=max(12,22)=max(1,1/2)|1 + 2|_2 = |3|_2 = 1 = \max(|1|_2, |2|_2) = \max(1, 1/2), since v2(1)=0<v2(2)=1v_2(1) = 0 < v_2(2) = 1. However, when xp=yp|x|_p = |y|_p, strict inequality may occur, as in 2+22=42=1/4<max(22,22)=1/2|2 + 2|_2 = |4|_2 = 1/4 < \max(|2|_2, |2|_2) = 1/2, where the valuations add in the sum. This inequality induces a non-Archimedean metric d(x,y)=xypd(x, y) = |x - y|_p on Q\mathbb{Q}, which generates a totally disconnected topology.
Add your contribution
Related Hubs
User Avatar
No comments yet.