A stand-alone analysis of quasidensity
Stephen Simons

TL;DR
This paper explores the concept of quasidensity in Banach spaces, establishing new connections with type (NI) sets, and provides sum theorems for coincidence sets, advancing the understanding of monotone multifunctions.
Contribution
It introduces new results on quasidensity, clarifies the relationship with type (NI), and proves sum theorems for coincidence sets, independent of previous Banach SN space work.
Findings
Quasidensity and type (NI) are not equivalent without monotonicity.
New sum theorems for coincidence sets are established.
Enhanced understanding of Fitzpatrick extension of quasidense monotone multifunctions.
Abstract
In this paper we consider the "quasidensity" of a subset of the product of a Banach space and its dual, and give a connection between quasidense sets and sets of "type (NI)". We discuss "coincidence sets" of certain convex functions and prove two sum theorems for coincidence sets. We obtain new results on the Fitzpatrick extension of a closed quasidense monotone multifunction. The analysis in this paper is self-contained, and independent of previous work on "Banach SN spaces". This version differs from the previous version because it is shown that the (well known) equivalence of quasidensity and "type (NI)" for maximally monotone sets is not true without the monotonicity assumption and that the appendix has been moved to the end of Section 10, where it rightfully belongs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Banach Space Theory · Optimization and Variational Analysis
A stand–alone analysis of quasidensity
Stephen Simons
Department of Mathematics, University of California, Santa Barbara, CA 93106-3080, U.S.A. Email: [email protected].
Abstract
In this paper we consider the “quasidensity” of a subset of the product of a Banach space and its dual, and give a connection between quasidense sets and sets of “type (NI)”. We discuss “coincidence sets” of certain convex functions and prove two sum theorems for coincidence sets. We obtain new results on the Fitzpatrick extension of a closed quasidense monotone multifunction. The analysis in this paper is self-contained, and independent of previous work on “Banach SN spaces”.
2010 Mathematics Subject Classification: Primary 47H05; Secondary 47N10, 52A41, 46A20.
Keywords: Banach space, Fenchel conjugate, quasidensity, multifunction,maximal monotonicity, sum theorem, subdifferential.
1 Introduction
In this paper we suppose that is a nonzero real Banach space with dual . In [22], we defined the quasidensity of a subset of . This was actually a special case of the concept of the –density of a subset of a Banach SN space that had been previously defined in [21], and the analysis in [22] was heavily dependent on [21]. The purpose of this paper is to give a development of the properties of quasidensity that is independent of [21]. This paper also contains many results that did not appear in [22].
In Section 2, we discuss proper convex functions on a Banach space and their Fenchel conjugates and biconjugates. We also introduce the (well known) canonical map from a Banach space into its bidual, which we denote by . In Theorems 2.1 and 2.3 and Lemma 2.2, we discuss some subtler properties of proper convex functions that are not necessarily lower semicontinuous. These subtler properties will be used in Theorem 4.11.
In Section 3, we discuss Banach spaces of the form . For this kind of Banach space, there is a (not so well known) canonical map from the space into its dual, which we denote by (see (3.1)). We define the quasidensity of of a subset of (or, equivalently, of a multifunction from into ) inDefinition 3.1. The definition of quasidensity does not require monotonicity, though there is a rich theory of the interaction of quasidensity and monotonicity which we will discuss in Sections 6–12 — the definition of monotonicity does not actually appear until Section 6. Lemma 3.3, Theorem 3.5 and Corollaries 3.7 and 3.9 contain useful results on quasidensity without a monotonicity assumption. In particular, Theorem 3.5 says that “preserves quasidensity”, and we establish in Corollary 3.7 that every quasidense set is of type (NI), a concept that has been extensively studied over the past two decades. We will return to this issue below. We mention in Example 3.2 that the subdifferential of a proper, convex, lower semicontinuous function on is quasidense. This result is generalized in [23] to certain more general subdifferentials of nonconvex functions.
In Section 4, we initiate the theory of the coincidence sets of certain convex functions. The basic idea is that we consider a proper convex function, , on that dominates the canonical bilinear form, , and the corresponding coincidence set is the set on which and coincide. (The “” in this notation stands for “quadratic”.) The main results in this section (and the pivotal results of this paper) are Theorem 4.4 (the primal condition for quasidensity),Theorem 4.8 (the dual condition for quasidensity) and Theorem 4.11 (the theorem of the three functions). As we observed above, the definition of monotonicity is not used explicitly before Section 6, but monotonicity is hiding below the surface because, as we shall see in Lemma 6.2, coincidence sets are monotone.
In Section 5, we investigate the coincidence sets of the partial episums of a pair of convex functions. This analysis will lead to the two sum theorems for quasidense maximally monotone multifunctions that we will establish in Theorem 7.3 and Theorem 9.1.
We start our explicit discussion of monotonicity in Section 6. We prove in Theorem 6.1 that every closed, monotone quasidense multifunction is maximally monotone. On the other hand, we give examples of varying degrees of abstraction in Example 8.8 and Theorems 10.3, 11.4(b) and 12.3 of maximally monotone linear operators that are not quasidense. The link between Section 4 and Section 6 is provided by Lemma 6.2, in which we give a short proof of the result first established by Burachik–Svaiter and Penot that coincidence sets are monotone. So suppose that is monotone and . In Definition 6.3, we define the function, , by adapting Definition 3.8. The well known Fitzpatrick function, , is defined in Definition 6.4 by . There is a short history of the Fitzpatrick function in Remark 6.5. Now let be maximally monotone. Then we prove in Theorem 6.7 that is quasidense if, and only if, on , and we prove in Theorem 6.12 that is quasidense if, and only if, on . These two results enable us to give two partial converses to Theorem 6.1 in Corollaries 6.8 and 6.13, namely that if is maximally monotone and surjective then is quasidense and that if is reflexive and is maximally monotone then is quasidense. Theorem 6.12 is particularly significant because it shows that a maximally monotone multifunction is quasidense exactly when it is of type (NI).
In Section 7, we prove the Sum theorem with domain constraints that was established in [21]. It is important to realize that we do not merely give sufficient conditions for a sum theorem for a pair of maximally monotone multifunctions to hold. In fact, we prove that, under the given conditions, the sum of a pair of closed, monotone and quasidense multifunctions is again closed, monotone and quasidense.
In Section 8, we discuss the Fitzpatrick extension of a closed, monotone and quasidense multifunction. This will be needed for our analysis of the Sum theorem with range constraints that will be the topic of Section 9. If is closed, monotone and quasidense then the Fitzpatrick extension, , of is defined formally in terms of in (8.1), and we give two other characterization of in (8.2). We prove in Theorem 8.2 that is maximally monotone, but we will see in Example 8.8, Theorems 11.4(b) and 12.3 that it may fail to be quasidense. (It is observed in Remark 8.4, that exactly when is in the Gossez extension of ). is defined in rather an abstract fashion, but we give a situation in Theorem 8.5 in which we can give a more explicit description of . Theorem 8.5 was obtained by analyzing some results of Bueno and Svaiter on linear multifunctions, which we will discuss in greater detail in Section 11. Theorem 8.5 does not have any linearity assumptions, but Theorem 8.7 is an application to linear maps.
In Section 9, we prove the Sum theorem with range constraints that was first established in [21].
In Section 10, we discuss a slight modification of an example due to Bueno and Svaiter of a non-quasidense maximally monotone skew linear operator from a subspace of into . In Section 11 we discuss a procedure due to Bueno and Svaiter for constructing quasidense linear maps from a Banach space into its dual with a non-quasidense Fitzpatrick extension. In Section 12, we give a specific example of the construction of Section 11, a map from into .
Given a maximally monotone multifunction, there are a number of conditions that are equivalent to its quasidensity. Broadly speaking, they separate into two classes, depending on whether or not they use the bidual in their definition.
Conditions that do not use the bidual include the negative alignment condition (see [21, Theorem 11.6, p. 1045]), two “fuzzy” criteria for quasidensity (in which an element of is replaced by a nonempty –compact convex subset of , or an element of is replaced by a nonempty –compact convex subset of — see [22, Section 8, pp. 14–17]) and the type (FP) condition (see [22, Section 10, pp. 20–22]).
There are many classes of maximally monotone multifunctions coinciding with those of type (FP) in the literature that do require the bidual in theirdefinitions. We mention type (D), dense type, type (ED) and Type (NI). These equivalences have been known for some time. See [22, Introduction, pp. 6–7] for a discusion of these with references to the sources of these results.
The bidual is not mentioned explicitly in the statements of Theorem 5.2, Corollary 6.8 or Theorem 7.3, but our proofs of all of these results ultimately depend on the bidual at one point or another. This raises the fascinating question whether there are proofs of any of these results that do not depend on the bidual. This seems to be quite a challenge. Another similar challenge is to find a proof that does not depend on the bidual of the fact that a maximally monotone multifunction is quasidense if, and only if, it is of type (FP). Of course, such a proof could not go through the equivalence of both of these classes of multifunctions with those of type (NI).
It was proved in [21, Theorem 11.9, pp. 1045–1046] that every closed,monotone quasidense multifunction is of type (ANA). It was also proved in [22, Theorem 7.2, p. 14 and Theorem 8.5, pp. 16–17] that every closed, monotone quasidense multifunction is of type (FPV), and strongly maximal. These observations lead to the three interesting problems of finding maximally monotone multifunctions that fail to be in any of these three classes.
The author would like to thank Orestes Bueno for a very interestingdiscussion, which led to the analysis that we present in Theorem 8.5 andSections 11 and 12. This discussion took place during the author’s stay in the Erwin Schrodinger International Institute for Mathematics and Physics of the University of Vienna in January-February, 2019. The author would like to express his sincere appreciation to the Erwin Schrodinger Institute for their support.
All vector spaces in this paper are real.
2 Fenchel conjugates
We start off by introducing some Banach space notation. If is a nonzero Banach space and , we write for \big{\{}x\in X\colon\ f(x)\in\mathbb{R}\big{\}}. is the effective domain of . We say that is proper if . We write for the set of all proper convex functions from into and for the set of all proper convex lower semicontinuous functions from into . We write for the dual space of (with the pairing ). If then, as usual, we define the Fenchel conjugate, , of to be the function on given by
[TABLE]
stands for the bidual of (with the pairing ). If then, according to (2.1), we define the Fenchel conjugate, , of to be the function on given by
[TABLE]
So, if and we interpret to mean then is the function on given by
[TABLE]
If , we write for the canonical image of in , that is to say
[TABLE]
If , we write for the epigraph of ,
[TABLE]
If , the lower semicontinuous envelope of , , is defined by . See [26, p. 62]. Of course, to make this definition legitimate, some effort has to be made to show that is the epigraph of a function. Since is closed, is lower semicontinuous. It is worth pointing out that if is a discontinuous linear functional then on .
Theorem 2.1**.**
Let . Let be lower semicontinuous and on . Then on and on . It follows from this that and on .
Proof.
We know from [26, Theorem 2.2.6(i), p. 62] that is convex. It follows from the hypotheses that and is closed in . Consequently, , from which on , as required.
If and then the Fenchel–Young inequality implies that on , so \hbox{\rm epi}\,h\subset\hbox{\rm epi}\,\big{(}x^{*}-h^{*}(x^{*})\big{)}. Since is continuous, \hbox{\rm epi}\,\big{(}x^{*}-h^{*}(x^{*})\big{)} is closed, thus , from which on . It follows easily that . Of course, this inequality persists even if , and so we have proved that on . This completes the proof of Theorem 2.1. ∎
The main tool in the proof of Theorem 2.1 was epigraphical analysis. The drawback of this method is that the definition of is not very intuitive. We now discuss a more explicit geometric method of obtaining the function required for Theorem 4.11, which we can actually express as a biconjugate. The preliminary work is done in Lemma 2.2 below, which is of independent interest.
We shall use Rockafellar’s version of the Fenchel duality theorem (which originally appeared in Rockafellar, [15, Theorem 3(a), p. 85]) in the following form: Let and be continuous. Then
[TABLE]
We could have used instead König’s sandwich theorem, a simple application of the Hahn–Banach theorem, see [9, Theorem 1.7, p. 112].
Lemma 2.2**.**
Let . Let be lower semicontinuous, on and . Then:
(a)* There exists such that on .*
(b)* There exists such that .*
Proof.
(a) Since the result is obvious if on , we can and will suppose that there exists such that . Let . It follows that . Since is lower semicontinuous, there exists such that and . Let . Let . We will show that
[TABLE]
This gives the desired result, with .
Case 1. () In this case, (2.4) is obvious since and .
Case 2. () In this case, , and so , hence . Again since and ,
[TABLE]
which gives (2.4).
Case 3. () Let . (unlike ) depends on . Here, the convexity of and the fact that on imply that
[TABLE]
Thus, from the choice of again,
[TABLE]
This is equivalent to the statement . Substituting , we see that
[TABLE]
We still have , and also . It follows that . Equivalently,
[TABLE]
(2.4) now follows by adding this to (2.5).
Now let . From (a), on , and so . (2.3) now gives such that . Since , , and thus we obtain (b). ∎
Theorem 2.3**.**
Let . Let , be lower semicontinuous and on . For all , let f(x):=\sup\nolimits_{x^{*}\in X^{*}}\big{[}\langle x,x^{*}\rangle-h^{*}(x^{*})\big{]}, i.e., . Then:
(a)* on , and so .*
(b)* and on .*
Proof.
(a) Let , and . Let and , so . Lemma 2.2(b) now gives such that . It is easily seen that this is equivalent to the statement that . (a) now follows by letting .
(b) From the Fenchel–Young inequality, for all , on , thus on , and so and on . On the other hand, for all , on , i.e., on thus, for all , f^{*}(x^{*})=\sup\nolimits_{X}\big{[}{x^{*}}-f\big{]}\leq h^{*}(x^{*}) on . Thus on , completing the proof of (b). ∎
3 , , and quasidensity
Now let be nonzero Banach space. For all , let , and represent by , under the pairing
[TABLE]
Define the linear map by
[TABLE]
Then
[TABLE]
We define the even real functions and on by and
[TABLE]
For all , , so
[TABLE]
We note for future reference that,
[TABLE]
Definition 3.1**.**
Let . We say that is quasidense (in ) if
[TABLE]
(The “” above follows since .) In longhand, (3.5) can be rewritten:
[TABLE]
Example 3.2** (Subdifferentials).**
Let be proper, convex and lower semicontinuous and be the usual subdifferential. Then isquasidense. There is an “elementary” proof of this in [22, Theorem 4.6]. There is also a more sophisticated proof based on Theorem 4.8 below in [21, Theorem 7.5, p. 1033]. We shall see in Theorem 6.1 below that this result generalizes Rockafellar’s maximal monotonicity theorem.
In fact, the “elementary” proof mentioned above can be generalized to some more general subdifferentials for non–convex functions. See Simons–Wang,[23, Definition 2.1, p. 633] and [23, Theorem 3.2, pp. 634–635].
The dual norm on is given by . Define the linear map by {\widetilde{L}}(x^{*},x^{**}):=\big{(}x^{**},\widehat{x^{*}}\big{)}. Then and .
One can easily verify the following generalization of (3.4):
[TABLE]
Lemma 3.3 below gives a very nice relationship between and quasidensity. It is the first of two preliminary results leading to the main result of this section, Theorem 3.5.
Lemma 3.3**.**
* is quasidense in . In other words:*
[TABLE]
In longhand, this can be rewritten:* for all ,*
[TABLE]
Proof.
Let . For all , the definition of provides such that and , from which . So
[TABLE]
This establishes (3.9), and hence (3.8). ∎
Lemma 3.4**.**
Let and . Then
[TABLE]
Let and . Then
[TABLE]
Proof.
From (3.7),
[TABLE]
This completes the proof of (3.10), and (3.11) follows from (3.10) with and ∎
We have the following fundamental result:
Theorem 3.5**.**
Let and be quasidense in . Then, for all , .
Proof.
Let and . Then, from Lemma 3.3 and Definition 3.1, there exist and then such that and . From (3.11), . ∎
The following definition was made in [17, Definition 10, p. 183]:
Definition 3.6**.**
Let . Then is of type (NI) if,
[TABLE]
In our current notation, (3.12) can be rephrased as
[TABLE]
“(NI)” stands for “negative infimum”. We note that is not constrained to be monotone in this definition.
Corollary 3.7**.**
Let and be quasidense in . Then is of type (NI).
Proof.
This is immediate from Theorem 3.5 and (3.13). ∎
There is another way of viewing Theorem 3.5. In order to explain this, we introduce the function . (Compare [21, Definition 6.2, p. 1029].)
Definition 3.8**.**
Let and . We define the function by:
[TABLE]
In longhand: for all ,
[TABLE]
Corollary 3.9**.**
Let and be quasidense in . Then on .
Proof.
Let . Then, from Definition 3.8 and (3.7),
[TABLE]
The result now follows since, from Theorem 3.5, . ∎
Remark 3.10**.**
Corollary 3.9 will be used in Lemma 4.7 and Theorem 6.12. The converses of Corollaries 3.7 and 3.9 are true for maximally monotone sets. (See Theorem 6.12). We give an example where the converse of Corollary 3.7 fails without the hypothesis of maximal monotonicity in Example 3.12 below. Example 3.12 depends on the following simple fact:
Fact 3.11**.**
Let be reflexive, , and . Then is of type (NI).
Proof.
Let . Since is reflexive, there exists such that . Since and , there exists such that . Since , is of type (NI). ∎
Example 3.12**.**
Let . If then
[TABLE]
Let A:=\big{\{}(\lambda,-\lambda)\colon\lambda\in\mathbb{R}\big{\}}\subset\mathbb{R}\times\mathbb{R} and then, for all , r_{L}\big{(}(s,s^{*})-(1,0)\big{)}={\textstyle\frac{1}{2}}(s-s-1-0)^{2}={\textstyle\frac{1}{2}}. Thus is not quasidense. However, from Fact 3.11, is of type (NI).
4 Quasidense sets determined by the coincidence sets of convex functions
Definition 4.1**.**
If and on , we write for the “coincidence set”
[TABLE]
The notation “” has been used for this set in the literature. We have avoided the “” notation because it lead to superscripts and subscripts on subscripts, and consequently makes the analysis harder to read. If is a proper, convex function on and on , we write for the “dual coincidence set”
[TABLE]
Lemmas 4.2 and 4.3 lead to the main result of the section, Theorem 4.4:
Lemma 4.2** (A boundedness result).**
Let be a nonzero real Banach space and . Suppose, further, that \inf\nolimits_{x\in X}\big{[}g(x)+{\textstyle\frac{1}{2}}\|x\|^{2}\big{]}=0, , and . Then .
Proof.
We have \textstyle\frac{1}{8}\big{[}\|y\|-\|z\|\big{]}^{2}=\textstyle\frac{1}{4}\|y\|^{2}+\textstyle\frac{1}{4}\|z\|^{2}-\textstyle\frac{1}{8}\big{[}\|y\|+\|z\|\big{]}^{2} and
[TABLE]
Thus, by addition,
[TABLE]
This gives the required result. ∎
Lemma 4.3**.**
Let . Then:
[TABLE]
Proof.
Let and . From the Cauchy–Schwarz inequality, we have . From the triangle inequality, \|x+z\|^{2}\leq\big{(}\|x\|+\|z\|\big{)}^{2}=\|x\|^{2}+2\|x\|\|z\|+\|z\|^{2} and \|x^{*}+z^{*}\|^{2}\leq\big{(}\|x^{*}\|+\|z^{*}\|\big{)}^{2}=\|x^{*}\|^{2}+2\|x^{*}\|\|z^{*}\|+\|z^{*}\|^{2}. Thus
[TABLE]
Also, from (3.4) with and the fact that ,
[TABLE]
The result now follows by addition, (3.2) and (3.3). ∎
Theorem 4.4** (Primal condition for quasidensity).**
Let and on . For all , let
[TABLE]
(The first expression shows that ).)* Then (a)(b):*
(a)* is quasidense.*
(b)* For all , \inf\nolimits_{b\in E\times E^{*}}\big{[}f_{c}(b)+{\textstyle\frac{1}{2}}\|b\|^{2}\big{]}\leq 0.*
Proof.
Let . Let . Since on ,
[TABLE]
and so it follows that (a)(b).
Suppose now that (b) is satisfied and . Let , so that \inf\nolimits_{b\in E\times E^{*}}\big{[}f_{c_{0}}(b)+{\textstyle\frac{1}{2}}\|b\|^{2}\big{]}\leq 0. From (4.1), on , so in fact \inf\nolimits_{b\in E\times E^{*}}\big{[}f_{c_{0}}(b)+{\textstyle\frac{1}{2}}\|b\|^{2}\big{]}=0. From Lemma 4.2, there exists such that
[TABLE]
Let . Let and . We now define inductively . Suppose that and is known. By hypohesis, \inf\nolimits_{b\in E\times E^{*}}\big{[}f_{c_{n}}(b)+{\textstyle\frac{1}{2}}\|b\|^{2}\big{]}\leq 0, and so there exists such that . Let . This completes the inductive construction.
Since , we now have such that,
[TABLE]
From (4.1), and so,
[TABLE]
Since and, from (3.3), on , this implies that,
[TABLE]
We now prove that,
[TABLE]
Let . Since is convex, (4.4) gives
[TABLE]
Since on and , it follows that
[TABLE]
Thus, from the quadraticity of , . Since , we see that
[TABLE]
From (4.4), . Thus
[TABLE]
Thus we obtain (4.5). We will also need an estimate for . This is not covered by (4.5). Now (4.5) used the inequality . A similar analysis for is unlikely, because we have no knowledge about — there is no a priori reason why should even be finite. This issue is partially resolved by (4.7) below.
It follows from (4.5) that exists. Let . Clearly, and so, from (4.5),
[TABLE]
From (4.4), the lower semicontinuity of , and the continuity of , , and so . We must now estimate . (4.3) with gives and so, from (4.2),
[TABLE]
Furthermore, (4.4) with gives
[TABLE]
From Lemma 4.3 with and , (4.6), (4.7) and (4.8),
[TABLE]
Letting , we see that . Thus isquasidense, and (a) holds. ∎
Remark 4.5**.**
An inspection of the above proof shows that we have, in fact, proved that if is quasidense then satisfies the strongercondition that, for all , there exists such that
[TABLE]
It is clear from (4.1) that, for all , . In light of this, the result of Lemma 4.6 below is very pleasing:
Lemma 4.6**.**
Let and be as in (4.1). Then, for all and , .
Proof.
From (4.1), the substitution , (3.4) and (3.7),
[TABLE]
This gives the required result. ∎
Lemma 4.7**.**
Let , on and be quasidense. Then on .
Proof.
Let . Let . Then, since on ,
[TABLE]
Thus, from Definition 3.8 and Corollary 3.9, . ∎
Theorem 4.8** (Dual condition for quasidensity).**
Let and on . Then is quasidense on .
Proof.
By virtue of Lemma 4.7, we only have to prove the implication (). So assume that on . Let . Let be as in (4.1). From Lemma 4.6, on , thus on . We now derive from (2.3) that \inf\nolimits_{b\in E\times E^{*}}\big{[}f_{c}(b)+{\textstyle\frac{1}{2}}\|b\|^{2}\big{]}\leq 0. Thus, from Theorem 4.4, is quasidense, as required. ∎
Definition 4.9**.**
Let . We define the function on by . Explicitly, for all ,
[TABLE]
Lemma 4.10 will be used in Theorem 4.11, Lemma 6.14 and Theorem 6.15.
Lemma 4.10**.**
Let , and on . Then .
Proof.
Let , , and . Then
[TABLE]
Dividing by and letting , we see that . If we now take the supremum over and use (4.9), we see that . Consequently, . ∎
The important thing about the next result is that is not required to be lower semicontinuous.
Theorem 4.11** (The theorem of the three functions).**
Let ,
[TABLE]
Then on and is closed and quasidense.
Proof.
From (4.10), on , as required. From Theorem 2.1 or Theorem 2.3 with , there exists such that on and on , from which on . Thus Theorem 4.8 and Lemma 4.10 imply that is quasidense and . Consequently, is quasidense. Since on , is quasidense also. Since is continuous and is lower semicontinuous, is closed. ∎
5 The coincidence sets of partial episums
Let and be nonzero Banach spaces and . Then we define the functions and by
[TABLE]
and
[TABLE]
We substitute the symbol for and for if the infimum is exact, that is to say, can be replaced by a minimum. Lemma 5.1 below first appeared in Simons–Zălinescu [24, Section 4, pp. 8–10], and appeared subsequently in[18, Section 16, pp. 67–69]. It was later generalized in [19, Theorem 9, p. 882] and [20, Corollary 5.4, pp. 121–122]. We will be applying Lemmas 5.1 and 5.3 below with . We define the projection maps and by and ().
Lemma 5.1**.**
Let , and
[TABLE]
Then .
Theorem 5.2**.**
Let , on ,
[TABLE]
and and be quasidense. Then on , is closed and quasidense, and
[TABLE]
Proof.
Let . Since on , for all ,
[TABLE]
From (5.2), , and so there exist , and such that and . It now follows from (5.1) that . To sum up:
[TABLE]
Note that we do not assert in (5.4) that . Since and are quasidense, Lemma 4.7 implies that
[TABLE]
from which
[TABLE]
From Lemma 5.1 and (5.5), for all ,
[TABLE]
Thus on , and so (5.4) and Theorem 4.11 imply that on and is closed and quasidense, as required.
We now establish (5.3). If and we use (5.6) and specialize (5.7) to the case when , we obtain
[TABLE]
If then this provides such that
[TABLE]
Let . Then and .From (5.6), and . This completes the proof of the implication () of (5.3). If, conversely, there exist such that , and then, from (5.8),
[TABLE]
It now follows from (5.8) that . This completes the proof of the implication () of (5.3), and thus the proof of Theorem 5.2. ∎
By interchanging the roles of and in the statement of Lemma 5.1, we can prove the following result:
Lemma 5.3**.**
Let , and
[TABLE]
Then .
Theorem 5.4**.**
Let , on ,
[TABLE]
and and be quasidense. Then on , is closed and quasidense and,
[TABLE]
Proof.
Let . By interchanging the variables in the proofs already given of (5.4) and (5.5) in Theorem 5.2, we can prove that,
[TABLE]
and
[TABLE]
From Lemma 5.3 and (5.12), for all ,
[TABLE]
Thus on , and so (5.11) and Theorem 4.11 imply that on and is closed and quasidense, as required. If we now let and specialize (5.13) to the case when , we obtain
[TABLE]
We now establish (5.10). If then (5.14) provides such that
[TABLE]
Let . Then we have and . From (5.12), and . This completes the proof of the implication () of (5.10). If, conversely, there exist such that , and then, from (5.14),
[TABLE]
It now follows from (5.14) that . This completes the proof of the implication () of (5.10), and thus the proof of Theorem 5.4. ∎
6 Monotone sets and multifunctions
Let . It is easy to see that
[TABLE]
Theorem 6.1** (Quasidensity and maximality).**
Let be a closed, quasidense monotone subset of . Then is maximally monotone.
Proof.
Let and be monotone. Let , and choose so that . Since , it follows that
[TABLE]
Letting and using the fact that is closed, . ∎
The following important property of coincidence sets was first proved in Burachik–Svaiter, [5, Theorem 3.1, pp. 2381–2382] and Penot, [13, Proposition 4(h)(a), pp. 860–861]. Here, we give a short proof using the criterion for monotonicity that appeared in (6.1).
Lemma 6.2**.**
Let and on . Then is monotone.
Proof.
Let . Then
[TABLE]
This establishes (6.1) and completes the proof of Lemma 6.2. ∎
In order to simplify some notation in the sequel, if , we will say that is closed if its graph, , is closed in , and we will say that is quasidense if is quasidense in .
Our analysis depends on the following definition:
Definition 6.3** (The definition of ).**
Let be a monotonemultifunction and . We define the function by . (See Definition 3.8.) Explicitly:
[TABLE]
In longhand, for all
[TABLE]
We now show how determines the Fitzpatrick function, , that acts on (rather than on ).
Definition 6.4** (The definition of ).**
Let be a monotone multifunction and . We define the function by
[TABLE]
Explicitly,
[TABLE]
In longhand, for all ,
[TABLE]
Remark 6.5**.**
The Fitzpatrick function was originally introduced in theBanach space setting in [6, (1988)], but lay dormant until it was rediscovered by Martínez-Legaz and Théra in [11, (2001)]. It had been previously considered in the finite–dimensional setting by Krylov in [10, (1982)]. The generalization of the Fitzpatrick function to Banach SN spaces can be found in [21, Definition 6.2, p. 1029].
Lemma 6.6**.**
Let be maximally monotone. Then:
[TABLE]
Proof.
If and then (6.7) gives \inf q_{L}\big{(}G(S)-b\big{)}\geq 0. From the maximality, and so we derive from the monotonicity that \inf q_{L}\big{(}G(S)-b\big{)}=0, from which . Since is obviously convex and lower semicontinuous, this completes the proof of (6.9). ∎
We now come to the “ criterion” for a maximally monotone set to be quasidense.
Theorem 6.7**.**
Let be maximally monotone. Then:
[TABLE]
Proof.
This is immediate from (6.9) and Theorem 4.8. ∎
Corollary 6.8** (First partial converse to Theorem 6.1).**
Let be maximally monotone and surjective. Then is quasidense.
Proof.
Suppose that . Let . Then, from (6.9),
[TABLE]
It now follows from (6.10) that is quasidense. ∎
Remark 6.9**.**
Once one knows the (highly nontrivial) result that a maximallymonotone multifunction is quasidense if, and only if, it is of type (FP), or locally maximally monotone, see [22, Theorem 10.3, p. 21], then Corollary 6.8 follows from Fitzpatrick–Phelps, [7, Theorem 3.7, pp. 67–68].
In Theorem 6.12, we will give the “ criterion” for a maximally monotone set to be quasidense. We start with a preliminary lemma of independent interest, which will be used in Corollary 11.7. Lemma 6.11 raises the following problem:
Problem 6.10**.**
Is there a maximally monotone multifunction such that ?
Lemma 6.11**.**
Let be maximally monotone. Then:
[TABLE]
If, further,
[TABLE]
then
[TABLE]
Proof.
[TABLE]
which gives (6.11). Now suppose that (6.12) is satisfied. If then . If, on the other hand, then (6.12) implies that , and so (6.9) gives . Thus, using (6.3), . Combining these two observations, we see that,
[TABLE]
Taking the supremum over , . Thus on , and (6.13) follows from (6.11). ∎
Theorem 6.12**.**
Let be maximally monotone. Then:
[TABLE]
Proof.
If is quasidense then is a quasidense subset of and so, from Corollary 3.9, on . If, conversely, on then, from (6.11), on , and it follows from Theorem 6.7 that is quasidense. ∎
Corollary 6.13** (Second partial converse to Theorem 6.1).**
Let be reflexive and be maximally monotone. Then is quasidense.
Proof.
Suppose that . Choose such that . Then and so, from (6.5) and (6.9),
[TABLE]
It now follows from Theorem 6.12 that is quasidense. ∎
We end this section by giving a result in Theorem 6.15 that will be used in our discussion of the Fitzpatrick extension in Section 8. We start with a preliminary lemma.
Lemma 6.14**.**
Let be maximally monotone. Then:
[TABLE]
Proof.
It follows by composing (6.11) with and using Definition 4.9 and (6.5) that on . Furthermore, (6.9) implies that on and . Lemma 4.10 implies that , which completes the proof of (6.15).
For all , . Thus, from (6.5),
[TABLE]
which gives the first inequality in (6.16), and the second inequality in (6.16) has already been established in (6.11). ∎
Theorem 6.15**.**
Let be maximally monotone and quasidense. Then .
Proof.
From (6.16) and (6.14), on . It follows that . However, if we applyLemma 4.10 (to instead of ), we see that ]. This gives the desired result. ∎
Problem 6.16**.**
Theorem 6.15 leads to the question: if is maximally monotone and on then is necessarily quasidense?
7 Sum theorem with domain constraints
Notation 7.1**.**
Let . In what follows, we write
[TABLE]
We will use the following computational rules in the sequel:
Lemma 7.2**.**
Let be closed, quasidense and monotone. Then
[TABLE]
Proof.
This is immediate from Theorem 6.1 and (6.9). ∎
Theorem 7.3** (Sum theorem with domain constraints).**
Let be closed, quasidense and monotone. Then (a)(b)(c)(d):
(a)* or .*
(b)* \textstyle\bigcup\nolimits_{\lambda>0}\lambda\big{[}D(S)-D(T)\big{]}=E.*
(c)* \textstyle\bigcup\nolimits_{\lambda>0}\lambda\big{[}\pi_{1}\,\hbox{\rm dom}\,\varphi_{S}-\pi_{1}\,\hbox{\rm dom}\,\varphi_{T}\big{]} is a closed subspace of .*
(d)* is closed, quasidense and monotone.*
Proof.
It is immediate from (7.1) that (a)(b)(c). Now suppose that (c) is satisfied. From Theorem 6.1, and are maximally monotone, and so (6.9) and (6.15) imply that , on , and , and we can apply Theorem 5.2 with and .
Thus on , is closed and quasidense, and if, and only if, there exist such that , and . This is exactly equivalent to the statement that . Finally, it is obvious that is monotone. ∎
Remark 7.4**.**
Theorem 7.3 above has applications to the classification of maximally monotone multifunctions. See [22, Theorems 7.2 and 8.1]. Theorem 7.3 can also be deduced from Voisei–Zălinescu [25, Corollary 3.5, p. 1024].
8 The Fitzpatrick extension
Definition 8.1** (The Fitzpatrick extension).**
Let be a closed quasidense monotone multifunction. We now introduce the Fitzpatrick extension, , of . From Theorem 6.1 and (6.9), , and so we see from Theorem 4.8 that on . Using our current notation, the multifunction was defined in [22, Definition 5.1] by
[TABLE]
(There is a more abstract version of this in [21, Definition 8.5, p. 1037].) From Theorem 6.15, we can also write
[TABLE]
The word extension is justified by the fact that . Indeed, from (8.2), (6.5) and (6.9),
[TABLE]
Theorem 8.2**.**
Let be closed, quasidense and monotone. Then is maximally monotone.
Proof.
From Lemma 6.2 (applied to the function on ), is monotone. Now let and, for all , . From (8.3), for all , q_{\widetilde{L}}\big{(}c^{*}-L(a)\big{)}\geq 0. Now (3.7) gives q_{\widetilde{L}}\big{(}c^{*}-L(a)\big{)}=q_{\widetilde{L}}(c^{*})-\langle a,c^{*}\rangle+q_{L}(a) and so, for all , . Taking the supremum over and using (6.3), . From Theorem 6.12, , and so . Thus, from (8.2), . This completes the proof of the maximal monotonicity of . ∎
Remark 8.3**.**
It is interesting to speculate (see [21, Problem 12.7, p. 1047]) whether is actually quasidense. We shall see in Example 8.8, Theorems 11.4(b) and 12.3 that this is not generally the case. However, it is the case in one important situation. We observed in Example 3.2 that if is proper, convex and lower semicontinuous then is quasidense. However, it was shown in [22, Theorem 5.7] that , so the multifunction is quasidense.
Remark 8.4**.**
It follows from (8.2) that exactly when is in the Gossez extension of (see [8, Lemma 2.1, p. 275]).
Our next result gives a situation in which we can obtain an explicit description of , as well as inverse of the operation . Theorem 8.5 is an extension to the nonlinear case of [3, Theorem 2.1, pp. 297–298]. It will be important in our construction of examples.
Theorem 8.5**.**
Let and . Let , i.e., is defined by . Then:
(a)* G(T)\subset L\big{(}G(S)\big{)}. (The opposite inclusion is trivially true.)*
(b)* Suppose in addition that is maximally monotone. Then is maximally monotone.*
(c)* Suppose in addition that is maximally monotone and . Then is maximally monotone and quasidense, and . Put another way, for multifunctions like , is the inverse of .*
Proof.
(a) Let . Since , there exists such that . But then , and so , from which (y^{*},y^{**})=L(y,y^{*})\in L\big{(}G(S)\big{)}.
(b) Now let . Then , and so . Equivalently, . Thus is monotone. We now prove that is maximally monotone. To this end, let and \inf q_{L}\big{(}G(S)-c\big{)}\geq 0. Equivalently, \inf q_{\widetilde{L}}\big{(}L\big{(}G(S)\big{)}-Lc\big{)}\geq 0. From (a), \inf q_{\widetilde{L}}\big{(}G(T)-Lc\big{)}\geq 0. The maximal monotonicity of now implies that Lc\in L\big{(}G(S)\big{)}. Since is injective, . Thus is maximally monotone.
(c) Let . Arguing as in (a), there exist and such that L(y,y^{*})=(y^{*},y^{**})\in L\big{(}G(S)\big{)}. Since is injective, . Thus , and the quasidensity of follows from Corollary 6.8. (8.3) and (a) now imply that that G(S^{\mathbb{F}})\supset L\big{(}G(S)\big{)}\supset G(T), and the assumed maximal monotonicity of now gives , as required. ∎
The following result appears in Phelps–Simons, [14, Corollary 2.6, p. 306]. We do not know the original source of the result. We almost certainly learned about it by personal communication with Robert Phelps. We give a proof for completeness.
Fact 8.6**.**
Let be monotone and linear. Then is maximally monotone.
Proof.
Let and, for all , . We first prove that, for all and for all ,
[TABLE]
To this end, let and . By direct computation,
[TABLE]
(8.4) now follows from our assumption, with . From (8.4), for all , the quadratic expression attains a minimum at so, from elementary calculus, for all , . Consequently, . Thus . This completes the proof of the maximal monotonicity of . ∎
Theorem 8.7 will be applied in Example 8.8 and Theorem 11.4.
Theorem 8.7**.**
Let be a monotone linear map and . Let . Then is maximally monotone and quasidense, and .
Proof.
Fact 8.6 (with replaced by ) implies that is maximally monotone. The result now follows from Theorem 8.5(c). ∎
Example 8.8**.**
Let , and define by . is the “tail operator”. Let . It was proved in [21, Example 7.10, pp. 1034–1035] that is not quasidense. Thus, from Theorems 8.2 and 8.7, is maximally monotone and quasidense, but is maximally monotone and not quasidense. This example answers in the negative the question posed in [21, Problem 12.7, p. 1047] as to whether the Fitzpatrick extension of a quasidense maximally monotone multifunction is necessarily quasidense. can be represented in matrix form by
[TABLE]
and D(S)=\big{\{}x\in c_{0}\colon\ \textstyle\sum_{i=1}^{\infty}|x_{i}-x_{i+1}|<\infty\big{\}}.
9 Sum theorem with range constraints
Theorem 9.1 below has applications to the classification of maximally monotone multifunctions. See [22, Theorems 8.2 and 10.3].
Theorem 9.1** (Sum theorem with range constraints).**
Let be closed, quasidense and monotone. Then (a)(b)(c)(d):
(a)* or .*
(b)* \textstyle\bigcup\nolimits_{\lambda>0}\lambda\big{[}R(S)-R(T)\big{]}=E^{*}.*
(c)* \textstyle\bigcup\nolimits_{\lambda>0}\lambda\big{[}\pi_{2}\,\hbox{\rm dom}\,\varphi_{S}-\pi_{2}\,\hbox{\rm dom}\,\varphi_{T}\big{]} is a closed subspace of .*
(d)* The multifunction defined by is closed,quasidense and monotone.*
(e)* If, further, , then the parallel sum is closed, monotone and quasidense.*
Proof.
It is immediate (using (7.1)) that (a)(b)(c). Now suppose that (c) is satisfied. From Theorem 6.1, and are maximally monotone, and so (6.9) implies that , on , and , and we can apply Theorem 5.4 with and . Thus on , is closed and quasidense, and if, and only if, there exist such that
[TABLE]
From (8.1), this is equivalent to the statement: “, and ”, that is to say, “”. This gives (d).
(e) Now suppose that and . Then the element in (9.1) is actually in , and so there exists such that. (8.3) now implies that , that is to say. From (9.1) again, , and a repetition of the argument above gives . Consequently, we have , that is to say . Thus we have proved that {\rm coinc}[(\varphi_{S}{\,\mathop{\oplus}\nolimits_{1}\,}\varphi_{T})^{@}]\subset G\big{(}(S^{-1}+T^{-1})^{-1}\big{)} On the other hand, from (8.3) and (9.1), we always have G\big{(}(S^{-1}+T^{-1})^{-1}\big{)}\subset{\rm coinc}[(\varphi_{S}{\,\mathop{\oplus}\nolimits_{1}\,}\varphi_{T})^{@}], completing the proof of (e). ∎
10 Another maximally monotone non–quasidense multifunction
In Bueno–Svaiter, [4, Proposition 1, pp. 84–85] an example is given of a maximally monotone skew linear operator from a subspace of into which is maximally monotone but not of type (D), thus answering in the negative a conjecture of J. Borwein. As observed in [22, Remark 10.4, pp. 21–22], a maximally monotone multifunction is of type (D) if, and only if, it is quasidense, so the Bueno–Svaiter example provides a maximally monotone non–quasidense multifunction on . In this section, we discuss a slight modification of this multifunction. Ironically, it is easier to establish the non–quasidensity than the maximal monotonicity.
Definition 10.1**.**
If is a real sequence such that is convergent, we define the tail sequence of , , by, for all , . Clearly
[TABLE]
Let
[TABLE]
is a vector subspace of . Let . For all , let
[TABLE]
Clearly, . can be represented in matrix form by
[TABLE]
If then and so, for all ,
[TABLE]
Letting in (10.4), for all ,
[TABLE]
If , we define . Thus is at most single–valued, linear and skew and .
If , write for the sequence , with the 1 in the th place.
Lemma 10.2**.**
Let . Then
[TABLE]
In other words,
[TABLE]
Proof.
Let . It is easily seen that . So, for all ,
[TABLE]
This gives the desired result. Alternatively, we can simply subtract the st column from the th column of the matrix in (10.3). ∎
Theorem 10.3**.**
* is skew and maximally monotone but not quasidense.*
Proof.
From (10.5), is skew. Now let and,
[TABLE]
From (10.5), , and so (10.6) reduces to . Since is a vector space, this implies that
[TABLE]
Lemma 10.2 and (10.7) imply that, for all ,
[TABLE]
Consequently, for all ,
[TABLE]
Adding to both sides of this equation,
[TABLE]
Using the fact that , and a simple interleaving argument, we see that . Since we now know that is convergent, we can use the notation of Definition 10.1. Thus
[TABLE]
Let . Using the same argument as above but starting the summation at instead of , . Replacing by , and so, by addition, . From (10.2), . So . Furthermore,
[TABLE]
and (10.7) now gives . Thus, from (10.1), and . This completes the proof of the maximal monotonicity of .
We now prove that is not quasidense. To this end, let . Then, from (10.2), \textstyle\sum_{j=1}^{\infty}(-1)^{j}(Sx)_{j}=\big{(}t(x)_{1}+t(x)_{2}\big{)}-\big{(}t(x)_{2}+t(x)_{3}\big{)}+\big{(}t(x)_{3}+t(x)_{4}\big{)}\cdots=t(x)_{1}=0, thus
[TABLE]
Thus . Since , . From (10.5), , and so
[TABLE]
This completes the proof that is not quasidense. ∎
Remark 10.4**.**
As we observed above, . On the other hand, the tail operator, , defined in Example 8.8 has full domain. This leads to the following problem.
Problem 10.5**.**
Is every maximally monotone multifunction such that quasidense?
It is natural to ask whether Theorem 8.5(b) can be used to establish themaximal monotonicity of in Theorem 10.3. Theorem 10.7 below shows that this is impossible.
Lemma 10.6**.**
Let be as in Definition 10.1, and . Then .
Proof.
and, from (10.1) and (10.2), and, for all , . Thus, for all ,
[TABLE]
Consequently,
[TABLE]
This gives the desired result. ∎
Theorem 10.7**.**
Let be as in Theorem 10.3, , and . Then is not maximally monotone.
Proof.
Let . From the proof of Theorem 8.5(a), there exists such that , and Lemma 10.6 implies that . From (10.5), , from which . Thus is monotonically related to .However, , and so . This completes the proof of Theorem 10.7. ∎
11 The Bueno–Svaiter construction
In Example 8.8, we gave an example of a quasidense maximally monotonemultifunction with a non-quasidense Fitzpatrick extension. In this section, we give a construction, due to Bueno and Svaiter, that produces another example of a similar phenonemon. Definition 11.1 is patterned after Bueno, [2, Theorem 2.7, pp. 13–14]. It would be interesting to find a scheme that includes both the example of Example 8.8, and also examples of the kind considered in this section.
Definition 11.1**.**
Let be a Banach space and . We define by . is a convex, continuous function on . Let be a linear map and . Suppose that
[TABLE]
In what follows, “lin” stands for “linear hull of”.
Lemma 11.2**.**
* and, for all , .*
Proof.
If then, from a well known algebraic result, thereexists so that but . Thus, for all ,, and by taking large and of the appropriate sign, . Thus . If now then k^{*}(2\mu e^{**})=\sup_{y^{*}\in E^{*}}\big{[}2\mu\langle y^{*},e^{**}\rangle-\langle y^{*},e^{**}\rangle^{2}\big{]}. Since , as runs through , runs through , and so (by elementary calaculus orcompleting the square) k^{*}(2\mu e^{**})=\sup_{\lambda\in\mathbb{R}}\big{[}2\mu\lambda-\lambda^{2}\big{]}=\mu^{2}. ∎
Theorem 11.3**.**
* is not quasidense.*
Proof.
We start off by proving that
[TABLE]
To this end, let and be as in (11.2). From (11.1) and the definition of , for all , , and (6.4) and Lemma 11.2 give
[TABLE]
This completes the proof of (11.2). If were quasidense then, from (11.2) and Corollary 3.9, if and \big{\langle}\widehat{E},z^{***}\big{\rangle}=\{0\} then, for all ,
[TABLE]
Letting , . So we would have whenever \big{\langle}\widehat{E},z^{***}\big{\rangle}=\{0\}. Since is a closed subspace of , it would follow that , violating the assumption in Definition 11.1. ∎
Theorem 11.4**.**
Let (see Theorem 8.5). Then:
(a)* is maximally monotone and quasidense, and .*
(b)* is maximally monotone but not quasidense.*
Proof.
(a) is immediate from Definition 11.1 and Theorem 8.7, and (b) isimmediate from Theorem 8.2, (a) and Theorem 11.3. ∎
For the rest of this section, we shall consider some of the more technical properties of , with as in Theorems 8.5 and 11.4.
Lemma 11.5**.**
For all , \langle y^{*},Tx^{*}\rangle=\big{\langle}x^{*},2\langle y^{*},e^{**}\rangle e^{**}-Ty^{*}\big{\rangle}.
Proof.
We have
[TABLE]
The result follows easily from this. ∎
Theorem 11.6**.**
Let . Then
[TABLE]
It follows that is a linear subpace of . Furthermore, for all , there exists a unique value of such that
[TABLE]
Proof.
It follows from (6.4) and (11.1) that
[TABLE]
Thus, from Lemma 11.5,
[TABLE]
(11.3) now follows from Lemma 11.2. Since , for all there exists a unique such that , and the rest of (11.4) follows from another application of Lemma 11.2. ∎
Corollary 11.7**.**
* and on .*
Proof.
Let . From (6.5), . Theorem 11.6 now gives a unique value of such that . Thus \widehat{E}\ni\widehat{x}-Tx^{*}=2\big{(}\mu-\langle x^{*},e^{**}\rangle\big{)}e^{**}. From Definition 11.1, , and so , from which . It follows that . Thus . The result now follows from Lemma 6.11. ∎
Since is quasidense, it follows from Theorem 6.15 that
[TABLE]
Of course, we know the first equality in (11.5) from Corollary 11.7. The second equality in (11.5) leads naturally to the conjecture that on . As we show in Theorem 11.8 below, this conjecture fails in a spectacular way. This raises the question of finding the exact value of .
Theorem 11.8**.**
Since , there exists so that . Define by . Let . Then
[TABLE]
but
[TABLE]
Proof.
We note that , so (11.6) follows from (11.4). Let . From (4.9) and (11.6),
[TABLE]
However, . It nowfollows from (11.1) that , and so , and we obtain (11.7) by letting . ∎
12 A specific non–quasidense Fitzpatrick
extension
If and , let . Define the linear map by
[TABLE]
Clearly . Let .
Remark 12.1**.**
can be represented by
[TABLE]
Lemma 12.2**.**
For all , .
Proof.
Let . Then . Since , . Thus
[TABLE]
as required. ∎
Theorem 12.3**.**
Let . Then is maximally monotone and quasidense, and is maximally monotone but not quasidense.
Proof.
This is immediate from Lemma 12.2 and Theorem 11.4. ∎
Remark 12.4**.**
In this case we can give a direct proof that is not quasidense. For all , and so , and . Thus
[TABLE]
Thus is not quasidense.
Remark 12.5**.**
Define by, for all , . Clearly, . Using the fact that , and an interleaving argument similar to that used in Theorem 10.3, we see that, for all , . It follows that can be represented in matrix form on the appropriate domain by
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Bauschke, J. M. Borwein, X. Wang and L. Yao, Every maximally monotone operator of Fitzpatrick-Phelps type is actually of dense type , Optim. Lett. 6 (2012), 1875-Ð1881. DOI: 10.1007/s 11590-011-0383-2
- 2[2] O. Bueno, On non–type (D) operators in non–reflexive Banach spaces and closures of monotone operators in topological vector spaces , Thesis, IMPA, 2012.
- 3[3] O. Bueno and B. F. Svaiter, A maximal monotone operator of type (D) for which maximal monotone extension to the bidual is not of type (D) , J. Convex Analysis, 19 (2012), 295–300.
- 4[4] O. Bueno and B. F. Svaiter, A non-type (D) operator in c 0 subscript 𝑐 0 c_{0} , Math. Program., Ser. B (2013) 139 81–-88. DOI 10.1007/s 10107-013-0661-0.
- 5[5] R. S. Burachik and B. F. Svaiter, Maximal monotonicity, conjugation and the duality product , Proc. Amer. Math. Soc. 131 (2003), 2379–2383.
- 6[6] S. Fitzpatrick, Representing monotone operators by convex functions , Workshop/ Miniconference on Functional Analysis and Optimization(Canberra, 1988), 59–65, Proc. Centre Math. Anal. Austral. Nat. Univ., 20 , Austral. Nat. Univ., Canberra, 1988.
- 7[7] S. P. Fitzpatrick and R. R. Phelps, Some properties of maximal monotone operators on nonreflexive Banach spaces , Set–Valued Anal. 3 (1995), 51–69.
- 8[8] J.–P. Gossez, Opérateurs monotones non linéaires dans les espaces de Banach non réflexifs , J. Math. Anal. Appl. 34 (1971), 371–395.
