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.
Mixture convexity does not imply displacement convexity
Example
Assume AC. Let , , , , and , so for every finite nonnegative Borel measure. For each , take and ; the cutoff, boundedness, Lipschitz, and linear-growth assumptions hold. This energy is convex under linear mixtures of measures, but it is not displacement convex along geodesics: along the geodesic from to , its endpoint values are zero and its midpoint value is one.
Example references
Facts & Assumptions
Given: The feature-energy data in the Example.
The unique coupling of two Dirac probability measures is concentrated on their support-point pair, so their geodesic is the linear interpolation of those points. Generalized W2 geodesics and strong Wasserstein subgradients
Proof
Given: , , and AC as in the Example.
For and , expansion gives . Thus the real square obeys the convexity inequality, including and , by core algebra alone.
For finite nonnegative measures , write and . Linearity of integration gives by step 1.1. Thus is mixture-convex.
For and , [F2] gives the geodesic . Then , whereas . The convexity inequality at would require , which is false. Hence mixture convexity does not imply displacement convexity.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Lénaïc Chizat and Francis Bach, On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport (standard reference, not scraped)
- Ambrosio, Gigli, and Giuseppe Savaré, Gradient Flows in Metric Spaces and in the Space of Probability Measures (standard reference, not scraped)