Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2020/ii/paper-3/28j/i/solution

Let be the Markov kernel of the Metropolis–Hastings algorithm. Away from the possibility of remaining at , its transition density is
Multiplication by the target density gives
This is detailed balance for every pair of distinct states.
Write
for the rejection probability, so
For every measurable , detailed balance and the Tonelli theorem give
Hence is an invariant distribution of the chain.

New to topics? Read the docs here!