MathLabs
TheoremProved

The ultrametric (strong triangle) inequality

Statement

For all x,y∈Qpx, y \in \mathbb{Q}_p, ∣x+y∣p≤max⁡(∣x∣p,∣y∣p)|x+y|_p \le \max(|x|_p, |y|_p), and equality ∣x+y∣p=max⁡(∣x∣p,∣y∣p)|x+y|_p = \max(|x|_p, |y|_p) holds whenever ∣x∣p≠∣y∣p|x|_p \ne |y|_p.

Why is it true?

This is the defining feature separating the pp-adic world from ordinary geometry: it forces every triangle to be isosceles. If dp(x,z)=∣x−z∣pd_p(x,z) = |x-z|_p, dp(x,y)d_p(x,y), dp(y,z)d_p(y,z) are the three pairwise distances among three points, the two largest of them must be equal. There is no such thing as a pp-adic triangle with one side strictly longer than the other two — a picture that has no counterpart for the ordinary absolute value on R\mathbb{R}.

Proof sketch

Write x=pvp(x)ux = p^{v_p(x)} u, y=pvp(y)wy = p^{v_p(y)} w with u,wu, w units in Zp\mathbb{Z}_p (i.e. ∣u∣p=∣w∣p=1|u|_p = |w|_p = 1), and suppose without loss of generality vp(x)≤vp(y)v_p(x) \le v_p(y), so ∣x∣p≥∣y∣p|x|_p \ge |y|_p. Factor out the smaller power: x+y=pvp(x)(u+pvp(y)−vp(x)w)x + y = p^{v_p(x)}(u + p^{v_p(y)-v_p(x)} w). The term in parentheses is a genuine element of Zp\mathbb{Z}_p (a sum of elements of Zp\mathbb{Z}_p), so its pp-adic absolute value is ≤1\le 1; hence ∣x+y∣p≤p−vp(x)=∣x∣p=max⁡(∣x∣p,∣y∣p)|x+y|_p \le p^{-v_p(x)} = |x|_p = \max(|x|_p, |y|_p), proving the inequality. If moreover vp(x)<vp(y)v_p(x) < v_p(y) strictly (i.e. ∣x∣p≠∣y∣p|x|_p \ne |y|_p), then pvp(y)−vp(x)w≡0(modp)p^{v_p(y)-v_p(x)} w \equiv 0 \pmod p while uu is a unit, so u+pvp(y)−vp(x)w≡u≢0(modp)u + p^{v_p(y)-v_p(x)} w \equiv u \not\equiv 0 \pmod p is again a unit; thus ∣x+y∣p=p−vp(x)|x+y|_p = p^{-v_p(x)} exactly, giving equality.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Neal Koblitz (1984). p-adic Numbers, p-adic Analysis, and Zeta-Functions · DOI:10.1007/978-1-4612-1112-9
  2. Peter Scholze (2012). Perfectoid spaces · arXiv:1111.4914