Game extensions of floppy graph metrics
Pith reviewed 2026-05-24 07:52 UTC · model grok-4.3
The pith
Floppy graph metrics with countably many missing edges can be completed to full metrics by choosing distances from dense sets.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For every floppy graph metric d on X, every missing pair {x,y}, and every r satisfying (1/3)check d(x,y) + (2/3)hat d(x,y) ≤ r < hat d(x,y), the extension d ∪ {<{x,y}, r>} is a floppy graph metric. This implies that when [X]^2 minus E_d is countable and (F_e) is a family of dense subsets of R_+, there exists an injective r in the product of the F_e such that d ∪ r is a full metric.
What carries the argument
The floppiness condition, which requires hat d(x,y) > check d(x,y) for each missing pair, where hat d is the infimum path length and check d is a supremum over certain differences; the allowable interval for the new edge length r ensures the condition persists after extension.
If this is right
- Sequential addition of edges with chosen lengths preserves floppiness at each step.
- When missing edges are countable, a full metric extension exists using lengths from any dense families.
- The extension choice can be made injective across the missing pairs.
- The completion property does not hold for uncountable collections of missing edges.
Where Pith is reading between the lines
- Such extensions may allow constructing metrics with additional properties like being injective or avoiding certain values.
- Similar extension techniques could apply to other variants of partial metrics beyond graph metrics.
Load-bearing premise
The starting graph metric must already satisfy the floppy condition that the shortest path distance exceeds the check value for every missing pair.
What would settle it
A concrete counterexample where extending a floppy metric by an r in the given interval fails to remain floppy, or where no injective selection from dense sets yields a full metric despite countability.
read the original abstract
A $graph$ $metric$ on a set $X$ is any function $d: E_d \to\mathbb R_+:=\{x\in\mathbb R:x>0\}$ defined on a connected graph $ E_d \subseteq[X]^2:=\{A\subseteq X:|A|=2\}$ and such that for every $\{x,y\}\in E_d$ we have $d(\{x,y\})\le\hat d(x,y):=\inf\big\{\sum_{i=1}^nd(\{x_{i-1},x_i\}):\{x,y\}=\{x_0,x_n\}\;\wedge\;\{\{x_{i-1},x_i\}:0<i\le n\}\subseteq E_d \big\}$. A graph metric $d$ is called a $full$ $metric$ on $X$ if $ E_d =[X]^2$. A graph metric $d: E_d \to\bar{\mathbb R}_+$ is $floppy$ if $\hat d(x,y)>\check d(x,y:= \sup\{d(\{a,b\})-\hat d(a,u)-\hat d(b,y):\{a,b\}\in E_d \}$ for every $x,y\in X$ with $\{x,y\}\notin E_d $. We prove that for every floppy graph metric $d: E_d \to\mathbb R_+$ on a set $X$, every points $x,y\in X$ with $\{x,y\}\notin E_d $, and every real number $r$ with $\frac 13\check d(x,y)+\frac23\hat d(x,y)\le r<\hat d(x,y)$ the function $d\cup\{\langle\{x,y\},r\rangle\}$ is a floppy graph metric. This implies that for every floppy graph metric $d: E_d \to\mathbb R_+$ with countable set $[X]^2\setminus E_d $ and for every indexed family $(F_e)_{e\in[X]^2\setminus E_d }$ of dense subsets of $\mathbb R_+$, there exists an injective function $r\in\prod_{e\in[X]^2\setminus E_d}F_e$ such that $d\cup r$ is a full metric. Also, we prove that the latter result does not extend to partial metrics defined on uncountable sets.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper defines a graph metric d on the edges E_d of a connected graph as a positive real function satisfying the triangle inequality via infima over path lengths (hat d). A graph metric is floppy if for every non-edge {x,y}, hat d(x,y) > check d(x,y), where check d(x,y) is the supremum of d({a,b}) - hat d(a,u) - hat d(b,y) over edges {a,b}. The central theorem asserts that if d is floppy then for any missing pair and r satisfying (1/3)check d(x,y) + (2/3)hat d(x,y) ≤ r < hat d(x,y), the one-edge extension remains a floppy graph metric. The corollary states that when the missing-edge set is countable, lengths can be chosen injectively from given dense subsets F_e of R+ to obtain a full metric; this fails for uncountable missing-edge sets.
Significance. If the result holds, the explicit interval for admissible r supplies a concrete, non-empty range that preserves both the metric inequality and the strict floppy separation, enabling sequential choice from dense sets for countable extensions. The uncountable counter-example delineates the precise scope. These features constitute a clean, falsifiable contribution to the study of partial metrics and their completions.
minor comments (2)
- [Abstract] Abstract, definition of check d: the displayed formula contains the typographical error 'check d(x,y:= sup' (missing closing parenthesis and colon placement).
- [Abstract] Abstract: the symbol bar R_+ appears once without prior definition; state explicitly whether it includes zero and whether it is used only for the non-floppy case.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript, including the recognition of the explicit interval for admissible edge lengths and the delineation of the countable versus uncountable cases. We are pleased that the contribution was viewed as clean and falsifiable.
Circularity Check
No significant circularity; pure deductive proof from definitions
full rationale
The paper defines graph metric d via the inequality d({x,y}) ≤ hat d(x,y) (the infimum path length) and floppy via hat d(x,y) > check d(x,y) (the supremum of triangle inequalities from existing edges). The central theorem states that for any missing pair and any r in the explicit interval [ (1/3)check d + (2/3)hat d , hat d ), the one-edge extension d ∪ {<{x,y},r>} remains a floppy graph metric. This interval is derived directly by substituting the definitions of check d and hat d into the required inequalities for the new metric; the lower bound is chosen precisely so that the new check d' and hat d' inequalities continue to hold strictly. The countable-extension corollary follows by induction on the missing edges, using that each single extension preserves the floppy property (so the allowable interval stays non-empty) and that each F_e is dense (so a value can always be chosen avoiding the finitely many forbidden points). No parameter is fitted to data, no self-citation is invoked as a load-bearing uniqueness theorem, and no ansatz or renaming occurs. The uncountable counter-example is proved separately by a direct cardinality argument. The entire chain is therefore self-contained against the initial definitions and requires no external or self-referential reduction.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The graph E_d is connected, as required by the definition of graph metric.
- standard math Infima and suprema exist in the extended reals for the path sums and the check-d expression.
Reference graph
Works this paper leans on
-
[1]
Banakh spaces and their geometry
T. Banakh, Banakh spaces and their geometry , preprint ( arxiv.org/abs/2305.07354)
work page internal anchor Pith review Pith/arXiv arXiv
- [2]
- [3]
-
[4]
Bessaga, On linear operators and functors extending pseudometrics , Fund
C. Bessaga, On linear operators and functors extending pseudometrics , Fund. Math. 142:2 (1993), 101–122
work page 1993
-
[5]
Bing, Extending a metric , Duke Math
R.H. Bing, Extending a metric , Duke Math. J. 14 (1947), 511–519
work page 1947
-
[6]
O. Dovgoshey, O. Martio, M. Vuorinen, Metrization of weighted graphs , Ann. Comb. 17:3 (2013), 455–476
work page 2013
-
[7]
Engelking, General Topology, Heldermann Verlag, Berlin, 1989
R. Engelking, General Topology, Heldermann Verlag, Berlin, 1989
work page 1989
-
[8]
Hausdorff, Erweiterung einer Hom¨ omorphie, Fund
F. Hausdorff, Erweiterung einer Hom¨ omorphie, Fund. Math. 16 (1930), 353–360
work page 1930
-
[9]
Petrov, On the uniqueness of continuation of a partially defined metr ic, Theory Appl
E. Petrov, On the uniqueness of continuation of a partially defined metr ic, Theory Appl. Graphs 10:1 (2023), Art. 1, 6 pp
work page 2023
-
[10]
Toru´ nczyk,A short proof of Hausdorff ’s theorem on extending metrics , Fund
H. Toru´ nczyk,A short proof of Hausdorff ’s theorem on extending metrics , Fund. Math. 77:2 (1972), 191–193
work page 1972
-
[11]
E. Tymchatyn, M. Zarichnyi, On simultaneous linear extensions of partial (pseudo)metr ics, Proc. Amer. Math. Soc. 132:9 (2004), 2799–2807
work page 2004
-
[12]
Taras Banakh , A generic metric on X ∪ Z, ( mathoverflow.net/q/446586/61536). T.Banakh: Ivan Franko National University of L viv (Ukraine), a nd Jan Kochanowski University in Kielce (Poland) Email address : t.o.banakh@gmail.com P.Majer: Universit `a di Pisa, Dipartimento di Matematica Email address : pietro.majer@unipi.it
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.