Proved; the site's label is PROVED (LEAN). Cambie's Theorem 1 (arXiv:2410.09138v1, 11 October 2024, 5 pages): for every constant $C\ge1$ and every sufficiently large $k$ there are integers $0<x<y$ with $y>x+k$ and $\operatorname{lcm}\{x,\ldots,x+k-1\}>C\cdot\operatorname{lcm}\{y,\ldots,y+k\}$. With $n=x-1$ and $m=y-1$ (an authored one-line substitution), this reads $M(n,k)>C\cdot M(m,k+1)$ with $m>n+k$, so for $C=1$ every large $k$ gives a triple and there are infinitely many; the ratio can moreover exceed any constant. The status-defining source is an arXiv preprint with no journal acceptance found on 2026-09-18; the site accepted it (PROVED (LEAN), 11 January 2026), and an external Lean formalization of the theorem, which imports an external project for the prime number theorem, accompanies it. The suffix is a catalog label explained under Formalization and the Lean label, and no local kernel credit is claimed. Claim page: Cambie 2024 (accepted on the site's documented acceptance; not refereed).