Brenier map
E1017920
The Brenier map is the unique gradient of a convex function that provides the optimal transport between probability measures under a quadratic cost, playing a central role in modern optimal transport theory.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Brenier map canonical | 2 |
| Brenier’s polar factorization theorem | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13035731 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Brenier map Context triple: [Monge problem in optimal transport, relatedConcept, Brenier map]
-
A.
Monge problem in optimal transport
The Monge problem in optimal transport is a foundational mathematical formulation that seeks the most efficient way to move mass from one distribution to another, minimizing a given transportation cost.
-
B.
Optimal Transport: Old and New
"Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
-
C.
Monge–Ampère equation
The Monge–Ampère equation is a fully nonlinear partial differential equation central to differential geometry, optimal transport, and several complex variables, often used to study curvature and geometric structures.
-
D.
Weingarten map
The Weingarten map is a differential geometric operator on a surface that encodes how the surface’s normal vector field changes, thereby describing the surface’s extrinsic curvature.
-
E.
Wasserstein distance
Wasserstein distance is a metric from optimal transport theory that measures the minimal “cost” of transforming one probability distribution into another, widely used to compare distributions in statistics and machine learning.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Brenier map Target entity description: The Brenier map is the unique gradient of a convex function that provides the optimal transport between probability measures under a quadratic cost, playing a central role in modern optimal transport theory.
-
A.
Monge problem in optimal transport
The Monge problem in optimal transport is a foundational mathematical formulation that seeks the most efficient way to move mass from one distribution to another, minimizing a given transportation cost.
-
B.
Optimal Transport: Old and New
"Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
-
C.
Monge–Ampère equation
The Monge–Ampère equation is a fully nonlinear partial differential equation central to differential geometry, optimal transport, and several complex variables, often used to study curvature and geometric structures.
-
D.
Weingarten map
The Weingarten map is a differential geometric operator on a surface that encodes how the surface’s normal vector field changes, thereby describing the surface’s extrinsic curvature.
-
E.
Wasserstein distance
Wasserstein distance is a metric from optimal transport theory that measures the minimal “cost” of transforming one probability distribution into another, widely used to compare distributions in statistics and machine learning.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
mathematical concept
ⓘ
optimal transport map ⓘ |
| appearsIn | polar factorization of vector-valued maps ⓘ |
| hasCodomain | Euclidean space ⓘ |
| hasDomain | Euclidean space ⓘ |
| hasRegularityDependingOn | regularity of source and target densities ⓘ |
| is |
almost everywhere uniquely defined
ⓘ
gradient of a convex function ⓘ optimal transport map for quadratic cost ⓘ |
| isAssociatedWith |
L2 optimal transport
ⓘ
Wasserstein-2 distance ⓘ |
| isCharacterizedAs |
Monge solution of the quadratic optimal transport problem
ⓘ
gradient of a convex potential ⓘ |
| isDefinedBetween |
absolutely continuous probability measures
ⓘ
probability measures ⓘ |
| isDefinedUnder | quadratic cost ⓘ |
| isGeneralizedBy | optimal maps for other cost functions ⓘ |
| isGradientOf | convex potential function ⓘ |
| isGuaranteedBy |
Brenier’s polar factorization theorem
ⓘ
linked to:
Brenier map
|
| isPushforwardMapOf | convex potential gradient ⓘ |
| isRelatedTo |
Kantorovich formulation of optimal transport
ⓘ
linked to:
Kantorovich problem in optimal transport
Monge formulation of optimal transport ⓘ
linked to:
Monge problem in optimal transport
cyclical monotonicity ⓘ |
| isSolutionOf | Monge problem with quadratic cost ⓘ |
| isSpecialCaseOf | c-convex potential gradients for c(x,y)=|x−y|^2/2 ⓘ |
| isStableUnder | weak convergence of measures (under suitable conditions) ⓘ |
| isSubjectOf | regularity theory in optimal transport ⓘ |
| isToolIn |
fluid mechanics
ⓘ
geometric analysis ⓘ machine learning ⓘ modern optimal transport theory ⓘ partial differential equations ⓘ probability theory ⓘ |
| isUnique | up to source-measure null sets ⓘ |
| isUsedFor |
density equalization mappings
ⓘ
domain morphing and mesh transport ⓘ image registration in imaging sciences ⓘ measure-preserving rearrangements ⓘ |
| isUsedToDefine |
displacement interpolation
ⓘ
geodesics in Wasserstein-2 space ⓘ |
| minimizes | quadratic transport cost ⓘ |
| namedAfter | Yann Brenier ⓘ |
| pushesForward | source measure to target measure ⓘ |
| requiresAssumption | source measure absolutely continuous with respect to Lebesgue measure ⓘ |
| satisfies |
Monge–Ampère equation in suitable settings
ⓘ
cyclical monotonicity of its graph ⓘ |
| underlies | Riemannian structure of Wasserstein space ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Brenier map Description of subject: The Brenier map is the unique gradient of a convex function that provides the optimal transport between probability measures under a quadratic cost, playing a central role in modern optimal transport theory.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Brenier map