Talagrand's Convexity Problem
Talagrand's convexity problem asks whether a universal number of Minkowski sum operations turns any set of large Gaussian measure into one containing a convex body of comparable measure. It is equivalent to a question about subgaussian vectors: is every centered $1$-subgaussian random vector in $\mathbb{R}^n$ the sum of a universal number of standard Gaussian vectors? Both are answered affirmatively, via the sharper statement that any random vector dominated in convex order by a standard Gaussian is the sum of three standard Gaussian vectors.
Exact FrontierDelta
Scope and record
Occurred: May 11, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Talagrand's Convexity Problem · Talagrand convexity problem
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Dongming Merrick Hua
human · human collaborator
Antoine Song
human · human collaborator
Stefan Tudose
human · human collaborator
GPT-5.5 Pro
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Stefan Tudose
This event attributed to Antoine Song
This event attributed to Dongming Merrick Hua
This event attributed to GPT-5.5 Pro