Talagrand's discrete convexity conjecture

Lineage and corrections

VibeMathed record: Talagrand's discrete convexity conjecture evidence for this event

This event attributed to Unreleased internal OpenAI model

Input: Talagrand's discrete-convexity conjecture evidence for this event

Talagrand's discrete convexity conjecture parent of this event

Lean proof (OAI.TalagrandDiscreteConvexity.talagrand_discrete_convexity) evidence for this event

Family: Integral and fractional expectation thresholds are equivalent evidence for this event

Talagrand, Are many small sets explicitly small? (STOC 2010) evidence for this event

Theorem 1.1: with $k=2^{75}$, for every $N\ge1$, $p\in(0,1)$ and $\mathcal D\subseteq2^{[N]}$, $\mu_p(\mathcal D)\ge1-1/k$ implies $E_k(\mathcal D)$ is $p$-small. Consequences: a containment cover for large values of positive selector processes (recovering Park-Pham's theorem), and with Li's fractional result and the companion rounding theorem, $E_2(\mathcal D)$ is $(p/C)$-small when $\mu_p(\mathcal D)>1/2$. Earlier, Hua-Song-Tudose derived a discrete statement with three unions at density $p^C$ and Park one with two unions at a $\log\log(1/p)$ loss. The constant $k$ is far from optimal and the Gaussian convexity question is a different problem. parent of this event

The Ascoli-He-Park-Talagrand graph-decomposition conjecture at the expectation threshold evidence for this event