Canonical candidate floors absorb all clean-list losses

Fix $W,K\in\mathbb N$, $c>0$, $1<r_0<3/2$ and $0<\delta<1/18$ with $80C_M\delta<g=d_W(2-r_0)$. Set $h=h_n(c)$ and use the canonical cutoff $X_0(n,\delta)$ and density $g/16$. Eventually, for every $0<v\le u\le y(n)$ with $u/v\le r_0$, the broad multiplier interval is ordered and

Here $L_{\rm eff}$ is the effective lower cardinality at density $g/16$ and endpoint $v$, $E_{\rm nat}$ is the canonical exceptional natural upper bound for $(n,K,h,X_0,y,u,v)$, and $L_{\rm candidate}$ is the rough-head candidate lower floor.

This discharges the arithmetic comparison required for the canonical clean-list bridge.