# Most Iterations of Projections Converge

Source: [Most Iterations of Projections Converge](<https://www.sota2.com/research/paper/68fa5b141e209131ce9c5414>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T16:51:38.409Z

Authors: Daylen K. Thimm

Published: 2023-11-08T13:10:37.000Z

## Abstract

Consider three closed linear subspaces $C\_1, C\_2,$ and $C\_3$ of a Hilbert space $H$ and the orthogonal projections $P\_1, P\_2$ and $P\_3$ onto them. Halperin showed that a point in $C\_1\\cap C\_2 \\cap C\_3$ can be found by iteratively projecting any point $x\_0 \\in H$ onto all the sets in a periodic fashion. The limit point is then the projection of $x\_0$ onto $C\_1\\cap C\_2 \\cap C\_3$. Nevertheless, a non-periodic projection order may lead to a non-convergent projection series, as shown by Kopeck\\'{a}, M\\"{u}ller, and Paszkiewicz. This raises the question how many projection orders in $\\{1,2,3\\}^\\mathbb{N}$ are "well behaved" in the sense that they lead to a convergent projection series. Melo, da Cruz Neto, and de Brito provided a necessary and sufficient condition under which the projection series converges and showed that the "well behaved" projection orders form a large subset in the sense of having full product measure. We show that also from a topological viewpoint the set of "well behaved" projection orders is a large subset: it contains a dense $G\_\\delta$ subset with respect to the product topology. Furthermore, we analyze why the proof from the measure theoretic case cannot be directly adapted to the topological setting.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2311.04663>)

[PDF](<https://arxiv.org/pdf/2311.04663.pdf>)
