= Solution
Write $z(s)=a(-s,0]-Cs$. For each t the minimum in the finite-buffer formula is no greater than $\sup_{0\leq s\leq t}z(s)$. Taking the outer <supremum> gives $\bar q(a)\leq\sup_{s\geq0}z(s)=q(a)$. Also $z(0)=0$ ensures $0\leq\bar q(a)\leq B$: the choice $t=0$ gives zero, and each term is at most $B+\inf_{0\leq s\leq t}z(s)\leq B$.
Every path in the fiber $\bar q(a)=x$ therefore lies in the set $q(a)\geq x$. Infima of its action give
$$
\boxed{\bar J(x)\geq\inf_{a:q(a)\geq x}I(a)=\inf_{y\geq x}J(y).}
$$
The last equality partitions that set by its <queue workload> fibers. It is a variational consequence of the pathwise order, without a questionable inference from probabilities of exact <queue workload> values.
Back to article page