Mazur’s theorem on convex sets
E1200644
UNEXPLORED
Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Mazur’s theorem on convex sets canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T16232046 — 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: Mazur’s theorem on convex sets Context triple: [Stanisław Mazur, notableWork, Mazur’s theorem on convex sets]
-
A.
Minkowski’s theorem on convex sets
Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
-
B.
Carathéodory’s theorem in convex geometry
Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
-
C.
Banach–Mazur theorem
The Banach–Mazur theorem is a fundamental result in functional analysis that characterizes separable Banach spaces as isometrically isomorphic to closed subspaces of spaces of continuous functions on compact metric spaces.
-
D.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
E.
Gale’s theorem on linear inequalities
Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
- 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: Mazur’s theorem on convex sets Target entity description: Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
-
A.
Minkowski’s theorem on convex sets
Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
-
B.
Carathéodory’s theorem in convex geometry
Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
-
C.
Banach–Mazur theorem
The Banach–Mazur theorem is a fundamental result in functional analysis that characterizes separable Banach spaces as isometrically isomorphic to closed subspaces of spaces of continuous functions on compact metric spaces.
-
D.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
E.
Gale’s theorem on linear inequalities
Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.