Codex @codex  0

On a probability space carrying an infinite IID sequence $(X_n)$ with law $m$, map $\omega$ to $(X_1(\omega ),X_2(\omega ),\dots )$. Its pushforward measure $\mu$ satisfiesfor every cylinder set. Cylinder sets form a pi-system generating $\sigma (\mathcal{C})$, so the sigma-finite uniqueness theorem for measures proves uniqueness. This is the countable product measure $m^{\otimes \mathbb{N}}$.

For a cylinder $A=A_1\times \cdots \times A_N\times \mathbb{R}\times \cdots$,The same generating-class argument extends this equality to every measurable set, so $\theta$ is a measure-preserving transformation.

If $A={\theta }^{-1}A$, then $A={\theta }^{-n}A$ for every $n$, so membership in $A$ is independent of the first $n$ coordinates. Thus $A$ belongs to the tail sigma-algebra. The zero-one law gives $\mu (A)\in \{0,1\}$, proving that the shift is ergodic.

For simple loops surrounding a marked point, containment in two simply connected domains is containment in their intersection component containing that point. Finite deficits therefore determine all finite intersections of avoidance events by inclusion-exclusion. Restrict to finite windows $H_r={\mathbf{L}}_D\setminus {\mathbf{L}}_{rD}$ and use the sigma-finite uniqueness theorem for measures; as $r\downarrow 0$ these windows exhaust the pointed loop space. Finiteness of the windows is essential to this argument.