Math 2.0

Calculus of variations and optimal control; optimization Theorem

Kantorovich–Rubinstein duality

Builds on Wasserstein metricPolish spaceLipschitz conditionProbability measureLebesgue integralSupremum

Statement

Let (M,d)(M, d) be a Polish space. Let μ\mu and ν\nu be Borel probability measures on MM with finite first moments, that is, ∫Md(x,x0) dμ(x)<∞\int_M d(x, x_0) \, d\mu(x) < \infty and ∫Md(x,x0) dν(x)<∞\int_M d(x, x_0) \, d\nu(x) < \infty for some x0∈Mx_0 \in M. Let W1W_1 be the 11-Wasserstein distance. Then W1(μ,ν)=sup⁡{∫Mf dμ−∫Mf dν},W_1(\mu, \nu) = \sup \set{ \int_M f \, d\mu - \int_M f \, d\nu }, where the supremum is over all functions f ⁣:M→ℝf \colon M \to \R with ∣f(x)−f(y)∣≤d(x,y)\abs{f(x) - f(y)} \le d(x, y) for all x,y∈Mx, y \in M.

Remarks

The inequality ≥\ge is easy. For a coupling γ\gamma and a 11-Lipschitz ff, one has ∫f dμ−∫f dν=∫(f(x)−f(y)) dγ(x,y)≤∫d(x,y) dγ(x,y)\int f \, d\mu - \int f \, d\nu = \int (f(x) - f(y)) \, d\gamma(x, y) \le \int d(x, y) \, d\gamma(x, y). The reverse inequality is a case of Kantorovich duality in optimal transport, for the cost c(x,y)=d(x,y)c(x, y) = d(x, y). For this cost the dual potentials can be taken 11-Lipschitz, with the second potential equal to −f-f.

Example: for Dirac measures δx\delta_x and δy\delta_y, the function f=d(⋅,y)f = d(\cdot, y) is 11-Lipschitz and gives f(x)−f(y)=d(x,y)f(x) - f(y) = d(x, y). This matches W1(δx,δy)=d(x,y)W_1(\delta_x, \delta_y) = d(x, y).

The moment condition makes all the integrals finite, since a 11-Lipschitz ff satisfies ∣f(x)∣≤∣f(x0)∣+d(x,x0)\abs{f(x)} \le \abs{f(x_0)} + d(x, x_0).

Going deeper

For a student

The duality turns a minimum over couplings into a maximum over Lipschitz functions. It shows that W1(μ,ν)W_1(\mu, \nu) depends only on the signed measure μ−ν\mu - \nu, as a dual norm for the Lipschitz seminorm. This is the form of W1W_1 used in Wasserstein generative adversarial networks, where the Lipschitz function is a trained critic. It is often called the Kantorovich–Rubinstein theorem.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Lebesgue integral concept
  2. Lipschitz condition concept
  3. Polish space concept
  4. Probability measure concept
  5. Supremum concept
  6. Wasserstein metric concept
  7. Kantorovich–Rubinstein duality statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Wasserstein_metric
About this page
TagSYXSZD8EFK
URIm2://SYXSZD8EFK
Kindstatement, theorem
WritingW0 stub
MSC49Q22, 60B10, 28A33
StatusThis copy of the site has no build data. Run m2 status SYXSZD8EFK.
AboutWasserstein metric
UsesWasserstein metric, Polish space, Lipschitz condition, Probability measure, Lebesgue integral, Supremum
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.