Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Optimal Transport: Convexity and Inequalities

In course

MATH-476: Optimal transport

The first part is devoted to Monge and Kantorovitch problems, discussing the existence and the properties of the optimal plan. The second part introduces the Wasserstein distance on measures and develops applications of optimal transport to PDEs, functiona ...

Description

This lecture covers the concept of optimal transport, focusing on convexity properties and inequalities. Starting with the definition of optimal coupling, the instructor explains the Wassenstein geodesic and its relation to convex functions. The lecture delves into the application of Brunn-Minkowski inequality, demonstrating how it applies to compact sets in Rd. Through a series of proofs and examples, the lecture showcases the importance of convexity in optimal transport problems and how it leads to various inequalities.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Maria Colombo

Xavier Fernandez-Real Girona

Official source

Related concepts (32)

Convex function

In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of the function lies above the graph between the two points. Equivalently, a function is convex if its epigraph (the set of points on or above the graph of the function) is a convex set. A twice-differentiable function of a single variable is convex if and only if its second derivative is nonnegative on its entire domain.

Convex set

In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve.

Compact space

In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space. The idea is that a compact space has no "punctures" or "missing endpoints", i.e., it includes all limiting values of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval [0,1] would be compact.

Locally compact space

In topology and related branches of mathematics, a topological space is called locally compact if, roughly speaking, each small portion of the space looks like a small portion of a compact space. More precisely, it is a topological space in which every point has a compact neighborhood. In mathematical analysis locally compact spaces that are Hausdorff are of particular interest; they are abbreviated as LCH spaces. Let X be a topological space. Most commonly X is called locally compact if every point x of X has a compact neighbourhood, i.

Σ-compact space

In mathematics, a topological space is said to be σ-compact if it is the union of countably many compact subspaces. A space is said to be σ-locally compact if it is both σ-compact and (weakly) locally compact. That terminology can be somewhat confusing as it does not fit the usual pattern of σ-(property) meaning a countable union of spaces satisfying (property); that's why such spaces are more commonly referred to explicitly as σ-compact (weakly) locally compact, which is also equivalent to being exhaustible by compact sets.

Related lectures (36)

Harmonic Forms: Main Theorem

Explores harmonic forms on Riemann surfaces and the uniqueness of solutions to harmonic equations.

Differential Forms Integration

Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.

Convex Sets and Functions

Introduces convex sets and functions, discussing minimizers, optimality conditions, and characterizations, along with examples and key inequalities.

Approximation of Zeta Function

Explores the approximation of the zeta function using compact functions and spectral decomposition.

Optimal Transport: Rockafellar Theorem Log in to Mediaspace to watch this video