1. Introduction
A linear relation is also called a multi-valued linear operator, which is a generalization of the concept of an operator in the multi-valued case. We call 
 a linear relation if for all nonzero 
 and 
 (the domain of 
T),
      
      where 
H and 
K are infinite dimensional complex Hilbert spaces, and 
 and 
 are nonempty subsets of 
K. 
 is the class of all linear relations with 
 into 
K. 
 is the set of bounded linear operators from 
H into 
K, and we write 
, 
.
Let 
. The graph 
 of 
T is given by
      
The closure of T, denoted by , is the linear relation defined by  The inverse relation  of T is given by  The relation T is called closed if  is a closed subspace of , continuous if the inverse image  of any neighborhood  is again a neighborhood in H, and bounded if  and T is continuous. We denote by  the set of all closed relations from H into K, and we denote by  the class of bounded relations.  is the class of all closed and bounded linear relations from H into K, and . We denote the range and the kernel of T by  and ; we write , , , and . We write  the quotient map. It is clear that  is an operator so that we can define  for  and . We can see that T is continuous if and only if .
Let 
, then 
 is closed and 
 (see ([
1], Theorem 2.13)).
Let 
, the adjoint relation 
 be defined by 
 and
      
Let 
. Then 
 is closed if and only if 
 is closed (see ([
2], Theorem III.4.4)).
Let relation 
 be closed with 
 closed, then we say 
T is left Fredholm, denoted by 
 if 
; it is right Fredholm, denoted by 
, if 
; it is Fredholm, denoted by 
, if 
T is both left and right Fredholm; it is Weyl, denoted by 
, if 
T is a Fredholm relation and 
; it is left Weyl, denoted by 
, if 
T is left Fredholm and 
; it is Browder, denoted by 
, if 
T is Weyl with finite ascent and descent; and it is left Browder, denoted by 
, if 
T is left Weyl of finite ascent, where the ascent 
 and descent 
 of relation 
T are defined by
      
	  Let 
. The resolvent set of 
T is the set
      
	  Moreover, if 
T is closed, the resolvent set of 
T is the set
      
	  The spectrum of 
T is the set 
 For 
 (see ([
1], Lemma 2.14)).
The point spectrum 
, defect spectrum 
, approximate point spectrum 
, essential spectrum 
, left essential spectrum 
, right essential spectrum 
, Weyl spectrum 
, essential approximate point spectrum 
, Browder spectrum 
, Browder essential approximate point spectrum 
, and closed-range spectrum 
 of 
T are, respectively, defined by
      
	  Let 
 and 
. Then 
 if and only if 
 and 
 is closed (see ([
1], Theorem 2.10)).
Definition 1  (see ([
3], Definition 3.1))
. Let . The local resolvent set  of T at  is defined as the set of all  such that there are an open neighborhood  of λ and an analytic function , which satisfiesThe local spectrum set  of T at  is defined as . Definition 2  (see ([
3], Definition 3.2))
. Let , . If for every neighborhood  of  the only analytic function  which satisfies Equation  is the constant function , then T is said to have the single-valued extension property at , abbreviated T has the SVEP at . T is said to have the SVEP if 
T has the SVEP at any 
. Denote 
 the set of 
 for which 
T has no SVEP. Clearly, 
T has the SVEP if and only if 
 Let 
 and 
 be a subspace, then the relation 
 is given by
      
	  Write 
. It is clear that 
 is single-valued. For 
 and 
, the notation 
 is a row relation from 
 into 
H, i.e., 
 for all 
.
 The linear relation was introduced to consider adjoints of nondensely defined linear differential operators by J. von Neumann [
4]. At present, the theoretical research has applications in many problems, for example, the study of some Cauchy problems is related to the theory of linear relations [
5]; the fixed point theory of linear relations has applications in mathematical economics, optimal control, digital imaging, discontinuous differential equations, and game theory [
6]. Recently, several researchers have been interested in the study of the spectral theory for relation matrices [
1,
7,
8,
9,
10,
11,
12], of which article [
12] shows that the spectral properties of the upper triangular relation matrix
      
      are related to the multi-valued part 
 of relation 
, and it obtains the inclusion 
 In 
Section 2, we investigate the basic properties of relation 
T and upper triangular relation matrix 
. Based on these properties, we obtain the spectral properties for 
. In 
Section 3, based on the results in [
12], we give the set
      
      under the local spectral theory, where 
. In 
Section 4, we extend the results in [
13] and explore how Browder’s theorem, a-Browder’s theorem, and Weyl’s theorem survive for upper triangular relation matrix 
. Meanwhile, we give a new method for studying the Weylness of relation matrices where all internal elements are multi-valued linear operators.
  2. Auxiliary Results
In this section, we collect some fundamental properties on linear operators, relations, and relation matrices, which will be used in later proofs. Let 
T be a linear relation in a linear space 
X; the singular chain manifold 
 of 
T is defined by 
, where 
 and 
. The lemma below is from Theorems 6.5, 6.13, and 6.11 and Corollary 6.7 of [
14].
Lemma 1. Assume that T is a linear relation in a linear space X:
- (i) 
 If  and , then 
- (ii) 
 If  and , then 
- (iii) 
 If ,  and , then ;
- (iv) 
 If  with  and , then  and .
 Lemma 2  (see ([
7],  Lemma 4.2 and [
9], Proposition 10))
. Let :- (i) 
  if and only if , and 
- (ii) 
  if and only if , and 
- (iii) 
 If , then  and ;
- (iv) 
 If  and , then  and .
 Lemma 3  (see ([
15], Proposition 2.1))
. Let  with . If  such that , then- (i) 
 T has the SVEP at λ if and only if ;
- (ii) 
  has the SVEP at λ if and only if .
 Lemma 4  (see ([
16], Lemma 2.6))
. Let T be a linear relation in a Banach space X. Then- (i) 
  if and only if  for any ;
- (ii) 
 If , then .
 For upper triangular relation matrix , we have the following Lemmas 5–10.
Lemma 5  (see ([
17], Proposition 2.7))
. For , and , Remark 1. For , and  from Lemma 5, we can obtain that  is closed if and only if  and  are closed.
 Lemma 6  (see ([
1], Theorem 2.12))
. Let , and  with  closed. Then the adjoint  of  is single-valued, and Lemma 7  (see ([
1], Theorem 3.2))
. Let , . Then Lemma 8  (see ([
17], Theorem 3.22))
. For  and , there exists  with  such that  if and only if ,  is closed, and Lemma 9  (see ([
17], Theorem 3.17))
. Let . Then there is  with  such that  if and only if , and  Lemma 10  (see ([
12], Theorem 3.1))
. Let , and . Then- (i) 
 - (ii) 
 If  and  are closed, then 
- (iii) 
 If  and  are closed, then 
 Proposition 1. Let  with . Then .
 Proof.  Note that  for any  Since  and , we then know that  if and only if  Hence, . □
 Proposition 2. Let  with  closed. If  and , then .
 Proof.  Assume, to the contrary, that . Then T has the SVEP at 0. It is clear that . So, from Lemma 3(i), we have  By Lemmas 1(i) and 4, , contradicting the assumption . □
 Proposition 3. Let , , and . If , then  and .
 Proof.  Assume that 
. By Lemma 2(i),(ii), we have 
, so then 
 according to Lemma 5. Again, from Lemma 2(ii), 
. To complete the proof, it remains to be shown 
. The closedness of 
 means that 
 is closed and so 
 is closed. It is clear that 
, therefore 
 is closed. Note that
        
		Moreover, it follows from 
 that 
 is closed, so
        
        is closed. This together with the closedness of 
 means that 
 is closed, and so 
 is closed. Hence, 
. □
 Proposition 4. Let  and . Then  and  are bounded. Moreover, if  is closed, then  is invertible if and only if so is .
 Proof.  Note that
        
        and
        
		It follows from the boundedness of 
T that both 
 and 
 are bounded linear relations. Assume that 
 is closed. Then 
 Clearly, 
 is surjective if and only if 
 is too. Hence, the conclusion is valid. □
 Proposition 5. Let . Then .
 Proof.  Assume that 
, so it suffices to prove that 
, i.e., 
T has the SVEP at 
 Let 
 be an analytic function and 
 for all 
 Note that 
f is an analytic function on 
. Then there is a sequence 
 so that 
 for all 
 The analyticity of 
 shows that 
 and then
        
        which ensures 
, and hence 
 Furthermore, this means that 
 for 
, so
        
        for all 
. Note that 
T is closed. Then it is not hard to see that equality (
2) is valid for every 
 by continuity. Similar to the proof above, we can obtain that 
. Then, for all integers 
, 
 by iterating this procedure. Hence, 
 on 
 which indicates that 
T has the SVEP at 
 □
 Proposition 6. Let . Then 
 Proof.  The inclusion 
 is clear by Proposition 5. Next we will show that the converse inclusion is also valid. Now suppose that 
, so we need only to prove 
. Let 
 Note that 
 is surjective, which together with the closedness of 
T implies that there is 
 and 
 such that
        
        and it is clear that 
 Take analytic function 
 for all 
,
        
		Since 
T has the SVEP at 
, we then have that 
 for all 
, and hence 
, which means that 
 Observe that 
 is surjective. Thus, 
 □
 Proposition 7. Let . Then 
 Proof.  Evidently, 
 To complete the proof, it suffices to prove that the opposite inclusion is valid. We now suppose that 
, 
 Note that 
 is surjective. Then the closedness of 
T implies that there is 
 and 
 such that
        
		Take analytic function 
 for any 
, so we have
        
        which ensures that 
. Thus, 
 □
 Proposition 8. Let , and  is finite rank. Then  is closed if and only if  is closed.
 Proof.  Sufficiency: The closedness of T implies that  is closed. Since  is closed and , we know that  is closed. Hence  is closed.
Necessity: Note that . Then, from the sufficiency, the necessity follows immediately. □
 Proposition 9. Let , , and . Then .
 Proof.  Assume that 
. Then there are a neighborhood 
 of 
 and a nonzero analytic function 
 such that 
 for all 
 It is not hard to see that
        
        which means that 
 and hence 
. □
 Proposition 10. Let , and . Then  for any .
 Proof.  It is clear that 
 For the opposite inclusion, we assume that 
 Then there are a neighborhood 
 and analytic functions 
, 
 such that
        
        for all 
 The fact that 
 implies that 
 on 
, and so 
. This means that
        
        for all 
 Therefore, 
. □
 Proposition 11. Let  and  with  closed. Then 
 Proof.  Note that 
. Then 
 and so 
 is bounded, which together with the closedness of 
 ensures that 
 is closed. It follows from Remark 1 that 
 is closed. By virtue of Propositions 7 and 10, we know
        
		Moreover, the converse inclusion 
 is clear. Hence, the conclusion is valid. □
   3. Spectral Properties of Relation Matrices
In this section, we mainly obtain the properties of spectra of upper triangular relation matrices, i.e., Theorems 1–5.
Theorem 1. Let , and  with  closed. Then 
 Proof.  We first prove 
 Let 
 It suffices to show that 
 i.e., 
 is invertible. The invertibility of 
 means that 
 is invertible. It follows from the invertibility of 
 that 
 is invertible by Proposition 4. Note that 
 is bounded. According to Lemma 5,
        
        and 
 is a single-valued relation. From this, we then have that 
 is invertible, and hence 
 is invertible, which shows that 
 By Proposition 5, 
. In addition, the opposite inclusion can be obtained according to Propositions 9 and 11. Hence, 
 □
 The following theorem is a generalization of ([
18], Theorem 2.5).
Theorem 2. Let , and  with  closed. Then 
 Proof.  We first show that 
. By virtue of Lemma 6 and Theorem 1, we know
        
		We claim that 
 Indeed, it is not hard to see that 
 and
        
        for 
 and 
. Since 
, 
. Therefore, 
. Note that 
 by Theorem 1. Hence, 
 □
 Next we give an example to illustrate the result above.
Example 1. Let  be given byfor all , respectively. Then  Note that  We claim  Indeed, let T be the left shift operator on  defined by  for all , so it is easy to see that  and , which together with Proposition 1 and  imply that  Since  and  is closed, then  by Theorem 2,
Moreover, observing that  and . Then we can know that 
Note that . This shows that the spectral properties of upper triangular relation matrices are related to the multi-valued part  of relation .
 Theorem 3. Let , and  with  and . Then 
 Proof.  Assume that  Then . By Proposition 3, we have  and  Note that  by Lemma 10(i). Then, to finish the proof, it is sufficient to show  On the contrary, suppose  then there are two cases to consider.
Case 1: If 
 i.e., 
. It is clear that 
 In view of 
, we can see that 
. Then, from Proposition 2, 
 and so 
, which means that 
. Moreover, from equality (
1), we have
        
		The fact that 
 implies 
, and hence, 
 according to Lemma 5, so 
. Again, by Lemma 5, 
 so 
 which contradicts the hypothesis 
Case 2: If  then  according to Proposition 2, so  Similar to the proof above, we can obtain that  which contradicts the hypothesis  □
 Theorem 4. Let , and  with  and . Then  Proof.  Suppose that 
, so we have 
. Let 
 Then to complete the proof, it suffices to show that 
. Note that 
 and 
 by the proof of Theorem 3. By virtue of Lemma 5, 
 Note that
        
        and
        
		Then 
, which together with Lemma 2(i),(ii) means that 
 Observe that 
. If 
, then 
. By Proposition 2, we have
        
		However, if 
, then similarly, we have 
, contradicting the assumption 
. Hence, 
 □
 Theorems 3 and 4 extend the result of ([
19], Theorems 3.2 and 3.3) to the case of a linear relation. The next theorem is a generalization of ([
20], Theorem 2.3).
Theorem 5. Let , and  with  and . Then  Proof.  We first show that
        
		It suffices to prove that 
 by Lemma 10(iii). We now suppose 
 so then 
, 
, and 
. By virtue of Lemma 3, 
 and 
, which means that 
.
For the reverse inclusion, let 
, so it suffices to prove 
 Evidently, 
, which together with Proposition 3 means that 
 and 
, and according to Lemmas 2(iii), (iv) and 6,
        
		It follows from the proof of Theorem 2 that 
, then 
 by Lemma 2(iii). Note that 
. Then 
 is closed. It is clear that 
, so
        
		It is not hard to see that 
 so 
 There are two case as follows.
Case 1: If 
, by Proposition 2, 
, and so 
, which together with 
 implies that 
 according to Lemmas 1(i) and 4; thus, 
. Then, from 
, we have 
 Since 
 then Lemma 5 show that 
, which together with 
 and 
 means that
        
		It follows from 
 that 
. By Lemma 1(iii), (iv), 
 and 
. Hence, 
Case 2: If , similar to the proof of case 1, we can obtain 
Therefore, the reverse inclusion is valid. □
   4. Weyl-Type Theorems of Relation Matrices
In this section, we mainly study Browder’s theorem, a-Browder’s theorem, and Weyl’s theorem for upper triangular relation matrices, i.e., Theorems 7–10. As their corollaries, some related properties are also characterized. In the sequel, we write , , and  where  is the isolated point of 
For , if , we say Browder’s theorem holds for T, while if , we say a-Browder’s theorem holds for T; T satisfies Weyl’s theorem if .
Lemma 11  (see ([
21], Theorem 4.1))
. Let  with . If Weyl’s theorem holds for T, then . Lemma 12  (see ([
22], Theorem 4.2))
. Let  with . If  and , then λ is an isolated point of . Proposition 12. Let  with . Then 
 Proof.  Let . Then , and  is a Browder relation. It is clear that . By Lemma 12, we can obtain that  Hence,  □
 Theorem 6. Let  with  and . Then
- (i) 
  if and only if A and B have the SVEP on 
- (ii) 
  if and only if A and B have the SVEP on 
 Proof.  (i) Let 
. Then it is clear that
        
		Let 
 that is, 
. It follows from 
 that 
 and 
. By Lemma 3, 
A and 
B have the SVEP on 
Conversely, since 
, we only need to show that 
. Assume that 
 Then 
. Note that 
A and 
B have the SVEP at 
. Then 
 and 
 according to Proposition 2, which together with 
 implies that
        
		Since 
A and 
B have the SVEP at 
, 
 and 
. By virtue of Lemmas 1(iii) and 4, 
 and 
, which means that 
 Hence, 
(ii) Let . Then we can know  Assume that  that is, . Then  implies that  and so , and . By Lemma 3, A and B have the SVEP on 
Conversely, since , we only need to show . Suppose  Then . Since A and B have the SVEP at ,  and  according to Proposition 2, then . By Lemma 3, we can learn that  and , which means that . Hence . □
 Remark 2. (i) Clearly, Theorem 6 implies that Browder’s theorem holds for  if and only if A and B have the SVEP at , and a-Browder’s theorem holds for  if and only if A and B have the SVEP at .
(ii) For  and , where , then clearly,  is single-valued and bounded. Note thatso  satisfies Weyl’s theorem if and only if  satisfies Weyl’s theorem. This will simplify the study of the Weylness of relation matrices with all internal elements being multi-valued operators.  Theorem 7. Let  with , , and  closed. If  satisfies Browder’s theorem and at least one of the following conditions holds:
- (i) 
  has the SVEP at  and B has the SVEP at 
- (ii) 
  has the SVEP at  and  has the SVEP at 
- (iii) 
  has the SVEP at  and  has the SVEP at 
then  satisfies Browder’s theorem.
 Proof.  Let Browder’s theorem holds for 
. Note that
        
		Then the boundedness of 
A means that 
 is bounded, which together with the closedness of 
 shows that 
 is closed, and so 
 is closed since 
B is closed. From this, we have that 
 is closed if and only if 
 is closed. It follows from 
 and 
 that
        
		According to Lemma 2(iii), we can obtain that 
 Then Browder’s theorem holds for 
 if and only if Browder’s theorem holds for 
. By virtue of Theorem 6, 
 and 
B have the SVEP at 
 and 
 and 
 have the SVEP at 
 according to Lemma 6. Note that 
 and 
 then hypotheses (i), (ii), and (iii) mean, respectively, that
- (i)’
  has the SVEP at  and B has the SVEP at 
- (ii)’
  has the SVEP at  and  has the SVEP at 
- (iii)’
  has the SVEP at  and  has the SVEP at 
It is clear that 
, so to finish the proof, we have to show 
. Let 
 so then 
. It follows from 
 and Lemma 9 that 
 and
        
		By Proposition 2, 
 and 
 if (i)’ holds, 
 if (ii)’ holds, and 
 and 
 if (iii)’ holds. Then 
 means that
        
        and so 
. Note that 
 Then 
, which means that 
 and 
B have the SVEP at 
 according to Remark 2(i). By virtue of Lemmas 3 and 1(iii), 
 and 
 Then 
 shows that 
 hence 
 according to Lemma 10(iii). □
 Corollary 1. Let  with  and . If  satisfies Browder’s theorem and at least one of the following conditions holds:
- (i) 
 A has the SVEP at  and B has the SVEP at 
- (ii) 
 A has the SVEP at  and  has the SVEP at 
- (iii) 
  has the SVEP at  and  has the SVEP at 
then  satisfies Browder’s theorem for all .
 Corollary 2. Let  with , , and  closed. If  and B have the SVEP, and  satisfies Browder’s theorem, then  satisfies Browder’s theorem.
 Corollary 3. Let  with  and . If A and B have the SVEP, and  satisfies Browder’s theorem, then  satisfies Browder’s theorem for all .
 Theorem 8. Let  with , , and  closed. If  satisfies a-Browder’s theorem and at least one of the following conditions holds:
- (i) 
  has the SVEP at  and  has the SVEP at 
- (ii) 
  has the SVEP at  and  has the SVEP at 
then  satisfies a-Browder’s theorem.
 Proof.  Let a-Browder’s theorem hold for . Then it is easy to see that Browder’s theorem holds for . From the proof of Theorem 7, we can know that  has the SVEP at , which together with Remark 2(i) shows that hypotheses (i) and (ii) mean, respectively, that
- (i)’
  has the SVEP at  and  has the SVEP at 
- (ii)’
  has the SVEP at  and  has the SVEP at 
Clearly, 
. To finish the proof, we need to verify that 
. Let 
 so we have 
, which implies that
        
        by Remark 2(ii) and Lemma 8. Similar to the proof of Theorem 7, we have that 
 if (i)’ holds and 
 and 
 if (ii)’ holds. Let either (i)’or (ii)’ hold, so we know that
        
        and 
 by Lemma 8, which means 
. By Remark 2(i), 
 and 
B have the SVEP at 
 It follows from Lemma 3 that
        
		So 
, which means 
 by Lemma 10(ii). Hence, 
 i.e., a-Browder’s theorem holds for 
. □
 Corollary 4. Let  with  and . If  satisfies a-Browder’s theorem and at least one of the following conditions holds:
- (i) 
 A has the SVEP at  and  has the SVEP at 
- (ii) 
  has the SVEP at  and  has the SVEP at ,
then  satisfies a-Browder’s theorem for all .
 Applying Theorems 7 and 8 yields the following result for upper triangular relation matrices.
Theorem 9. Let  with , , and  closed. If  satisfies Browder’s (a-Browder’s) theorem, and either  and A have the SVEP or  and  have the SVEP, then  satisfies Browder’s (a-Browder’s) theorem.
 Corollary 5. Let  with  and . If  satisfies Browder’s (a-Browder’s) theorem, and either  and A have the SVEP or  and  have the SVEP, then  satisfies Browder’s (a-Browder’s) theorem for all .
 Theorem 10. Let  with , , and  closed. If at least one of the hypotheses (i), (ii), and (iii) of Theorem 7 is satisfied, and  satisfies Weyl’s theorem, then  satisfies Weyl’s theorem if and only if .
 Proof.  Sufficiency: Assume that 
 satisfies Weyl’s theorem, so we have that 
 satisfies Browder’s theorem according to Lemma 11, which together with one of the hypotheses (i)–(iii) of Theorem 7 means that 
 satisfies Browder’s theorem, and 
 by the proof of Theorem 7. We claim that 
 Indeed, from the proof of Theorem 7, we have that 
 has the SVEP at 
 or 
B has the SVEP at 
. Let 
. Since 
 according to Lemma 7, and hence 
 is injective, 
 is closed, and 
 is surjective, then
        
		By virtue of Proposition 2, we can obtain that 
, and then 
, which implies that 
 In addition, 
 is clear. Hence,
        
		Since 
 satisfies Weyl’s theorem and 
, we have
        
		Note that 
 satisfies Browder’s theorem. So, applying Proposition 12, we have that 
 and hence 
 To prove the sufficiency, it suffices to show 
 Assume that 
 Then the expression 
 indicates 
 Evidently, 
 means that 
, and 
 means that 
. Next we prove that 
 On the contrary, let 
 As a relation from 
 to 
, the relation 
 admits the block expression
        
		There are two cases to consider here.
Case 1: dim It follows from  that  and  so , which is a contradiction.
Case 2: dim
 Note that 
 Then 
 which together with 
 and 
 indicates that 
 Then dim
 and so
        
        which is a contradiction. Hence, 
 This, together with 
 and 
, shows that 
 which means that 
 Therefore, 
 i.e., 
 satisfies Weyl’s theorem.
Necessity: Assume that 
 and 
 satisfy Weyl’s theorem, and we have from the proof above that
        
		Let 
 then 
 and 
, so we can easily obtain that 
, i.e., 
. □
 From the proof of Theorem 10, we have the following theorem.
Theorem 11. Let  with , , and  closed. If at least one of the hypotheses (i), (ii), and (iii) of Theorem 7 is satisfied, and  satisfies Weyl’s theorem, then  satisfies Weyl’s theorem if and only if  for all .
 Corollary 6. Let  with  and . If at least one of the hypotheses (i), (ii), and (iii) of Corollary 1 is satisfied, and  satisfies Weyl’s theorem, then  satisfies Weyl’s theorem if and only if .
 Corollary 7. Let  with  and . If at least one of the hypotheses (i), (ii), and (iii) of Corollary 1 is satisfied, and  satisfies Weyl’s theorem, then  satisfies Weyl’s theorem if and only if  for all .
 We end this section with an example to illustrate the previous result.
Example 2. Let , , and  be given byfor any , respectively. Note that , , A and B have the SVEP. Since , ,  satisfies Weyl’s theorem. However,  and , so  does not satisfy Weyl’s theorem according to Corollary 7. Indeed, , , which means that  does not satisfy Weyl’s theorem.