Convergence is the agreement between the sampled distribution and the target, and the Kullback-Leibler divergence over a common binning is the sharpest such summary. Bins with no chain mass contribute nothing; a bin with chain mass but no target mass makes the divergence infinite, which is a genuine failure and is reported rather than smoothed away.
References
Brooks and Gelman (1998), General methods for monitoring convergence of iterative simulations, Journal of Computational and Graphical Statistics 7(4):434-455. doi:10.1080/10618600.1998.10474787
