Abstract
We develop a semi-inner product framework for block operator matrices acting on the direct sum of a complex Hilbert space , generated by the diagonal operator matrix , where and are distinct positive operators acting on , neither assumed to be injective. This extends the setting of Bhunia, Paul, and Nayak [Electron. J. Linear Algebra 36 (2020), 143–157], who treated the case with injective. Using Douglas’ majorization theorem, we employ and develop the mixed - and -adjoint formalism in the block operator matrix setting; these adjoints relate the two distinct seminorms induced by and and take the place of the ordinary adjoint when these seminorms differ. Within this framework, we establish upper and lower bounds for the -numerical radius of operator matrices belonging to the appropriate -bounded or -adjointable classes, extending and refining the bounds of the above-mentioned paper to the case of two distinct, not necessarily injective, positive generators.
Keywords:
mixed adjoint operator; semi-Hilbertian space; MSC:
47A12; 47A30; 47A63
1. Introduction and Preliminaries
Inequalities serve as fundamental tools in functional analysis, with numerical radius inequalities playing a central role in operator theory (see [1,2,3] and the references therein). In this paper, we aim to establish generalized numerical radius inequalities for block operator matrices acting on asymmetric semi-Hilbertian spaces—that is, spaces induced by a diagonal positive operator matrix on a direct sum Hilbert space, where the diagonal entries are distinct positive operators acting on the same complex Hilbert space. The primary goal of this section is to outline the foundational context of semi-Hilbertian spaces and recall the essential properties of generalized numerical radii. This establishes the necessary theoretical framework and clarifies the notation that will be utilized throughout the manuscript.
Let be a complex Hilbert space with inner product and norm , and let denote the algebra of all bounded linear operators on . For , the operator norm is and the numerical radius is
The numerical radius defines a norm equivalent to the standard operator norm, specifically satisfying . It is widely used to study the numerical range and estimate the location of polynomial zeros (see, for example, [4,5]). Improving these bounds has inspired an extensive body of literature [2,6,7], including significant work on operator matrices [8,9,10].
The theory of bounded operators extends naturally to semi-Hilbertian spaces, a framework initiated by Krein [11] and extensively developed in recent years [12,13,14,15]. A positive operator , meaning that for all , induces the semi-inner product and the seminorm , which becomes a norm if and only if is injective. The set of all non-zero positive operators on (explicitly excluding the zero operator ) will be denoted by . Note that is in general neither a normed space nor a complete space (see [12]).
For , we denote by its range, by its kernel, and by its adjoint. For a subspace , stands for its closure with respect to the norm topology of . For a closed subspace , we write for the orthogonal projection of onto . We denote by the zero operator on , and by the identity operator on (we simply write when the underlying space is clear from the context). The unit sphere with respect to the -seminorm is denoted by . Throughout, for , denotes the set of matrices with real entries. Before stating the fundamental range inclusion theorem, we recall the Löwner partial order for self-adjoint operators. For self-adjoint operators , the operator inequality means that for all . The following celebrated assertion is known as the Douglas theorem or Douglas majorization theorem (for its proof see [16]).
Theorem 1.
If , then the following statements are equivalent:
- (i)
- ;
- (ii)
- There exists a positive constant λ such that , which is equivalent to the norm inequality for all ;
- (iii)
- for some .
Moreover, if one of these conditions holds, then there exists a unique solution of the equation (known as the Douglas solution) such that .
Let . An operator is said to be an -adjoint of if for all , the identity holds [12]. Thus, the existence of an -adjoint of is equivalent to the existence of a solution of the equation . By Douglas’ theorem, this is equivalent to the range inclusion . Clearly, the existence of an -adjoint operator for all is not guaranteed unless the generator is invertible. We denote by the subspace of all operators admitting -adjoints:
If , the reduced solution of the equation is a distinguished -adjoint operator of , which is denoted by . Note that , where is the Moore–Penrose inverse of [13]. Recall that given an operator , its Moore–Penrose inverse is defined as the unique linear extension of the inverse of the restricted isomorphism to the domain , satisfying . Furthermore, represents the unique solution to the four Moore–Penrose equations: , , , and . The operator has a closed graph, and it is bounded if and only if is closed. Additionally, if is a self-adjoint operator, then . Consequently, if is a positive operator, its Moore–Penrose inverse satisfies [13]. Notice that if , then , , and . Moreover, if then and . For more results concerning , we refer the reader to [12,14].
An operator is called -bounded if there exists such that for all An application of Douglas’ theorem shows that the subspace of all operators admitting -adjoints, denoted by , is equal to the collection of all -bounded operators:
Notice that and are two subalgebras of which are, in general, neither closed nor dense in . Moreover, we have the inclusion [12,14].
Example 1.
We show that the inclusion may be strict when is not closed. Let with canonical orthonormal basis . Let . Then and . Consider the vector .
Let . Since , we have . Moreover, . Hence . On the other hand, suppose that for some . Then for all n. Since , this is impossible. Thus .
Now define the rank-one operator by
Its adjoint is given by for all . Since and are diagonal, we have
Therefore .
Since , Douglas’ theorem implies that . Indeed, for all , we have
On the other hand, since , we get . By Douglas’ theorem, the equation has no solution in . Thus admits no -adjoint, that is, . Consequently, .
This explains why the formulas involving and the mixed adjoints require the assumption , and not merely .
Clearly, induces a seminorm on . Indeed, if , then it holds that
Furthermore, the -numerical radius of an operator was firstly defined by Saddi in [17] as
It should be emphasized that it may happen that and are equal to for some [18]. However, these quantities are equivalent seminorms on . More precisely, it was shown in [15] that for every , we have Notice that if and satisfies , then by (Corollary 2, [19]) we have
For the sequel, for any arbitrary operator , we denote the real and imaginary parts by
It has been proved in [20] that for , it holds
Recently, the concept of the -spectral radius of -bounded operators has been introduced in [19] as follows:
Moreover, like the classical spectral radius of Hilbert space operators, it was shown in [19] that satisfies the commutativity property, which asserts that
for all . In addition, the following relation between the -spectral and -numerical radii of -bounded operators was also proved in [19]:
Recall that an operator is said to be -positive if , in which case we write . Clearly, an -positive operator is always -selfadjoint (that is, is selfadjoint), since is a complex Hilbert space. It is also clear that -selfadjoint operators belong to . Notice that if is -selfadjoint, then by [19],
Moreover, if , then , , and
Finally, if satisfy , then we write . In recent years, several results covering some classes of operators on a complex Hilbert space were extended to semi-Hilbertian spaces. Of course, the extension is not trivial since many difficulties arise. For instance, as it is mentioned above, it may happen that for some . Moreover, not any operator admits an adjoint operator for the semi-inner product . In addition, as mentioned earlier, even if , we have .
An operator is said to be an -isometry if for all . An operator is said to be -unitary if and for all . We denote the set of all -unitary operators by . Baklouti and Namouri (Lemma 2.4, [21]) connected these notions with the fundamental properties of the usual isometries and unitary operators, showing that is an -isometry if and only if , and that is -unitary if and only if . The reader is referred to [12,13,14,22] and the references therein for more details on this theory.
The exploration of numerical radii in semi-Hilbertian spaces has recently stimulated a wealth of significant contributions. Various authors have focused on generalizing and improving fundamental estimations for the -numerical radius of single operators [23,24,25]. Parallel investigations have successfully utilized the Moore–Penrose inverse and extended Buzano inequalities to refine -spectral bounds [26,27,28]. Furthermore, advanced refinements and exact bounds for the -numerical radius of semi-Hilbertian operators continue to be extensively explored [29,30,31]. In the context of block matrices and structural configurations, sophisticated convex-block approaches have yielded highly accurate numerical radius inequalities [32,33,34]. Related concepts, including -partial isometries and -Berezin number inequalities, have also attracted considerable attention [35,36].
The concept of the numerical radius has also been extended to block operator matrices. For matrices, the investigation was initiated by Bhunia, Paul, and Nayak [37], who investigated the operator matrix acting on , under the restrictive assumption that is strictly non-zero positive operator. Subsequently, Rout et al. [38,39] and Feki [40] removed this assumption, establishing -numerical radius inequalities for matrices where is simply a non-zero positive operator. Further results under the same conditions were established by Bhunia and Paul in [41]. Several authors then generalized the framework to operator matrices [42,43], retaining the homogeneous generator defined on the uniform direct sum .
A common feature of these results is that the same operator occupies every diagonal entry of . While convenient, this uniformity assumption sidesteps a genuine structural difficulty: in general, the two direct summands of carry different semi-inner products, so the off-diagonal blocks act as transformations between two distinct seminorms—a situation the uniform theory simply does not capture. Closing this gap is the main goal of the present manuscript. Throughout, we work with
where are two, possibly distinct, non-zero positive operators, neither of which is assumed to be injective.
The notion of a mixed adjoint relative to two positive operators goes back to Arias, Corach, and Gonzalez ([14], [Section 3]), who studied the equation in the context of lifting properties and described its reduced solutions. Using Douglas’ theorem [16], we define the mixed - and -adjoints in the block matrix setting, where they play the role of the usual adjoint once the two seminorms no longer coincide. When , they reduce to the ordinary -adjoint, and all of our results recover the known ones for the uniform generator . These adjoints are our main tool for deriving -numerical radius inequalities for arbitrary operator matrices. In particular, our bounds extend the quadratic numerical radius inequalities of Kittaneh [2], as well as their block versions due to Bhunia, Paul, and Nayak [37], to distinct and possibly singular positive generators.
The paper is organized as follows. Section 2 introduces mixed adjoint operators and mixed seminorms, and establishes their basic metric and submultiplicative properties. Section 3 gives necessary and sufficient conditions for a block operator matrix to admit a mixed adjoint, together with upper bounds for its spectral radius. Section 4 then uses these tools to derive bounds for the generalized -numerical radius, treating the diagonal and anti-diagonal block structures separately across the two seminorms.
2. Mixed Adjoint Operators and Mixed Seminorms
In this section, we define the foundational concepts of mixed adjoints and mixed seminorms bridging different semi-Hilbertian spaces, and establish their core metric and algebraic properties.
The next definition formalizes the notion of a mixed adjoint operator.
Definition 1.
Let . An operator is called a mixed -adjoint of if it satisfies
This defining relation is algebraically equivalent to the operator equation . We denote by the set of all operators in that admit a mixed -adjoint.
By applying Douglas’ theorem (Theorem 1), we deduce that the operator equation possesses a solution if and only if the range inclusion holds. If this condition holds, then Douglas’ theorem guarantees the existence of a unique reduced solution, denoted by , that satisfies and . Specifically, by using the Moore–Penrose inverse of , this distinguished solution can be explicitly represented as .
The next result generalizes a profound property established by Arias et al. [12] for uniform generators. It establishes an explicit formula for the double mixed adjoint in terms of orthogonal projections.
Lemma 1.
Let . Then, and we have
and
Proof.
Let . By definition, is the unique reduced solution satisfying the equation such that . Using the properties of the Moore–Penrose pseudoinverse, this solution is explicitly given by .
Since is typically an unbounded operator (unless is closed), we must carefully apply the adjoint extension relations for densely defined operators. Specifically, the adjoint of a product satisfies . Applying this to , we obtain:
Since is a bounded operator on , its adjoint is everywhere defined. The operator is defined on the dense domain . Therefore, for any vector , we have the exact equality .
Let . We aim to show that . Both and are everywhere defined bounded operators. Let . Clearly, . By evaluating at , we get:
Since is self-adjoint, we have . Substituting this yields:
This establishes the bounded operator identity . Since by construction, the uniqueness of the Douglas reduced solution guarantees that , which proves (5).
To prove (6), let . We seek to show . By definition, is the unique reduced solution to with . Taking the classical adjoint of the bounded operator , we get . Multiplying by , we obtain:
Since solves and commutes with its range projection, substituting yields:
Since already satisfies , the uniqueness of the reduced solution ensures . This proves (6) and completes the proof. □
By using similar reasoning, we apply Douglas’ theorem to the square roots of the generators to establish a broader class of bounded operators.
The next definition introduces boundedness across mixed generators.
Definition 2.
An operator admits a mixed -adjoint if it satisfies the range inclusion condition:
By Douglas’ theorem, this inclusion is equivalent to the existence of a constant such that . This operator inequality translates precisely to the mixed boundedness condition:
We denote the set of all such -bounded operators by .
The next result establishes the inclusion between these mixed operator spaces. The proof utilizes operator convexity properties for contractive maps [44,45] and extends a brilliant technique due to Antezana, first presented by Arias, Corach, and Gonzalez in [14].
Lemma 2.
We have .
Proof.
Let . Assume that is a contraction, meaning that ; otherwise, we scale it. In this case, the map defined by is a contractive positive map. By the definition of the mixed space, there exists an operator such that . By substituting this, we obtain:
By leveraging the operator convexity properties established for contractive maps [44,45], we obtain . On the other hand, since the function is operator monotone, we deduce that . By combining these bounds, we get:
By using the equivalence between assertion (ii) and assertion (i) of Douglas’ theorem (Theorem 1), this operator inequality guarantees the range inclusion . Thus, . This completes the proof. □
The following definition establishes the core metric topology across mixed generator spaces.
Definition 3.
For an operator , we define the mixed -operator seminorm by
Remark 1.
Let . Then if and only if . In general, therefore, is only a seminorm on . It is a norm precisely when is injective, and no injectivity assumption on is needed.
Analogously, the spaces and , the distinguished mixed adjoint , and the mixed seminorm are defined symmetrically for an operator by reversing the roles of and . When considering operators under a uniform generator , we naturally recover the standard notations and .
The next result expresses the mixed seminorm in terms of the semi-inner product, establishes the fundamental isometric property of the mixed adjoint mapping, and provides a generalized submultiplicativity property for operators mapping across different semi-inner product spaces.
Proposition 1.
Let . Then, the following assertions hold:
- (i)
- If , then the mixed -operator seminorm satisfiesConsequently, if , we obtain the equality
- (ii)
- If and , then and we have
Proof.
(i) Suppose that . By taking the supremum over all , we obtain . On the other hand, if , by choosing , we deduce . If , the equality holds trivially. Thus, we deduce
By taking the supremum over all in (8), we obtain the first identity.
To establish the norm equality, we utilize the definition of the mixed adjoint. Assume that . By definition, we have . By substituting this into the established supremum formula, we obtain:
This implies the desired equality.
(ii) Let . By using the definition of the mixed -operator seminorm for , we obtain for any vector that . By substituting , we deduce:
Since , we further bound the right side using the mixed -seminorm of :
Since this bound holds for all , it follows that . By taking the supremum over all , we obtain . This completes the proof. □
3. Generalized Semi-Inner Products for 2 × 2 Operator Matrices
The goal of this section is to determine necessary and sufficient conditions for block operator matrices to admit mixed adjoints. Building upon these conditions, we develop new mixed-generator upper bounds for the spectral radii and seminorms of matrices within the direct sum space.
In this section, we introduce the foundational spaces and operators utilized throughout the manuscript. Let be a complex Hilbert space. Throughout this paper, exclusively denotes the direct sum Hilbert space , and denotes the diagonal operator matrix , where . We equip with the canonical inner product:
for all column vectors and . It is evident that .
The matrix induces a positive semi-definite sesquilinear form on :
The following theorem provides necessary and sufficient conditions for an operator matrix to admit an -adjoint.
Theorem 2.
An operator matrix admits an -adjoint (i.e., ) if and only if its components admit their respective mixed adjoints, specifically: , , , and . In this case, we have
Proof.
By invoking Douglas’ theorem, an operator matrix belongs to if and only if the range inclusion holds. Let us explicitly evaluate the product :
Since , its range is strictly the direct sum of the ranges of its diagonal components, meaning . Therefore, the global condition is mathematically equivalent to stating that for any column vector , the following holds:
Assume that . By setting in (10), we obtain and for all . This implies and . By Douglas’ theorem, this guarantees and . Similarly, by setting , we obtain and for all . This implies and . Hence, and .
Conversely, assume that the components belong to their respective mixed spaces. By definition, we have , , , and . Since and are linear subspaces, they are closed under addition. Thus, for any vectors , we obtain:
It follows that the resulting vector resides in . Therefore, , which implies .
Let be the matrix on the right-hand side of (9). By hypothesis, we have the identities , , , and . By computing the matrix product , we obtain:
Since is the unique operator satisfying such that , it remains to show that . Let . Since and , the first component of resides in . Similarly, the second component resides in . Thus, we deduce that This implies that . This completes the proof. □
Remark 2.
It should be noted here that the first summand of carries the seminorm and the second carries . Throughout the paper, the block of an operator matrix acts from the j-th summand to the i-th summand, so its domain and codomain are in general equipped with different seminorms. For instance, maps the -summand into the -summand, which is why and why its seminorm is ; likewise, maps the -summand into the -summand and belongs to . In every mixed notion attached to a block, the generator of the domain is written first and that of the codomain second. The mixed adjoint reverses the direction of the block. Thus maps the -summand into the -summand and occupies the position in (9), while occupies the position. This convention is adopted solely to avoid confusion between the indices of the blocks and those of the generators.
In the following corollary, we can directly apply Theorem 2 by replacing the positive generators and with their respective square roots and .
Corollary 1.
An operator matrix if and only if its components satisfy , , , and .
The next result provides an upper bound for the -operator seminorm.
Lemma 3.
Let . Then, we have
where .
Proof.
We are now in a position to state our next main result, which bounds the -spectral radius of an arbitrary block operator matrix by the ordinary spectral radius of the scalar matrix formed from the mixed seminorms of its entries.
Theorem 3.
Let . Then, That is
Proof.
Let . To prove (13), we first establish a general entrywise inequality between the real matrices and for appropriately bounded block matrices and . To formalize the mappings, let and . The block component of an operator matrix on maps from the space equipped with the generator to the space equipped with the generator . Thus, its bounding mixed seminorm is evaluated as .
By evaluating the entry of using matrix multiplication and the triangle inequality, we obtain:
By employing the generalized mixed submultiplicativity established in Proposition 1(ii), we systematically bound each term:
We observe that this upper bound is exactly the algebraic formula for the entry of the matrix product . Since this holds for all indices , we deduce the global entrywise matrix inequality:
It is a standard property of the spectral norm for matrices with non-negative entries that if entrywise, then . By applying this monotonicity property, we infer:
Finally, since the standard matrix norm is submultiplicative, we obtain , which yields the fundamental matrix bound:
By employing (11) alongside (14) and an induction argument, we deduce:
for all . By utilizing the formula for the -spectral radius, we obtain:
By using this, we obtain (13). □
To establish our subsequent result, we evaluate the seminorms and numerical radii by isolating the diagonal and anti-diagonal components.
Proposition 2.
Let . Then, the following assertions hold:
- (a)
- .
- (b)
- .
Proof.
(a) Let and . Applying the Cauchy–Schwarz and arithmetic-geometric mean inequalities, we obtain:
By taking the supremum over independent vectors in (15), we deduce:
Let . By letting and , we have . By evaluating the inner product, we obtain:
By taking the supremum over all such and , we deduce that . Symmetrically, by isolating the second component, we infer that . This implies the desired equality.
(b) Let . By expanding the squared seminorm, we obtain:
This implies that . Let and define . Since , we obtain:
By taking the supremum over all , we deduce . Similarly, by isolating the first component, we infer . This implies the equality, which completes the proof. □
The next definition introduces the concepts of mixed isometries and mixed unitary operators mapping between two distinct semi-inner product spaces, extending the standard -unitary framework [12].
Definition 4.
An operator is called an -isometry if it satisfies for all . Furthermore, an operator is called an -unitary operator if is an -isometry and is a -isometry. We denote the set of all -unitary operators by .
Remark 3.
It should be noted here that if , then reduces to , the set of all -unitary operators, originally introduced in [12].
The next result establishes a generalized unitary invariance property for the numerical radius across different semi-inner product spaces.
Lemma 4.
Suppose that is an -unitary operator. Let and . Then, the following hold:
and
Proof.
Let . By definition, since is an -unitary operator, we have . Let . By using the definition of the mixed adjoint, we obtain:
By taking the supremum over all , we deduce that .
Conversely, suppose that . Let . Since , we get . Since , we deduce that for all , which implies . By definition of the mixed adjoint, we have . Thus, we obtain . This implies that . Since , it leaves invariant, so . Therefore, we obtain:
By taking the supremum over all such , we deduce . Consequently, we obtain (16) as desired.
Let . Let . Because is an -unitary operator, we have . Thus, we obtain . By applying the definition of the mixed adjoint, we obtain:
By taking the supremum over all , we deduce .
Conversely, suppose that . Let . Because is an -unitary operator, we have , which implies . Since , we deduce that for all . By definition of the mixed adjoint, we have . This implies , and therefore . Thus, we obtain . This implies that . Since , it leaves invariant. This implies . Therefore, we deduce:
By taking the supremum over all , we deduce . Consequently, we obtain (17) as claimed. This completes the proof. □
Remark 4.
We point out that if , then reduces to , the class of -unitary operators, and Lemma 4 recovers the known unitary invariance of the -numerical radius,
for all and ; see [46].
The next theorem establishes several structural assertions for appropriately bounded operators.
Theorem 4.
The following assertions hold for appropriately bounded operators:
- (i)
- Let and . Then
- (ii)
- Let and . ThenIn particular, we have
- (iii)
- Let and . Then for any ,
Proof.
(i) Let and , which implies . By using the Cauchy–Schwarz inequality for the mixed components, we deduce:
By taking the supremum over all , we infer that
Suppose and define . Then, we obtain
By taking the supremum over all , we deduce
and thus we infer . Similarly, for any , by defining , we deduce . Therefore, we obtain . This completes the proof of Theorem 4(i).
(ii) Let be a diagonal operator matrix on . Let . By computing the matrix multiplication, we obtain:
Since holds trivially, we deduce that . By solving the equation blockwise, we compute the explicit mixed adjoint using the Moore–Penrose pseudoinverse. Specifically, we multiply the diagonal pseudoinverse by the matrix . Applying the fundamental property to the positive generators and , we obtain:
By evaluating the respective mixed seminorms, we verify the isometric properties for all and for all . Thus, we deduce that is a -unitary operator mapping between the two semi-inner product spaces. Let . Applying unitary invariance across these isometrically isomorphic spaces presented in (17), we obtain:
The last equality follows from [38]. This proves (19). Suppose that and . By substituting these into (19), we obtain the desired equality (20).
(iii) Suppose that . Let and . It can be seen that and . By definition, we have . Then, we obtain . Since , it follows that . Similarly, we get . Thus, we deduce that . Applying (18), we obtain . Since , we have [12]. Since does not affect the -numerical radius, it follows that . By computing the matrix multiplication, we get:
We have for any block operator matrix . We deduce:
This completes the proof. □
Remark 5.
Alternatively, as pointed out by the referee, we can prove Theorem 4(ii) directly without explicitly using generalized mixed-unitary operators. Let . We observe that . Let . Since , we have
Furthermore, for any block operator matrix , the numerical radius formulation yields
By performing the change in variables and utilizing the identity , we obtain . Taking the supremum over all unit vectors gives
By applying this to , we immediately deduce (19).
The following result is a consequence of Theorem 4(i) by setting and was already proved in [38]. For the sake of completeness, we include its proof.
Corollary 2.
Let .
In particular, by taking , we obtain:
Proof.
Assume that . Then . Let . Since and , we deduce that is an -unitary operator. Let . By computing the matrix multiplication, we obtain . By applying the unitary invariance stated in (18), we obtain . Since and does not affect the -numerical radius, we have . By using Theorem 4(i) for the diagonal block matrix, we obtain
This yields the first identity. Suppose that . We obtain . Since , we deduce the second identity. This completes the proof. □
4. Applications to Generalized Numerical Radius for 2 × 2 Operator Matrices
In this section, we aim to demonstrate the invariance of the generalized numerical radius under distinct isometric and unitary transformations, and calculate sharp estimations for anti-diagonal operator blocks across separate seminorms.
The next result presents a computational lemma for the anti-diagonal component of a operator matrix across distinct generators.
Lemma 5.
Let and . Then, we have
Proof.
Let . By using Proposition 2(b) together with (7), we obtain:
for every . By utilizing the properties of the numerical radius for the generalized adjoint (since ) and applying the first identity in (2) directly to together with (9), we deduce:
where the last equality follows from (6). Since and its -adjoint constitutes the block component, then by evaluating the mixed norms through (21), the maximum simplifies to a single term. By using this, we deduce:
The last equality holds by directly applying (7) to the composite operator , since the expression inside the -seminorm is precisely . By replacing with in the last equality, we obtain:
Let be an operator matrix on . By Theorem 4(ii), we infer that
By applying the established identity (22) to the permuted matrix operating under the flipped seminorm system generated by , we explicitly interchange the roles of and , along with the generators and . From this substitution, we obtain:
By substituting (24) into the unitary equivalence (23), we get the desired result. This completes the proof. □
The next result provides the main generalized upper bound utilizing a scalar matrix structure.
Corollary 3.
Let . Then,
where is given by
Proof.
By using the definition of the real part with respect to for , we obtain:
By applying Lemma 3, specifically the block seminorm estimate (11), alongside the norm monotonicity of matrices with non-negative entries, and subsequently utilizing Lemma 5 and the properties of the numerical radius, we deduce:
By taking the supremum over all in the above inequality, we obtain , where is defined in (25). Finally, by using (23), we deduce . Since is a real symmetric matrix, then . By using this, we infer the required inequality. This completes the proof. □
Recall that the notation means that , which is equivalent to the operator inequality . The next lemma establishes an essential monotonicity property and was already stated in [37].
Lemma 6.
Let be -bounded operators. If , then .
The next result provides the main bounds for the mixed anti-diagonal matrix.
Theorem 5.
Let and . Then, for , the following bounds hold:
and
Proof.
Let and
By expanding the squares of these components, we deduce:
Next, by explicitly computing the products and based on Theorem 2, we obtain:
By summing these two block diagonal matrices, we obtain:
where we define and .
By taking the norm on both sides and utilizing the triangle inequality and submultiplicativity of the seminorm, we deduce
By evaluating the norm of the diagonal operator matrix, we obtain
This completes the proof of the first inequality.
Conversely, by rearranging the equality , we obtain:
Consequently, we infer that . Since is -selfadjoint, its square satisfies . Moreover, the block diagonal matrix is clearly -positive by taking (26) into consideration. Thus, the hypotheses of Lemma 6 are satisfied. Applying this lemma, together with the identity , which holds because is -selfadjoint (see [19]), we deduce that
By taking the supremum over all , we infer
This finishes the proof of the second inequality. □
The next result is a direct corollary for the uniform single-space framework. It follows by letting in Theorem 5, and it was originally obtained in [20]. For , it recovers the well-known inequalities of Kittaneh [2].
Corollary 4.
Let . Then
The next result provides the commutativity property of the mixed spectral radius and will be required in order to prove our next result.
Lemma 7.
If and , then , , and
Proof.
By using Proposition 1(ii), we obtain and . Let be an integer. We have
By applying the submultiplicativity property for mixed seminorms, we get
It follows that
By taking the limit as , we obtain
Similarly, we get . Hence, . This completes the proof. □
The next result provides an upper bound for the -numerical radius through a decomposition of the matrix into row blocks.
Theorem 6.
Let . Then
Proof.
Step 1: We first establish a key auxiliary bound for the upper triangular block . We claim that:
Since the operator is -selfadjoint for , we apply (3) to obtain
On the other hand, by using the spectral radius formulation, we get
By factoring the block matrix, we obtain
Let and . Let acting on . Since and , we deduce . Similarly, since and , we obtain . By applying Lemma 7, we get
By using (13) together with the identity , we get
It follows that
Since
we obtain (27).
Step 2: We estimate the lower triangular block and combine the bounds. Let be a diagonal operator matrix on , and let . By (19), we infer that
By applying (27) to this matrix under the permuted seminorm system generated by , we obtain
Since , the triangle inequality for the -numerical radius gives . Hence, we obtain the required inequality. This completes the proof. □
The next result presents our final generalized upper bound based on isolating the diagonal and anti-diagonal elements.
Theorem 7.
Let . Then, we have
Proof.
By employing the triangle inequality and Theorem 4(i), we obtain:
Since strictly off-diagonal block matrices are nilpotent of degree 2, then by applying (1), we deduce that:
Moreover, by (4), namely , along with Proposition 2(a), we obtain:
Since scaling by the half coefficient evaluates the first off-diagonal term, we apply analogous arguments to the transposed term corresponding to to obtain . Finally, by adding these expressions, we complete the proof. □
The following example illustrates the utility of the mixed-adjoint framework for distinct singular generators, a scenario not covered by the uniform setting as stated.
Example 2.
Let with the standard inner product. Let and . Then and are distinct singular positive operators. Let act on , where and . A direct computation gives . Since , we have . Thus . The reduced solution of is .
Similarly, and . Hence , so and . By Theorem 2, . Now, by applying Theorem 5, wee have
Thus and . Therefore, Theorem 5 gives
In fact, . Let with and . Then . Since and , we obtain
Hence , with equality for . Thus , and the upper bound of Theorem 5 is attained.
We note that on the matrix acts as the ordinary flip matrix. Hence the example does not produce new numerical values. It only shows that the mixed-adjoint framework applies directly to distinct singular generators , where the uniform setting does not apply as stated.
5. Conclusions
In this paper, we have ventured beyond the standard uniform semi-inner product framework to address a natural yet technically demanding question: how do block operator matrices behave when their off-diagonal components map between entirely distinct, non-injective semi-Hilbertian spaces? By deploying the generalized two-generator mixed adjoint via Douglas’ theorem, we successfully bridged this gap, extracting a cohesive theory of numerical radii that elegantly captures the asymmetry of distinct positive generators. The structural upper and lower bounds established here not only encapsulate previous uniform results as special cases but also open the door to analyzing highly singular, asymmetric physical and operator systems. We hope this distinct-generator framework will serve as a robust and inspiring mathematical tool for researchers exploring the next generation of operator theoretic bounds.
Author Contributions
Conceptualization, A.B., K.F. and H.H.T.; methodology, A.B., K.F. and H.H.T.; writing—original draft, A.B., K.F. and H.H.T.; writing—review and editing, A.B., K.F. and H.H.T. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the Deanship of Graduate Studies and Scientific Research at Najran University under the Consortium Funding Program grant code (NU/CPL/SERC/14/4210-7); and the Princess Nourah bint Abdulrahman University Researcher Support Project number (PNURSP2026R899), Riyadh, Saudi Arabia.
Data Availability Statement
No new data were created or analyzed in this study. Data sharing is not applicable to this article.
Acknowledgments
The authors are grateful to the anonymous referees for their valuable comments and suggestions, which helped improve the quality of this work. Moreover, the authors are thankful to the Deanship of Graduate Studies and Scientific Research at Najran University for funding this work under the Consortium Funding Program grant code (NU/CPL/SERC/14/4210-7). In addition, the third author would like to acknowledge the support received from the Princess Nourah bint Abdulrahman University Researcher Support Project (number PNURSP2026R899), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Gustafson, K.E.; Rao, D.K.M. Numerical Range; Springer: New York, NY, USA, 1997. [Google Scholar]
- Kittaneh, F. Numerical radius inequalities for Hilbert spaces operators. Stud. Math. 2005, 168, 73–80. [Google Scholar] [CrossRef] [Scilit]
- Paul, K.; Bag, S. On the numerical radius of a matrix and estimation of bounds for zeros of a polynomial. Int. J. Math. Math. Sci. 2012, 2012, 129132. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Bag, S.; Paul, K. Numerical radius inequalities and its applications in estimation of zeros of polynomials. Linear Algebra Appl. 2019, 573, 166–177. [Google Scholar] [CrossRef] [Scilit]
- Paul, K.; Bag, S. Estimation of bounds for the zeros of a polynomial using numerical radius. Appl. Math. Comput. 2013, 222, 231–243. [Google Scholar] [CrossRef] [Scilit]
- Yamazaki, T. On upper and lower bounds of the numerical radius and an equality condition. Stud. Math. 2007, 178, 83–89. [Google Scholar] [CrossRef] [Scilit]
- Kittaneh, F.; Moslehian, M.S.; Yamazaki, T. Cartesian decomposition and numerical radius inequalities. Linear Algebra Appl. 2015, 471, 46–53. [Google Scholar] [CrossRef] [Scilit]
- Hirzallah, O.; Kittaneh, F.; Shebrawi, K. Numerical radius inequalities for 2 × 2 operator matrices. Stud. Math. 2012, 210, 99–115. [Google Scholar] [CrossRef] [Scilit]
- Shebrawi, K. Numerical radius inequalities for certain 2 × 2 operator matrices II. Linear Algebra Appl. 2017, 523, 1–12. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Bag, S.; Paul, K. Numerical radius inequalities of operator matrices with applications. Linear Multilinear Algebra 2021, 69, 1635–1644. [Google Scholar] [CrossRef] [Scilit]
- Krein, M.G. Compact linear operators on functional spaces with two norms. Integral Equ. Oper. Theory 1998, 30, 140–162. [Google Scholar] [CrossRef] [Scilit]
- Arias, M.L.; Corach, G.; Gonzalez, M.C. Partial isometries in semi-Hilbertian spaces. Linear Algebra Appl. 2008, 428, 1460–1475. [Google Scholar] [CrossRef] [Scilit]
- Arias, M.L.; Corach, G.; Gonzalez, M.C. Metric properties of projections in semi-Hilbertian spaces. Integral Equ. Oper. Theory 2008, 62, 11–28. [Google Scholar] [CrossRef] [Scilit]
- Arias, M.L.; Corach, G.; Gonzalez, M.C. Lifting properties in operator ranges. Acta Sci. Math. 2009, 75, 635–653. [Google Scholar]
- Baklouti, H.; Feki, K.; Sid Ahmed, O.A.M. Joint numerical ranges of operators in semi-Hilbertian spaces. Linear Algebra Appl. 2018, 555, 266–284. [Google Scholar] [CrossRef] [Scilit]
- Douglas, R.G. On majorization, factorization and range inclusion of operators in Hilbert space. Proc. Am. Math. Soc. 1966, 17, 413–416. [Google Scholar] [CrossRef] [Scilit]
- Saddi, A. A-Normal operators in Semi-Hilbertian spaces. Aust. J. Math. Anal. Appl. 2012, 9, 1–12. [Google Scholar]
- Feki, K. A note on the A-numerical radius of operators in semi-Hilbertian spaces. Arch. Math. 2020, 115, 535–544. [Google Scholar] [CrossRef] [Scilit]
- Feki, K. Spectral radius of semi-Hilbertian space operators and its applications. Ann. Funct. Anal. 2020, 11, 929–946. [Google Scholar] [CrossRef] [Scilit]
- Zamani, A. A-numerical radius inequalities for semi-Hilbertian space operators. Linear Algebra Appl. 2019, 578, 159–183. [Google Scholar] [CrossRef] [Scilit]
- Baklouti, H.; Namouri, S. Spectral analysis of bounded operators on semi-Hilbertian spaces. Banach J. Math. Anal. 2022, 16, 12. [Google Scholar] [CrossRef] [Scilit]
- Tam, T.-Y.; Zhang, P. Spectral decomposition of selfadjoint matrices in positive semidefinite inner product spaces and its applications. Linear Multilinear Algebra 2019, 67, 1829–1838. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Nayak, R.K.; Paul, K. Improvement of A-numerical radius inequalities of semi-Hilbertian space operators. Results Math. 2021, 76, 120. [Google Scholar] [CrossRef] [Scilit]
- Moslehian, M.S.; Xu, Q.; Zamani, A. Seminorm and numerical radius inequalities of operators in semi-Hilbertian spaces. Linear Algebra Appl. 2020, 591, 299–321. [Google Scholar] [CrossRef] [Scilit]
- Sen, A.; Birbonshi, R.; Paul, K. A note on the A-numerical range of semi-Hilbertian operators. Linear Algebra Appl. 2024, 703, 268–288. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Kittaneh, F.; Paul, K.; Sen, A. Anderson’s theorem and A-spectral radius bounds for semi-Hilbertian space operators. Linear Algebra Appl. 2023, 657, 147–162. [Google Scholar] [CrossRef] [Scilit]
- Kittaneh, F.; Zamani, A. Bounds for A-numerical radius based on an extension of A-Buzano inequality. J. Comput. Appl. Math. 2023, 426, 115070. [Google Scholar] [CrossRef] [Scilit]
- Sababheh, M.; Djordjević, D.S.; Moradi, H.R. Numerical radius and norm bounds via the Moore-Penrose inverse. Complex Anal. Oper. Theory 2024, 18, 117. [Google Scholar] [CrossRef] [Scilit]
- Gourty, A.; Ighachane, M.A.; Kittaneh, F. Further A-numerical radius inequalities for semi-Hilbertian space operators. J. Anal. 2025, 33, 2023–2045. [Google Scholar] [CrossRef] [Scilit]
- Guesba, M.; Kittaneh, F. New bounds for the A-numerical radius of the product of semi-Hilbert space operators. J. Anal. 2026, early access. [Google Scholar] [CrossRef] [Scilit]
- Guesba, M.; Tapdigoglu, R. Refined inequalities for the A-numerical radius. J. Anal. 2026; early access. [CrossRef] [Scilit]
- Sababheh, M.; Conde, C.; Moradi, H.R. A convex-block approach for numerical radius inequalities. Funct. Anal. Appl. 2023, 57, 26–30. [Google Scholar] [CrossRef] [Scilit]
- Sababheh, M.; Conde, C.; Moradi, H.R. On the numerical radius of an operator matrix. Math. Inequal. Appl. 2024, 27, 417–434. [Google Scholar] [CrossRef] [Scilit]
- Sababheh, M.; Moradi, H.R. More accurate numerical radius inequalities (I). Linear Multilinear Algebra 2021, 69, 1964–1973. [Google Scholar] [CrossRef] [Scilit]
- Arias, M.L.; Mbekhta, M. A-partial isometries and generalized inverses. Linear Algebra Appl. 2013, 439, 1286–1293. [Google Scholar] [CrossRef] [Scilit]
- Zamani, A.; Sahoo, S.; Tapdigoglu, R.; Garaev, M. A-Berezin number inequalities for 2 × 2 operator matrices. Bull. Malays. Math. Sci. Soc. 2024, 47, 114. [Google Scholar]
- Bhunia, P.; Paul, K.; Nayak, R.K. On inequalities for A-numerical radius of operators. Electron. J. Linear Algebra 2020, 36, 143–157. [Google Scholar]
- Rout, N.C.; Sahoo, S.; Mishra, D. On -numerical radius inequalities for 2 × 2 operator matrices. Linear Multilinear Algebra 2022, 70, 2672–2692. [Google Scholar]
- Rout, N.C.; Mishra, D. Further results on -numerical radius inequalities. Ann. Funct. Anal. 2022, 13, 13. [Google Scholar] [CrossRef] [Scilit]
- Feki, K. Some bounds for the -numerical radius of certain 2 × 2 operator matrices. Hacet. J. Math. Stat. 2021, 50, 795–810. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Paul, K. Some improvements of numerical radius inequalities of operators and operator matrices. Linear Multilinear Algebra 2022, 70, 1995–2013. [Google Scholar] [CrossRef] [Scilit]
- Feki, K. Some -numerical radius inequalities for d × d operator matrices. Rend. Circ. Mat. Palermo II. Ser. 2022, 71, 85–103. [Google Scholar]
- Daptari, S.; Kittaneh, F.; Sahoo, S. New A-numerical radius equalities and inequalities for certain operator matrices and applications. Results Math. 2025, 80, 22. [Google Scholar] [CrossRef] [Scilit]
- Hansen, F.; Pedersen, G.K. Jensen’s inequality for operators and Löwner’s theorem. Math. Ann. 1982, 258, 229–241. [Google Scholar]
- Hansen, F.; Pedersen, G.K. Jensen’s operator inequality. Bull. Lond. Math. Soc. 2003, 35, 553–564. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Feki, K.; Paul, K. A-Numerical radius orthogonality and parallelism of semi-Hilbertian space operators and their applications. Bull. Iran. Math. Soc. 2021, 47, 435–457. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.