Talagrand's Convexity Problem
Statement
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 -subgaussian random vector in 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.
Record
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
proof attempt · #1
Dongming Merrick Hua, Antoine Song and Stefan Tudose, using GPT-5.5 ProThat credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
The disclosure is unusually precise about which proof the model owns, and the answer is: not the published one. The first two authors, working independently of the third, reached a resolution of the subgaussian formulation on the strength of a proposition whose proof GPT-5.5 Pro generated in a conversation they link a public transcript to. The third author independently arrived at a complete proof in parallel. Comparing the two, the authors judged his route more general and conceptual, so the main body follows it and the model's proposition is preserved as Appendix B. Everything outside that appendix is stated to be human authorship. So the model produced a genuine and sufficient route to the answer, which the paper then chose not to build on.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.