The defining formulas imply the matching-distance identities
For example,
and the other two follow cyclically. Thus are the tripod points of a geodesic triangle.
By the thin geodesic triangle condition, lies within of some point on or . If , then the triangle inequality gives
Since is the point of at distance from , the geodesic parametrization gives , and hence . If instead , comparison of distances from gives .
Applying the same argument cyclically, each of lies within of at least one of the other two. The graph on these three points whose edges join pairs at distance at most therefore has no isolated vertex, so it is connected. Any two vertices are joined by at most two edges, and the triangle inequality yields
Let be a measure-preserving transformation of and let . The Birkhoff ergodic theorem states that
almost everywhere, where is the invariant sigma-algebra. The limit is -invariant and
Assume now that . For , let
be the bounded truncation of , and let be its Birkhoff limit. Since on a finite measure space, the dominated convergence theorem gives
Measure preservation and the triangle inequality give the contraction
Moreover, the almost-everywhere convergence and Fatou lemma imply
Consequently
Since in , letting proves the L1 convergence in the Birkhoff ergodic theorem on a finite measure space:
For , the triangle inequality and the Cauchy-Schwarz inequality give
Thus is a continuous function. The unit sphere in the finite-dimensional Euclidean normed vector space is compact. Moreover, implies that the polynomial vanishes identically, so every coefficient is zero. Hence is strictly positive on the unit sphere. By the extreme value theorem, it has a positive minimum
The supremum norm is homogeneous. For ,
It follows directly that whenever .
Write each polynomial of degree at most as and define
This is a continuous function, and the reverse triangle inequality together with part (a) gives
Consequently is a coercive function. Choose so large that outside the closed Euclidean ball of radius . That ball is compact, so the extreme value theorem supplies a minimizer there. Then is a best uniform approximation to among polynomials of degree at most .
Write for the partial sum. Fix an integer . The tail-sum formula for expectation, applied to the nonnegative random variable , gives
because . The events are independent, so the second Borel--Cantelli lemma shows that infinitely often with probability one. Taking the countable intersection over yields
almost surely.
Now , and the triangle inequality gives
If the limit superior of were finite, the right-hand side would have finite limit superior, contradicting the preceding conclusion. Therefore
almost surely.
Let be one side of the geodesic quadrilateral, and draw a diagonal from to the opposite vertex. A point lies, by -thinness of the first geodesic triangle, within either of an adjacent side or of the diagonal. In the latter case, -thinness of the second triangle places the nearby point of the diagonal within another of one of the other two sides. The triangle inequality then places within of the remaining three sides. The argument applies to every side, proving the geodesic quadrilateral in a hyperbolic metric space bound.
Let be the midpoint of a geodesic and put . Apply the geodesic quadrilateral in a hyperbolic metric space bound to the quadrilateral with consecutive vertices . The point is within of one of the other three sides. It cannot be within of , because every point of has distance greater than from every point of .
By symmetry there is therefore a point with . The triangle inequality gives
and hence
Since and is a closest point of to , we also have . Therefore , as required.
Put
The numerator is the linear kernel, while the reciprocal of the denominator is the kernel from part c applied to and . The product of positive-semidefinite kernels therefore shows that is a positive-semidefinite kernel. The Cauchy-Schwarz inequality and the arithmetic-geometric mean inequality give , so
Each power is positive semidefinite by the Schur product theorem, and the convergent sum is positive semidefinite.
Moreover . If is its canonical feature map, then
The feature-space norm gives symmetry and the triangle inequality. Finally, implies , hence and
which is equivalent to . Thus is a metric rather than merely a pseudometric.
Write . On , Hölder's inequality gives
Since , the triangle inequality gives
Substitution in the Basic inequality for the Lasso, followed by discarding the nonnegative prediction-error term, yields
Therefore , the Lasso cone condition.
Define
For every unit-ball vector , the triangle inequality gives
Taking the supremum and using optimality, , yields
For , choose the integer with
and define the partial sum
It belongs to , and the triangle inequality gives
At the points
every tail term has the same alternating sign because
Thus
There are at least such points because . The Chebyshev alternation theorem proves
For , the partial sum is empty and the same argument at gives and .
The spectral norm of an operator is the induced operator norm
Every Pauli X gate is unitary, so . The triangle inequality for the norm therefore gives
In fact equality holds, as the product of eigenvectors of the has eigenvalue under .
For , its regular tempered distribution acts by integration, and the distributional transform agrees with the function
The triangle inequality gives the uniform bound
If , then pointwise and every integrand is bounded in absolute value by the Lebesgue integrable function . The Dominated convergence theorem therefore proves that is continuous. In fact the Riemann-Lebesgue lemma also gives as .
Write points of as with . For , translate into the domain by
Continuity of translations in applied to gives
as . Choose a standard mollifier supported in a ball of radius . For , the convolution
only samples points with first coordinate greater than , so it is well-defined and smooth throughout . The approximation-to-the-identity theorem, applied also to each weak derivative, allows to be chosen so that
Taking and using the triangle inequality proves the density of smooth functions in a Sobolev space.
One standard normalized form of the Croot-Sisask almost-periodicity theorem is this. Let be finite subsets of an abelian group with , let , let , and let be a complex function. There is with
such that every satisfies
For the proof, sample independent points of and approximate by the empirical average of the corresponding translates of . A moment inequality bounds the expected error, so many samples are good. The small size of lets a translation and pigeonhole argument find many shifts in producing the same good approximation. Subtracting two such shifts and applying the triangle inequality yields the almost periods in .
For , the triangle inequality and the fact that is an isometry give
Thus the displacement function is -Lipschitz, hence continuous.
Write for the polynomial length. The height bound for a polynomial evaluation is
provided the denominator is nonzero. At non-Archimedean places the integral coefficients and ultrametric inequality give the local estimate without an extra constant; at Archimedean places the triangle inequality gives the polynomial length. Multiplication over every place of a number field and the product formula produce the displayed bound.
Taking and gives
Taking gives
Refine a dyadic partition by inserting and . The triangle inequality shows that its variation over is at least . Passing to the defining limit gives
Consequently the càdlàg functions
are nondecreasing: for , the displayed inequality makes both increments nonnegative. Thus they are distribution functions in the Stieltjes sense and ; this is the Jordan decomposition of a function of bounded variation.
Now , so is countable by part (a). For any finite subset , partitions isolating its points and the triangle inequality give
Taking the supremum over finite proves .
Choose a shortest path . Glue the prescribed one-step edge couplings successively. The triangle inequality for the Wasserstein transportation metric gives
Now couple initial states optimally for and conditionally use these one-step couplings. Taking expectations and then the infimum gives
Iteration with yields . Since this metric dominates total variation, it is at most once