Regularity of singular set in optimal transportation
Abstract
In this paper, we establish a regularity theory for the optimal transport problem when the target is composed of two disjoint convex domains. This is an important model in which singularities arise. Even though the singular set does not exhibit any form of convexity a priori, we prove its higher order regularity by developing novel methods, which also have many other applications. Notably, our results are achieved without requiring any convexity of the source domain. This aligns with Caffarelli's celebrated regularity theory.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.