Game extensions of floppy graph metrics

Abstract: A

g r a p h

m e t r i c

on a set

X

is any function

d : E_{d} o m a t h b b R_{+} := x i n m a t h b b R : x > 0

defined on a connected graph

E_{d} s u b s e t e q [X]^{2} := A s u b s e t e q X : | A | = 2

and such that for every

x, y i n E_{d}

we have

. A graph metric

d

is called a

f u l l

m e t r i c

on

X

if

E_{d} = [X]^{2}

. A graph metric

is

f l o p p y

if

h a t d (x, y) > c h e c k d (x, y := s u p d (a, b) - h a t d (a, u) - h a t d (b, y) : a, b i n E_{d}

for every

x, y i n X

with

x, y o t i n E_{d}

. We prove that for every floppy graph metric

d : E_{d} o m a t h b b R_{+}

on a set

X

, every points

x, y i n X

with

x, y o t i n E_{d}

, and every real number

r

with

f r a c 13 c h e c k d (x, y) + f r a c 23 h a t d (x, y) l e r < h a t d (x, y)

the function

d c u p l a n g l e x, y, r a n g l e

is a floppy graph metric. This implies that for every floppy graph metric

d : E_{d} o m a t h b b R_{+}

with countable set

[X]^{2} s e t m i n u s E_{d}

and for every indexed family

(F_{e})_{e i n [X]^{2} s e t m i n u s E_{d}}

of dense subsets of

m a t h b b R_{+}

, there exists an injective function

r i n p r o d_{e i n [X]^{2} s e t m i n u s E_{d}} F_{e}

such that

d c u p r

is a full metric. Also, we prove that the latter result does not extend to partial metrics defined on uncountable sets.

This page was built for publication: Game extensions of floppy graph metrics