How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Douglas–Rachford shadows converge to a zero of the operator sum
Statement
Let be maximal monotone on , let , and assume there is with , meaning that and can be chosen with . The Douglas–Rachford recurrence of Douglas–Rachford splitting for two maximal-monotone relations has a state sequence converging to a fixed point of its map , and its shadow converges to a zero of .
Facts & Assumptions
Given: as in the Statement.
Both relations are maximal monotone, , and for some .
The Douglas–Rachford fixed-point map is firmly nonexpansive: is firmly nonexpansive.
Picard iterates of a firmly nonexpansive map converge in finite dimensions: if is firmly nonexpansive and has a fixed point, its Picard iterates converge to a fixed point.
A maximal-monotone resolvent is everywhere-defined and firmly nonexpansive: each resolvent is everywhere-defined and 1-Lipschitz.
Proof
Choose and with . The resolvent identities give and . At , the second input is , so the update has and . Thus has a fixed point.
Apply [F3] using firm nonexpansiveness [F2]. It follows that the states converge to some with .
Put and . Fixedness says . The resolvent inclusions yield and ; adding them gives .
The shadow converges to because the resolvent is 1-Lipschitz by [F4] and . Thus the shadow converges to a zero of the sum.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jonathan Eckstein and Dimitri P. Bertsekas, On the Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone operators, §4 (standard reference, not scraped)
- Neal Parikh and Stephen Boyd, Proximal Algorithms, §4.4 (standard reference, not scraped)