TOPICS
Search

Four-Point Condition


A metric d on a finite set satisfies the four-point condition if, for every four points u, v, x, and y, the two largest of the three numbers

 {d(u,v)+d(x,y),d(u,x)+d(v,y),d(u,y)+d(v,x)}

are equal. Equivalently, the maximum of the three numbers is attained at least twice.

A finite metric satisfies the four-point condition iff it is a tree metric. This criterion is consequently used to recognize when a distance matrix can be represented by distances in an edge-weighted tree.


See also

Distance Matrix, Metric, Phylogenetic Tree, Tree, Tree Metric

Explore with Wolfram|Alpha

References

Buneman, P. "The Recovery of Trees from Measures of Dissimilarity." In Mathematics in the Archaeological and Historical Sciences (Eds. F. R. Hodson, D. G. Kendall, and P. Tautu). Edinburgh, Scotland: Edinburgh University Press, pp. 387-395, 1971.Semple, C. and Steel, M. Phylogenetics. Oxford, England: Oxford University Press, 2003.

Cite this as:

Weisstein, Eric W. "Four-Point Condition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Four-PointCondition.html

Subject classifications