with inner product ⟨⋅∣⋅⟩ and induced norm ∥⋅∥. Now assume thatFor basic Convex Analysis, we refer the reader to .
In this paper, we analyze carefully the question: When is ∑i∈IαiPCi 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 to be closed. This happens, for instance, when each set is bounded.) It is known that, in the case of linear subspaces, ∑i∈IPCi is a projector onto a closed linear subspace if and only if (Ci) 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) are cones, then ∑i∈IPCi is a projector if and only if (PCi) is pairwise orthogonal in the sense that, for every (i,j)∈I×I with i=j, we have (∀x∈H)⟨PCix∣PCjx⟩=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 to be a projector without any further assumption on the sets (Ci). 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) 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 is a projector; Theorem 3.12 concerns the sum ∑i∈IPCi.
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 is the identity operator on H. Let C be a subset of H. Then we denote by C the closure of C (with respect to the norm topology on H), by dC its distance function, by C⊖ its polar cone, i.e., C⊖:={u∈H∣sup⟨C∣u⟩⩽0}, and by C⊥ its orthogonal complement. Next, the indicator and support functions of C are
respectively. Moreover, if C is convex, closed, and nonempty, then the projector associated with C is denoted by PC. In turn, we set
Next, the set of convex, lower semicontinuous, and proper functions from H to ]−∞,+∞] is Γ0(H). The domain of of a function f:H→[−∞,+∞] is domf:={x∈H∣f(x)<+∞} with closure domf, its graph is denoted by graf, its conjugate is denoted by f∗, and its subdifferential is denoted by ∂f; furthermore, if f∈Γ0(H), then we denote its proximity operator by Proxf and its Moreau envelope by envf, i.e., \operatorname{env}f\coloneqq f\mbox{\footnotesize\,\square\,}{\operatorname{q}}=f\mbox{\footnotesize\,\boxdot\,}{\operatorname{q}}, where □ and ⊡ denote the infimal convolution and the exact infimal convolution, respectively. Next, let T:H→H. The range of T is ranT with closure ranT. If T∈B(H), the space of bounded linear operators on H, then its adjoint is denoted by T∗. 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.
Base case: When m=1, by applying [4, Corollary 2.15] to (x−x1,x1) and noticing that α=α1, we obtain
Inductive step: Assume that m⩾2 and that the result holds for families containing m−1 or fewer elements. Moreover, set J:={1,…,m−1} and β:=∑j∈Jαj. Then, by the base case, we have
Hence, since β+αm=α, we infer from the induction hypothesis that
(ii): Since (∀i∈I)αi=1, we have α=cardI, and thus
and hence 9 holds. Consequently, 10 follows from (i) and 9. ∎
We shall need the following identities involving convex cones.
Let K and S be nonempty closed convex cones in H. Then the following hold:
Take x∈H. (i): We derive from [4, Theorem 6.30(i)&(ii)] that ∥PKx∥2=⟨PKx∣PKx⟩=⟨x−PK⊖x∣PKx⟩=⟨x∣PKx⟩, as claimed. (ii): The Moreau conical decomposition () and (i) give
Let C be a nonempty closed convex subset of H. Then the following hold:
PC is 3∗ monotoneA monotone operator A:H→2H is 3∗ monotone if (∀(x,u)∈domA×ranA)inf(y,v)∈graA⟨x−y∣u−v⟩>−∞..
(i): See [4, Example 20.32]. (ii): Because PC 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. Then ran∑i∈IαiPCi=∑i∈IαiCi.
Suppose that (∀i∈I)αi⩾0 and that there exists a closed convex set C such that ∑i∈IαiPCi=PC. Then ∑i∈IαiCi is closed and C=∑i∈IαiCi.
(i): Let x be in H. Apply Lemma 2.1(i) to (x,(PCix),(αi)) and notice that (∀i∈I)∥x−PCix∥=dCi(x).
(ii): Because the operators (PCi) are 3∗ monotone by Fact 2.3(ii) and because (∀i∈I)domPCi=H, we derive from [9, Lemma 3.1(ii)] that ran∑i∈IαiPCi=∑i∈IαiranPCi=∑i∈IαiCi, as desired.
(iii): It follows from (ii) and our assumption that
Thus, we conclude that ∑i∈IαiCi=C and that ∑i∈IαiCi is closed. ∎
Proposition 2.4(ii)&(iii) may fail if (∃i∈I)αi<0. Indeed, in the setting of Proposition 2.4, suppose that I={1,2}, that C1=C2, and that α1=−α2=1. Then α1PC1+α2PC2=0=P{0}, but α1C1+α2C2=C1−C1={0} if C1 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, which implies that
Recall from [18, pp. 89–90] that, if f:H→]−∞,+∞], then the Fréchet subdifferential of f is
Main results
Let φ∈Γ0(H), let T:H→H, and set f:=φ∘T+q∘(Id−T). Then the following are equivalent:
T is monotone, gra(φ+ιranT) is a dense subset of graφ, and f is Gâteaux differentiable on H with ∇f=Id−T.
Furthermore, if (i) or (ii) holds, then f=envφ and f is Fréchet differentiable on H.
“(i)⇒(ii)”: First, by [4, Example 20.30], T=Proxφ is monotone. Next, since φ∈Γ0(H) and T=Proxφ, [4, Eq. (24.3)] gives ranT=dom∂φ, and hence, according to [4, Proposition 16.38], it follows that gra(φ+ιranT) is a dense subset of graφ. Finally, in view of [4, Remark 12.24], we see that f=φ∘T+q∘(Id−T)=φ∘Proxφ+q∘(Id−Proxφ)=envφ, and [4, Proposition 12.30] thus entails that f is Fréchet (thus Gâteaux) differentiable on H with ∇f=Id−Proxφ=Id−T.
“(i)⇐(ii)”: Set g:=q−f. Then, on the one hand, because q and f are Gâteaux differentiable, so is g. On the other hand, since ∇q=Id and ∇f=Id−T, we infer that ∇g=∇(q−f)=∇q−∇f=T, which is monotone by assumption. Altogether, [4, Proposition 17.7] yields the convexity of g. Therefore, since g is Gâteaux differentiable on H, it follows from [4, Proposition 17.48(i)] that g is lower semicontinuous on H. To sum up, we have shown that
Moreover, 24 and [4, Corollary 13.38] yield
In turn, set h:=g∗−q. Let us now establish that
Towards this goal, fix u∈ranT, say u=Tx=\lx@crefcreftyperefnume:info−g∇g(x), where x∈H. Then 24, [4, Proposition 17.35], and the very definitions of g and f assert that
Hence, 26 holds. Next, fix v∈domh, and we shall prove that φ(v)⩽h(v). Indeed, on the one hand, because h=g∗−q and domq=H, we have domh=domg∗. On the other hand, due to 24 and [4, Corollary 16.30], dom∂g∗=dom(∂g)−1=ran∂g, and since ran∂g=ran∇g=ranT thanks to 24 and [4, Proposition 17.31(i)], we deduce that dom∂g∗=ranT. Altogether, because v∈domh=domg∗, 25 and [4, Proposition 16.38] ensures the existence of a sequence (vn) in dom∂g∗=ranT such that vn→v and g∗(vn)→g∗(v). Therefore, by the definition of h, we get h(vn)=g∗(vn)−q(vn)→g∗(v)−q(v)=h(v). However, because {vn}⊆ranT and vn→v, the lower semicontinuity of φ and 26 imply that h(v)=limh(vn)=limφ(vn)⩾φ(v). Hence, we have established that
To this end, let w∈domφ. Then, since gra(φ+ιranT) is a dense subset of graφ by assumption, there exists a sequence (wn) in ranT such that wn→w and φ(wn)→φ(w). In turn, since h is lower semicontinuous by 25, we infer from 26 that φ(w)=limφ(wn)=limh(wn)⩾h(w), from which 29 follows. Consequently, combining 28 and 29 yields h=φ. Finally, since φ∈Γ0(H), it follows from 24, the definition of h, the Fenchel–Moreau theorem, and [4, Proposition 24.4] that Proxφ=∇(φ+q)∗=∇(h+q)∗=∇g∗∗=∇g=T, as desired. ∎
In , Zarantonello provided a necessary and sufficient condition in terms of a differential equation for an operator on 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 P in [26, Theorem 4.1] can be replaced by the Gâteaux one. By assuming the monotonicity of P 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, and set f:=q∘(Id−T). Then the following are equivalent:
T is monotone, f is Gâteaux differentiable on H, and ∇f=Id−T.
If (i) or (ii) holds, then ranT is closed and convex, T=PranT, and f=(1/2)dranT2 is Fréchet differentiable on H.
Set φ:=ιranT.
“(i)⇒(ii)”: Suppose that T=PC, where C is convex, closed, and nonempty. Then clearly ranT=ranPC=C is closed and convex. This implies that φ=ιranT∈Γ0(H) and that T=PranT=ProxιranT=Proxφ. In turn, because f=φ∘T+q∘(Id−T) by the definition of φ, we infer from Theorem 3.1 that (ii) holds and, moreover, f=envφ=envιranT=(1/2)dranT2 is Fréchet differentiable on H.
“(i)⇐(ii)”: We first show that ranT is convex. Indeed, by our assumption, q−f is Gâteaux differentiable on H with
Thus, since T is monotone, [4, Proposition 17.7] ensures that q−f is convex, and thus, the Gâteaux differentiability of q−f and [4, Proposition 17.48(i)] imply that q−f∈Γ0(H). Hence, due to 30 and [4, Proposition 17.31(i)], Moreau’s theorem asserts that T=∇(q−f) is maximally monotone. Consequently, [4, Corollary 21.14] yields the convexity of ranT, as claimed. In turn, on the one hand, this implies that φ=ιranT∈Γ0(H). On the other hand, we deduce from the definition of φ that f=φ∘T+q∘(Id−T) and gra(φ+ιranT)=gra(ιranT∩ranT)=graιranT=ranT×{0} is a dense subset of ranT×{0}=graιranT=graφ. Thus, the implication “(ii)⇒(i)” of Theorem 3.1 and our assumption guarantee that T=Proxφ=ProxιranT=PranT, which completes the proof. ∎
Consider the implication “(ii)⇒(i)” of Theorem 3.2. If we merely assume that T is defined on a proper open subset D of H, then, although there may exist a closed set C such that T is the restriction to D of the projector onto C, the set C may fail to be convex. An example can be constructed as follows. Suppose that H={0}, and set
i.e., C is the unit sphere of H. Then clearly C is a closed nonconvex set and T is the restriction to H∖{0} of the set-valued projector PC. Thus, in the light of [4, Example 20.12], T 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, we infer that f is Fréchet differentiable on H∖{0} and
We do not know whether the monotonicity of T 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 FixT in the absence of monotonicity.
However, because ∇f=F, a direct computation gives
Let T:H→H, and set f:=q∘(Id−T). Suppose that f is Fréchet differentiable on H with ∇f=Id−T. Then FixT=∅.
Now let ε∈]0,1[. Since g is bounded below and continuous, Ekeland’s variational principle (see, e.g., [4, Theorem 1.46(iii)]) applied to g and (α,β)=(ε2,ε) yields the existence of z∈H such that (∀x∈H∖{z})g(z)+εd{z}(z)=g(z)<g(x)+εd{z}(x). This guarantees that z is the unique minimizer of g+εd{z}. Thus, [18, Proposition 1.114], Lemma 2.8, and 35 imply that
which is absurd since ε∈]0,1[ and ∥(z−Tz)/(∥z−Tz∥)∥=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) T is Lipschitz continuous, then FixT=∅. However, we do not need the Lipschitz continuity of T in our proof.
Suppose, in addition, that ∇f is continuous. Then we obtain an alternative proof as follows. Assume to the contrary that FixT=∅. Then g:=⋅∘(2f) is continuously Fréchet differentiable on H (hence continuous) with
Fix ε∈]0,1[. Since g is bounded below and continuous, Ekeland’s variational principle implies that there exists z∈H such that (∀x∈H∖{z})g(z)+εd{z}(z)=g(z)<g(x)+εd{z}(x). Thus, z is a minimizer of g+εd{z}(z). Therefore, because d{z} 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[.
By specializing Theorem 3.2 to positively homogeneous operators on H, we obtain a characterization for projectors onto closed convex cones.
Let T:H→H and set f:=q∘T. Then the following are equivalent:
There exists a nonempty closed convex cone K such that T=PK.
T is monotone and positively homogeneous, f is Gâteaux differentiable on H, and ∇f=T.
If (i) or (ii) holds, then K=ranT.
“(i)⇒(ii)”: Clearly ranT=ranPK=K. Now, it follows from [4, Example 20.32] that T=PK is monotone. Next, because K is a nonempty closed convex cone, [4, Proposition 29.29] guarantees that T is positively homogeneous. In turn, since f=q∘T=q∘PK, [4, Proposition 12.32 and Lemma 2.61(i)] yield the Gâteaux differentiability of f and, moreover, ∇f=∇(q∘PK)=PK=T, as desired.
“(i)⇐(ii)”: First, since T is positively homogeneous,
In Corollary 3.8, if T 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⊥, where V is a closed linear subspace of H, see, e.g., [24, Theorem 4.29].
Let L:H→H. Then the following are equivalent:
There exists a closed linear subspace V of H such that L=PV.
L∈B(H) and L=L∗=L2.
L∈B(H) and L=L∗L.
If one of (i), (ii) and (iii) holds, then V=ranL.
“(i)⇒(ii)”: See, e.g., [4, Corollary 3.24(iii)&(vi)]. Moreover, it is clear that ranL=ranPV=V.
“(iii)⇒(i)”: On the one hand, because L∈B(H), we deduce from [4, Example 20.16(ii)] that L=L∗L is monotone. On the other hand, since L∈B(H), [4, Example 2.60] and our assumption imply that q∘L is Fréchet differentiable on H and ∇(q∘L)=L∗L=L. Altogether, because L is clearly positively homogeneous, we obtain the conclusion via Corollary 3.8. ∎
Set T:=∑i∈IαiPCi, set f:=q∘(Id−T), and define
Now assume that there exists a nonempty closed convex subset C of H such that T=PC. Then, due to Fact 2.3(i), we see that T is monotone. Next, on the one hand, since T=PC, it follows from Theorem 3.2 that f is Fréchet differentiable on H and ∇f=Id−T=Id−∑i∈IαiPCi. On the other hand, for every i∈I, since Ci is convex, closed, and nonempty, we infer from Theorem 3.2 (applied to PCi) that dCi2=2q∘(Id−PCi) is Fréchet differentiable on H with ∇dCi2=2(Id−PCi). Altogether, since α=∑i∈Iαi by definition, it follows from 43 that g is Fréchet differentiable on H and that
and it thus follows that f is Fréchet differentiable on H and, since α=∑i∈Iαi, ∇f=∑i∈Iαi(Id−PCi)−(α−1)Id=Id−∑i∈IαiPCi=Id−T. Hence, since T is monotone by our assumption, Theorem 3.2 ensures the existence of a nonempty closed convex set C such that T=PC. Therefore, f=q∘(Id−PC)=(1/2)dC2 and 41 follows from 45. ∎
As we have seen in Remark 2.5, the set C in Theorem 3.10 need not be ∑i∈IαiCi.
We now establish a necessary and sufficient condition under which a finite sum of projectors is a projector.
in which case, ∑i∈ICi is a closed convex set,
Since it is clear that ∑i∈IPCi is monotone, we derive from Theorem 3.10 (applied to (Ci), (αi)=(1), and α=cardI=∑i∈I1) and 9 that
According to Proposition 2.4(iii) and 50, we see that ∑i∈ICi=C is a closed convex set, from which and 50 we get 47. Furthermore, it follows from 10 and 51 that
Let C and D be nonempty closed convex subsets of H. Then the following are equivalent:
If (i) or (ii) holds, then C+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 γ in Corollary 3.13 can take on any value.
Let u and v be in H, set C:={u}, and set D:={v}. Then clearly PC+PD=P{u+v}=PC+D and (∀x∈H)⟨PCx∣PDx⟩=⟨u∣v⟩.
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 C and D be nonempty closed convex subsets of H such that C⊥D. Then the following hold:
dC+D2=dC2+dD2−2q.
Since (∀x∈H)⟨PCx∣PDx⟩=0, the conclusions readily follow from Corollary 3.13. ∎
We now provide an instance where item (ii) of Corollary 3.13 holds, C⊈D⊥ in general, and neither C nor D is a cone.
We next establish a necessary and sufficient condition for u+PC to be a projector.
Let C be a nonempty closed convex subset of H, and let u∈H. Then, since (∀x∈H)u=P{u}x, we deduce from Corollary 3.13 that
in which case, u+PC=Pu+C due to Corollary 3.13.
Consider the setting of Example 3.18. Since u+PC is monotone, nonexpansive, and a sum of proximity operators, [2, Corollary 2.5] guarantees that u+PC is a proximity operator. However, by Example 3.18, it is not a projector unless u∈(C−C)⊥.
Here is a sufficient, but not necessary, condition for a sum of projectors to be a projector.
Set (∀k∈I)Dk:=∑i=1kCi, and let us establish that
Due to Corollary 3.13, the claim holds if k=2, and we therefore assume that, for some k∈{2,…,m−1}, Dk is a closed convex set and that ∑i=1kPCi=PDk. Then, by our assumption, (∀x∈H)⟨PDkx∣PCk+1x⟩=∑i=1k⟨PCix∣PCk+1x⟩=∑i=1kγi,k+1, from which and Corollary 3.13 (applied to Dk and Ck+1) we infer that Dk+1=Dk+Ck+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. Hence, letting k=m in 58 yields the conclusion. ∎
We now illustrate that the assumption of Corollary 3.20 need not hold when merely ∑i∈IPCi=PC.
Let C be a nonempty closed convex subset of H such that H∖(C−C)⊥=∅, and suppose that u∈H∖(C−C)⊥. Then P{u}+P{−u}+PC=PC is a projector. However, if x↦⟨P{u}x∣PCx⟩=⟨u∣PCx⟩ were a constant, then it would follow from Corollary 3.13 that u+PC=P{u}+PC is a projector, which violates Example 3.18 and the assumption that u∈/(C−C)⊥.
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) be a finite family of firmly nonexpansive operators from H to H, let (αi) be real numbers in ]0,1] such that ∑i∈Iαi=1, and let C be a nonempty closed convex subset of H. Then ∑i∈IαiTi=PC if and only if there exist vectors (ui) in H such that (∀i∈I)Ti=PC+ui and ∑i∈Iαiui=0.
Let C and D be nonempty closed convex subsets of H, and set v:=PD−C0. Then the following hold:
Let (cn) and (dn) be sequences in C and D, respectively, and suppose that dn−cn→v. Then dn−PCdn→v.
Suppose that there exists u∈H such that PD=PC+u. Then u=v∈(C−C)⊥ and D=C+v.
(ii): Since PD=PC+u, Example 3.18 guarantees that u∈(C−C)⊥ and that D=C+u. Hence, it suffices to show that u=v. Indeed, since v=PD−C0∈D−C, there exist sequences (cn) in C and (dn) in D such that dn−cn→v. Thus, we deduce from (i) that
Let (Ci) be a finite family of nonempty closed convex subsets of H, let k∈I, and set (∀i∈I)vi:=PCi−Ck0. Then the following are equivalent:
For every i∈I, we have vi∈(Ck−Ck)⊥ and Ci=Ck+vi.
“(i)⇒(iii)”: Suppose that there exist (αi)∈]0,1]I and a nonempty closed convex subset C of H such that ∑i∈Iαi=1 and ∑i∈IαiPCi=PC. Then, since (PCi) are firmly nonexpansive by [4, Proposition 4.16], Fact 4.1 guarantees the existence of vectors (ui) in H such that
Now fix i∈I. We then derive from 61 that PCi=(PCk−uk)+ui=PCk+ui−uk, and it thus follows from Lemma 4.2(ii) (applied to (Ck,Ci,ui−uk)) that vi∈(Ck−Ck)⊥ and Ci=Ck+vi, as required.
To complete the proof, we shall show that (ii)⇔(iii).
“(iii)⇒(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 C be a nonempty closed convex subset of H, and let u∈H. Then the affine combination of (PC,PC,P{u}) with weights (1/4,−1/4,1) is a projector since (1/4)PC−(1/4)PC+P{u}=P{u}. However, Theorem 4.3(iii) fails when C is not a singleton.
Here are some direct consequences of Theorem 4.3.
Let k∈I and let i∈I. Since Ck∩Ci=∅ by assumption, we see that PCi−Ck0=0, and thus, due to our assumption, the implication “(i)⇒(iii)” of Theorem 4.3 yields Ci=Ck, as desired. ∎
Let C and D be nonempty closed convex subsets of H. Then the following are equivalent:
PD−C0∈(C−C)⊥ and D=C+PD−C0.
This follows from the equivalences “(ii)⇔(iii)⇔(iv)” of Theorem 4.3. ∎
We now specialize Corollary 4.6 to get a result on scalar multiples of projectors.
Let D={0} 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 K1 and K2 be nonempty closed convex cones in H, and set
The chain of implications “(i)⇒(ii)⇒(iii)” is clear.
“(iv)⇒(i)”: First, take u∈K1. Since K2⊆K1 and K1 is a convex cone by assumption, it follows that u+K2⊆K1+K1⊆K1, and therefore u∈K. Conversely, fix u∈K. Because u+K2⊆K1 and 0∈K2, we deduce that u∈K1, which completes the proof. ∎
Let C and D be nonempty closed convex subsets of H, and set
Suppose that C and D are cones and D⊆C⊖. Then h=ιC⊖∩D⊖.
(i): Since D is convex, closed, and nonempty, we see that ιD∈Γ0(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) and q∗=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⊖, Lemma 5.1 (applied to the pair of closed convex cones (C⊖,D)) yields
Next, we derive from (i) and [4, Example 13.3(ii)] that
Now fix u∈H, and let us consider two alternatives.
(a) u∈H∖C⊖: In view of 66bo, there exists v∈D such that u+v∈H∖C⊖, and therefore, by 66bp, h(u)⩾ιC⊖(u+v)+⟨u∣v⟩=+∞.
(b) u∈C⊖: Then, by 66bo, u+D⊆C⊖. Hence, since D is a nonempty cone, it follows from 66bp and [4, Example 13.3(ii)] that h(u)=supv∈D⟨u∣v⟩=σD(u)=ιD⊖(u)=ιC⊖∩D⊖(u).
Altogether, we obtain the desired conclusion. ∎
Here is the first main result of this section. The proof of the implication “(v)⇒(i)” was inspired by [2, Lemma 5.3].
Let K1 and K2 be nonempty closed convex cones in H. Then the following are equivalent:
K1+K2 is closed and PK1+PK2=PK1+K2.
There exists a nonempty closed convex cone K such that PK1+PK2=PK.
PK1+PK2 is a proximity operator of a function in Γ0(H).
Id−PK1−PK2 is monotone.
(∀x∈H)⟨PK1x∣PK2x⟩=0.
Furthermore, if one of (i), (ii), (iii), (iv), (v) and (vi) holds, then
The chain of implications “(i)⇒(ii)⇒(iii)⇒(iv)” is clear, and the implication “(iv)⇒(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⊖. To do so, we derive from the monotonicity of Id−PK1−PK2 and Moreau’s conical decomposition that
Thus, because K1⊖ and K2 are closed convex cones, [26, Lemma 5.6] guarantees that K2⊆K1⊖, from which and Proposition 5.2(ii) we deduce that
as claimed. Next, by Theorem 3.2 (respectively applied to PK1 and PK2), f is Fréchet differentiable on H (hence continuous) and
which is monotone by assumption. Therefore, in view of [4, Proposition 17.7(iii)], f is convex, and so f∈Γ0(H). In turn, because f∗=h+q=ιK1⊖∩K2⊖+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. Hence, by 66bv and [4, Corollary 12.31], we obtain Id−PK1−PK2=∇f=Id−(Id−PK1⊖∩K2⊖)=PK1⊖∩K2⊖. 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. Consequently, Proposition 2.4(iii) asserts that K1+K2 is closed, and therefore, PK1+PK2=PK1+K2, as desired. To summarize, we have shown the equivalences of (i)–(v).
“(i)⇔(vi)”: Follows from Corollary 3.13 and the fact that ⟨PK10∣PK20⟩=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)⇒(i)” of Theorem 5.3 fail, as illustrated by the following example.
Let K be a nonempty closed convex cone in H, and let u∈H. Then, by Moreau’s conical decomposition, Id−PK−P{u}=PK⊖−u, which is clearly monotone. However, owing to Example 3.18, P{u}+PK=u+PK is not a projector provided that u∈/(K−K)⊥.
Here is an instance where the projector onto the intersection can be expressed in term of the individual projectors.
Let K1 and K2 be nonempty closed convex cones in H. Then the following are equivalent:
PK1∩K2=PK1+PK2−Id.
PK1+PK2−Id is monotone.
(∀x∈H)∥PK1x∥2+∥PK2x∥2=∥x∥2+⟨PK1x∣PK2x⟩.
We first deduce from the Moreau conical decomposition and [4, Proposition 6.35] that
“(i)⇔(ii)”: Denote by C the class of nonempty closed convex cones in H. Then, because the mapping C→C:K↦K⊖ is bijective due to [4, Corollary 6.34], we derive from 66bwd, the equivalence “(i)⇔(ii)” of Theorem 5.3, and the Moreau conical decomposition that
where the last equivalence follows from the fact that PK1+PK2−Id is positively homogeneous.
“(i)⇔(iii)”: Since Id−(PK1⊖+PK2⊖)=PK1+PK2−Id by Moreau’s decomposition, this equivalence is a consequence of 66bwd and the equivalence “(ii)⇔(v)” of Theorem 5.3 (applied to (K1⊖,K2⊖)).
“(i)⇔(iv)”: This readily follows from 66bwd, the equivalence “(ii)⇔(vi)” of Theorem 5.3 (applied to (K1⊖,K2⊖)), and Lemma 2.2(ii). ∎
By replacing (K1,K2) by (K1,K2⊖) 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 K1 and K2 be nonempty closed convex cones in H. Then PK2PK1=PK2 if and only if PK1−PK2 is a projector onto a closed convex set; in which case, PK1−PK2=PK1∩K2⊖.
First, suppose that PK2PK1=PK2. Then, by [4, Theorem 6.30(i)&(iii)] and Lemma 2.2(i),
Hence, the equivalence “(i)⇔(iv)” of Corollary 5.5 (applied to (K1,K2⊖)) yields PK1−PK2=PK1+PK2⊖−Id=PK1∩K2⊖, as desired. Conversely, assume that PK1−PK2 is a projector associated with a closed convex set. Since PK1−PK2=PK1+PK2⊖−Id, it follows from the equivalence “(i)⇔(ii)” of Corollary 5.5 (applied to (K1,K2⊖)) that
Now take x∈H. On the one hand, because PK1∩K2⊖+PK2=(PK1−PK2)+PK2=PK1 by 66bz, we infer from Theorem 5.3 that PK1∩K2⊖x⊥PK2x or, equivalently, by 66bz, (PK1x−PK2x)⊥PK2x. On the other hand, 66bz implies that PK1x−PK2x∈K2⊖. Altogether, since clearly PK2x∈K2, [4, Proposition 6.28] asserts that PK2PK1x=PK2x, 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)⇔(iii)” of the following result was obtained by Zarantonello with a different proof (see [26, Theorem 5.5]).
Let (Ki) be a family of nonempty closed convex cones in H. Then the following are equivalent:
For every (i,j)∈I×I such that i=j, we have (∀x∈H)⟨PKix∣PKjx⟩=0.
∑i∈IKi is closed and ∑i∈IPKi=P∑i∈IKi.
∑i∈IPKi is a projection onto a closed convex cone in H.
∑i∈IPKi is a proximity operator of a function in Γ0(H).
For every nonempty subset J of I, ∑j∈JPKj is a proximity operator of a function in Γ0(H).
For every nonempty subset J of I, ∑j∈JKj is closed and ∑j∈JPKj=P∑j∈JKj.
For every (i,j)∈I×I such that i=j, we have PKi+PKj is nonexpansive.
For every (i,j)∈I×I such that i=j, we have Id−PKi−PKj is monotone.
“(i)⇒(ii)”: A direct consequence of Corollary 3.20.
“(ii)⇒(iii)” and “(iii)⇒(iv)”: Clear.
“(iv)⇒(v)”: Let f∈Γ0(H) be such that ∑i∈IPKi=Proxf. Then, by Moreau’s decomposition (), ∑i∈IPKi+Proxf∗=Proxf+Proxf∗=Id. Therefore, since {PKi} are proximity operators, the conclusion follows from [2, Theorem 4.2].
“(vii)⇒(viii)”: See [4, Example 20.7].
“(viii)⇒(i)”: This is the implication “(v)⇒(vi)” of Theorem 5.3.
To sum up, we have shown the equivalence of (i)–(viii) except for (vi).
“(v)⇔(vi)”: Follows from the equivalence “(ii)⇔(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∥v. Then, by the Cauchy–Schwarz inequality, ⟨w∣u⟩=∥v∥∥u∥2+∥u∥⟨u∣v⟩⩾∥v∥∥u∥2−∥u∥(∥u∥∥v∥)=0 and ⟨w∣v⟩=∥v∥⟨u∣v⟩+∥u∥∥v∥2⩾−∥v∥(∥u∥∥v∥)+∥u∥∥v∥2=0. Hence, due to [4, Example 29.31], we obtain
from which we derive the following conceivable cases.
(a) ⟨u∣v⟩=0: Then u⊥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∈IPKi. Then, Theorem 5.7 ensures that,
The one-dimensional case
The goal of this section is to describe all pairs (C,D) on the real line such that PC+PD=PC+D. We begin with a simple observation.
If C={0} or D={0}, then clearly PC+PD=PC+D. Thus, we henceforth assume in this section that
Here is a sufficient condition under which PC+PD=PC+D.
Suppose that C∩D={0}. Then the following hold:
Exactly one of the following cases occurs:
C+D is closed and PC+PD=PC+D.
Here is a direct consequence of Proposition 6.2(i).
Suppose that C∩D=∅. Then
where CD:={ξη∣ξ∈Candη∈D}.
The next result classifies all pairs (C,D) such that PC+PD=PC+D. Item (ii) is a partial converse of Proposition 6.2.
Neither C nor D is a singleton and C∩D={0}.
(i): Suppose that C={ω}, where ω=0 due to 66ci. Then, for every ξ∈D and every η∈D, since PCξ=PCη=ω, 66ck implies that ωξ=ωPDξ=ωPDη=ωη, and because ω=0, it follows that ξ=η. Therefore, D is a singleton, as required.
Without loss of generality, we may and do assume that
Then 66cl asserts that C is bounded above and D is bounded below, and because they are closed, we infer that supC=maxC and infD=minD. Let us consider the following conceivable cases.
(a) maxC=0: Then minD=0 (otherwise 0∈C∩D, which is absurd). Because C is not a singleton, we can find ξ1∈C and ξ2∈C such that ξ1=ξ2. In turn, due to 66cl and 66cm, (∀i∈{1,2})ξi⩽β/μ⩽minD, from which and [4, Example 24.34(i)] we deduce that PDξ1=PDξ2=minD. Consequently, since {ξ1,ξ2}⊆C, 66ck implies that ξ1minD=⟨PCξ1∣PDξ1⟩=⟨PCξ2∣PDξ2⟩=ξ2minD, and since minD=0, it follows that ξ1=ξ2, which is impossible.
(b) maxC=0: Since D is not a singleton, there are η1∈D and η2∈D such that η1=η2. In turn, we infer from 66cl&66cm that (∀i∈{1,2})maxC⩽β/μ⩽ηi, and therefore [4, Example 24.34(i)] yields PCη1=PCη2=maxC. Thus, by 66ck and the fact that {η1,η2}⊆D, , we see that (maxC)η1=⟨PCη1∣PDη1⟩=⟨PCη2∣PDη2⟩=(maxC)η2. Consequently, since maxC=0, it follows that η1=η2, which is absurd.
Let us next verify that C∩D is a singleton. To this end, take ξ∈C∩D and η∈C∩D, and let ε∈]0,1[. On the one hand, by 66ck, we see that
On the other hand, since C∩D is convex and ε∈]0,1[, (1−ε)ξ+εη∈C∩D. Altogether, ξ2=[(1−ε)ξ+εη]2 or, equivalently, ε(ξ−η)[(2−ε)ξ+εη]=ξ2−[(1−ε)ξ+εη]2=0. Interchanging ξ and η yields ε(η−ξ)[(2−ε)η+εξ]=0, and upon adding these equalities, we obtain ε(ξ−η)(2(1−ε)ξ−2(1−ε)η)=0, i.e., 2ε(1−ε)(ξ−η)2=0. Therefore, ξ=η and C∩D is thus a singleton, say
It remains to show that ω=0. Since C is not a singleton, there exists ξ∈C∖{ω}. In turn, because C∩D={ω}, we derive from [4, Proposition 24.47] (applied to (Ω,ϕ)=(D,ιC)) and 66ck&66co that ξω=⟨PCξ∣PC∩Dξ⟩=⟨PCξ∣PD(PCξ)⟩=⟨PCξ∣PDξ⟩=γ=ω2. Thus, ω(ξ−ω)=0, and since ξ=ω, it follows that ω=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 C be a nonempty closed convex subset of H, and let K be a nonempty closed convex cone in H. Suppose that there exits a closed convex set D such that PC+PK=PD. Then C⊆K⊖.
The following example shows that the conclusion of Proposition 7.1 is merely a necessary condition for PC+PK=PC+K even when C 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 C be a nonempty closed convex subset of H, and let V be a closed linear subspace of H. Then the following are equivalent:
There exists a closed convex set D such that PC+PV=PD.
Moreover, if (i) and (ii) hold, then D=C+V and PC+PV=PC+V.
“(i)⇒(ii)”: It follows from Corollary 3.13 that D=C+V and that PC+PV=PC+V. Now, by Proposition 7.1 and [4, Proposition 6.23], we obtain C⊆V⊖=V⊥.
“(ii)⇒(i)”: Immediate from Corollary 3.16. ∎
However, replacing the subspace V in Corollary 7.3 by cone might not work. The following simple example shows that the implication “(i)⇒(ii)” of Corollary 7.3 may fail even when C and V 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) be a finite family of closed linear subspaces of H. Then ∑i∈IPVi is a projector associated with a closed linear subspace if and only if, for every (i,j)∈I×I with i=j, we have Vi⊥Vj.
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.