On sums and convex combinations of projectors onto convex sets

Heinz H. Bauschke, Minh N. Bui, Xianfu Wang

Introduction

with inner product ⟨ ⋅ ∣ ⋅ ⟩\langle\,\cdot\,|\,\mathopen{}\cdot\,\rangle and induced norm ∥ ⋅ ∥\lVert\,\cdot\,\rVert. Now assume thatFor basic Convex Analysis, we refer the reader to .

In this paper, we analyze carefully the question: When is ∑i∈IαiPCi\sum_{i\in I}\alpha_{i}P_{C_{i}} a projector? This allows us to provide a complete answer to the question “When is the sum of projectors also a projector?” (In view of Proposition 2.4(iii), an affirmative answer to this question requires the sum ∑i∈ICi\sum_{i\in I}C_{i} to be closed. This happens, for instance, when each set is bounded.) It is known that, in the case of linear subspaces, ∑i∈IPCi\sum_{i\in I}P_{C_{i}} is a projector onto a closed linear subspace if and only if (Ci)(C_{i})_{} is pairwise orthogonal; see [14, Theorem 2, p. 46]. This question is also of interest in Quantum Mechanics [17, p. 50]. In 1971, Zarantonello answered this question in the case of convex cones, i.e., if (Ci)(C_{i})_{} are cones, then ∑i∈IPCi\sum_{i\in I}P_{C_{i}} is a projector if and only if (PCi)(P_{C_{i}})_{} is pairwise orthogonal in the sense that, for every (i,j)∈I×I(i,j)\in I\times I with i≠ji\neq j, we have (∀x∈H) ⟨PCix ∣ PCjx⟩=0.(\forall x\in\mathcal{H})\,\langle{P_{C_{i}}x}\,|\,\mathopen{}{P_{C_{j}}x}\rangle=0. However, the question remains open in the general convex case. Therefore, one goal of this paper is to provide necessary and sufficient conditions for ∑i∈IαiPCi\sum_{i\in I}\alpha_{i}P_{C_{i}} to be a projector without any further assumption on the sets (Ci)(C_{i})_{}. As a consequence, we answer entirely the question “When is the sum of projectors also a projector?” Our results unify the two aforementioned results and make a connection with the recent work where it was proven that, if the sum of a family of proximity operators is a proximity operator, then every partial sum remains a proximity operator. Interestingly, we shall see that this property is still valid in the class of projectors onto convex cones; in other words, if a finite sum of projectors onto convex cones is a projector, then so are its partial sums. Nevertheless, this result fails outside the world of convex cones. Another goal is to characterize the instances where a convex average of (PCi)(P_{C_{i}})_{} is again a projector. In striking contrast to a result in 1963 by Moreau , which states that a convex average of proximity operators is always a proximity operator, we shall see in Theorem 4.3 that taking convex combinations does not preserve the class of projectors onto convex sets (see Theorem 4.3 for the rigorous statement). Our main results are summarized as follows:

We provide a new characterization of proximity operators in Theorem 3.1 (for a list of other characterizations, see ). In turn, we derive a new characterization of projectors (Theorem 3.2), which is a pillar of this paper and a variant of [26, Theorem 4.1]. Furthermore, we also partially answer an open question by Zarantonello regarding [26, Theorem 4.1].

Theorem 3.10 characterizes (without any additional assumptions on the underlying sets) when ∑i∈IαiPCi\sum_{i\in I}\alpha_{i}P_{C_{i}} is a projector; Theorem 3.12 concerns the sum ∑i∈IPCi\sum_{i\in I}P_{C_{i}}.

By specifying our analysis to the case of convex average in Theorem 4.3, we explicitly determine families of closed convex sets that are preserved under taking convex combinations.

We present the partial sum property (see [2, Theorem 4.2]) for projectors onto convex cones in Theorem 5.7, whose proof is based on Theorem 5.3 and [2, Theorem 4.2]. We also recover [26, Theorems 5.3 and 5.5].

where ∇q⁡=Id⁡\nabla{\operatorname{q}}={\operatorname{Id}} is the identity operator on H\mathcal{H}. Let CC be a subset of H\mathcal{H}. Then we denote by C‾\overline{C} the closure of CC (with respect to the norm topology on H\mathcal{H}), by dCd_{C} its distance function, by C⊖{C}^{\ominus} its polar cone, i.e., C⊖≔{u∈H ∣ sup⁡⟨C ∣ u⟩⩽0},{C}^{\ominus}\coloneqq\{{u\in\mathcal{H}}~{}|~{}\mathopen{}{\sup\langle{C}\,|\,\mathopen{}{u}\rangle\leqslant 0}\}, and by C⊥C^{\perp} its orthogonal complement. Next, the indicator and support functions of CC are

respectively. Moreover, if CC is convex, closed, and nonempty, then the projector associated with CC is denoted by PCP_{C}. In turn, we set

Next, the set of convex, lower semicontinuous, and proper functions from H\mathcal{H} to ]−∞,+∞]\mathopen{}\left]{-}\infty,{+}\infty\right] is Γ0(H)\varGamma_{0}(\mathcal{H}). The domain of of a function f ⁣:H→[−∞,+∞]f\colon\mathcal{H}\to\mathopen{}\left[{-}\infty,{+}\infty\right] is dom⁡f≔{x∈H ∣ f(x)<+∞}\operatorname{dom}{f}\coloneqq\{{x\in\mathcal{H}}~{}|~{}\mathopen{}{f(x)<+\infty}\} with closure dom‾⁡f\operatorname{\overline{dom}}f, its graph is denoted by gra⁡f\operatorname{gra}f, its conjugate is denoted by f∗f^{\ast}, and its subdifferential is denoted by ∂f\partial f; furthermore, if f∈Γ0(H),f\in\varGamma_{0}(\mathcal{H}), then we denote its proximity operator by Prox⁡f\operatorname{Prox}_{f} and its Moreau envelope by env⁡f\operatorname{env}f, i.e., \operatorname{env}f\coloneqq f\mbox{\footnotesize\,\square\,}{\operatorname{q}}=f\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}}, where  □ \,\square\, and  ⊡ \,\boxdot\, denote the infimal convolution and the exact infimal convolution, respectively. Next, let T ⁣:H→HT\colon\mathcal{H}\to\mathcal{H}. The range of TT is ran⁡T\operatorname{ran}T with closure ran‾⁡T\operatorname{\overline{ran}}T. If T∈B(H)T\in\mathscr{B}(\mathcal{H}), the space of bounded linear operators on H\mathcal{H}, then its adjoint is denoted by T∗T^{\ast}. Finally, we adopt the convention that empty sums are zero.

Auxiliary results

In this section, we provide various results that will be useful in the sequel. Let us start with a simple identity in H\mathcal{H}.

∥x−∑i∈Iαixi∥2=(1−α)∥x∥2+∑i∈Iαi∥x−xi∥2+(α−1)∑i∈Iαi∥xi∥2−12∑i∈I∑j∈Iαiαj∥xi−xj∥2.\mathopen{}\left\lVert x-\sum_{i\in I}\alpha_{i}x_{i}\right\rVert^{2}=(1-\alpha)\lVert x\rVert^{2}+\sum_{i\in I}\alpha_{i}\lVert x-x_{i}\rVert^{2}+(\alpha-1)\sum_{i\in I}\alpha_{i}\lVert x_{i}\rVert^{2}-\tfrac{1}{2}\sum_{i\in I}\sum_{j\in I}\alpha_{i}\alpha_{j}\lVert x_{i}-x_{j}\rVert^{2}.

Suppose that (∀i∈I) αi=1(\forall i\in I)\,\alpha_{i}=1. Then α=card⁡I\alpha=\operatorname{card}I and

Base case: When m=1m=1, by applying [4, Corollary 2.15] to (x−x1,x1)(x-x_{1},x_{1}) and noticing that α=α1\alpha=\alpha_{1}, we obtain

Inductive step: Assume that m⩾2m\geqslant 2 and that the result holds for families containing m−1m-1 or fewer elements. Moreover, set J≔{1,…,m−1}J\coloneqq\{1,\ldots,m-1\} and β≔∑j∈Jαj\beta\coloneqq\sum_{j\in J}\alpha_{j}. Then, by the base case, we have

Hence, since β+αm=α\beta+\alpha_{m}=\alpha, we infer from the induction hypothesis that

(ii): Since (∀i∈I) αi=1(\forall i\in I)\,\alpha_{i}=1, we have α=card⁡I\alpha=\operatorname{card}I, and thus

and hence 9 holds. Consequently, 10 follows from (i) and 9. ∎

We shall need the following identities involving convex cones.

Let KK and SS be nonempty closed convex cones in H\mathcal{H}. Then the following hold:

(∀x∈H) ∥PKx∥2=⟨x ∣ PKx⟩(\forall x\in\mathcal{H})\,\lVert P_{K}x\rVert^{2}=\langle{x}\,|\,\mathopen{}{P_{K}x}\rangle.

(∀x∈H) ⟨PK⊖x ∣ PS⊖x⟩+∥PKx∥2+∥PSx∥2=∥x∥2+⟨PKx ∣ PSx⟩.(\forall x\in\mathcal{H})\,\langle{P_{{K}^{\ominus}}x}\,|\,\mathopen{}{P_{{S}^{\ominus}}x}\rangle+\lVert P_{K}x\rVert^{2}+\lVert P_{S}x\rVert^{2}=\lVert x\rVert^{2}+\langle{P_{K}x}\,|\,\mathopen{}{P_{S}x}\rangle.

Take x∈Hx\in\mathcal{H}. (i): We derive from [4, Theorem 6.30(i)&(ii)] that ∥PKx∥2=⟨PKx ∣ PKx⟩=⟨x−PK⊖x ∣ PKx⟩=⟨x ∣ PKx⟩,\lVert P_{K}x\rVert^{2}=\langle{P_{K}x}\,|\,\mathopen{}{P_{K}x}\rangle=\langle{x-P_{{K}^{\ominus}}x}\,|\,\mathopen{}{P_{K}x}\rangle=\langle{x}\,|\,\mathopen{}{P_{K}x}\rangle, as claimed. (ii): The Moreau conical decomposition () and (i) give

Let CC be a nonempty closed convex subset of H\mathcal{H}. Then the following hold:

PCP_{C} is 3∗3^{\ast} monotoneA monotone operator A ⁣:H→2HA\colon\mathcal{H}\to 2^{\mathcal{H}} is 3∗3^{\ast} monotone if (∀(x,u)∈dom⁡A×ran⁡A) inf⁡(y,v)∈gra⁡A⟨x−y ∣ u−v⟩>−∞.(\forall(x,u)\in\operatorname{dom}{A}\times\operatorname{ran}{A})\,\inf_{(y,v)\in\operatorname{gra}{A}}\langle{x-y}\,|\,\mathopen{}{u-v}\rangle>-\infty..

(i): See [4, Example 20.32]. (ii): Because PCP_{C} is firmly nonexpansive by [4, Proposition 4.16], the conclusion follows from [4, Example 25.20(ii)]. ∎

In the finite-dimensional case, Proposition 2.4(ii) can also be deduced from [7, Theorem 3.15]. Furthermore, let us point out that Proposition 2.4(iii) generalizes Zarantonello’s [26, Theorem 5.4].

Suppose that (∀i∈I) αi⩾0(\forall i\in I)\,\alpha_{i}\geqslant 0. Then ran‾⁡∑i∈IαiPCi=∑i∈IαiCi‾.\operatorname{\overline{ran}}{\sum_{i\in I}\alpha_{i}P_{C_{i}}}=\overline{\sum_{i\in I}\alpha_{i}C_{i}}.

Suppose that (∀i∈I) αi⩾0(\forall i\in I)\,\alpha_{i}\geqslant 0 and that there exists a closed convex set CC such that ∑i∈IαiPCi=PC\sum_{i\in I}\alpha_{i}P_{C_{i}}=P_{C}. Then ∑i∈IαiCi\sum_{i\in I}\alpha_{i}C_{i} is closed and C=∑i∈IαiCiC=\sum_{i\in I}\alpha_{i}C_{i}.

(i): Let xx be in H\mathcal{H}. Apply Lemma 2.1(i) to (x,(PCix),(αi))(x,(P_{C_{i}}x)_{},(\alpha_{i})_{}) and notice that (∀i∈I) ∥x−PCix∥=dCi(x)(\forall i\in I)\,\lVert x-P_{C_{i}}x\rVert=d_{C_{i}}(x).

(ii): Because the operators (PCi)(P_{C_{i}})_{} are 3∗3^{\ast} monotone by Fact 2.3(ii) and because (∀i∈I) dom⁡PCi=H(\forall i\in I)\,\operatorname{dom}P_{C_{i}}=\mathcal{H}, we derive from [9, Lemma 3.1(ii)] that ran‾⁡∑i∈IαiPCi=∑i∈Iαiran⁡PCi‾=∑i∈IαiCi‾,\operatorname{\overline{ran}}\sum_{i\in I}\alpha_{i}P_{C_{i}}=\overline{\sum_{i\in I}\alpha_{i}\operatorname{ran}P_{C_{i}}}=\overline{\sum_{i\in I}\alpha_{i}C_{i}}, as desired.

(iii): It follows from (ii) and our assumption that

Thus, we conclude that ∑i∈IαiCi=C\sum_{i\in I}\alpha_{i}C_{i}=C and that ∑i∈IαiCi\sum_{i\in I}\alpha_{i}C_{i} is closed. ∎

Proposition 2.4(ii)&(iii) may fail if (∃i∈I) αi<0(\exists i\in I)~{}\alpha_{i}<0. Indeed, in the setting of Proposition 2.4, suppose that I={1,2}I=\mathopen{}\left\{1,2\right\}, that C1=C2C_{1}=C_{2}, and that α1=−α2=1\alpha_{1}=-\alpha_{2}=1. Then α1PC1+α2PC2=0=P{0}\alpha_{1}P_{C_{1}}+\alpha_{2}P_{C_{2}}=0=P_{\mathopen{}\left\{0\right\}}, but α1C1+α2C2=C1−C1≠{0}\alpha_{1}C_{1}+\alpha_{2}C_{2}=C_{1}-C_{1}\neq\mathopen{}\left\{0\right\} if C1C_{1} is not a singleton.

The following is a variant of [27, Lemma 6.1]. We provide a proof for completeness.

By Lemma 2.6 and our assumption, ∇f(0)=0\nabla f(0)=0, which implies that

Recall from [18, pp. 89–90] that, if f ⁣:H→]−∞,+∞]f\colon\mathcal{H}\to\mathopen{}\left]-\infty,+\infty\right], then the Fréchet subdifferential of ff is

Main results

Let φ∈Γ0(H)\varphi\in\varGamma_{0}(\mathcal{H}), let T ⁣:H→HT\colon\mathcal{H}\to\mathcal{H}, and set f≔φ∘T+q⁡∘(Id⁡−T)f\coloneqq\varphi\circ T+{\operatorname{q}}\circ({{\operatorname{Id}}}-T). Then the following are equivalent:

TT is monotone, gra⁡(φ+ιran⁡T)\operatorname{gra}(\varphi+\iota_{\operatorname{ran}T}) is a dense subset of gra⁡φ\operatorname{gra}\varphi, and ff is Gâteaux differentiable on H\mathcal{H} with ∇f=Id⁡−T\nabla f={\operatorname{Id}}-T.

Furthermore, if (i) or (ii) holds, then f=env⁡φf=\operatorname{env}\varphi and ff is Fréchet differentiable on H\mathcal{H}.

“(i)⇒\Rightarrow(ii)”: First, by [4, Example 20.30], T=Prox⁡φT=\operatorname{Prox}_{\varphi} is monotone. Next, since φ∈Γ0(H)\varphi\in\varGamma_{0}(\mathcal{H}) and T=Prox⁡φT=\operatorname{Prox}_{\varphi}, [4, Eq. (24.3)] gives ran⁡T=dom⁡∂φ\operatorname{ran}T=\operatorname{dom}\partial\varphi, and hence, according to [4, Proposition 16.38], it follows that gra⁡(φ+ιran⁡T)\operatorname{gra}(\varphi+\iota_{\operatorname{ran}T}) is a dense subset of gra⁡φ\operatorname{gra}\varphi. Finally, in view of [4, Remark 12.24], we see that f=φ∘T+q⁡∘(Id⁡−T)=φ∘Prox⁡φ+q⁡∘(Id⁡−Prox⁡φ)=env⁡φf=\varphi\circ T+{\operatorname{q}}\circ({\operatorname{Id}}-T)=\varphi\circ{\operatorname{Prox}_{\varphi}}+{\operatorname{q}}\circ({\operatorname{Id}}-{\operatorname{Prox}_{\varphi}})=\operatorname{env}\varphi, and [4, Proposition 12.30] thus entails that ff is Fréchet (thus Gâteaux) differentiable on H\mathcal{H} with ∇f=Id⁡−Prox⁡φ=Id⁡−T\nabla f={\operatorname{Id}}-{\operatorname{Prox}_{\varphi}}={\operatorname{Id}}-T.

“(i)⇐\Leftarrow(ii)”: Set g≔q⁡−fg\coloneqq{\operatorname{q}}-f. Then, on the one hand, because q⁡{\operatorname{q}} and ff are Gâteaux differentiable, so is gg. On the other hand, since ∇q⁡=Id⁡\nabla{\operatorname{q}}={\operatorname{Id}} and ∇f=Id⁡−T\nabla f={\operatorname{Id}}-T, we infer that ∇g=∇(q⁡−f)=∇q⁡−∇f=T,\nabla g=\nabla({\operatorname{q}}-f)=\nabla{\operatorname{q}}-\nabla f=T, which is monotone by assumption. Altogether, [4, Proposition 17.7] yields the convexity of gg. Therefore, since gg is Gâteaux differentiable on H\mathcal{H}, it follows from [4, Proposition 17.48(i)] that gg is lower semicontinuous on H\mathcal{H}. To sum up, we have shown that

Moreover, 24 and [4, Corollary 13.38] yield

In turn, set h≔g∗−q⁡.h\coloneqq g^{\ast}-{\operatorname{q}}. Let us now establish that

Towards this goal, fix u∈ran⁡Tu\in\operatorname{ran}{T}, say u=Tx=\lx@crefcreftype refnume:info−g∇g(x)u=Tx\overset{\lx@cref{creftype~refnum}{e:info-g}}{=}\nabla g(x), where x∈Hx\in\mathcal{H}. Then 24, [4, Proposition 17.35], and the very definitions of gg and ff assert that

Hence, 26 holds. Next, fix v∈dom⁡hv\in\operatorname{dom}h, and we shall prove that φ(v)⩽h(v)\varphi(v)\leqslant h(v). Indeed, on the one hand, because h=g∗−q⁡h=g^{\ast}-{\operatorname{q}} and dom⁡q⁡=H\operatorname{dom}{\operatorname{q}}=\mathcal{H}, we have dom⁡h=dom⁡g∗\operatorname{dom}h=\operatorname{dom}g^{\ast}. On the other hand, due to 24 and [4, Corollary 16.30], dom⁡∂g∗=dom⁡(∂g)−1=ran⁡∂g,\operatorname{dom}\partial g^{\ast}=\operatorname{dom}(\partial g)^{-1}=\operatorname{ran}\partial g, and since ran⁡∂g=ran⁡∇g=ran⁡T\operatorname{ran}\partial g=\operatorname{ran}\nabla g=\operatorname{ran}T thanks to 24 and [4, Proposition 17.31(i)], we deduce that dom⁡∂g∗=ran⁡T\operatorname{dom}\partial g^{\ast}=\operatorname{ran}T. Altogether, because v∈dom⁡h=dom⁡g∗v\in\operatorname{dom}h=\operatorname{dom}g^{\ast}, 25 and [4, Proposition 16.38] ensures the existence of a sequence (vn)(v_{n})_{} in dom⁡∂g∗=ran⁡T\operatorname{dom}\partial g^{\ast}=\operatorname{ran}T such that vn→vv_{n}\to v and g∗(vn)→g∗(v)g^{\ast}(v_{n})\to g^{\ast}(v). Therefore, by the definition of hh, we get h(vn)=g∗(vn)−q⁡(vn)→g∗(v)−q⁡(v)=h(v)h(v_{n})=g^{\ast}(v_{n})-{\operatorname{q}}(v_{n})\to g^{\ast}(v)-{\operatorname{q}}(v)=h(v). However, because {vn}⊆ran⁡T\{v_{n}\}_{}\subseteq\operatorname{ran}T and vn→vv_{n}\to v, the lower semicontinuity of φ\varphi and 26 imply that h(v)=lim⁡h(vn)=lim⁡φ(vn)⩾φ(v).h(v)=\lim h(v_{n})=\lim\varphi(v_{n})\geqslant\varphi(v). Hence, we have established that

To this end, let w∈dom⁡φw\in\operatorname{dom}\varphi. Then, since gra⁡(φ+ιran⁡T)\operatorname{gra}(\varphi+\iota_{\operatorname{ran}T}) is a dense subset of gra⁡φ\operatorname{gra}\varphi by assumption, there exists a sequence (wn)(w_{n})_{} in ran⁡T\operatorname{ran}T such that wn→ww_{n}\to w and φ(wn)→φ(w)\varphi(w_{n})\to\varphi(w). In turn, since hh is lower semicontinuous by 25, we infer from 26 that φ(w)=lim⁡φ(wn)=lim⁡h(wn)⩾h(w),\varphi(w)=\lim\varphi(w_{n})=\lim h(w_{n})\geqslant h(w), from which 29 follows. Consequently, combining 28 and 29 yields h=φh=\varphi. Finally, since φ∈Γ0(H)\varphi\in\varGamma_{0}(\mathcal{H}), it follows from 24, the definition of hh, the Fenchel–Moreau theorem, and [4, Proposition 24.4] that Prox⁡φ=∇(φ+q⁡)∗=∇(h+q⁡)∗=∇g∗∗=∇g=T,\operatorname{Prox}_{\varphi}=\nabla(\varphi+{\operatorname{q}})^{\ast}=\nabla(h+{\operatorname{q}})^{\ast}=\nabla g^{\ast\ast}=\nabla g=T, as desired. ∎

In , Zarantonello provided a necessary and sufficient condition in terms of a differential equation for an operator on H\mathcal{H} to be a projector. The proof there, however, is not within the scope of Convex Analysis. He also conjectured (see the paragraph after [26, Corollary 2, p. 306]) that the Fréchet differentiability of the operator PP in [26, Theorem 4.1] can be replaced by the Gâteaux one. By assuming the monotonicity of PP instead of the Lipschitz continuity, we provide below an affirmative answer. The next result, which plays a crucial role in determining whether a sum of projectors is a projector (see Theorem 3.12 below), is a variant of [26, Theorem 4.1] with a proof rooted in Convex Analysis.

Let T ⁣:H→H,T\colon\mathcal{H}\to\mathcal{H}, and set f≔q⁡∘(Id⁡−T)f\coloneqq{\operatorname{q}}\circ({\operatorname{Id}}-T). Then the following are equivalent:

TT is monotone, ff is Gâteaux differentiable on H\mathcal{H}, and ∇f=Id⁡−T\nabla f={\operatorname{Id}}-T.

If (i) or (ii) holds, then ran⁡T\operatorname{ran}{T} is closed and convex, T=Pran⁡TT=P_{\operatorname{ran}{T}}, and f=(1/2)dran⁡T2f=(1/2)d_{\operatorname{ran}{T}}^{2} is Fréchet differentiable on H\mathcal{H}.

Set φ≔ιran‾⁡T\varphi\coloneqq\iota_{\operatorname{\overline{ran}}T}.

“(i)⇒\Rightarrow(ii)”: Suppose that T=PCT=P_{C}, where CC is convex, closed, and nonempty. Then clearly ran⁡T=ran⁡PC=C\operatorname{ran}{T}=\operatorname{ran}{P_{C}}=C is closed and convex. This implies that φ=ιran⁡T∈Γ0(H)\varphi=\iota_{\operatorname{ran}T}\in\varGamma_{0}(\mathcal{H}) and that T=Pran⁡T=Prox⁡ιran⁡T=Prox⁡φT=P_{\operatorname{ran}T}=\operatorname{Prox}_{\iota_{\operatorname{ran}T}}=\operatorname{Prox}_{\varphi}. In turn, because f=φ∘T+q⁡∘(Id⁡−T)f=\varphi\circ T+{\operatorname{q}}\circ({\operatorname{Id}}-T) by the definition of φ\varphi, we infer from Theorem 3.1 that (ii) holds and, moreover, f=env⁡φ=env⁡ιran⁡T=(1/2)dran⁡T2f=\operatorname{env}\varphi=\operatorname{env}\iota_{\operatorname{ran}T}=(1/2)d_{\operatorname{ran}T}^{2} is Fréchet differentiable on H\mathcal{H}.

“(i)⇐\Leftarrow(ii)”: We first show that ran‾⁡T\operatorname{\overline{ran}}T is convex. Indeed, by our assumption, q⁡−f{\operatorname{q}}-f is Gâteaux differentiable on H\mathcal{H} with

Thus, since TT is monotone, [4, Proposition 17.7] ensures that q⁡−f{\operatorname{q}}-f is convex, and thus, the Gâteaux differentiability of q⁡−f{\operatorname{q}}-f and [4, Proposition 17.48(i)] imply that q⁡−f∈Γ0(H){\operatorname{q}}-f\in\varGamma_{0}(\mathcal{H}). Hence, due to 30 and [4, Proposition 17.31(i)], Moreau’s theorem asserts that T=∇(q⁡−f)T=\nabla({\operatorname{q}}-f) is maximally monotone. Consequently, [4, Corollary 21.14] yields the convexity of ran‾⁡T\operatorname{\overline{ran}}T, as claimed. In turn, on the one hand, this implies that φ=ιran‾⁡T∈Γ0(H)\varphi=\iota_{\operatorname{\overline{ran}}T}\in\varGamma_{0}(\mathcal{H}). On the other hand, we deduce from the definition of φ\varphi that f=φ∘T+q⁡∘(Id⁡−T)f=\varphi\circ T+{\operatorname{q}}\circ({\operatorname{Id}}-T) and gra⁡(φ+ιran⁡T)=gra⁡(ιran‾⁡T∩ran⁡T)=gra⁡ιran⁡T=ran⁡T×{0}\operatorname{gra}(\varphi+\iota_{\operatorname{ran}T})=\operatorname{gra}(\iota_{\operatorname{\overline{ran}}T\cap\operatorname{ran}T})=\operatorname{gra}\iota_{\operatorname{ran}T}=\operatorname{ran}T\times\mathopen{}\left\{0\right\} is a dense subset of ran‾⁡T×{0}=gra⁡ιran‾⁡T=gra⁡φ\operatorname{\overline{ran}}T\times\mathopen{}\left\{0\right\}=\operatorname{gra}\iota_{\operatorname{\overline{ran}}T}=\operatorname{gra}\varphi. Thus, the implication “(ii)⇒\Rightarrow(i)” of Theorem 3.1 and our assumption guarantee that T=Prox⁡φ=Prox⁡ιran‾⁡T=Pran‾⁡TT=\operatorname{Prox}_{\varphi}=\operatorname{Prox}_{\iota_{\operatorname{\overline{ran}}T}}=P_{\operatorname{\overline{ran}}T}, which completes the proof. ∎

Consider the implication “(ii)⇒\Rightarrow(i)” of Theorem 3.2. If we merely assume that TT is defined on a proper open subset DD of H\mathcal{H}, then, although there may exist a closed set CC such that TT is the restriction to DD of the projector onto CC, the set CC may fail to be convex. An example can be constructed as follows. Suppose that H≠{0}\mathcal{H}\neq\mathopen{}\left\{0\right\}, and set

i.e., CC is the unit sphere of H\mathcal{H}. Then clearly CC is a closed nonconvex set and TT is the restriction to H∖{0}\mathcal{H}\smallsetminus\mathopen{}\left\{0\right\} of the set-valued projector PCP_{C}. Thus, in the light of [4, Example 20.12], TT is monotone. Next, since (∀x∈H∖{0}) f(x)=(1/2)∥(1−1/∥x∥)x∥2=(1/2)(∥x∥−1)2=q⁡(x)−∥x∥+1/2,(\forall x\in\mathcal{H}\smallsetminus\mathopen{}\left\{0\right\})\,f(x)=(1/2)\lVert(1-1/\lVert x\rVert)x\rVert^{2}=(1/2)(\lVert x\rVert-1)^{2}={\operatorname{q}}(x)-\lVert x\rVert+1/2, we infer that ff is Fréchet differentiable on H∖{0}\mathcal{H}\smallsetminus\mathopen{}\left\{0\right\} and

We do not know whether the monotonicity of TT can be omitted in Theorem 3.2. Nevertheless, on the one hand, the following remark might be useful in finding counterexamples if one thinks the answer is negative; on the other hand, Proposition 3.6 provides information on the set Fix⁡T\operatorname{Fix}T in the absence of monotonicity.

However, because ∇f=F\nabla f=F, a direct computation gives

Let T ⁣:H→HT\colon\mathcal{H}\to\mathcal{H}, and set f≔q⁡∘(Id⁡−T)f\coloneqq{\operatorname{q}}\circ({\operatorname{Id}}-T). Suppose that ff is Fréchet differentiable on H\mathcal{H} with ∇f=Id⁡−T\nabla f={\operatorname{Id}}-T. Then Fix⁡T≠∅.\operatorname{Fix}T\neq\varnothing.

Now let ε∈]0,1[\varepsilon\in]0,1[. Since gg is bounded below and continuous, Ekeland’s variational principle (see, e.g., [4, Theorem 1.46(iii)]) applied to gg and (α,β)=(ε2,ε)(\alpha,\beta)=(\varepsilon^{2},\varepsilon) yields the existence of z∈Hz\in\mathcal{H} such that (∀x∈H∖{z}) g(z)+εd{z}(z)=g(z)<g(x)+εd{z}(x)(\forall x\in\mathcal{H}\smallsetminus\{z\})\,g(z)+\varepsilon d_{\mathopen{}\left\{z\right\}}(z)=g(z)<g(x)+\varepsilon d_{\mathopen{}\left\{z\right\}}(x). This guarantees that zz is the unique minimizer of g+εd{z}g+\varepsilon d_{\mathopen{}\left\{z\right\}}. Thus, [18, Proposition 1.114], Lemma 2.8, and 35 imply that

which is absurd since ε∈]0,1[\varepsilon\in]0,1[ and ∥(z−Tz)/(∥z−Tz∥)∥=1\lVert(z-Tz)/(\lVert z-Tz\rVert)\rVert=1. ∎

Consider the setting and the assumption of Proposition 3.6.

Zarantonello established in the proof of [26, Theorem 4.1] that, if (in addition to our assumption) TT is Lipschitz continuous, then Fix⁡T≠∅\operatorname{Fix}{T}\neq\varnothing. However, we do not need the Lipschitz continuity of TT in our proof.

Suppose, in addition, that ∇f\nabla f is continuous. Then we obtain an alternative proof as follows. Assume to the contrary that Fix⁡T=∅.\operatorname{Fix}T=\varnothing. Then g≔ ⋅ ∘(2f)g\coloneqq\sqrt{\,\cdot\,}\circ(2f) is continuously Fréchet differentiable on H\mathcal{H} (hence continuous) with

Fix ε∈]0,1[\varepsilon\in]0,1[. Since gg is bounded below and continuous, Ekeland’s variational principle implies that there exists z∈Hz\in\mathcal{H} such that (∀x∈H∖{z}) g(z)+εd{z}(z)=g(z)<g(x)+εd{z}(x)(\forall x\in\mathcal{H}\smallsetminus\{z\})\,g(z)+\varepsilon d_{\mathopen{}\left\{z\right\}}(z)=g(z)<g(x)+\varepsilon d_{\mathopen{}\left\{z\right\}}(x). Thus, zz is a minimizer of g+εd{z}(z)g+\varepsilon d_{\mathopen{}\left\{z\right\}}(z). Therefore, because d{z}d_{\mathopen{}\left\{z\right\}} is convex, in view of [25, Theorem 3.2.4(iii)&(vi)&(ii)] and [4, Example 16.62], we see that

which contradicts the fact that ε∈]0,1[.\varepsilon\in]0,1[.

By specializing Theorem 3.2 to positively homogeneous operators on H\mathcal{H}, we obtain a characterization for projectors onto closed convex cones.

Let T ⁣:H→HT\colon\mathcal{H}\to\mathcal{H} and set f≔q⁡∘Tf\coloneqq{\operatorname{q}}\circ T. Then the following are equivalent:

There exists a nonempty closed convex cone KK such that T=PKT=P_{K}.

TT is monotone and positively homogeneous, ff is Gâteaux differentiable on H\mathcal{H}, and ∇f=T\nabla f=T.

If (i) or (ii) holds, then K=ran⁡TK=\operatorname{ran}{T}.

“(i)⇒\Rightarrow(ii)”: Clearly ran⁡T=ran⁡PK=K\operatorname{ran}{T}=\operatorname{ran}P_{K}=K. Now, it follows from [4, Example 20.32] that T=PKT=P_{K} is monotone. Next, because KK is a nonempty closed convex cone, [4, Proposition 29.29] guarantees that TT is positively homogeneous. In turn, since f=q⁡∘T=q⁡∘PKf={\operatorname{q}}\circ T={\operatorname{q}}\circ P_{K}, [4, Proposition 12.32 and Lemma 2.61(i)] yield the Gâteaux differentiability of ff and, moreover, ∇f=∇(q⁡∘PK)=PK=T\nabla f=\nabla({\operatorname{q}}\circ P_{K})=P_{K}=T, as desired.

“(i)⇐\Leftarrow(ii)”: First, since TT is positively homogeneous,

In Corollary 3.8, if TT is a bounded linear operator, then we recover the following characterization of orthogonal projectors. For an alternative proof, which is based on the orthogonal decomposition H=V⊕V⊥\mathcal{H}=V\oplus V^{\perp}, where VV is a closed linear subspace of H\mathcal{H}, see, e.g., [24, Theorem 4.29].

Let L ⁣:H→HL\colon\mathcal{H}\to\mathcal{H}. Then the following are equivalent:

There exists a closed linear subspace VV of H\mathcal{H} such that L=PVL=P_{V}.

L∈B(H)L\in\mathscr{B}(\mathcal{H}) and L=L∗=L2L=L^{\ast}=L^{2}.

L∈B(H)L\in\mathscr{B}(\mathcal{H}) and L=L∗LL=L^{\ast}L.

If one of (i), (ii) and (iii) holds, then V=ran⁡LV=\operatorname{ran}{L}.

“(i)⇒\Rightarrow(ii)”: See, e.g., [4, Corollary 3.24(iii)&(vi)]. Moreover, it is clear that ran⁡L=ran⁡PV=V\operatorname{ran}L=\operatorname{ran}P_{V}=V.

“(iii)⇒\Rightarrow(i)”: On the one hand, because L∈B(H)L\in\mathscr{B}(\mathcal{H}), we deduce from [4, Example 20.16(ii)] that L=L∗LL=L^{\ast}L is monotone. On the other hand, since L∈B(H)L\in\mathscr{B}(\mathcal{H}), [4, Example 2.60] and our assumption imply that q⁡∘L{\operatorname{q}}\circ L is Fréchet differentiable on H\mathcal{H} and ∇(q⁡∘L)=L∗L=L\nabla({\operatorname{q}}\circ L)=L^{\ast}L=L. Altogether, because LL is clearly positively homogeneous, we obtain the conclusion via Corollary 3.8. ∎

Set T≔∑i∈IαiPCiT\coloneqq\sum_{i\in I}\alpha_{i}P_{C_{i}}, set f≔q⁡∘(Id⁡−T)f\coloneqq{\operatorname{q}}\circ({\operatorname{Id}}-T), and define

Now assume that there exists a nonempty closed convex subset CC of H\mathcal{H} such that T=PCT=P_{C}. Then, due to Fact 2.3(i), we see that TT is monotone. Next, on the one hand, since T=PCT=P_{C}, it follows from Theorem 3.2 that ff is Fréchet differentiable on H\mathcal{H} and ∇f=Id⁡−T=Id⁡−∑i∈IαiPCi\nabla f={\operatorname{Id}}-T={\operatorname{Id}}-\sum_{i\in I}\alpha_{i}P_{C_{i}}. On the other hand, for every i∈Ii\in I, since CiC_{i} is convex, closed, and nonempty, we infer from Theorem 3.2 (applied to PCiP_{C_{i}}) that dCi2=2q⁡∘(Id⁡−PCi)d_{C_{i}}^{2}=2{\operatorname{q}}\circ({\operatorname{Id}}-P_{C_{i}}) is Fréchet differentiable on H\mathcal{H} with ∇dCi2=2(Id⁡−PCi)\nabla d_{C_{i}}^{2}=2({\operatorname{Id}}-P_{C_{i}}). Altogether, since α=∑i∈Iαi\alpha=\sum_{i\in I}\alpha_{i} by definition, it follows from 43 that gg is Fréchet differentiable on H\mathcal{H} and that

and it thus follows that ff is Fréchet differentiable on H\mathcal{H} and, since α=∑i∈Iαi\alpha=\sum_{i\in I}\alpha_{i}, ∇f=∑i∈Iαi(Id⁡−PCi)−(α−1)Id⁡=Id⁡−∑i∈IαiPCi=Id⁡−T\nabla f=\sum_{i\in I}\alpha_{i}({\operatorname{Id}}-P_{C_{i}})-(\alpha-1){\operatorname{Id}}={\operatorname{Id}}-\sum_{i\in I}\alpha_{i}P_{C_{i}}={\operatorname{Id}}-T. Hence, since TT is monotone by our assumption, Theorem 3.2 ensures the existence of a nonempty closed convex set CC such that T=PCT=P_{C}. Therefore, f=q⁡∘(Id⁡−PC)=(1/2)dC2f={\operatorname{q}}\circ({\operatorname{Id}}-P_{C})=(1/2)d_{C}^{2} and 41 follows from 45. ∎

As we have seen in Remark 2.5, the set CC in Theorem 3.10 need not be ∑i∈IαiCi\sum_{i\in I}\alpha_{i}C_{i}.

We now establish a necessary and sufficient condition under which a finite sum of projectors is a projector.

in which case, ∑i∈ICi\sum_{i\in I}C_{i} is a closed convex set,

Since it is clear that ∑i∈IPCi\sum_{i\in I}P_{C_{i}} is monotone, we derive from Theorem 3.10 (applied to (Ci)(C_{i})_{}, (αi)=(1)(\alpha_{i})_{}=(1)_{}, and α=card⁡I=∑i∈I1\alpha=\operatorname{card}I=\sum_{i\in I}1) and 9 that

According to Proposition 2.4(iii) and 50, we see that ∑i∈ICi=C\sum_{i\in I}C_{i}=C is a closed convex set, from which and 50 we get 47. Furthermore, it follows from 10 and 51 that

Let CC and DD be nonempty closed convex subsets of H\mathcal{H}. Then the following are equivalent:

If (i) or (ii) holds, then C+DC+D is a closed convex set,

Consider the setting of Corollary 3.13. In view of [4, Example 12.3], we see that 54 is equivalent to (\iota_{C}\mbox{\footnotesize\,\square\,}\iota_{D})\mbox{\footnotesize\,\square\,}{\operatorname{q}}=\iota_{C}\mbox{\footnotesize\,\square\,}{\operatorname{q}}+\iota_{D}\mbox{\footnotesize\,\square\,}{\operatorname{q}}-{\operatorname{q}}+\gamma. Hence, using [4, Example 13.3(i) and Proposition 13.24(i)] and Moreau’s decomposition , we infer that

This type of relationship is used in [11, Proposition 3.16] to establish a condition for the sum of two proximity operators to be a proximity operator.

The following simple example shows that the constant γ\gamma in Corollary 3.13 can take on any value.

Let uu and vv be in H\mathcal{H}, set C≔{u}C\coloneqq\{u\}, and set D≔{v}D\coloneqq\{v\}. Then clearly PC+PD=P{u+v}=PC+DP_{C}+P_{D}=P_{\{u+v\}}=P_{C+D} and (∀x∈H) ⟨PCx ∣ PDx⟩=⟨u ∣ v⟩(\forall x\in\mathcal{H})\,\langle{P_{C}x}\,|\,\mathopen{}{P_{D}x}\rangle=\langle{u}\,|\,\mathopen{}{v}\rangle.

As a consequence of Corollary 3.13, a sum of projectors onto orthogonal sets is a projector; see [6, Proposition 2.6] for a difference derivation.

Let CC and DD be nonempty closed convex subsets of H\mathcal{H} such that C⊥DC\perp D. Then the following hold:

dC+D2=dC2+dD2−2q⁡d_{C+D}^{2}=d_{C}^{2}+d_{D}^{2}-2{\operatorname{q}}.

Since (∀x∈H) ⟨PCx ∣ PDx⟩=0(\forall x\in\mathcal{H})\,\langle{P_{C}x}\,|\,\mathopen{}{P_{D}x}\rangle=0, the conclusions readily follow from Corollary 3.13. ∎

We now provide an instance where item (ii) of Corollary 3.13 holds, C⊈D⊥C\nsubseteq D^{\perp} in general, and neither CC nor DD is a cone.

We next establish a necessary and sufficient condition for u+PCu+P_{C} to be a projector.

Let CC be a nonempty closed convex subset of H\mathcal{H}, and let u∈H.u\in\mathcal{H}. Then, since (∀x∈H) u=P{u}x(\forall x\in\mathcal{H})\,u=P_{\mathopen{}\left\{u\right\}}x, we deduce from Corollary 3.13 that

in which case, u+PC=Pu+Cu+P_{C}=P_{u+C} due to Corollary 3.13.

Consider the setting of Example 3.18. Since u+PCu+P_{C} is monotone, nonexpansive, and a sum of proximity operators, [2, Corollary 2.5] guarantees that u+PCu+P_{C} is a proximity operator. However, by Example 3.18, it is not a projector unless u∈(C−C)⊥.u\in(C-C)^{\perp}.

Here is a sufficient, but not necessary, condition for a sum of projectors to be a projector.

Set (∀k∈I) Dk≔∑i=1kCi(\forall k\in I)\,D_{k}\coloneqq\sum_{i=1}^{k}C_{i}, and let us establish that

Due to Corollary 3.13, the claim holds if k=2k=2, and we therefore assume that, for some k∈{2,…,m−1}k\in\{2,\ldots,m-1\}, DkD_{k} is a closed convex set and that ∑i=1kPCi=PDk\sum_{i=1}^{k}P_{C_{i}}=P_{D_{k}}. Then, by our assumption, (∀x∈H) ⟨PDkx ∣ PCk+1x⟩=∑i=1k⟨PCix ∣ PCk+1x⟩=∑i=1kγi,k+1(\forall x\in\mathcal{H})\,\langle{P_{D_{k}}x}\,|\,\mathopen{}{P_{C_{k+1}}x}\rangle=\sum_{i=1}^{k}\langle{P_{C_{i}}x}\,|\,\mathopen{}{P_{C_{k+1}}x}\rangle=\sum_{i=1}^{k}\gamma_{i,k+1}, from which and Corollary 3.13 (applied to DkD_{k} and Ck+1C_{k+1}) we infer that Dk+1=Dk+Ck+1D_{k+1}=D_{k}+C_{k+1} is a closed convex set and, due to the induction hypothesis, ∑i=1k+1PCi=∑i=1kPCi+PCk+1=PDk+PCk+1=PDk+Ck+1=PDk+1\sum_{i=1}^{k+1}P_{C_{i}}=\sum_{i=1}^{k}P_{C_{i}}+P_{C_{k+1}}=P_{D_{k}}+P_{C_{k+1}}=P_{D_{k}+C_{k+1}}=P_{D_{k+1}}. Hence, letting k=mk=m in 58 yields the conclusion. ∎

We now illustrate that the assumption of Corollary 3.20 need not hold when merely ∑i∈IPCi=PC\sum_{i\in I}P_{C_{i}}=P_{C}.

Let CC be a nonempty closed convex subset of H\mathcal{H} such that H∖(C−C)⊥≠∅\mathcal{H}\smallsetminus(C-C)^{\perp}\neq\varnothing, and suppose that u∈H∖(C−C)⊥.u\in\mathcal{H}\smallsetminus(C-C)^{\perp}. Then P{u}+P{−u}+PC=PCP_{\mathopen{}\left\{u\right\}}+P_{\mathopen{}\left\{-u\right\}}+P_{C}=P_{C} is a projector. However, if x↦⟨P{u}x ∣ PCx⟩=⟨u ∣ PCx⟩x\mapsto\langle{P_{\{u\}}x}\,|\,\mathopen{}{P_{C}x}\rangle=\langle{u}\,|\,\mathopen{}{P_{C}x}\rangle were a constant, then it would follow from Corollary 3.13 that u+PC=P{u}+PCu+P_{C}=P_{\mathopen{}\left\{u\right\}}+P_{C} is a projector, which violates Example 3.18 and the assumption that u∉(C−C)⊥.u\notin(C-C)^{\perp}.

We conclude this section with a result concerning the difference of two projectors.

Convex combination of projectors

The analysis of this section requires the following results.

Let (Ti)(T_{i})_{} be a finite family of firmly nonexpansive operators from H\mathcal{H} to H\mathcal{H}, let (αi)(\alpha_{i})_{} be real numbers in ]0,1]\mathopen{}\left]0,1\right] such that ∑i∈Iαi=1\sum_{i\in I}\alpha_{i}=1, and let CC be a nonempty closed convex subset of H\mathcal{H}. Then ∑i∈IαiTi=PC\sum_{i\in I}\alpha_{i}T_{i}=P_{C} if and only if there exist vectors (ui)(u_{i})_{} in H\mathcal{H} such that (∀i∈I) Ti=PC+ui(\forall i\in I)\,T_{i}=P_{C}+u_{i} and ∑i∈Iαiui=0\sum_{i\in I}\alpha_{i}u_{i}=0.

Let CC and DD be nonempty closed convex subsets of H\mathcal{H}, and set v≔PD−C‾0v\coloneqq P_{\overline{D-C}}0. Then the following hold:

Let (cn)(c_{n})_{} and (dn)(d_{n})_{} be sequences in CC and DD, respectively, and suppose that dn−cn→vd_{n}-c_{n}\to v. Then dn−PCdn→vd_{n}-P_{C}d_{n}\to v.

Suppose that there exists u∈Hu\in\mathcal{H} such that PD=PC+uP_{D}=P_{C}+u. Then u=v∈(C−C)⊥u=v\in(C-C)^{\perp} and D=C+vD=C+v.

(ii): Since PD=PC+uP_{D}=P_{C}+u, Example 3.18 guarantees that u∈(C−C)⊥u\in(C-C)^{\perp} and that D=C+uD=C+u. Hence, it suffices to show that u=vu=v. Indeed, since v=PD−C‾0∈D−C‾v=P_{\overline{D-C}}0\in\overline{D-C}, there exist sequences (cn)(c_{n})_{} in CC and (dn)(d_{n})_{} in DD such that dn−cn→vd_{n}-c_{n}\to v. Thus, we deduce from (i) that

Let (Ci)(C_{i})_{} be a finite family of nonempty closed convex subsets of H\mathcal{H}, let k∈Ik\in I, and set (∀i∈I) vi≔PCi−Ck‾0(\forall i\in I)\,v_{i}\coloneqq P_{\overline{C_{i}-C_{k}}}0. Then the following are equivalent:

For every i∈Ii\in I, we have vi∈(Ck−Ck)⊥v_{i}\in(C_{k}-C_{k})^{\perp} and Ci=Ck+viC_{i}=C_{k}+v_{i}.

“(i)⇒\Rightarrow(iii)”: Suppose that there exist (αi)∈]0,1]I(\alpha_{i})_{}\in\mathopen{}\left]0,1\right]^{I} and a nonempty closed convex subset CC of H\mathcal{H} such that ∑i∈Iαi=1\sum_{i\in I}\alpha_{i}=1 and ∑i∈IαiPCi=PC\sum_{i\in I}\alpha_{i}P_{C_{i}}=P_{C}. Then, since (PCi)(P_{C_{i}})_{} are firmly nonexpansive by [4, Proposition 4.16], Fact 4.1 guarantees the existence of vectors (ui)(u_{i})_{} in H\mathcal{H} such that

Now fix i∈Ii\in I. We then derive from 61 that PCi=(PCk−uk)+ui=PCk+ui−ukP_{C_{i}}=(P_{C_{k}}-u_{k})+u_{i}=P_{C_{k}}+u_{i}-u_{k}, and it thus follows from Lemma 4.2(ii) (applied to (Ck,Ci,ui−uk)(C_{k},C_{i},u_{i}-u_{k})) that vi∈(Ck−Ck)⊥v_{i}\in(C_{k}-C_{k})^{\perp} and Ci=Ck+viC_{i}=C_{k}+v_{i}, as required.

To complete the proof, we shall show that (ii)⇔\Leftrightarrow(iii).

“(iii)⇒\Rightarrow(ii)”: Suppose that (iii) holds. Then, due to 62, (iv) holds, from which (ii) follows. ∎

The following example shows that the conclusion of Theorem 4.3 fails if we replace “convex combination” by “affine combination” in item (i).

Let CC be a nonempty closed convex subset of H\mathcal{H}, and let u∈Hu\in\mathcal{H}. Then the affine combination of (PC,PC,P{u})(P_{C},P_{C},P_{\mathopen{}\left\{u\right\}}) with weights (1/4,−1/4,1)(1/4,-1/4,1) is a projector since (1/4)PC−(1/4)PC+P{u}=P{u}(1/4)P_{C}-(1/4)P_{C}+P_{\mathopen{}\left\{u\right\}}=P_{\mathopen{}\left\{u\right\}}. However, Theorem 4.3(iii) fails when CC is not a singleton.

Here are some direct consequences of Theorem 4.3.

Let k∈Ik\in I and let i∈Ii\in I. Since Ck∩Ci≠∅C_{k}\cap C_{i}\neq\varnothing by assumption, we see that PCi−Ck‾0=0P_{\overline{C_{i}-C_{k}}}0=0, and thus, due to our assumption, the implication “(i)⇒\Rightarrow(iii)” of Theorem 4.3 yields Ci=CkC_{i}=C_{k}, as desired. ∎

Let CC and DD be nonempty closed convex subsets of H\mathcal{H}. Then the following are equivalent:

PD−C‾0∈(C−C)⊥P_{\overline{D-C}}0\in(C-C)^{\perp} and D=C+PD−C‾0D=C+P_{\overline{D-C}}0.

This follows from the equivalences “(ii)⇔\Leftrightarrow(iii)⇔\Leftrightarrow(iv)” of Theorem 4.3. ∎

We now specialize Corollary 4.6 to get a result on scalar multiples of projectors.

Let D={0}D=\mathopen{}\left\{0\right\} in Corollary 4.6. ∎

The partial sum property of projectors onto convex cones

In this section, we shall discuss the partial sum property and the connections between our work, Zarantonello’s [26, Theorems 5.5 and 5.3], and the recent work . We shall need the following two results. Let us provide an instance where the star-difference of two sets (see ) can be explicitly determined. Lemma 5.1 was mentioned in [2, Footnote 5] and was also stated implicitly in the proof of [26, Theorem 5.2].

Let K1K_{1} and K2K_{2} be nonempty closed convex cones in H\mathcal{H}, and set

The chain of implications “(i)⇒\Rightarrow(ii)⇒\Rightarrow(iii)” is clear.

“(iv)⇒\Rightarrow(i)”: First, take u∈K1u\in K_{1}. Since K2⊆K1K_{2}\subseteq K_{1} and K1K_{1} is a convex cone by assumption, it follows that u+K2⊆K1+K1⊆K1u+K_{2}\subseteq K_{1}+K_{1}\subseteq K_{1}, and therefore u∈Ku\in K. Conversely, fix u∈Ku\in K. Because u+K2⊆K1u+K_{2}\subseteq K_{1} and 0∈K20\in K_{2}, we deduce that u∈K1u\in K_{1}, which completes the proof. ∎

Let CC and DD be nonempty closed convex subsets of H\mathcal{H}, and set

(\forall u\in\mathcal{H})\,h(u)=\sup_{v\in D}\big{(}\sigma_{C}(u+v)+\langle{u}\,|\,\mathopen{}{v}\rangle\big{)}.

Suppose that CC and DD are cones and D⊆C⊖.D\subseteq{C}^{\ominus}. Then h=ιC⊖∩D⊖.h=\iota_{{C}^{\ominus}\cap{D}^{\ominus}}.

(i): Since DD is convex, closed, and nonempty, we see that ιD∈Γ0(H)\iota_{D}\in\varGamma_{0}(\mathcal{H}), and so (1/2)d_{D}^{2}=\iota_{D}\mbox{\footnotesize\,\square\,}{\operatorname{q}}=\iota_{D}\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}} by [4, Example 12.21 and Proposition 12.15]. In turn, Moreau’s decomposition asserts that {\operatorname{q}}-(1/2)d_{D}^{2}={\operatorname{q}}-\iota_{D}\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}}=\iota_{D}^{\ast}\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}}. Thus, 64 yields

Moreover, since ιD∈Γ0(H)\iota_{D}\in\varGamma_{0}(\mathcal{H}) and q⁡∗=q⁡{\operatorname{q}}^{\ast}={\operatorname{q}}, [4, Proposition 13.24(i)] and the Fenchel–Moreau theorem guarantee that (\iota_{D}^{\ast}\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}})^{\ast}=\iota_{D}^{\ast\ast}+{\operatorname{q}}^{\ast}=\iota_{D}+{\operatorname{q}}, which implies that \operatorname{dom}(\iota_{D}^{\ast}\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}})^{\ast}=D. Consequently, because \iota_{D}^{\ast}\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}}\in\varGamma_{0}(\mathcal{H}), [4, Proposition 14.19 and Example 13.27(iii)] imply that

(ii): First, because D⊆C⊖D\subseteq{C}^{\ominus}, Lemma 5.1 (applied to the pair of closed convex cones (C⊖,D)({C}^{\ominus},D)) yields

Next, we derive from (i) and [4, Example 13.3(ii)] that

Now fix u∈Hu\in\mathcal{H}, and let us consider two alternatives.

(a) u∈H∖C⊖u\in\mathcal{H}\smallsetminus{C}^{\ominus}: In view of 66bo, there exists v∈Dv\in D such that u+v∈H∖C⊖u+v\in\mathcal{H}\smallsetminus{C}^{\ominus}, and therefore, by 66bp, h(u)⩾ιC⊖(u+v)+⟨u ∣ v⟩=+∞.h(u)\geqslant\iota_{C^{\ominus}}(u+v)+\langle{u}\,|\,\mathopen{}{v}\rangle=+\infty.

(b) u∈C⊖u\in{C}^{\ominus}: Then, by 66bo, u+D⊆C⊖u+D\subseteq{C}^{\ominus}. Hence, since DD is a nonempty cone, it follows from 66bp and [4, Example 13.3(ii)] that h(u)=sup⁡v∈D⟨u ∣ v⟩=σD(u)=ιD⊖(u)=ιC⊖∩D⊖(u).h(u)=\sup_{v\in D}\langle{u}\,|\,\mathopen{}{v}\rangle=\sigma_{D}(u)=\iota_{{D}^{\ominus}}(u)=\iota_{{C}^{\ominus}\cap{D}^{\ominus}}(u).

Altogether, we obtain the desired conclusion. ∎

Here is the first main result of this section. The proof of the implication “(v)⇒\Rightarrow(i)” was inspired by [2, Lemma 5.3].

Let K1K_{1} and K2K_{2} be nonempty closed convex cones in H\mathcal{H}. Then the following are equivalent:

K1+K2K_{1}+K_{2} is closed and PK1+PK2=PK1+K2.P_{K_{1}}+P_{K_{2}}=P_{K_{1}+K_{2}}.

There exists a nonempty closed convex cone KK such that PK1+PK2=PKP_{K_{1}}+P_{K_{2}}=P_{K}.

PK1+PK2P_{K_{1}}+P_{K_{2}} is a proximity operator of a function in Γ0(H)\varGamma_{0}(\mathcal{H}).

Id⁡−PK1−PK2{{\operatorname{Id}}}-P_{K_{1}}-P_{K_{2}} is monotone.

(∀x∈H) ⟨PK1x ∣ PK2x⟩=0.(\forall x\in\mathcal{H})\,\langle{P_{K_{1}}x}\,|\,\mathopen{}{P_{K_{2}}x}\rangle=0.

Furthermore, if one of (i), (ii), (iii), (iv), (v) and (vi) holds, then

The chain of implications “(i)⇒\Rightarrow(ii)⇒\Rightarrow(iii)⇒\Rightarrow(iv)” is clear, and the implication “(iv)⇒\Rightarrow(v)” follows from [4, Example 20.7]. We now assume that (v) holds and establish (i). Towards this end, set

Let us first establish that h=ιK1⊖∩K2⊖.h=\iota_{K_{1}^{\ominus}\cap K_{2}^{\ominus}}. To do so, we derive from the monotonicity of Id⁡−PK1−PK2{{\operatorname{Id}}}-P_{K_{1}}-P_{K_{2}} and Moreau’s conical decomposition that

Thus, because K1⊖K_{1}^{\ominus} and K2K_{2} are closed convex cones, [26, Lemma 5.6] guarantees that K2⊆K1⊖K_{2}\subseteq K_{1}^{\ominus}, from which and Proposition 5.2(ii) we deduce that

as claimed. Next, by Theorem 3.2 (respectively applied to PK1P_{K_{1}} and PK2P_{K_{2}}), ff is Fréchet differentiable on H\mathcal{H} (hence continuous) and

which is monotone by assumption. Therefore, in view of [4, Proposition 17.7(iii)], ff is convex, and so f∈Γ0(H)f\in\varGamma_{0}(\mathcal{H}). In turn, because f∗=h+q⁡=ιK1⊖∩K2⊖+q⁡f^{\ast}=h+{\operatorname{q}}=\iota_{K_{1}^{\ominus}\cap K_{2}^{\ominus}}+{\operatorname{q}} by 66bs and 66bu, the Fenchel–Moreau theorem and [4, Example 13.5] yield f=f∗∗=(ιK1⊖∩K2⊖+q⁡)∗=q⁡−(1/2)dK1⊖∩K2⊖2.f=f^{\ast\ast}=(\iota_{K_{1}^{\ominus}\cap K_{2}^{\ominus}}+{\operatorname{q}})^{\ast}={\operatorname{q}}-(1/2)d_{K_{1}^{\ominus}\cap K_{2}^{\ominus}}^{2}. Hence, by 66bv and [4, Corollary 12.31], we obtain Id⁡−PK1−PK2=∇f=Id⁡−(Id⁡−PK1⊖∩K2⊖)=PK1⊖∩K2⊖.{{\operatorname{Id}}}-P_{K_{1}}-P_{K_{2}}=\nabla f={{\operatorname{Id}}}-({{\operatorname{Id}}}-P_{K_{1}^{\ominus}\cap K_{2}^{\ominus}})=P_{K_{1}^{\ominus}\cap K_{2}^{\ominus}}. Thus, the Moreau conical decomposition and [4, Proposition 6.35 and Corollary 6.34] guarantee that PK1+PK2=Id⁡−PK1⊖∩K2⊖=P(K1⊖∩K2⊖)⊖=PK1⊖⊖+K2⊖⊖‾=PK1+K2‾.P_{K_{1}}+P_{K_{2}}={{\operatorname{Id}}}-P_{K_{1}^{\ominus}\cap K_{2}^{\ominus}}=P_{(K_{1}^{\ominus}\cap K_{2}^{\ominus})^{\ominus}}=P_{\overline{K_{1}^{\ominus\ominus}+K_{2}^{\ominus\ominus}}}=P_{\overline{K_{1}+K_{2}}}. Consequently, Proposition 2.4(iii) asserts that K1+K2K_{1}+K_{2} is closed, and therefore, PK1+PK2=PK1+K2P_{K_{1}}+P_{K_{2}}=P_{K_{1}+K_{2}}, as desired. To summarize, we have shown the equivalences of (i)–(v).

“(i)⇔\Leftrightarrow(vi)”: Follows from Corollary 3.13 and the fact that ⟨PK10 ∣ PK20⟩=0\langle{P_{K_{1}}0}\,|\,\mathopen{}{P_{K_{2}}0}\rangle=0. Moreover, if (vi) holds, then 66bq follows from Corollary 3.13 and [4, Theorem 6.30(iii)]. ∎

Replacing one cone by a general convex set may make the implication “(v)⇒\Rightarrow(i)” of Theorem 5.3 fail, as illustrated by the following example.

Let KK be a nonempty closed convex cone in H\mathcal{H}, and let u∈Hu\in\mathcal{H}. Then, by Moreau’s conical decomposition, Id⁡−PK−P{u}=PK⊖−u{{\operatorname{Id}}}-P_{K}-P_{\mathopen{}\left\{u\right\}}=P_{{K}^{\ominus}}-u, which is clearly monotone. However, owing to Example 3.18, P{u}+PK=u+PKP_{\mathopen{}\left\{u\right\}}+P_{K}=u+P_{K} is not a projector provided that u∉(K−K)⊥.u\notin(K-K)^{\perp}.

Here is an instance where the projector onto the intersection can be expressed in term of the individual projectors.

Let K1K_{1} and K2K_{2} be nonempty closed convex cones in H\mathcal{H}. Then the following are equivalent:

PK1∩K2=PK1+PK2−Id⁡.P_{K_{1}\cap K_{2}}=P_{K_{1}}+P_{K_{2}}-{{\operatorname{Id}}}.

PK1+PK2−Id⁡P_{K_{1}}+P_{K_{2}}-{{\operatorname{Id}}} is monotone.

(∀x∈H) ∥PK1x∥2+∥PK2x∥2=∥x∥2+⟨PK1x ∣ PK2x⟩.(\forall x\in\mathcal{H})\,\lVert P_{K_{1}}x\rVert^{2}+\lVert P_{K_{2}}x\rVert^{2}=\lVert x\rVert^{2}+\langle{P_{K_{1}}x}\,|\,\mathopen{}{P_{K_{2}}x}\rangle.

We first deduce from the Moreau conical decomposition and [4, Proposition 6.35] that

“(i)⇔\Leftrightarrow(ii)”: Denote by C\mathscr{C} the class of nonempty closed convex cones in H\mathcal{H}. Then, because the mapping C→C:K↦K⊖\mathscr{C}\to\mathscr{C}:K\mapsto{K}^{\ominus} is bijective due to [4, Corollary 6.34], we derive from 66bwd, the equivalence “(i)⇔\Leftrightarrow(ii)” of Theorem 5.3, and the Moreau conical decomposition that

where the last equivalence follows from the fact that PK1+PK2−Id⁡P_{K_{1}}+P_{K_{2}}-{\operatorname{Id}} is positively homogeneous.

“(i)⇔\Leftrightarrow(iii)”: Since Id⁡−(PK1⊖+PK2⊖)=PK1+PK2−Id⁡{\operatorname{Id}}-(P_{K_{1}^{\ominus}}+P_{K_{2}^{\ominus}})=P_{K_{1}}+P_{K_{2}}-{\operatorname{Id}} by Moreau’s decomposition, this equivalence is a consequence of 66bwd and the equivalence “(ii)⇔\Leftrightarrow(v)” of Theorem 5.3 (applied to (K1⊖,K2⊖)(K_{1}^{\ominus},K_{2}^{\ominus})).

“(i)⇔\Leftrightarrow(iv)”: This readily follows from 66bwd, the equivalence “(ii)⇔\Leftrightarrow(vi)” of Theorem 5.3 (applied to (K1⊖,K2⊖)(K_{1}^{\ominus},K_{2}^{\ominus})), and Lemma 2.2(ii). ∎

By replacing (K1,K2)(K_{1},K_{2}) by (K1,K2⊖)(K_{1},K_{2}^{\ominus}) in Corollary 5.5, we provide an alternative proof for [26, Theorem 5.3]. The linear case of Corollary 5.6 goes back at least to Halmos (see [14, Theorem 3, p. 48]).

Let K1K_{1} and K2K_{2} be nonempty closed convex cones in H\mathcal{H}. Then PK2PK1=PK2P_{K_{2}}P_{K_{1}}=P_{K_{2}} if and only if PK1−PK2P_{K_{1}}-P_{K_{2}} is a projector onto a closed convex set; in which case, PK1−PK2=PK1∩K2⊖.P_{K_{1}}-P_{K_{2}}=P_{K_{1}\cap K_{2}^{\ominus}}.

First, suppose that PK2PK1=PK2.P_{K_{2}}P_{K_{1}}=P_{K_{2}}. Then, by [4, Theorem 6.30(i)&(iii)] and Lemma 2.2(i),

Hence, the equivalence “(i)⇔\Leftrightarrow(iv)” of Corollary 5.5 (applied to (K1,K2⊖)(K_{1},K_{2}^{\ominus})) yields PK1−PK2=PK1+PK2⊖−Id⁡=PK1∩K2⊖P_{K_{1}}-P_{K_{2}}=P_{K_{1}}+P_{K_{2}^{\ominus}}-{\operatorname{Id}}=P_{K_{1}\cap K_{2}^{\ominus}}, as desired. Conversely, assume that PK1−PK2P_{K_{1}}-P_{K_{2}} is a projector associated with a closed convex set. Since PK1−PK2=PK1+PK2⊖−Id⁡P_{K_{1}}-P_{K_{2}}=P_{K_{1}}+P_{K_{2}^{\ominus}}-{\operatorname{Id}}, it follows from the equivalence “(i)⇔\Leftrightarrow(ii)” of Corollary 5.5 (applied to (K1,K2⊖)(K_{1},K_{2}^{\ominus})) that

Now take x∈Hx\in\mathcal{H}. On the one hand, because PK1∩K2⊖+PK2=(PK1−PK2)+PK2=PK1P_{K_{1}\cap K_{2}^{\ominus}}+P_{K_{2}}=(P_{K_{1}}-P_{K_{2}})+P_{K_{2}}=P_{K_{1}} by 66bz, we infer from Theorem 5.3 that PK1∩K2⊖x⊥PK2xP_{K_{1}\cap K_{2}^{\ominus}}x\perp P_{K_{2}}x or, equivalently, by 66bz, (PK1x−PK2x)⊥PK2x.(P_{K_{1}}x-P_{K_{2}}x)\perp P_{K_{2}}x. On the other hand, 66bz implies that PK1x−PK2x∈K2⊖P_{K_{1}}x-P_{K_{2}}x\in K_{2}^{\ominus}. Altogether, since clearly PK2x∈K2P_{K_{2}}x\in K_{2}, [4, Proposition 6.28] asserts that PK2PK1x=PK2xP_{K_{2}}P_{K_{1}}x=P_{K_{2}}x, and the proof is complete. ∎

The so-called partial sum property, i.e., if a finite sum of proximity operators is a proximity operator, then so is every partial sum, was obtained in . Somewhat surprisingly, as we shall see in the following result, this property is still valid in the class of projectors onto convex cones. The equivalence “(i)⇔\Leftrightarrow(iii)” of the following result was obtained by Zarantonello with a different proof (see [26, Theorem 5.5]).

Let (Ki)(K_{i})_{} be a family of nonempty closed convex cones in H\mathcal{H}. Then the following are equivalent:

For every (i,j)∈I×I(i,j)\in I\times I such that i≠ji\neq j, we have (∀x∈H) ⟨PKix ∣ PKjx⟩=0.(\forall x\in\mathcal{H})\,\langle{P_{K_{i}}x}\,|\,\mathopen{}{P_{K_{j}}x}\rangle=0.

∑i∈IKi\sum_{i\in I}K_{i} is closed and ∑i∈IPKi=P∑i∈IKi\sum_{i\in I}P_{K_{i}}=P_{\sum_{i\in I}K_{i}}.

∑i∈IPKi\sum_{i\in I}P_{K_{i}} is a projection onto a closed convex cone in H\mathcal{H}.

∑i∈IPKi\sum_{i\in I}P_{K_{i}} is a proximity operator of a function in Γ0(H)\varGamma_{0}(\mathcal{H}).

For every nonempty subset JJ of II, ∑j∈JPKj\sum_{j\in J}P_{K_{j}} is a proximity operator of a function in Γ0(H)\varGamma_{0}(\mathcal{H}).

For every nonempty subset JJ of II, ∑j∈JKj\sum_{j\in J}K_{j} is closed and ∑j∈JPKj=P∑j∈JKj\sum_{j\in J}P_{K_{j}}=P_{\sum_{j\in J}K_{j}}.

For every (i,j)∈I×I(i,j)\in I\times I such that i≠ji\neq j, we have PKi+PKjP_{K_{i}}+P_{K_{j}} is nonexpansive.

For every (i,j)∈I×I(i,j)\in I\times I such that i≠ji\neq j, we have Id⁡−PKi−PKj{\operatorname{Id}}-P_{K_{i}}-P_{K_{j}} is monotone.

“(i)⇒\Rightarrow(ii)”: A direct consequence of Corollary 3.20.

“(ii)⇒\Rightarrow(iii)” and “(iii)⇒\Rightarrow(iv)”: Clear.

“(iv)⇒\Rightarrow(v)”: Let f∈Γ0(H)f\in\varGamma_{0}(\mathcal{H}) be such that ∑i∈IPKi=Prox⁡f\sum_{i\in I}P_{K_{i}}=\operatorname{Prox}_{f}. Then, by Moreau’s decomposition (), ∑i∈IPKi+Prox⁡f∗=Prox⁡f+Prox⁡f∗=Id⁡\sum_{i\in I}P_{K_{i}}+\operatorname{Prox}_{f^{\ast}}=\operatorname{Prox}_{f}+\operatorname{Prox}_{f^{\ast}}={\operatorname{Id}}. Therefore, since {PKi}\{P_{K_{i}}\}_{} are proximity operators, the conclusion follows from [2, Theorem 4.2].

“(vii)⇒\Rightarrow(viii)”: See [4, Example 20.7].

“(viii)⇒\Rightarrow(i)”: This is the implication “(v)⇒\Rightarrow(vi)” of Theorem 5.3.

To sum up, we have shown the equivalence of (i)–(viii) except for (vi).

“(v)⇔\Leftrightarrow(vi)”: Follows from the equivalence “(ii)⇔\Leftrightarrow(iv).” ∎

As we now illustrate, the partial sum property may, however, fail outside the class of projectors onto convex cones.

To proceed further, we require the following lemma.

and set w≔∥v∥u+∥u∥vw\coloneqq\lVert v\rVert u+\lVert u\rVert v. Then, by the Cauchy–Schwarz inequality, ⟨w ∣ u⟩=∥v∥∥u∥2+∥u∥⟨u ∣ v⟩⩾∥v∥∥u∥2−∥u∥(∥u∥∥v∥)=0\langle{w}\,|\,\mathopen{}{u}\rangle=\lVert v\rVert\lVert u\rVert^{2}+\lVert u\rVert\langle{u}\,|\,\mathopen{}{v}\rangle\geqslant\lVert v\rVert\lVert u\rVert^{2}-\lVert u\rVert(\lVert u\rVert\lVert v\rVert)=0 and ⟨w ∣ v⟩=∥v∥⟨u ∣ v⟩+∥u∥∥v∥2⩾−∥v∥(∥u∥∥v∥)+∥u∥∥v∥2=0\langle{w}\,|\,\mathopen{}{v}\rangle=\lVert v\rVert\langle{u}\,|\,\mathopen{}{v}\rangle+\lVert u\rVert\lVert v\rVert^{2}\geqslant-\lVert v\rVert(\lVert u\rVert\lVert v\rVert)+\lVert u\rVert\lVert v\rVert^{2}=0. Hence, due to [4, Example 29.31], we obtain

from which we derive the following conceivable cases.

(a) ⟨u ∣ v⟩=0\langle{u}\,|\,\mathopen{}{v}\rangle=0: Then u⊥vu\perp v.

Theorem 5.7 allows us to characterize finitely generated cones of which the associated projectors are the sum of projectors onto the generating rays.

Assume first that PK=∑i∈IPKiP_{K}=\sum_{i\in I}P_{K_{i}}. Then, Theorem 5.7 ensures that,

The one-dimensional case

The goal of this section is to describe all pairs (C,D)(C,D) on the real line such that PC+PD=PC+D.P_{C}+P_{D}=P_{C+D}. We begin with a simple observation.

If C={0}C=\mathopen{}\left\{0\right\} or D={0}D=\mathopen{}\left\{0\right\}, then clearly PC+PD=PC+DP_{C}+P_{D}=P_{C+D}. Thus, we henceforth assume in this section that

Here is a sufficient condition under which PC+PD=PC+D.P_{C}+P_{D}=P_{C+D}.

Suppose that C∩D={0}.C\cap D=\mathopen{}\left\{0\right\}. Then the following hold:

Exactly one of the following cases occurs:

C+DC+D is closed and PC+PD=PC+D.P_{C}+P_{D}=P_{C+D}.

Here is a direct consequence of Proposition 6.2(i).

Suppose that C∩D≠∅.C\cap D\neq\varnothing. Then

where CD≔{ξη ∣ ξ∈C and η∈D}.CD\coloneqq\{{\xi\eta}~{}|~{}\mathopen{}{\xi\in C\text{~{}and~{}}\eta\in D}\}.

The next result classifies all pairs (C,D)(C,D) such that PC+PD=PC+D.P_{C}+P_{D}=P_{C+D}. Item (ii) is a partial converse of Proposition 6.2.

Neither CC nor DD is a singleton and C∩D={0}.C\cap D=\mathopen{}\left\{0\right\}.

(i): Suppose that C={ω}C=\mathopen{}\left\{\omega\right\}, where ω≠0\omega\neq 0 due to 66ci. Then, for every ξ∈D\xi\in D and every η∈D\eta\in D, since PCξ=PCη=ωP_{C}\xi=P_{C}\eta=\omega, 66ck implies that ωξ=ωPDξ=ωPDη=ωη,\omega\xi=\omega P_{D}\xi=\omega P_{D}\eta=\omega\eta, and because ω≠0\omega\neq 0, it follows that ξ=η\xi=\eta. Therefore, DD is a singleton, as required.

Without loss of generality, we may and do assume that

Then 66cl asserts that CC is bounded above and DD is bounded below, and because they are closed, we infer that sup⁡C=max⁡C\sup{C}=\max{C} and inf⁡D=min⁡D.\inf{D}=\min{D}. Let us consider the following conceivable cases.

(a) max⁡C=0\max{C}=0: Then min⁡D≠0\min{D}\neq 0 (otherwise 0∈C∩D0\in C\cap D, which is absurd). Because CC is not a singleton, we can find ξ1∈C\xi_{1}\in C and ξ2∈C\xi_{2}\in C such that ξ1≠ξ2\xi_{1}\neq\xi_{2}. In turn, due to 66cl and 66cm, (∀i∈{1,2}) ξi⩽β/μ⩽min⁡D,(\forall i\in\mathopen{}\left\{1,2\right\})\,\xi_{i}\leqslant\beta/\mu\leqslant\min{D}, from which and [4, Example 24.34(i)] we deduce that PDξ1=PDξ2=min⁡DP_{D}\xi_{1}=P_{D}\xi_{2}=\min{D}. Consequently, since {ξ1,ξ2}⊆C\mathopen{}\left\{\xi_{1},\xi_{2}\right\}\subseteq C, 66ck implies that ξ1min⁡D=⟨PCξ1 ∣ PDξ1⟩=⟨PCξ2 ∣ PDξ2⟩=ξ2min⁡D\xi_{1}\min{D}=\langle{P_{C}\xi_{1}}\,|\,\mathopen{}{P_{D}\xi_{1}}\rangle=\langle{P_{C}\xi_{2}}\,|\,\mathopen{}{P_{D}\xi_{2}}\rangle=\xi_{2}\min{D}, and since min⁡D≠0\min{D}\neq 0, it follows that ξ1=ξ2\xi_{1}=\xi_{2}, which is impossible.

(b) max⁡C≠0\max{C}\neq 0: Since DD is not a singleton, there are η1∈D\eta_{1}\in D and η2∈D\eta_{2}\in D such that η1≠η2.\eta_{1}\neq\eta_{2}. In turn, we infer from 66cl&66cm that (∀i∈{1,2}) max⁡C⩽β/μ⩽ηi,(\forall i\in\mathopen{}\left\{1,2\right\})\,\max{C}\leqslant\beta/\mu\leqslant\eta_{i}, and therefore [4, Example 24.34(i)] yields PCη1=PCη2=max⁡C.P_{C}\eta_{1}=P_{C}\eta_{2}=\max{C}. Thus, by 66ck and the fact that {η1,η2}⊆D\mathopen{}\left\{\eta_{1},\eta_{2}\right\}\subseteq D, , we see that (max⁡C)η1=⟨PCη1 ∣ PDη1⟩=⟨PCη2 ∣ PDη2⟩=(max⁡C)η2(\max{C})\eta_{1}=\langle{P_{C}\eta_{1}}\,|\,\mathopen{}{P_{D}\eta_{1}}\rangle=\langle{P_{C}\eta_{2}}\,|\,\mathopen{}{P_{D}\eta_{2}}\rangle=(\max{C})\eta_{2}. Consequently, since max⁡C≠0\max{C}\neq 0, it follows that η1=η2\eta_{1}=\eta_{2}, which is absurd.

Let us next verify that C∩DC\cap D is a singleton. To this end, take ξ∈C∩D\xi\in C\cap D and η∈C∩D\eta\in C\cap D, and let ε∈]0,1[.\varepsilon\in]0,1[. On the one hand, by 66ck, we see that

On the other hand, since C∩DC\cap D is convex and ε∈]0,1[\varepsilon\in]0,1[, (1−ε)ξ+εη∈C∩D(1-\varepsilon)\xi+\varepsilon\eta\in C\cap D. Altogether, ξ2=[(1−ε)ξ+εη]2\xi^{2}=[(1-\varepsilon)\xi+\varepsilon\eta]^{2} or, equivalently, ε(ξ−η)[(2−ε)ξ+εη]=ξ2−[(1−ε)ξ+εη]2=0.\varepsilon(\xi-\eta)[(2-\varepsilon)\xi+\varepsilon\eta]=\xi^{2}-[(1-\varepsilon)\xi+\varepsilon\eta]^{2}=0. Interchanging ξ\xi and η\eta yields ε(η−ξ)[(2−ε)η+εξ]=0\varepsilon(\eta-\xi)[(2-\varepsilon)\eta+\varepsilon\xi]=0, and upon adding these equalities, we obtain ε(ξ−η)(2(1−ε)ξ−2(1−ε)η)=0,\varepsilon(\xi-\eta)(2(1-\varepsilon)\xi-2(1-\varepsilon)\eta)=0, i.e., 2ε(1−ε)(ξ−η)2=0.2\varepsilon(1-\varepsilon)(\xi-\eta)^{2}=0. Therefore, ξ=η\xi=\eta and C∩DC\cap D is thus a singleton, say

It remains to show that ω=0.\omega=0. Since CC is not a singleton, there exists ξ∈C∖{ω}\xi\in C\smallsetminus\mathopen{}\left\{\omega\right\}. In turn, because C∩D={ω}C\cap D=\mathopen{}\left\{\omega\right\}, we derive from [4, Proposition 24.47] (applied to (Ω,ϕ)=(D,ιC)(\varOmega,\phi)=(D,\iota_{C})) and 66ck&66co that ξω=⟨PCξ ∣ PC∩Dξ⟩=⟨PCξ ∣ PD(PCξ)⟩=⟨PCξ ∣ PDξ⟩=γ=ω2.\xi\omega=\langle{P_{C}\xi}\,|\,\mathopen{}{P_{C\cap D}\xi}\rangle=\langle{P_{C}\xi}\,|\,\mathopen{}{P_{D}(P_{C}\xi)}\rangle=\langle{P_{C}\xi}\,|\,\mathopen{}{P_{D}\xi}\rangle=\gamma=\omega^{2}. Thus, ω(ξ−ω)=0\omega(\xi-\omega)=0, and since ξ≠ω\xi\neq\omega, it follows that ω=0\omega=0, which completes the proof. ∎

On a result by Halmos

In this section, we revisit and extend the classical result [14, Theorem 2, p. 46] to the nonlinear case.

Let CC be a nonempty closed convex subset of H\mathcal{H}, and let KK be a nonempty closed convex cone in H\mathcal{H}. Suppose that there exits a closed convex set DD such that PC+PK=PDP_{C}+P_{K}=P_{D}. Then C⊆K⊖.C\subseteq{K}^{\ominus}.

The following example shows that the conclusion of Proposition 7.1 is merely a necessary condition for PC+PK=PC+KP_{C}+P_{K}=P_{C+K} even when CC is a cone.

We now extend the classical [14, Theorem 2, p. 46] (in the case of two subspaces) by replacing one subspace by a general convex set.

Let CC be a nonempty closed convex subset of H\mathcal{H}, and let VV be a closed linear subspace of H\mathcal{H}. Then the following are equivalent:

There exists a closed convex set DD such that PC+PV=PDP_{C}+P_{V}=P_{D}.

Moreover, if (i) and (ii) hold, then D=C+VD=C+V and PC+PV=PC+VP_{C}+P_{V}=P_{C+V}.

“(i)⇒\Rightarrow(ii)”: It follows from Corollary 3.13 that D=C+VD=C+V and that PC+PV=PC+VP_{C}+P_{V}=P_{C+V}. Now, by Proposition 7.1 and [4, Proposition 6.23], we obtain C⊆V⊖=V⊥C\subseteq{V}^{\ominus}=V^{\perp}.

“(ii)⇒\Rightarrow(i)”: Immediate from Corollary 3.16. ∎

However, replacing the subspace VV in Corollary 7.3 by cone might not work. The following simple example shows that the implication “(i)⇒\Rightarrow(ii)” of Corollary 7.3 may fail even when CC and VV are cones.

Combining Theorem 5.7, Theorem 5.3, and Corollary 7.3, we obtain the following well-known result; see [14, Theorem 2, p. 46].

Let (Vi)(V_{i})_{} be a finite family of closed linear subspaces of H\mathcal{H}. Then ∑i∈IPVi\sum_{i\in I}P_{V_{i}} is a projector associated with a closed linear subspace if and only if, for every (i,j)∈I×I(i,j)\in I\times I with i≠ji\neq j, we have Vi⊥VjV_{i}\perp V_{j}.

The authors thank two referees for their constructive comments. We also thank Professors Rebecca Tyson and Chris Cosner for helpful comments on Remark 3.5. We are grateful to Professor Patrick Combettes for bringing our attention to the case of convex averages. HHB and XW were partially supported by NSERC Discovery Grants; MNB was partially supported by a Mitacs Globalink Graduate Fellowship Award. Most parts of this work were done when MNB was a graduate student at the University of British Columbia, Okanagan campus.

References