assum: proper is stronger than those in previous works on SSP [1]}, [2]}, [3]}, [4]}, which only require the existence of a proper policy. We note that the algorithmic trick they developed (adding a small amount of cost to every step) can also help us weaken assum: proper. More details on this are available in app:nonproper.
