How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Nonnegativity of a metric is a consequence of the other axioms, not an axiom
Statement
Let be a set and let satisfy the reflexivity axiom (M1') and the symmetry axiom (M2) of Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric. Then:
- If satisfies the triangle inequality (M3), then for all .
- If satisfies the strong triangle inequality (M3'), then for all .
In particular every metric, every pseudometric and every ultrametric (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) takes only nonnegative values. Nonnegativity is therefore a theorem about the axiom list this library uses, not a fourth axiom, and no statement on this page needs to assume it separately.
Facts & Assumptions
Given: A set , points , and a function satisfying (M1') for every and (M2) for all (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
(M3) The triangle inequality holds for all (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
(M3') The strong triangle inequality holds for all (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Trichotomy of the order of : for reals exactly one of , , holds, so fails exactly when (Order on the reals, Complete ordered field (least-upper-bound property), Ordered field).
Adding two strict inequalities: if and then (Order is preserved by adding a constant and by adding inequalities).
A two-element subset of has a maximum, and that maximum is or ; if it is (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
Proof
Instantiate [A1] at , , : .
Instantiate [A2] at , , : .
Suppose, towards ruling it out, that .
By (M1') the left side of step 1.1 is and by (M2) the right side is , so .
By (M2) the two entries of the maximum in step 1.2 are the same real number, so that maximum equals by [L3], and (M1') turns step 1.2 into , which is claim 2.
Adding the supposed inequality of step 1.3 to itself gives .
Steps 2.1 and 2.3 assert and , which trichotomy forbids; so the supposition of step 1.3 is untenable and , which is claim 1.
Remarks
- What each claim uses. Claim 1 is the familiar two-line argument followed by the observation that a negative real added to itself stays negative. Claim 2 does not need that second half at all: the strong triangle inequality delivers in one step, because the maximum of a real number with itself is that number.
- Symmetry is used in both claims and cannot be dropped. Without (M2) the instantiation of step 1.1 only gives , which leaves the possibility that one of the two values is negative and the other larger and positive. Dropping (M2) instead of weakening (M1) gives the notion usually called a quasimetric, which this library does not treat; for it the argument above is unavailable, so nonnegativity is not redundant there and is imposed as part of the definition (Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here).
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Order is preserved by adding a constant and by adding inequalities
- Order on the reals
- Complete ordered field (least-upper-bound property)
- Ordered field
- Maximum and minimum of a set
- Every nonempty finite set of reals has a maximum and a minimum
Used by
- The a priori bound d(x^*, xₙ) ≤ qⁿ d(x₁,x₀)/(1-q) and the a posteriori bound d(x^*, xₙ₊₁) ≤ q d(xₙ₊₁,xₙ)/(1-q) Corollary
- On ℕ with d(m,n) = 1 + 1/(m+n) for m ≠ n the sets {n, n+1, …} are nested, closed, bounded and complete with empty intersection Counterexample
- ℤ and {n + 1/n : n ≥ 2} are disjoint closed subsets of ℝ at distance 0, so the set-to-set distance is not a metric Counterexample
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms Definition
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space Definition
- Cauchy sequence in a metric space Definition
- Convergence of a sequence in a metric space: xₖ → x iff d(xₖ, x) → 0 in ℝ Definition
- Lipschitz map, α-Hölder map for rational 0 < α ≤ 1, and contraction Definition
- Open ball, closed ball and sphere in a metric space Definition
- The 2-adic absolute value gives an ultrametric on ℚ, in which every triangle is isosceles and every point of a ball is a centre Example
- The discrete metric induces the discrete topology, in which every subset is clopen Example
- The post-office metric d(x,y) = ‖x‖ + ‖y‖ for x ≠ y on ℝⁿ, and its isolated points Example
- |d(x,A) - d(y,A)| ≤ d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz Lemma
- A sequence in a metric space has at most one limit Lemma
- Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,∞) has it without being complete Lemma
- Dictionary: for A ⊆ ℝ with the metric d(x,y) = |x-y|, continuity and uniform continuity of f : A → ℝ agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of ℝ is compact in the open-cover sense of ℝ exactly when it is a compact metric subspace Lemma
- Every Cauchy sequence in a metric space is bounded Lemma
- For a nonempty set X and a metric space (Y,d) the uniform metric barρ(f,g) = supₓ min{d(f(x),g(x)), 1} is a metric on Y^X Lemma
- For n ≥ 1 the product topology on n copies of the usual topology of ℝ is the metric topology of d_∞ on ℝⁿ, and hence also of d₁ and d₂, so ℝⁿ as a product and ℝⁿ as a metric space are one space Lemma
- min(d,1) and d/(1+d) are metrics uniformly equivalent to d, so every metric space carries a bounded metric with the same topology Lemma
- Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here Remark
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point Theorem
- A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed Theorem
- Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent Theorem
- Distinct points of a metric space have disjoint balls around them Theorem
- Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences Theorem
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous Theorem
- In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness Theorem
- In a metric space any two separated sets have disjoint open neighbourhoods, so every metrizable space is completely normal Theorem
- The closure of a nonempty A is {x : d(x,A) = 0}, equals A together with its limit points, and is the smallest closed superset Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 22 results over 9 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Metric space (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)
- T. Tao, Analysis II, 3rd ed., Ch. 1 (standard reference, not scraped)