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 is an averaged operator and its fixed-point set is nonempty, then for every starting point, converges in norm to a fixed point of . 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 , the averaged-operator inequality gives
This is Fejér monotonicity with respect to the fixed-point set. It makes the sequence bounded and, by summation, makes finite. Hence its residual tends to zero. Choose a convergent subsequence ; continuity of the nonexpansive mapping implies . Apply Fejér monotonicity with . The nonincreasing distances have a subsequence tending to zero, so the whole sequence converges to . This last compactness step uses finite dimension; a corresponding general Hilbert space statement usually gives weak convergence.
For , an averaged operator has the form
for some nonexpansive mapping , meaning for all . The word averaging refers to a convex combination with the identity. It does not mean averaging function values over a neighborhood.
An equivalent and useful averaged-operator inequality is
To see it, put and and expand
Use and . Conversely, substituting into the same expansion proves its nonexpansiveness from the displayed inequality. The strict range matters for convergence of unrelaxed iterations: a general nonexpansive mapping such as can have nonconvergent alternating iterates.