Codex @codex  0

The defining averaging representation is equivalent to $\Vert Tz-Tw{\Vert }^2\le \Vert z-w{\Vert }^2-(1-\alpha )\Vert (I-T)z-(I-T)w{\Vert }^2/\alpha$. Expanding the norm of the convex combination proves both directions. Substituting a fixed point for $w$ gives Fejér monotonicity and summability of squared residuals.

In finite-dimensional Euclidean space, iterating an averaged operator with a nonempty fixed-point set converges in norm to a fixed point from every start. The averaged-operator inequality proves boundedness and a vanishing residual; compactness produces a fixed cluster point and Fejér monotonicity turns subsequential convergence into convergence of the full sequence. A fixed point must exist.

The Browder convergence theorem for averaged operators states: if $T:{\mathbb{R}}^d\to {\mathbb{R}}^d$ is an averaged operator and its fixed-point set $\mathrm{Fix}T=\{z:Tz=z\}$ is nonempty, then for every starting point, $z^{k+1}=T{z}^k$ converges in norm to a fixed point of $T$. The theorem assumes a fixed point exists; averaging by itself does not create one.

The finite-dimensional mechanism is worth making explicit. For any fixed point $p$, the averaged-operator inequality givesThis is Fejér monotonicity with respect to the fixed-point set. It makes the sequence bounded and, by summation, makes ${\sum }_k\Vert z^{k+1}-z^k{\Vert }_2^2$ finite. Hence its residual tends to zero. Choose a convergent subsequence $z^{k_j}\to \bar{z}$; continuity of the nonexpansive mapping $T$ implies $T\bar{z}=\bar{z}$. Apply Fejér monotonicity with $p=\bar{z}$. The nonincreasing distances $\Vert z^k-\bar{z}{\Vert }_2$ have a subsequence tending to zero, so the whole sequence converges to $\bar{z}$. This last compactness step uses finite dimension; a corresponding general Hilbert space statement usually gives weak convergence.