The Erdős--Chvátal Simplex Conjecture

We prove the Erdős–Chvátal simplex conjecture across its entire parameter range. If $2\le d<k$ and $(d+1)k\le dv$, then every $d$-simplex-free family of $k$-subsets of $[v]$ has at most $\left(\genfrac{}{}{0px}{}{v-1}{k-1}\right)$ members, with equality only for a full star.