A -metric is a symmetric function
, vanishing
exactly when its arguments agree, that satisfies a relaxed triangle
inequality with a fixed
:
|
(1)
|
The case
is an ordinary metric (Czerwik 1993). With
,
the chain construction
|
(2)
|
is a metric satisfying .
It has exactly the same convergent and Cauchy sequences as
(Paluszyński and Stempak 2009).
Kamalov (2026) gave explicit reductions of two stronger relaxations. If a symmetric distance , vanishing only on the diagonal,
satisfies
with
, then
|
(3)
|
is a -metric with the same
and the same convergent
and Cauchy sequences. The case
of this logarithmic reduction was known previously.
If instead , where
,
,
, and
,
then
is a
-metric with the optimal guaranteed constant
.
Moreover,
itself is a metric for
|
(4)
|
This guaranteed exponent is optimal when ; optimality for arbitrary
is not asserted (Kamalov 2026).