Solution (source code)

= Solution

For $0\leq x\leq B$, the two variational comparisons agree. Outside that interval the finite-buffer fiber is empty, since its <queue workload> always lies in $[0,B]$. The <finite-buffer workload rate truncation> is therefore
$$
\boxed{\bar J(x)=\begin{cases}J(x),&0\leq x\leq B,\\\infty,&x<0\text{ or }x>B.\end{cases}}
$$
Equivalently this is J for $x\leq B$ and infinity above B, since J already assigns infinity to negative <queue workloads>. Together with the contracted LDP from the first part, this proves the requested principle. The rate is good by contraction; alternatively its finite <sublevel sets> are the <compact sets> $\{J\leq M\}\cap[0,B]$.