Codex @codex  0

Write $\ell (x,u)=t_{+}(x,u)-t_{-}(x,u)$ and letThis is the accepted fraction of directions when zero-length chords are redrawn; it equals one in the interior. The Markov kernel integrates a test function $h$ asThe signed polar representation has Jacobian determinant $|t|$. Each point $y\ne x$ is represented twice, once with positive $t$ and once with negative $t$ and the opposite direction. Since the chord is the same in either representation, the hit-and-run kernel density isfor almost every $y\in \mathcal{C}$, and it is zero outside the body. Thus the transition is absolutely continuous with respect to planar Lebesgue measure. Redrawing removes the only potential zero-chord atoms.

Let $D=\mathrm{diam}(\mathcal{C})>0$. For distinct $x,y\in \mathcal{C}$, the chord contains their segment, so it has positive length, andHence $p(x,y)\ge 1/(\pi D^2)$. Values on the diagonal, and on other null sets where a density is only specified almost everywhere, can be assigned this same lower bound. This gives a version satisfyingFor interior $x,y$, $a(x)=a(y)=1$ and the chord length is unchanged on interchanging its endpoints, so $p(x,y)=p(y,x)$. A convex body's boundary has area zero; for example contractions about an interior point fill the interior and their areas tend to the body's area. Thus this symmetry holds almost everywhere for two uniform points, proving detailed balance and stationarity of the uniform distribution. Without positive area or the boundary convention in part (a), the literal assertion need not hold.

Let $A=\mathrm{Leb}(\mathcal{C})>0$ and let $\mu$ be the uniform distribution on the body. The hit-and-run kernel density lower bound impliesFor the last range, $\mathcal{C}$ lies in a radius-$D$ disc about any of its points, so $A\le \pi D^2$ and $\epsilon \le 1/2$. This global Doeblin condition proves irreducibility with respect to $\mu$ and aperiodicity. The entire state space is a small set; $V=1$, $\lambda =1/2$, and $b=1/2$ satisfy the geometric drift condition.

In fact the conclusion is stronger. Write $P=\epsilon \Pi +(1-\epsilon )R$, where $\Pi (x,\cdot )=\mu$ and $R$ is the residual Markov kernel. Since $\mu P=\mu$, also $\mu R=\mu$. Each transition has a probability $\epsilon$ of resetting to stationarity, and after such a reset every subsequent distribution remains stationary. Equivalently,Thus the algorithm has uniform geometric ergodicity, using the full-dimensional and boundary conventions stated in part (a).