-
Notifications
You must be signed in to change notification settings - Fork 209
Description
What is the conjecture
A compact set
Talagrand's Convexity Problem asks: Does there exist an integer
In other words, can one always create a convex set of high Gaussian measure by taking a finite (dimension-independent) number of Minkowski sums of a balanced set with high Gaussian measure?
(This description may contain subtle errors especially on more complex problems; for exact details, refer to the sources.)
A proof is worth 1000$ (I think, see sources for details).
Sources:
- https://michel.talagrand.net/prizes/convexity.tex | Michel Talagrand, "Are all sets of positive measure essentially convex?", Operator Theory: Advances and Applications, Vol. 77, Birkhäuser, 1995, pp. 295–310
Prerequisites needed
Formalizability Rating: 1/5 (0 is best) (as of 2026-01-22)
Building blocks (from Mathlib):
Metric.Compactfor compact sets in ℝ^NMeasureTheory.gaussianMeasurefor the Gaussian measure γ_NConvexfor convexity- Minkowski sum operations (basic algebraic structures)
Missing pieces:
- Formal definition of balanced set (simple:
∀ x ∈ A, ∀ λ ∈ ℝ, |λ| ≤ 1 → λ • x ∈ A) - Wrapper for the universal quantifier over dimensions and q-fold Minkowski sums
Rating justification: All essential building blocks (compact sets, Gaussian measure, convex sets, Minkowski sums) exist in Mathlib. The definition of balanced sets is straightforward. The statement itself is expressible using existing infrastructure with only minor helper definitions needed.
AMS categories
- ams-52
- ams-28
- ams-46
Choose either option
- I plan on adding this conjecture to the repository
- This issue is up for grabs: I would like to see this conjecture added by somebody else
This issue was generated by an AI agent and reviewed by me.
See more information here: link
Feedback on mistakes/hallucinations: link