Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 A,B be maximal monotone on E=Rn, let ρ>0, and assume there is p∈E with 0∈(A+B)(p), meaning that a∈A(p) and b∈B(p) can be chosen with a+b=0. 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 T, and its shadow JρB(wk) converges to a zero of A+B.

Facts & Assumptions

Given: A,B,ρ,p as in the Statement.

[A1]

Both relations are maximal monotone, ρ>0, and 0∈(A+B)(p) for some p.

[F1]

Douglas–Rachford splitting for two maximal-monotone relations: T(w)=w+q−pB, where pB=JρBw and q=JρA(2pB−w).

[F3]

Picard iterates of a firmly nonexpansive map converge in finite dimensions: if T is firmly nonexpansive and has a fixed point, its Picard iterates converge to a fixed point.

[F4]

A maximal-monotone resolvent is everywhere-defined and firmly nonexpansive: each resolvent is everywhere-defined and 1-Lipschitz.

Proof

1.1A1givenF1F4choose

Choose b∈B(p) and a∈A(p) with a+b=0. The resolvent identities give JρB(p+ρb)=p and JρA(p−ρb)=p. At w∗=p+ρb, the second input is 2p−w∗=p−ρb, so the update has pB=q=p and T(w∗)=w∗. Thus T has a fixed point.

2.1A1F2F3step 1.1

Apply [F3] using firm nonexpansiveness [F2]. It follows that the states wk=Tk(w0) converge to some w∗′ with T(w∗′)=w∗′.

3.1A1F1F4step 2.1algebra

Put p′=JρB(w∗′) and q′=JρA(2p′−w∗′). Fixedness says q′=p′. The resolvent inclusions yield w∗′−p′∈ρB(p′) and p′−w∗′∈ρA(p′); adding them gives 0∈(A+B)(p′).

4.1A1F1F4step 2.1algebra∎

The shadow pk=JρB(wk) converges to p′ because the resolvent is 1-Lipschitz by [F4] and wk→w∗′. 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