Skip to Content
MathematicsMathematics
  • Article
  • Open Access

5 November 2026

27 Pages

A Mixed-Adjoint Framework for 2 × 2 Operator Matrices and Their Numerical Radii

,
and
1
Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11564, Saudi Arabia
2
Department of Mathematics, College of Science and Arts, Najran University, Najran 66462, Saudi Arabia
3
Science and Engineering Research Center, Najran University, Najran, Saudi Arabia
4
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
Mathematics2026, 14(21), 4048;https://doi.org/10.3390/math14214048 
(registering DOI)
This article belongs to the Special Issue New Advances in Functional Analysis and PDEs

Abstract

We develop a semi-inner product framework for 2 × 2 block operator matrices acting on the direct sum K = H ⊕ H of a complex Hilbert space H , generated by the diagonal operator matrix A = diag ( A , B ) , where A and B are distinct positive operators acting on H , 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 A = diag ( A , A ) with A injective. Using Douglas’ majorization theorem, we employ and develop the mixed ( A , B ) - and ( B , A ) -adjoint formalism in the block operator matrix setting; these adjoints relate the two distinct seminorms induced by A and B and take the place of the ordinary adjoint when these seminorms differ. Within this framework, we establish upper and lower bounds for the A -numerical radius of 2 × 2 operator matrices belonging to the appropriate A -bounded or A -adjointable classes, extending and refining the bounds of the above-mentioned paper to the case of two distinct, not necessarily injective, positive generators.

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 2 × 2 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 H be a complex Hilbert space with inner product ⟨ · , · ⟩ and norm ∥ · ∥ , and let L ( H ) denote the algebra of all bounded linear operators on H . For X ∈ L ( H ) , the operator norm is ∥ X ∥   =   sup { ∥ X u ∥ : u ∈ H , ∥ u ∥   =   1 } and the numerical radius is
ω ( X ) = sup { | ⟨ X u , u ⟩ | : u ∈ H , ∥ u ∥   =   1 } .
The numerical radius defines a norm equivalent to the standard operator norm, specifically satisfying 1 2 ∥ X ∥ ≤ ω ( X ) ≤ ∥ X ∥ . 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 A ∈ L ( H ) , meaning that ⟨ A u , u ⟩ ≥ 0 for all u ∈ H , induces the semi-inner product ⟨ u , v ⟩ A = ⟨ A u , v ⟩ and the seminorm ∥ u ∥ A = ⟨ A u , u ⟩ , which becomes a norm if and only if A is injective. The set of all non-zero positive operators on H (explicitly excluding the zero operator 0 ) will be denoted by L + ( H ) . Note that ( H , ⟨ · , · ⟩ A ) is in general neither a normed space nor a complete space (see [12]).
For X ∈ L ( H ) , we denote by Ran ( X ) its range, by Ker ( X ) its kernel, and by X * its adjoint. For a subspace M ⊆ H , M ¯ stands for its closure with respect to the norm topology of H . For a closed subspace M ⊆ H , we write Π M for the orthogonal projection of H onto M . We denote by 0 the zero operator on H , and by I H the identity operator on H (we simply write I when the underlying space is clear from the context). The unit sphere with respect to the A -seminorm is denoted by S A 1 ( H ) = { u ∈ H   :   ∥ u ∥ A = 1 } . Throughout, for n ∈ N , M n ( R ) denotes the set of n × n 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 C , D ∈ L ( H ) , the operator inequality C ≤ D means that ⟨ C u , u ⟩ ≤ ⟨ D u , u ⟩ for all u ∈ H . The following celebrated assertion is known as the Douglas theorem or Douglas majorization theorem (for its proof see [16]).
Theorem 1. 
If X , Y ∈ L ( H ) , then the following statements are equivalent:
(i)
Ran ( Y ) ⊆ Ran ( X ) ;
(ii)
There exists a positive constant λ such that Y Y * ≤ λ 2 X X * , which is equivalent to the norm inequality ∥ Y * u ∥   ≤   λ ∥ X * u ∥ for all u ∈ H ;
(iii)
X Z = Y for some Z ∈ L ( H ) .
Moreover, if one of these conditions holds, then there exists a unique solution Q ∈ L ( H ) of the equation X Z = Y (known as the Douglas solution) such that Ran ( Q ) ⊆ Ran ( X * ) ¯ .
Let X ∈ L ( H ) . An operator Y ∈ L ( H ) is said to be an A -adjoint of X if for all u , v ∈ H , the identity ⟨ X u , v ⟩ A = ⟨ u , Y v ⟩ A holds [12]. Thus, the existence of an A -adjoint of X is equivalent to the existence of a solution of the equation A Y = X * A . By Douglas’ theorem, this is equivalent to the range inclusion Ran ( X * A ) ⊆ Ran ( A ) . Clearly, the existence of an A -adjoint operator for all X ∈ L ( H ) is not guaranteed unless the generator is invertible. We denote by L A ( H ) the subspace of all operators admitting A -adjoints:
L A ( H ) = X ∈ L ( H ) : Ran ( X * A ) ⊆ Ran ( A ) .
If X ∈ L A ( H ) , the reduced solution of the equation A Y = X * A is a distinguished A -adjoint operator of X , which is denoted by X ♯ A . Note that X ♯ A = A † X * A , where A † is the Moore–Penrose inverse of A [13]. Recall that given an operator T ∈ L ( H ) , its Moore–Penrose inverse T † is defined as the unique linear extension of the inverse of the restricted isomorphism T | Ker ( T ) ⊥ : Ker ( T ) ⊥ → Ran ( T ) to the domain Dom ( T † ) = Ran ( T ) ⊕ Ran ( T ) ⊥ , satisfying Ker ( T † ) = Ran ( T ) ⊥ . Furthermore, T † represents the unique solution to the four Moore–Penrose equations: T T † T = T , T † T T † = T † , T † T = Π Ker ( T ) ⊥ , and T T † = Π Ran ( T ) ¯ | Dom ( T † ) . The operator T † has a closed graph, and it is bounded if and only if Ran ( T ) is closed. Additionally, if T is a self-adjoint operator, then ( T † ) * = T † . Consequently, if T is a positive operator, its Moore–Penrose inverse satisfies T † = ( T ) † ( T ) † [13]. Notice that if X ∈ L A ( H ) , then X ♯ A ∈ L A ( H ) , ( X ♯ A ) ♯ A = Π Ran ( A ) ¯ X Π Ran ( A ) ¯ , and ( ( X ♯ A ) ♯ A ) ♯ A = X ♯ A . Moreover, if Y ∈ L A ( H ) then X Y ∈ L A ( H ) and ( X Y ) ♯ A = Y ♯ A X ♯ A . For more results concerning X ♯ A , we refer the reader to [12,14].
An operator X is called A -bounded if there exists λ > 0 such that ∥ X u ∥ A ≤ λ ∥ u ∥ A for all u ∈ H . An application of Douglas’ theorem shows that the subspace of all operators admitting A -adjoints, denoted by L A ( H ) , is equal to the collection of all A -bounded operators:
L A ( H ) = X ∈ L ( H ) : ∃ λ > 0 such that ∥ X u ∥ A ≤ λ ∥ u ∥ A , ∀ u ∈ H .
Notice that L A ( H ) and L A ( H ) are two subalgebras of L ( H ) which are, in general, neither closed nor dense in L ( H ) . Moreover, we have the inclusion L A ( H ) ⊆ L A ( H ) [12,14].
Example 1. 
We show that the inclusion L A ( H ) ⊆ L A ( H ) may be strict when Ran ( A ) is not closed. Let H = ℓ 2 ( N ) with canonical orthonormal basis { e n } n ≥ 1 . Let A = diag ( 1 , 2 − 2 , 3 − 2 , … ) . Then A ∈ L + ( H ) and A = diag ( 1 , 2 − 1 , 3 − 1 , … ) . Consider the vector v = ( n − 2 ) n ≥ 1 ∈ H .
Let u = ( n − 1 ) n ≥ 1 . Since ∑ n = 1 ∞ n − 2 < ∞ , we have u ∈ H . Moreover, A u = v . Hence v ∈ Ran ( A ) . On the other hand, suppose that A w = v for some w ∈ H . Then w n = n 2 · n − 2 = 1 for all n. Since ∑ n = 1 ∞ 1 = ∞ , this is impossible. Thus v ∉ Ran ( A ) .
Now define the rank-one operator X ∈ L ( H ) by
X x = ⟨ x , v ⟩ e 1 , x ∈ H .
Its adjoint is given by X * y = ⟨ y , e 1 ⟩ v for all y ∈ H . Since A and A are diagonal, we have
X * A y = X * A y = y 1 v , y ∈ H .
Therefore Ran ( X * A ) = Ran ( X * A ) = span { v } .
Since span { v } ⊆ Ran ( A ) , Douglas’ theorem implies that X ∈ L A ( H ) . Indeed, for all x ∈ H , we have
∥ X x ∥ A = | ⟨ x , v ⟩ | ∥ e 1 ∥ A   =   | ⟨ A x , u ⟩ |   ≤   ∥ u ∥ ∥ x ∥ A .
On the other hand, since span { v } ⊈ Ran ( A ) , we get Ran ( X * A ) ⊈ Ran ( A ) . By Douglas’ theorem, the equation A Y = X * A has no solution in L ( H ) . Thus X admits no A -adjoint, that is, X ∉ L A ( H ) . Consequently, L A ( H ) ⊊ L A ( H ) .
This explains why the formulas involving X ♯ A and the mixed adjoints require the assumption X ∈ L A ( H ) , and not merely X ∈ L A ( H ) .
Clearly, ⟨ · , · ⟩ A induces a seminorm on L A ( H ) . Indeed, if X ∈ L A ( H ) , then it holds that
∥ X ∥ A = sup u ∈ Ran ( A ) ¯ , u ≠ 0 ∥ X u ∥ A ∥ u ∥ A = sup u ∈ S A 1 ( H ) ∥ X u ∥ A < ∞ .
Furthermore, the A -numerical radius of an operator X ∈ L A ( H ) was firstly defined by Saddi in [17] as
ω A ( X ) = sup u ∈ S A 1 ( H ) | ⟨ X u , u ⟩ A | .
It should be emphasized that it may happen that ∥ X ∥ A and ω A ( X ) are equal to + ∞ for some X ∈ L ( H ) ∖ L A ( H ) [18]. However, these quantities are equivalent seminorms on L A ( H ) . More precisely, it was shown in [15] that for every X ∈ L A ( H ) , we have 1 2 ∥ X ∥ A ≤ ω A ( X ) ≤ ∥ X ∥ A . Notice that if X ∈ L A ( H ) and satisfies A X 2 = 0 , then by (Corollary 2, [19]) we have
ω A ( X ) = 1 2 ∥ X ∥ A .
For the sequel, for any arbitrary operator X ∈ L A ( H ) , we denote the real and imaginary parts by
ℜ A ( X ) = X + X ♯ A 2 and ℑ A ( X ) = X − X ♯ A 2 i .
It has been proved in [20] that for X ∈ L A ( H ) , it holds
ω A ( X ) = sup θ ∈ R ℜ A ( e i θ X ) A = sup θ ∈ R ℑ A ( e i θ X ) A .
Recently, the concept of the A -spectral radius of A -bounded operators has been introduced in [19] as follows:
r A ( X ) : = inf n ∈ N ∥ X n ∥ A 1 n = lim n → ∞ ∥ X n ∥ A 1 n , X ∈ L A ( H ) .
Moreover, like the classical spectral radius of Hilbert space operators, it was shown in [19] that r A ( · ) satisfies the commutativity property, which asserts that
r A ( X Y ) = r A ( Y X ) ,
for all X , Y ∈ L A ( H ) . In addition, the following relation between the A -spectral and A -numerical radii of A -bounded operators was also proved in [19]:
r A ( X ) ≤ ω A ( X ) , for all X ∈ L A ( H ) .
Recall that an operator X is said to be A -positive if A X ≥ 0 , in which case we write X ≥ A 0 . Clearly, an A -positive operator is always A -selfadjoint (that is, A X is selfadjoint), since H is a complex Hilbert space. It is also clear that A -selfadjoint operators belong to L A ( H ) . Notice that if X is A -selfadjoint, then by [19],
ω A ( X ) = r A ( X ) = ∥ X ∥ A .
Moreover, if X ∈ L A ( H ) , then X X ♯ A ≥ A 0 , X ♯ A X ≥ A 0 , and
∥ X ♯ A X ∥ A =   ∥ X X ♯ A ∥ A   =   ∥ X ∥ A 2 = ∥ X ♯ A ∥ A 2 .
Finally, if X , Y ∈ L ( H ) satisfy X − Y ≥ A 0 , then we write X ≥ A Y . In recent years, several results covering some classes of operators on a complex Hilbert space H 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 ∥ X ∥ A = ∞ for some X ∈ L ( H ) . Moreover, not any operator admits an adjoint operator for the semi-inner product ⟨ · , · ⟩ A . In addition, as mentioned earlier, even if X ∈ L A ( H ) , we have ( X ♯ A ) ♯ A ≠ X .
An operator X ∈ L ( H ) is said to be an A -isometry if ∥ X u ∥ A = ∥ u ∥ A for all u ∈ H . An operator U ∈ L ( H ) is said to be A -unitary if U ∈ L A ( H ) and ∥ U u ∥ A =   ∥ U ♯ A u ∥ A = ∥ u ∥ A for all u ∈ H . We denote the set of all A -unitary operators by U A ( H ) . Baklouti and Namouri (Lemma 2.4, [21]) connected these notions with the fundamental properties of the usual isometries and unitary operators, showing that X ∈ L A ( H ) is an A -isometry if and only if A X ♯ A X = A , and that U ∈ L A ( H ) is A -unitary if and only if A U ♯ A U = A U U ♯ A = A . 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 A -numerical radius of single operators [23,24,25]. Parallel investigations have successfully utilized the Moore–Penrose inverse and extended Buzano inequalities to refine A -spectral bounds [26,27,28]. Furthermore, advanced refinements and exact bounds for the A -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 A -partial isometries and A -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 2 × 2 matrices, the investigation was initiated by Bhunia, Paul, and Nayak [37], who investigated the operator matrix A = A 0 0 A acting on K , under the restrictive assumption that A is strictly non-zero positive operator. Subsequently, Rout et al. [38,39] and Feki [40] removed this assumption, establishing A -numerical radius inequalities for 2 × 2 matrices where A 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 q × q operator matrices [42,43], retaining the homogeneous generator A = diag ( A , … , A ) defined on the uniform direct sum H ⊕ ⋯ ⊕ H .
A common feature of these results is that the same operator A occupies every diagonal entry of A . While convenient, this uniformity assumption sidesteps a genuine structural difficulty: in general, the two direct summands of K 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
A = A 0 0 B ,
where A , B ∈ L + ( H ) 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 A Y = X * B in the context of lifting properties and described its reduced solutions. Using Douglas’ theorem [16], we define the mixed ( A , B ) - and ( B , A ) -adjoints in the block matrix setting, where they play the role of the usual adjoint once the two seminorms no longer coincide. When A = B , they reduce to the ordinary A -adjoint, and all of our results recover the known ones for the uniform generator diag ( A , A ) . These adjoints are our main tool for deriving A -numerical radius inequalities for arbitrary 2 × 2 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 2 × 2 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 A -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 X ∈ L ( H ) . An operator Y ∈ L ( H ) is called a mixed ( A , B ) -adjoint of X if it satisfies
⟨ X u , v ⟩ B = ⟨ u , Y v ⟩ A , for all u , v ∈ H .
This defining relation is algebraically equivalent to the operator equation A Y = X * B . We denote by L A , B ( H ) the set of all operators in L ( H ) that admit a mixed ( A , B ) -adjoint.
By applying Douglas’ theorem (Theorem 1), we deduce that the operator equation A Y = X * B possesses a solution if and only if the range inclusion Ran ( X * B ) ⊆ Ran ( A ) holds. If this condition holds, then Douglas’ theorem guarantees the existence of a unique reduced solution, denoted by X ♯ A , B , that satisfies Ran ( X ♯ A , B ) ⊆ Ran ( A ) ¯ and Ker ( X ♯ A , B ) = Ker ( X * B ) . Specifically, by using the Moore–Penrose inverse of A , this distinguished solution can be explicitly represented as X ♯ A , B = A † X * B .
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 X ∈ L A , B ( H ) . Then, X ♯ A , B ∈ L B , A ( H ) and we have
( X ♯ A , B ) ♯ B , A = Π Ran ( B ) ¯ X Π Ran ( A ) ¯
and
( ( X ♯ A , B ) ♯ B , A ) ♯ A , B = X ♯ A , B .
Proof. 
Let Y = X ♯ A , B . By definition, Y is the unique reduced solution satisfying the equation A Y = X * B such that Ran ( Y ) ⊆ Ran ( A ) ¯ . Using the properties of the Moore–Penrose pseudoinverse, this solution is explicitly given by Y = A † X * B .
Since A † is typically an unbounded operator (unless Ran ( A ) is closed), we must carefully apply the adjoint extension relations for densely defined operators. Specifically, the adjoint of a product satisfies ( S T ) * ⊃ T * S * . Applying this to Y , we obtain:
Y * = ( A † X * B ) * ⊃ B * ( X * ) * ( A † ) * = B X A † .
Since Y is a bounded operator on H , its adjoint Y * is everywhere defined. The operator B X A † is defined on the dense domain D ( A † ) = Ran ( A ) ⊕ Ker ( A ) . Therefore, for any vector u ∈ D ( A † ) , we have the exact equality Y * u = B X A † u .
Let Z = Π Ran ( B ) ¯ X Π Ran ( A ) ¯ . We aim to show that B Z = Y * A . Both B Z and Y * A are everywhere defined bounded operators. Let v ∈ H . Clearly, A v ∈ Ran ( A ) ⊆ D ( A † ) . By evaluating Y * at A v , we get:
Y * ( A v ) = B X A † ( A v ) = B X Π Ran ( A ) ¯ v .
Since B is self-adjoint, we have B = B Π Ran ( B ) ¯ . Substituting this yields:
Y * A v = B Π Ran ( B ) ¯ X Π Ran ( A ) ¯ v = B Z v .
This establishes the bounded operator identity B Z = Y * A . Since Ran ( Z ) ⊆ Ran ( B ) ¯ by construction, the uniqueness of the Douglas reduced solution guarantees that Y ♯ B , A = Z , which proves (5).
To prove (6), let W = Z ♯ A , B . We seek to show W = Y . By definition, W is the unique reduced solution to A W = Z * B with Ran ( W ) ⊆ Ran ( A ) ¯ . Taking the classical adjoint of the bounded operator Z , we get Z * = Π Ran ( A ) ¯ X * Π Ran ( B ) ¯ . Multiplying by B , we obtain:
Z * B = Π Ran ( A ) ¯ X * Π Ran ( B ) ¯ B = Π Ran ( A ) ¯ X * B .
Since Y solves A Y = X * B and A commutes with its range projection, substituting X * B yields:
Z * B = Π Ran ( A ) ¯ ( A Y ) = A Y .
Since Y already satisfies Ran ( Y ) ⊆ Ran ( A ) ¯ , the uniqueness of the reduced solution ensures W = Y . 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 X ∈ L ( H ) admits a mixed ( A , B ) -adjoint if it satisfies the range inclusion condition:
Ran ( X * B ) ⊆ Ran ( A ) .
By Douglas’ theorem, this inclusion is equivalent to the existence of a constant c > 0 such that X * B X ≤ c 2 A . This operator inequality translates precisely to the mixed boundedness condition:
∥ X u ∥ B ≤ c ∥ u ∥ A , for all u ∈ H .
We denote the set of all such ( A , B ) -bounded operators by L A , B ( H ) .
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 L A , B ( H ) ⊆ L A , B ( H ) .
Proof. 
Let X ∈ L A , B ( H ) . Assume that X is a contraction, meaning that ∥ X ∥ ≤ 1 ; otherwise, we scale it. In this case, the map Φ : L ( H ) → L ( H ) defined by Φ ( E ) = X * E X is a contractive positive map. By the definition of the mixed space, there exists an operator Y ∈ L ( H ) such that A Y = X * B . By substituting this, we obtain:
X * B 2 X = ( X * B ) ( B X ) = ( A Y ) ( Y * A ) = A Y Y * A ≤ ∥ Y ∥ 2 A 2 .
By leveraging the operator convexity properties established for contractive maps [44,45], we obtain X * B X ≤ X * B 2 X . On the other hand, since the function f ( t ) = t is operator monotone, we deduce that X * B 2 X ≤ ∥ Y ∥ 2 A 2 = ∥ Y ∥ A . By combining these bounds, we get:
( X * B ) ( X * B ) * = X * B X ≤ ∥ Y ∥ A = ∥ Y ∥ ( A ) ( A ) * .
By using the equivalence between assertion (ii) and assertion (i) of Douglas’ theorem (Theorem 1), this operator inequality guarantees the range inclusion Ran ( X * B ) ⊆ Ran ( A ) . Thus, X ∈ L A , B ( H ) . This completes the proof. □
The following definition establishes the core metric topology across mixed generator spaces.
Definition 3. 
For an operator X ∈ L A , B ( H ) , we define the mixed ( A , B ) -operator seminorm by
∥ X ∥ A , B = sup ∥ X u ∥ B : u ∈ S A 1 ( H ) .
Remark 1. 
Let X ∈ L A , B ( H ) . Then ∥ X ∥ A , B = 0 if and only if X Ran ( A ) ¯ ⊆ Ker ( B ) . In general, therefore, ∥ · ∥ A , B is only a seminorm on L A , B ( H ) . It is a norm precisely when B is injective, and no injectivity assumption on A is needed.
Analogously, the spaces L B , A ( H ) and L B , A ( H ) , the distinguished mixed adjoint Y ♯ B , A , and the mixed seminorm ∥ Y ∥ B , A are defined symmetrically for an operator Y ∈ L ( H ) by reversing the roles of A and B . When considering operators under a uniform generator A , we naturally recover the standard notations X ♯ A and L A ( H ) .
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 A , B , C ∈ L + ( H ) . Then, the following assertions hold:
(i)
If X ∈ L A , B ( H ) , then the mixed ( A , B ) -operator seminorm satisfies
∥ X ∥ A , B = sup | ⟨ X u , v ⟩ B |   :   u ∈ S A 1 ( H ) , v ∈ S B 1 ( H ) .
Consequently, if X ∈ L A , B ( H ) , we obtain the equality
∥ X ♯ A , B ∥ B , A   =   ∥ X ∥ A , B .
(ii)
If Y ∈ L A , B ( H ) and X ∈ L B , C ( H ) , then X Y ∈ L A , C ( H ) and we have
∥ X Y ∥ A , C   ≤   ∥ X ∥ B , C ∥ Y ∥ A , B .
Proof. 
(i) Suppose that X ∈ L A , B ( H ) . By taking the supremum over all v ∈ S B 1 ( H ) , we obtain sup v ∈ S B 1 ( H ) | ⟨ X u , v ⟩ B |   ≤   ∥ X u ∥ B . On the other hand, if ∥ X u ∥ B ≠ 0 , by choosing v = X u ∥ X u ∥ B ∈ S B 1 ( H ) , we deduce ⟨ X u , v ⟩ B = ∥ X u ∥ B . If ∥ X u ∥ B = 0 , the equality holds trivially. Thus, we deduce
sup v ∈ S B 1 ( H ) | ⟨ X u , v ⟩ B |   =   ∥ X u ∥ B .
By taking the supremum over all u ∈ S A 1 ( H ) in (8), we obtain the first identity.
To establish the norm equality, we utilize the definition of the mixed adjoint. Assume that X ∈ L A , B ( H ) . By definition, we have ⟨ X u , v ⟩ B = ⟨ u , X ♯ A , B v ⟩ A . By substituting this into the established supremum formula, we obtain:
∥ X ∥ A , B = sup u ∈ S A 1 ( H ) , v ∈ S B 1 ( H ) | ⟨ X u , v ⟩ B | = sup u ∈ S A 1 ( H ) , v ∈ S B 1 ( H ) | ⟨ u , X ♯ A , B v ⟩ A | =   ∥ X ♯ A , B ∥ B , A .
This implies the desired equality.
(ii) Let u ∈ S A 1 ( H ) . By using the definition of the mixed ( B , C ) -operator seminorm for X , we obtain for any vector v ∈ H that ∥ X v ∥ C ≤ ∥ X ∥ B , C ∥ v ∥ B . By substituting v = Y u , we deduce:
∥ X ( Y u ) ∥ C ≤ ∥ X ∥ B , C ∥ Y u ∥ B .
Since Y ∈ L A , B ( H ) , we further bound the right side using the mixed ( A , B ) -seminorm of Y :
∥ X Y u ∥ C ≤ ∥ X ∥ B , C ∥ Y ∥ A , B ∥ u ∥ A .
Since this bound holds for all u ∈ H , it follows that X Y ∈ L A , C ( H ) . By taking the supremum over all u ∈ S A 1 ( H ) , we obtain ∥ X Y ∥ A , C ≤ ∥ X ∥ B , C ∥ Y ∥ A , B . 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 2 × 2 matrices within the direct sum space.
In this section, we introduce the foundational spaces and operators utilized throughout the manuscript. Let H be a complex Hilbert space. Throughout this paper, K exclusively denotes the direct sum Hilbert space H ⊕ H , and A denotes the 2 × 2 diagonal operator matrix diag ( A , B ) , where A , B ∈ L + ( H ) . We equip K with the canonical inner product:
⟨ u , v ⟩ = ⟨ u 1 , v 1 ⟩ H + ⟨ u 2 , v 2 ⟩ H ,
for all column vectors u = u 1 u 2 ∈ K and v = v 1 v 2 ∈ K . It is evident that A ∈ L + ( K ) .
The matrix A induces a positive semi-definite sesquilinear form on K :
⟨ u , v ⟩ A = ⟨ A u , v ⟩ = ⟨ A u 1 , v 1 ⟩ H + ⟨ B u 2 , v 2 ⟩ H = ⟨ u 1 , v 1 ⟩ A + ⟨ u 2 , v 2 ⟩ B .
The following theorem provides necessary and sufficient conditions for an operator matrix to admit an A -adjoint.
Theorem 2. 
An operator matrix X = X 11 X 12 X 21 X 22 admits an A -adjoint (i.e., X ∈ L A ( K ) ) if and only if its components admit their respective mixed adjoints, specifically: X 11 ∈ L A ( H ) , X 22 ∈ L B ( H ) , X 12 ∈ L B , A ( H ) , and X 21 ∈ L A , B ( H ) . In this case, we have
X 11 X 12 X 21 X 22 ♯ A = X 11 ♯ A X 21 ♯ A , B X 12 ♯ B , A X 22 ♯ B .
Proof. 
By invoking Douglas’ theorem, an operator matrix X belongs to L A ( K ) if and only if the range inclusion Ran ( X * A ) ⊆ Ran ( A ) holds. Let us explicitly evaluate the product X * A :
X * A = X 11 * X 21 * X 12 * X 22 * A 0 0 B = X 11 * A X 21 * B X 12 * A X 22 * B .
Since A = diag ( A , B ) , its range is strictly the direct sum of the ranges of its diagonal components, meaning Ran ( A ) = Ran ( A ) ⊕ Ran ( B ) . Therefore, the global condition Ran ( X * A ) ⊆ Ran ( A ) is mathematically equivalent to stating that for any column vector u = u 1 u 2 ∈ K , the following holds:
X 11 * A u 1 + X 21 * B u 2 X 12 * A u 1 + X 22 * B u 2 ∈ Ran ( A ) ⊕ Ran ( B ) .
Assume that X ∈ L A ( K ) . By setting u 2 = 0 in (10), we obtain X 11 * A u 1 ∈ Ran ( A ) and X 12 * A u 1 ∈ Ran ( B ) for all u 1 ∈ H . This implies Ran ( X 11 * A ) ⊆ Ran ( A ) and Ran ( X 12 * A ) ⊆ Ran ( B ) . By Douglas’ theorem, this guarantees X 11 ∈ L A ( H ) and X 12 ∈ L B , A ( H ) . Similarly, by setting u 1 = 0 , we obtain X 21 * B u 2 ∈ Ran ( A ) and X 22 * B u 2 ∈ Ran ( B ) for all u 2 ∈ H . This implies Ran ( X 21 * B ) ⊆ Ran ( A ) and Ran ( X 22 * B ) ⊆ Ran ( B ) . Hence, X 21 ∈ L A , B ( H ) and X 22 ∈ L B ( H ) .
Conversely, assume that the components belong to their respective mixed spaces. By definition, we have Ran ( X 11 * A ) ⊆ Ran ( A ) , Ran ( X 12 * A ) ⊆ Ran ( B ) , Ran ( X 21 * B ) ⊆ Ran ( A ) , and Ran ( X 22 * B ) ⊆ Ran ( B ) . Since Ran ( A ) and Ran ( B ) are linear subspaces, they are closed under addition. Thus, for any vectors u 1 , u 2 ∈ H , we obtain:
X 11 * A u 1 + X 21 * B u 2 ∈ Ran ( A ) , X 12 * A u 1 + X 22 * B u 2 ∈ Ran ( B ) .
It follows that the resulting vector resides in Ran ( A ) ⊕ Ran ( B ) = Ran ( A ) . Therefore, Ran ( X * A ) ⊆ Ran ( A ) , which implies X ∈ L A ( K ) .
Let S be the matrix on the right-hand side of (9). By hypothesis, we have the identities A X 11 ♯ A = X 11 * A , B X 22 ♯ B = X 22 * B , B X 12 ♯ B , A = X 12 * A , and A X 21 ♯ A , B = X 21 * B . By computing the matrix product A S , we obtain:
A S = A 0 0 B X 11 ♯ A X 21 ♯ A , B X 12 ♯ B , A X 22 ♯ B = A X 11 ♯ A A X 21 ♯ A , B B X 12 ♯ B , A B X 22 ♯ B = X 11 * A X 21 * B X 12 * A X 22 * B = X 11 * X 21 * X 12 * X 22 * A 0 0 B = X * A .
Since X ♯ A is the unique operator satisfying A X ♯ A = X * A such that Ran ( X ♯ A ) ⊆ Ran ( A ) ¯ , it remains to show that Ran ( S ) ⊆ Ran ( A ) ¯ . Let u = u 1 u 2 ∈ K . Since Ran ( X 11 ♯ A ) ⊆ Ran ( A ) ¯ and Ran ( X 21 ♯ A , B ) ⊆ Ran ( A ) ¯ , the first component of S u resides in Ran ( A ) ¯ . Similarly, the second component resides in Ran ( B ) ¯ . Thus, we deduce that S u ∈ Ran ( A ) ¯ ⊕ Ran ( B ) ¯ = Ran ( A ) ¯ . This implies that Ran ( S ) ⊆ Ran ( A ) ¯ . This completes the proof. □
Remark 2. 
It should be noted here that the first summand of K = H ⊕ H carries the seminorm ∥ · ∥ A and the second carries ∥ · ∥ B . Throughout the paper, the block X i j 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, X 12 maps the B -summand into the A -summand, which is why X 12 ∈ L B , A ( H ) and why its seminorm is ∥ X 12 ∥ B , A ; likewise, X 21 maps the A -summand into the B -summand and belongs to L A , B ( H ) . 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 X 21 ♯ A , B maps the B -summand into the A -summand and occupies the ( 1 , 2 ) position in (9), while X 12 ♯ B , A occupies the ( 2 , 1 ) 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 A and B with their respective square roots A and B .
Corollary 1. 
An operator matrix X = X 11 X 12 X 21 X 22 ∈ L A ( K ) if and only if its components satisfy X 11 ∈ L A ( H ) , X 22 ∈ L B ( H ) , X 12 ∈ L B , A ( H ) , and X 21 ∈ L A , B ( H ) .
The next result provides an upper bound for the A -operator seminorm.
Lemma 3. 
Let X = X 11 X 12 X 21 X 22 ∈ L A ( K ) . Then, we have
∥ X ∥ A ≤ ∥ X ^ A ∥ ,
where X ^ A = ∥ X 11 ∥ A ∥ X 12 ∥ B , A ∥ X 21 ∥ A , B ∥ X 22 ∥ B .
Proof. 
Let u = u 1 u 2 ∈ K . By using the definition, we obtain:
∥ X u ∥ A 2 =   ∥ A X u ∥ 2 =   ∥ X 11 u 1 + X 12 u 2 ∥ A 2 + ∥ X 21 u 1 + X 22 u 2 ∥ B 2 ≤ ( ∥ X 11 u 1 ∥ A + ∥ X 12 u 2 ∥ A ) 2 + ( ∥ X 21 u 1 ∥ B + ∥ X 22 u 2 ∥ B ) 2 .
Let u ^ A = ∥ u 1 ∥ A ∥ u 2 ∥ B ∈ R 2 . Since ∥ u ^ A ∥   = ∥ u 1 ∥ A 2 +   ∥ u 2 ∥ B 2 = ∥ u ∥ A , by expanding (12), we obtain:
∥ X u ∥ A 2 ≤ ( ∥ X 11 ∥ A ∥ u 1 ∥ A + ∥ X 12 ∥ B , A ∥ u 2 ∥ B ) 2 + ( ∥ X 21 ∥ A , B ∥ u 1 ∥ A + ∥ X 22 ∥ B ∥ u 2 ∥ B ) 2 = X ^ A u ^ A 2 ≤ ∥ X ^ A ∥ 2 ∥ u ^ A ∥ 2 = ∥ X ^ A ∥ 2 ∥ u ∥ A 2 .
By taking the supremum over all u ∈ S A 1 ( K ) in the last inequality, we get (11) as requested. This completes the proof. □
We are now in a position to state our next main result, which bounds the A -spectral radius of an arbitrary 2 × 2 block operator matrix by the ordinary spectral radius of the 2 × 2 scalar matrix formed from the mixed seminorms of its entries.
Theorem 3. 
Let X = X 11 X 12 X 21 X 22 ∈ L A ( K ) . Then, r A ( X ) ≤ r ( X ^ A ) . That is
r A X 11 X 12 X 21 X 22 ≤ r ∥ X 11 ∥ A ∥ X 12 ∥ B , A ∥ X 21 ∥ A , B ∥ X 22 ∥ B .
Proof. 
Let Y = Y 11 Y 12 Y 21 Y 22 ∈ L A ( K ) . To prove (13), we first establish a general entrywise inequality between the 2 × 2 real matrices X Y ^ A and X ^ A Y ^ A for appropriately bounded block matrices X and Y . To formalize the mappings, let E 1 = A and E 2 = B . The ( i , j ) block component of an operator matrix on K maps from the space equipped with the generator E j to the space equipped with the generator E i . Thus, its bounding mixed seminorm is evaluated as ∥ · ∥ E j , E i .
By evaluating the ( i , j ) entry of X Y ^ A using matrix multiplication and the triangle inequality, we obtain:
X Y ^ A i j = ∑ k = 1 2 X i k Y k j E j , E i ≤ ∑ k = 1 2 X i k Y k j E j , E i .
By employing the generalized mixed submultiplicativity established in Proposition 1(ii), we systematically bound each term:
X Y ^ A i j ≤ ∑ k = 1 2 ∥ X i k ∥ E k , E i ∥ Y k j ∥ E j , E k .
We observe that this upper bound is exactly the algebraic formula for the ( i , j ) entry of the matrix product X ^ A Y ^ A . Since this holds for all indices i , j ∈ { 1 , 2 } , we deduce the global entrywise matrix inequality:
0 ≤ X Y ^ A ≤ X ^ A Y ^ A .
It is a standard property of the spectral norm for matrices with non-negative entries that if 0 ≤ M ≤ N entrywise, then ∥ M ∥   ≤   ∥ N ∥ . By applying this monotonicity property, we infer:
∥ X Y ^ A ∥ ≤   ∥ X ^ A Y ^ A ∥ .
Finally, since the standard matrix norm is submultiplicative, we obtain ∥ X ^ A Y ^ A ∥   ≤   ∥ X ^ A ∥ ∥ Y ^ A ∥ , which yields the fundamental matrix bound:
∥ X Y ^ A ∥   ≤   ∥ X ^ A ∥ ∥ Y ^ A ∥ .
By employing (11) alongside (14) and an induction argument, we deduce:
∥ X n ∥ A ≤   X n ^ A ≤ X ^ A n ,
for all n ∈ N . By utilizing the formula for the A -spectral radius, we obtain:
r A ( X ) = lim n → ∞ ∥ X n ∥ A 1 n ≤ lim n → ∞ X ^ A n 1 n = r ( X ^ A ) .
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 X = X 11 0 0 X 22 , Y = 0 X 12 X 21 0 ∈ L A ( K ) . Then, the following assertions hold:
(a) 
∥ X ∥ A = max ∥ X 11 ∥ A , ∥ X 22 ∥ B .
(b) 
∥ Y ∥ A = max ∥ X 12 ∥ B , A , ∥ X 21 ∥ A , B .
Proof. 
(a) Let u = u 1 u 2 and v = v 1 v 2 ∈ K . Applying the Cauchy–Schwarz and arithmetic-geometric mean inequalities, we obtain:
| ⟨ X u , v ⟩ A | ≤   | ⟨ X 11 u 1 , v 1 ⟩ A |   +   | ⟨ X 22 u 2 , v 2 ⟩ B | ≤   ∥ X 11 ∥ A ∥ u 1 ∥ A ∥ v 1 ∥ A   +   ∥ X 22 ∥ B ∥ u 2 ∥ B ∥ v 2 ∥ B ≤ max ∥ X 11 ∥ A , ∥ X 22 ∥ B 1 2 ∥ u 1 ∥ A 2   +   ∥ v 1 ∥ A 2   +   ∥ u 2 ∥ B 2   +   ∥ v 2 ∥ B 2 = 1 2 ( ∥ u ∥ A 2   +   ∥ v ∥ A 2 ) max ∥ X 11 ∥ A , ∥ X 22 ∥ B .
By taking the supremum over independent vectors u , v ∈ S A 1 ( K ) in (15), we deduce:
∥ X ∥ A ≤ max ∥ X 11 ∥ A , ∥ X 22 ∥ B .
Let x , z ∈ S A 1 ( H ) . By letting u = x 0 and v = z 0 , we have u , v ∈ S A 1 ( K ) . By evaluating the inner product, we obtain:
∥ X ∥ A ≥   | ⟨ X u , v ⟩ A |   =   | ⟨ X 11 x , z ⟩ A | .
By taking the supremum over all such x and z , we deduce that ∥ X ∥ A ≥ ∥ X 11 ∥ A . Symmetrically, by isolating the second component, we infer that ∥ X ∥ A ≥ ∥ X 22 ∥ B . This implies the desired equality.
(b) Let u = u 1 u 2 ∈ K . By expanding the squared seminorm, we obtain:
∥ Y u ∥ A 2 =   ∥ X 12 u 2 ∥ A 2   +   ∥ X 21 u 1 ∥ B 2 ≤   ∥ X 12 ∥ B , A 2 ∥ u 2 ∥ B 2   +   ∥ X 21 ∥ A , B 2 ∥ u 1 ∥ A 2 ≤   max ∥ X 12 ∥ B , A 2 , ∥ X 21 ∥ A , B 2 ∥ u 1 ∥ A 2   +   ∥ u 2 ∥ B 2 =   max ∥ X 12 ∥ B , A 2 , ∥ X 21 ∥ A , B 2 ∥ u ∥ A 2 .
This implies that ∥ Y ∥ A ≤ max ( ∥ X 12 ∥ B , A , ∥ X 21 ∥ A , B ) . Let x ∈ S B 1 ( H ) and define u = 0 x ∈ K . Since u ∈ S A 1 ( K ) , we obtain:
∥ Y ∥ A ≥ ∥ Y u ∥ A = ∥ X 12 x ∥ A .
By taking the supremum over all x ∈ S B 1 ( H ) , we deduce ∥ Y ∥ A ≥ ∥ X 12 ∥ B , A . Similarly, by isolating the first component, we infer ∥ Y ∥ A ≥ ∥ X 21 ∥ A , B . 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 A -unitary framework [12].
Definition 4. 
An operator X ∈ L ( H ) is called an ( A , B ) -isometry if it satisfies ∥ X u ∥ B = ∥ u ∥ A for all u ∈ H . Furthermore, an operator U ∈ L A , B ( H ) is called an ( A , B ) -unitary operator if U is an ( A , B ) -isometry and U ♯ A , B is a ( B , A ) -isometry. We denote the set of all ( A , B ) -unitary operators by U A , B ( H ) .
Remark 3. 
It should be noted here that if A = B , then U A , B ( H ) reduces to U A ( H ) , the set of all A -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 U ∈ U A , B ( H ) is an ( A , B ) -unitary operator. Let X ∈ L A ( H ) and Y ∈ L B ( H ) . Then, the following hold:
ω B ( U X U ♯ A , B ) = ω A ( X ) ,
and
ω A ( U ♯ A , B Y U ) = ω B ( Y ) .
Proof. 
Let u ∈ S B 1 ( H ) . By definition, since U is an ( A , B ) -unitary operator, we have ∥ U ♯ A , B u ∥ A = ∥ u ∥ B = 1 . Let v = U ♯ A , B u ∈ S A 1 ( H ) . By using the definition of the mixed adjoint, we obtain:
⟨ U X U ♯ A , B u , u ⟩ B = ⟨ X U ♯ A , B u , U ♯ A , B u ⟩ A = ⟨ X v , v ⟩ A .
By taking the supremum over all u ∈ S B 1 ( H ) , we deduce that ω B ( U X U ♯ A , B ) ≤ ω A ( X ) .
Conversely, suppose that y ∈ S A 1 ( H ) . Let z = U y . Since ∥ U y ∥ B = ∥ y ∥ A = 1 , we get z ∈ S B 1 ( H ) . Since ∥ U y ∥ B 2 = ∥ y ∥ A 2 , we deduce that ⟨ U * B U y , y ⟩ = ⟨ A y , y ⟩ for all y , which implies U * B U = A . By definition of the mixed adjoint, we have A U ♯ A , B = U * B . Thus, we obtain A U ♯ A , B U = U * B U = A . This implies that U ♯ A , B U y − y ∈ Ker ( A ) . Since X ∈ L A ( H ) , it leaves Ker ( A ) invariant, so A X U ♯ A , B U y = A X y . Therefore, we obtain:
⟨ U X U ♯ A , B z , z ⟩ B = ⟨ X U ♯ A , B U y , U ♯ A , B U y ⟩ A = ⟨ A X U ♯ A , B U y , U ♯ A , B U y ⟩ = ⟨ A X y , U ♯ A , B U y ⟩ = ⟨ X y , A U ♯ A , B U y ⟩ = ⟨ X y , A y ⟩ = ⟨ X y , y ⟩ A .
By taking the supremum over all such z ∈ S B 1 ( H ) , we deduce ω A ( X ) ≤ ω B ( U X U ♯ A , B ) . Consequently, we obtain (16) as desired.
Let x ∈ S A 1 ( H ) . Let w = U x . Because U is an ( A , B ) -unitary operator, we have ∥ w ∥ B = ∥ U x ∥ B = ∥ x ∥ A = 1 . Thus, we obtain w ∈ S B 1 ( H ) . By applying the definition of the mixed adjoint, we obtain:
⟨ U ♯ A , B Y U x , x ⟩ A = ⟨ Y U x , U x ⟩ B = ⟨ Y w , w ⟩ B .
By taking the supremum over all x ∈ S A 1 ( H ) , we deduce ω A ( U ♯ A , B Y U ) ≤ ω B ( Y ) .
Conversely, suppose that t ∈ S B 1 ( H ) . Let s = U ♯ A , B t . Because U is an ( A , B ) -unitary operator, we have ∥ s ∥ A   =   ∥ U ♯ A , B t ∥ A = ∥ t ∥ B = 1 , which implies s ∈ S A 1 ( H ) . Since ∥ U ♯ A , B t ∥ A 2 = ∥ t ∥ B 2 , we deduce that ⟨ A U ♯ A , B t , U ♯ A , B t ⟩ = ⟨ B t , t ⟩ for all t . By definition of the mixed adjoint, we have A U ♯ A , B = U * B . This implies ⟨ U * B t , U ♯ A , B t ⟩ = ⟨ B t , t ⟩ , and therefore ⟨ B t , U U ♯ A , B t ⟩ = ⟨ B t , t ⟩ . Thus, we obtain B U U ♯ A , B = B . This implies that U U ♯ A , B t − t ∈ Ker ( B ) . Since Y ∈ L B ( H ) , it leaves Ker ( B ) invariant. This implies B Y U U ♯ A , B t = B Y t . Therefore, we deduce:
⟨ U ♯ A , B Y U s , s ⟩ A = ⟨ Y U U ♯ A , B t , U U ♯ A , B t ⟩ B = ⟨ B Y U U ♯ A , B t , U U ♯ A , B t ⟩ = ⟨ B Y t , U U ♯ A , B t ⟩ = ⟨ Y t , B U U ♯ A , B t ⟩ = ⟨ Y t , B t ⟩ = ⟨ Y t , t ⟩ B .
By taking the supremum over all t ∈ S B 1 ( H ) , we deduce ω B ( Y ) ≤ ω A ( U ♯ A , B Y U ) . Consequently, we obtain (17) as claimed. This completes the proof. □
Remark 4. 
We point out that if A = B , then U A , B ( H ) reduces to U A ( H ) , the class of A -unitary operators, and Lemma 4 recovers the known unitary invariance of the A -numerical radius,
ω A ( U X U ♯ A ) = ω A ( U ♯ A X U ) = ω A ( X ) ,
for all U ∈ U A ( H ) and X ∈ L A ( H ) ; 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 X 11 ∈ L A ( H ) and X 22 ∈ L B ( H ) . Then
ω A X 11 0 0 X 22 = max ω A ( X 11 ) , ω B ( X 22 ) .
(ii) 
Let X 11 X 12 X 21 X 22 ∈ L A ( K ) and A ˜ = diag ( B , A ) . Then
ω A X 11 X 12 X 21 X 22 = ω A ˜ X 22 X 21 X 12 X 11 .
In particular, we have
ω A 0 X 12 X 21 0 = ω A ˜ 0 X 21 X 12 0 .
(iii) 
Let X 12 ∈ L B , A ( H ) and X 21 ∈ L A , B ( H ) . Then for any θ ∈ R ,
ω A 0 X 12 e i θ X 21 0 = ω A 0 X 12 X 21 0 .
Proof. 
(i) Let T = X 11 0 0 X 22 and u = u 1 u 2 ∈ S A 1 ( K ) , which implies ∥ u 1 ∥ A 2   +   ∥ u 2 ∥ B 2 = 1 . By using the Cauchy–Schwarz inequality for the mixed components, we deduce:
| ⟨ T u , u ⟩ A | ≤   | ⟨ X 11 u 1 , u 1 ⟩ A |   +   | ⟨ X 22 u 2 , u 2 ⟩ B | ≤ ω A ( X 11 ) ∥ u 1 ∥ A 2   +   ω B ( X 22 ) ∥ u 2 ∥ B 2 ≤ max ω A ( X 11 ) , ω B ( X 22 ) .
By taking the supremum over all u ∈ S A 1 ( K ) , we infer that
ω A ( T ) ≤ max ω A ( X 11 ) , ω B ( X 22 ) .
Suppose x ∈ S A 1 ( H ) and define u = x 0 ∈ S A 1 ( K ) . Then, we obtain
| ⟨ T u , u ⟩ A | =   | ⟨ X 11 x , x ⟩ A | .
By taking the supremum over all x ∈ S A 1 ( H ) , we deduce
sup x ∈ S A 1 ( H ) | ⟨ T u , u ⟩ A | = ω A ( X 11 ) ,
and thus we infer ω A ( T ) ≥ ω A ( X 11 ) . Similarly, for any y ∈ S B 1 ( H ) , by defining v = 0 y ∈ S A 1 ( K ) , we deduce ω A ( T ) ≥ ω B ( X 22 ) . Therefore, we obtain ω A ( T ) = max { ω A ( X 11 ) , ω B ( X 22 ) } . This completes the proof of Theorem 4(i).
(ii) Let A ˜ = B 0 0 A be a diagonal operator matrix on K . Let U = 0 I H I H 0 . By computing the matrix multiplication, we obtain:
U * A = 0 I H I H 0 A 0 0 B = 0 B A 0 .
Since Ran ( U * A ) ⊆ Ran ( A ˜ ) holds trivially, we deduce that U ∈ L A ˜ , A ( K ) . By solving the equation A ˜ Y = U * A blockwise, we compute the explicit mixed adjoint using the Moore–Penrose pseudoinverse. Specifically, we multiply the diagonal pseudoinverse A ˜ † = diag ( B † , A † ) by the matrix U * A . Applying the fundamental property T † T = Π Ran ( T ) ¯ to the positive generators A and B , we obtain:
U ♯ A ˜ , A = A ˜ † U * A = B † 0 0 A † 0 B A 0 = 0 B † B A † A 0 = 0 Π Ran ( B ) ¯ Π Ran ( A ) ¯ 0 .
By evaluating the respective mixed seminorms, we verify the isometric properties ∥ U u ∥ A = ∥ u ∥ A ˜ for all u ∈ K and ∥ U ♯ A ˜ , A v ∥ A ˜ = ∥ v ∥ A for all v ∈ K . Thus, we deduce that U is a ( A ˜ , A ) -unitary operator mapping between the two semi-inner product spaces. Let S = X 11 X 12 X 21 X 22 . Applying unitary invariance across these isometrically isomorphic spaces presented in (17), we obtain:
ω A ( S ) = ω A ˜ U ♯ A ˜ , A S U = ω A ˜ Π Ran ( B ) ¯ X 22 Π Ran ( B ) ¯ X 21 Π Ran ( A ) ¯ X 12 Π Ran ( A ) ¯ X 11 = ω A ˜ Π Ran ( B ) ¯ 0 0 Π Ran ( A ) ¯ X 22 X 21 X 12 X 11 = ω A ˜ Π Ran ( A ˜ ) ¯ X 22 X 21 X 12 X 11 = ω A ˜ X 22 X 21 X 12 X 11 .
The last equality follows from [38]. This proves (19). Suppose that X 11 = 0 and X 22 = 0 . By substituting these into (19), we obtain the desired equality (20).
(iii) Suppose that θ ∈ R . Let T = 0 X 12 X 21 0 and U = I H 0 0 e − i θ 2 I H . It can be seen that U U * = I K and A U = U A . By definition, we have A U ♯ A = U * A . Then, we obtain U A U ♯ A = U U * A = A . Since A U = U A , it follows that A U U ♯ A = A . Similarly, we get A U ♯ A U = A . Thus, we deduce that U ∈ U A ( K ) . Applying (18), we obtain ω A ( U ♯ A T U ) = ω A ( T ) . Since A U = U A , we have U ♯ A = Π Ran ( A ) ¯ U * [12]. Since Π Ran ( A ) ¯ does not affect the A -numerical radius, it follows that ω A ( U ♯ A T U ) = ω A ( U * T U ) . By computing the matrix multiplication, we get:
U * T U = I H 0 0 e i θ 2 I H 0 X 12 X 21 0 I H 0 0 e − i θ 2 I H = 0 e − i θ 2 X 12 e i θ 2 X 21 0 = e − i θ 2 0 X 12 e i θ X 21 0 .
We have ω A ( e − i θ 2 S ) = ω A ( S ) for any block operator matrix S . We deduce:
ω A 0 X 12 e i θ X 21 0 = ω A ( T ) .
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 U = 0 I H I H 0 . We observe that U * A ˜ U = A . Let u ∈ K . Since U u = u 2 u 1 , we have
∥ U u ∥ A ˜ 2 = ⟨ A ˜ U u , U u ⟩ = ⟨ U * A ˜ U u , u ⟩ = ⟨ A u , u ⟩ = ∥ u ∥ A 2 .
Furthermore, for any block operator matrix S , the numerical radius formulation yields
ω A ˜ ( U S U ) = sup v ∈ S A ˜ 1 ( K ) | ⟨ U S U v , v ⟩ A ˜ | .
By performing the change in variables v = U u and utilizing the identity U * A ˜ U = A , we obtain ⟨ U S U v , v ⟩ A ˜ = ⟨ A ˜ U S u , U u ⟩ = ⟨ U * A ˜ U S u , u ⟩ = ⟨ A S u , u ⟩ = ⟨ S u , u ⟩ A . Taking the supremum over all unit vectors gives
ω A ˜ ( U S U ) = ω A ( S ) .
By applying this to S = X 11 X 12 X 21 X 22 , we immediately deduce (19).
The following result is a consequence of Theorem 4(i) by setting A = B and was already proved in [38]. For the sake of completeness, we include its proof.
Corollary 2. 
Let X , Y ∈ L A ( H ) .
ω A X Y Y X = max ω A ( X + Y ) , ω A ( X − Y ) .
In particular, by taking X = 0 , we obtain:
ω A 0 Y Y 0 = ω A ( Y ) .
Proof. 
Assume that A = B . Then A = diag ( A , A ) . Let U = 1 2 I H I H I H − I H . Since U U * = I K and U A = A U , we deduce that U is an A -unitary operator. Let S = X Y Y X . By computing the matrix multiplication, we obtain U * S U = X + Y 0 0 X − Y . By applying the unitary invariance stated in (18), we obtain ω A ( S ) = ω A ( U ♯ A S U ) . Since U ♯ A = Π Ran ( A ) ¯ U * and Π Ran ( A ) ¯ does not affect the A -numerical radius, we have ω A ( S ) = ω A ( U * S U ) . By using Theorem 4(i) for the diagonal block matrix, we obtain
ω A ( U * S U ) = max { ω A ( X + Y ) , ω A ( X − Y ) } .
This yields the first identity. Suppose that X = 0 . We obtain max { ω A ( Y ) , ω A ( − Y ) } . Since ω A ( − Y ) = ω A ( Y ) , 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 2 × 2 operator matrix across distinct generators.
Lemma 5. 
Let X 12 ∈ L B , A ( H ) and X 21 ∈ L A , B ( H ) . Then, we have
ω A 0 X 12 X 21 0 = 1 2 sup θ ∈ R e i θ X 12 + e − i θ X 21 ♯ A , B B , A .
Proof. 
Let Y = 0 X 12 X 21 0 . By using Proposition 2(b) together with (7), we obtain:
0 Z Z ♯ B , A 0 A =   ∥ Z ∥ B , A ,
for every Z ∈ L B , A ( H ) . By utilizing the properties of the numerical radius for the generalized adjoint (since ω A ( Y ) = ω A ( Y ♯ A ) ) and applying the first identity in (2) directly to Y ♯ A together with (9), we deduce:
ω A 0 X 12 X 21 0 = ω A 0 X 12 X 21 0 ♯ A = 1 2 sup θ ∈ R e i θ 0 X 21 ♯ A , B X 12 ♯ B , A 0 + e − i θ 0 ( X 12 ♯ B , A ) ♯ A , B ( X 21 ♯ A , B ) ♯ B , A 0 A = 1 2 sup θ ∈ R 0 e i θ X 21 ♯ A , B + e − i θ ( X 12 ♯ B , A ) ♯ A , B e i θ X 12 ♯ B , A + e − i θ ( X 21 ♯ A , B ) ♯ B , A 0 A = 1 2 sup θ ∈ R 0 e i θ X 21 ♯ A , B + e − i θ ( X 12 ♯ B , A ) ♯ A , B e i θ X 21 ♯ A , B + e − i θ ( X 12 ♯ B , A ) ♯ A , B ♯ B , A 0 A ,
where the last equality follows from (6). Since e i θ X 21 ♯ A , B + e − i θ ( X 12 ♯ B , A ) ♯ A , B ∈ L B , A ( H ) and its ( B , A ) -adjoint constitutes the ( 2 , 1 ) block component, then by evaluating the mixed norms through (21), the maximum simplifies to a single term. By using this, we deduce:
ω A ( Y ) = 1 2 sup θ ∈ R e i θ X 21 ♯ A , B + e − i θ ( X 12 ♯ B , A ) ♯ A , B B , A = 1 2 sup θ ∈ R e i θ X 12 ♯ B , A + e − i θ X 21 A , B .
The last equality holds by directly applying (7) to the composite operator Z = e i θ X 12 ♯ B , A + e − i θ X 21 , since the expression inside the ( B , A ) -seminorm is precisely Z ♯ A , B . By replacing θ with − θ in the last equality, we obtain:
ω A 0 X 12 X 21 0 = 1 2 sup θ ∈ R e − i θ X 12 ♯ B , A + e i θ X 21 A , B .
Let A ˜ = B 0 0 A be an operator matrix on K . By Theorem 4(ii), we infer that
ω A 0 X 12 X 21 0 = ω A ˜ 0 X 21 X 12 0 .
By applying the established identity (22) to the permuted matrix 0 X 21 X 12 0 operating under the flipped seminorm system generated by A ˜ , we explicitly interchange the roles of X 12 and X 21 , along with the generators A and B . From this substitution, we obtain:
ω A ˜ 0 X 21 X 12 0 = 1 2 sup θ ∈ R e − i θ X 21 ♯ A , B + e i θ X 12 B , A .
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 2 × 2 scalar matrix structure.
Corollary 3. 
Let X = X 11 X 12 X 21 X 22 ∈ L A ( K ) . Then,
ω A ( X ) ≤ ω ( S ) ,
where S = [ S i j ] ∈ M 2 ( R ) is given by
S = ω A ( X 11 ) ω A 0 X 12 X 21 0 ω A 0 X 12 X 21 0 ω B ( X 22 ) .
Proof. 
By using the definition of the real part with respect to A for θ ∈ R , we obtain:
ℜ A ( e i θ X ) = 1 2 e i θ X + e − i θ X ♯ A = ℜ A ( e i θ X 11 ) 1 2 e i θ X 12 + e − i θ X 21 ♯ A , B 1 2 e i θ X 21 + e − i θ X 12 ♯ B , A ℜ B ( e i θ X 22 ) .
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:
ℜ A ( e i θ X ) A ≤   ω A ( X 11 ) ω A 0 X 12 X 21 0 ω A ˜ 0 X 21 X 12 0 ω B ( X 22 ) .
By taking the supremum over all θ ∈ R in the above inequality, we obtain ω A ( X ) ≤ ∥ S ∥ , where S is defined in (25). Finally, by using (23), we deduce ω A ˜ 0 X 21 X 12 0 = ω A 0 X 12 X 21 0 . Since S is a real symmetric matrix, then ω ( S )   =   ∥ S ∥ . By using this, we infer the required inequality. This completes the proof. □
Recall that the notation Y ≤ A X means that X − Y ≥ A 0 , which is equivalent to the operator inequality A ( X − Y ) ≥ 0 . The next lemma establishes an essential monotonicity property and was already stated in [37].
Lemma 6. 
Let X , Y ∈ L A ( H ) be A -bounded operators. If 0 ≤ A Y ≤ A X , then ∥ Y ∥ A ≤ ∥ X ∥ A .
The next result provides the main bounds for the mixed anti-diagonal matrix.
Theorem 5. 
Let X 12 ∈ L B , A ( H ) and X 21 ∈ L A , B ( H ) . Then, for T = 0 X 12 X 21 0 , the following bounds hold:
ω A 2 ( T ) ≥ 1 4 max ∥ X 12 X 12 ♯ B , A + X 21 ♯ A , B X 21 ∥ A , ∥ X 12 ♯ B , A X 12 + X 21 X 21 ♯ A , B ∥ B ,
and
ω A 2 ( T ) ≤ 1 2 max ∥ X 12 X 12 ♯ B , A + X 21 ♯ A , B X 21 ∥ A , ∥ X 12 ♯ B , A X 12 + X 21 X 21 ♯ A , B ∥ B .
Proof. 
Let H θ = ℜ A ( e i θ T ) = 1 2 ( e i θ T + e − i θ T ♯ A ) and
K θ = ℑ A ( e i θ T ) = 1 2 i ( e i θ T − e − i θ T ♯ A ) .
By expanding the squares of these components, we deduce:
H θ 2 + K θ 2 = 1 4 e 2 i θ T 2 + T T ♯ A + T ♯ A T + e − 2 i θ ( T ♯ A ) 2 − 1 4 e 2 i θ T 2 − T T ♯ A − T ♯ A T + e − 2 i θ ( T ♯ A ) 2 = 1 2 T T ♯ A + T ♯ A T .
Next, by explicitly computing the products T T ♯ A and T ♯ A T based on Theorem 2, we obtain:
T T ♯ A = 0 X 12 X 21 0 0 X 21 ♯ A , B X 12 ♯ B , A 0 = X 12 X 12 ♯ B , A 0 0 X 21 X 21 ♯ A , B , T ♯ A T = 0 X 21 ♯ A , B X 12 ♯ B , A 0 0 X 12 X 21 0 = X 21 ♯ A , B X 21 0 0 X 12 ♯ B , A X 12 .
By summing these two block diagonal matrices, we obtain:
H θ 2 + K θ 2 = 1 2 M 0 0 N ,
where we define M = X 12 X 12 ♯ B , A + X 21 ♯ A , B X 21 ∈ L A ( H ) and N = X 12 ♯ B , A X 12 + X 21 X 21 ♯ A , B ∈ L B ( H ) .
By taking the norm on both sides and utilizing the triangle inequality and submultiplicativity of the seminorm, we deduce
1 2 M 0 0 N A =   ∥ H θ 2 + K θ 2 ∥ A   ≤   ∥ H θ ∥ A 2 +   ∥ K θ ∥ A 2 ≤ 2 ω A 2 ( T ) .
By evaluating the norm of the diagonal operator matrix, we obtain
1 2 max ∥ M ∥ A , ∥ N ∥ B ≤ 2 ω A 2 ( T ) .
This completes the proof of the first inequality.
Conversely, by rearranging the equality H θ 2 + K θ 2 = 1 2 M 0 0 N , we obtain:
H θ 2 − 1 2 M 0 0 N = − K θ 2 ≤ A 0 .
Consequently, we infer that H θ 2 ≤ A 1 2 M 0 0 N . Since H θ is A -selfadjoint, its square satisfies H θ 2 ≥ A 0 . Moreover, the block diagonal matrix 1 2 M 0 0 N is clearly A -positive by taking (26) into consideration. Thus, the hypotheses of Lemma 6 are satisfied. Applying this lemma, together with the identity ∥ H θ 2 ∥ A = ∥ H θ ∥ A 2 , which holds because H θ is A -selfadjoint (see [19]), we deduce that
∥ H θ ∥ A 2 ≤ 1 2 M 0 0 N A = 1 2 max ∥ M ∥ A , ∥ N ∥ B .
By taking the supremum over all θ ∈ R , we infer
ω A 2 ( T ) ≤ 1 2 max ∥ M ∥ A , ∥ N ∥ B .
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 X 12 = X 21 = T in Theorem 5, and it was originally obtained in [20]. For A = I H , it recovers the well-known inequalities of Kittaneh [2].
Corollary 4. 
Let T ∈ L A ( H ) . Then
1 4 ∥ T T ♯ A + T ♯ A T ∥ A ≤ ω A 2 ( T ) ≤ 1 2 ∥ T T ♯ A + T ♯ A T ∥ A .
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 X ∈ L A , B ( H ) and Y ∈ L B , A ( H ) , then Y X ∈ L A ( H ) , X Y ∈ L B ( H ) , and
r A ( Y X ) = r B ( X Y ) .
Proof. 
By using Proposition 1(ii), we obtain Y X ∈ L A ( H ) and X Y ∈ L B ( H ) . Let n ≥ 2 be an integer. We have
( Y X ) n = Y ( X Y ) n − 1 X .
By applying the submultiplicativity property for mixed seminorms, we get
∥ ( Y X ) n ∥ A ≤ ∥ Y ∥ B , A ∥ ( X Y ) n − 1 ∥ B ∥ X ∥ A , B .
It follows that
∥ ( Y X ) n ∥ A 1 n ≤ ∥ Y ∥ B , A ∥ X ∥ A , B 1 n ∥ ( X Y ) n − 1 ∥ B 1 n .
By taking the limit as n → ∞ , we obtain
r A ( Y X ) ≤ lim n → ∞ ∥ ( X Y ) n − 1 ∥ B 1 n − 1 n − 1 n = r B ( X Y ) .
Similarly, we get r B ( X Y ) ≤ r A ( Y X ) . Hence, r A ( Y X ) = r B ( X Y ) . This completes the proof. □
The next result provides an upper bound for the A -numerical radius through a decomposition of the matrix into row blocks.
Theorem 6. 
Let X = X 11 X 12 X 21 X 22 ∈ L A ( K ) . Then
ω A ( X ) ≤ 1 2 ∥ X 11 ∥ A + ∥ X 11 X 11 ♯ A + X 12 X 12 ♯ B , A ∥ A + 1 2 ∥ X 22 ∥ B + ∥ X 21 X 21 ♯ A , B + X 22 X 22 ♯ B ∥ B .
Proof. 
Step 1: We first establish a key auxiliary bound for the upper triangular block X 1 = X 11 X 12 0 0 . We claim that:
ω A ( X 1 ) ≤ 1 2 ∥ X 11 ∥ A + ∥ X 11 X 11 ♯ A + X 12 X 12 ♯ B , A ∥ A .
Since the operator ℜ A ( e i θ X 1 ) is A -selfadjoint for θ ∈ R , we apply (3) to obtain
r A ℜ A ( e i θ X 1 ) =   ∥ ℜ A ( e i θ X 1 ) ∥ A .
On the other hand, by using the spectral radius formulation, we get
r A ℜ A ( e i θ X 1 ) = 1 2 r A ( e i θ X 1 + e − i θ X 1 ♯ A ) = 1 2 r A e i θ X 11 + e − i θ X 11 ♯ A e i θ X 12 e − i θ X 12 ♯ B , A 0 .
By factoring the block matrix, we obtain
r A ℜ A ( e i θ X 1 ) = 1 2 r A X 11 ♯ A e i θ I H X 12 ♯ B , A 0 e − i θ I H 0 X 11 X 12 .
Let C = e − i θ I H 0 X 11 X 12 and D = X 11 ♯ A e i θ I H X 12 ♯ B , A 0 . Let A ′ = diag ( A , A ) acting on K . Since X 11 ∈ L A ( H ) and X 12 ∈ L B , A ( H ) , we deduce C ∈ L A , A ′ ( K ) . Similarly, since X 11 ♯ A ∈ L A ( H ) and X 12 ♯ B , A ∈ L A , B ( H ) , we obtain D ∈ L A ′ , A ( K ) . By applying Lemma 7, we get
r A ℜ A ( e i θ X 1 ) = 1 2 r A ′ ( C D ) = 1 2 r A ′ e − i θ X 11 ♯ A I H X 11 X 11 ♯ A + X 12 X 12 ♯ B , A e i θ X 11 .
By using (13) together with the identity ∥ X 11 ♯ A ∥ A = ∥ X 11 ∥ A , we get
r A ℜ A ( e i θ X 1 ) ≤ 1 2 r ∥ e − i θ X 11 ♯ A ∥ A ∥ I H ∥ A ∥ X 11 X 11 ♯ A + X 12 X 12 ♯ B , A ∥ A ∥ e i θ X 11 ∥ A ≤ 1 2 r ∥ X 11 ∥ A 1 ∥ X 11 X 11 ♯ A + X 12 X 12 ♯ B , A ∥ A ∥ X 11 ∥ A .
It follows that
r A ℜ A ( e i θ X 1 ) ≤ 1 2 ∥ X 11 ∥ A + ∥ X 11 X 11 ♯ A + X 12 X 12 ♯ B , A ∥ A .
Since
ω A ( X 1 ) = sup θ ∈ R ∥ ℜ A ( e i θ X 1 ) ∥ A = sup θ ∈ R r A ℜ A ( e i θ X 1 ) ,
we obtain (27).
Step 2: We estimate the lower triangular block X 2 = 0 0 X 21 X 22 and combine the bounds. Let A ˜ = B 0 0 A be a diagonal operator matrix on K , and let U = 0 I H I H 0 . By (19), we infer that
ω A ( X 2 ) = ω A ˜ X 22 X 21 0 0 .
By applying (27) to this matrix under the permuted seminorm system generated by A ˜ , we obtain
ω A ( X 2 ) ≤ 1 2 ∥ X 22 ∥ B + ∥ X 22 X 22 ♯ B + X 21 X 21 ♯ A , B ∥ B .
Since X = X 1 + X 2 , the triangle inequality for the A -numerical radius gives ω A ( X ) ≤ ω A ( X 1 ) + ω A ( X 2 ) . 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 X = X 11 X 12 X 21 X 22 ∈ L A ( K ) . Then, we have
ω A ( X ) ≤ max ω A ( X 11 ) , ω B ( X 22 ) + 1 2 ∥ X 12 X 12 ♯ B , A ∥ A + 1 2 ∥ X 21 X 21 ♯ A , B ∥ B .
Proof. 
By employing the triangle inequality and Theorem 4(i), we obtain:
ω A ( X ) ≤ max ω A ( X 11 ) , ω B ( X 22 ) + ω A 0 X 12 0 0 + ω A 0 0 X 21 0 .
Since strictly off-diagonal block matrices are nilpotent of degree 2, then by applying (1), we deduce that:
ω A 0 X 12 0 0 = 1 2 0 X 12 0 0 A .
Moreover, by (4), namely ∥ Z ∥ A 2 = ∥ Z Z ♯ A ∥ A , along with Proposition 2(a), we obtain:
0 X 12 0 0 A 2 =   0 X 12 0 0 0 0 X 12 ♯ B , A 0 A =   X 12 X 12 ♯ B , A 0 0 0 A =   ∥ X 12 X 12 ♯ B , A ∥ A .
Since scaling by the half coefficient evaluates the first off-diagonal term, we apply analogous arguments to the transposed term corresponding to X 21 to obtain 1 2 ∥ X 21 X 21 ♯ A , B ∥ B . 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 diag ( A , A ) as stated.
Example 2. 
Let H = C 2 with the standard inner product. Let A = 1 0 0 0 and B = 0 0 0 1 . Then A and B are distinct singular positive operators. Let X = 0 X 12 X 21 0 act on K = H ⊕ H , where X 12 = 0 1 0 0 and X 21 = 0 0 1 0 . A direct computation gives X 12 * A = 0 0 1 0 . Since Ran ( B ) = span { e 2 } , we have Ran ( X 12 * A ) ⊆ Ran ( B ) . Thus X 12 ∈ L B , A ( H ) . The reduced solution of B Y = X 12 * A is X 12 ♯ B , A = 0 0 1 0 .
Similarly, X 21 * B = 0 1 0 0 and Ran ( A ) = span { e 1 } . Hence Ran ( X 21 * B ) ⊆ Ran ( A ) , so X 21 ∈ L A , B ( H ) and X 21 ♯ A , B = 0 1 0 0 . By Theorem 2, X ∈ L A ( K ) . Now, by applying Theorem 5, wee have
M = X 12 X 12 ♯ B , A + X 21 ♯ A , B X 21 = 2 A , N = X 12 ♯ B , A X 12 + X 21 X 21 ♯ A , B = 2 B .
Thus diag ( M , N ) = 2 A and ∥ M ∥ A = ∥ N ∥ B = 2 . Therefore, Theorem 5 gives
1 2 ≤ ω A ( X ) 2 ≤ 1 .
In fact, ω A ( X ) = 1 . Let u = u 1 u 2 ∈ S A 1 ( K ) with u 1 = ( a , b ) and u 2 = ( c , d ) . Then | a | 2 + | d | 2 = 1 . Since X 12 u 2 = ( d , 0 ) and X 21 u 1 = ( 0 , a ) , we obtain
⟨ X u , u ⟩ A = d a ¯ + a d ¯ = 2 Re ( a d ¯ ) .
Hence | ⟨ X u , u ⟩ A | ≤ 2 | a | | d | ≤ | a | 2 + | d | 2 = 1 , with equality for a = d = 1 2 . Thus ω A ( X ) = 1 , and the upper bound of Theorem 5 is attained.
We note that on Ran ( A ) ¯ ⊕ Ran ( B ) ¯ the matrix X acts as the ordinary 2 × 2 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 A ≠ B , where the uniform setting diag ( A , A ) 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 2 × 2 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

  1. Gustafson, K.E.; Rao, D.K.M. Numerical Range; Springer: New York, NY, USA, 1997. [Google Scholar]
  2. Kittaneh, F. Numerical radius inequalities for Hilbert spaces operators. Stud. Math. 2005, 168, 73–80. [Google Scholar] [CrossRef] [Scilit]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Kittaneh, F.; Moslehian, M.S.; Yamazaki, T. Cartesian decomposition and numerical radius inequalities. Linear Algebra Appl. 2015, 471, 46–53. [Google Scholar] [CrossRef] [Scilit]
  8. Hirzallah, O.; Kittaneh, F.; Shebrawi, K. Numerical radius inequalities for 2 × 2 operator matrices. Stud. Math. 2012, 210, 99–115. [Google Scholar] [CrossRef] [Scilit]
  9. Shebrawi, K. Numerical radius inequalities for certain 2 × 2 operator matrices II. Linear Algebra Appl. 2017, 523, 1–12. [Google Scholar] [CrossRef] [Scilit]
  10. 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]
  11. Krein, M.G. Compact linear operators on functional spaces with two norms. Integral Equ. Oper. Theory 1998, 30, 140–162. [Google Scholar] [CrossRef] [Scilit]
  12. 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]
  13. 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]
  14. Arias, M.L.; Corach, G.; Gonzalez, M.C. Lifting properties in operator ranges. Acta Sci. Math. 2009, 75, 635–653. [Google Scholar]
  15. 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]
  16. 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]
  17. Saddi, A. A-Normal operators in Semi-Hilbertian spaces. Aust. J. Math. Anal. Appl. 2012, 9, 1–12. [Google Scholar]
  18. 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]
  19. Feki, K. Spectral radius of semi-Hilbertian space operators and its applications. Ann. Funct. Anal. 2020, 11, 929–946. [Google Scholar] [CrossRef] [Scilit]
  20. Zamani, A. A-numerical radius inequalities for semi-Hilbertian space operators. Linear Algebra Appl. 2019, 578, 159–183. [Google Scholar] [CrossRef] [Scilit]
  21. Baklouti, H.; Namouri, S. Spectral analysis of bounded operators on semi-Hilbertian spaces. Banach J. Math. Anal. 2022, 16, 12. [Google Scholar] [CrossRef] [Scilit]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. Guesba, M.; Tapdigoglu, R. Refined inequalities for the A-numerical radius. J. Anal. 2026; early access. [CrossRef] [Scilit]
  32. 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]
  33. 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]
  34. Sababheh, M.; Moradi, H.R. More accurate numerical radius inequalities (I). Linear Multilinear Algebra 2021, 69, 1964–1973. [Google Scholar] [CrossRef] [Scilit]
  35. Arias, M.L.; Mbekhta, M. A-partial isometries and generalized inverses. Linear Algebra Appl. 2013, 439, 1286–1293. [Google Scholar] [CrossRef] [Scilit]
  36. 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]
  37. 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]
  38. Rout, N.C.; Sahoo, S.; Mishra, D. On A -numerical radius inequalities for 2 × 2 operator matrices. Linear Multilinear Algebra 2022, 70, 2672–2692. [Google Scholar]
  39. Rout, N.C.; Mishra, D. Further results on A -numerical radius inequalities. Ann. Funct. Anal. 2022, 13, 13. [Google Scholar] [CrossRef] [Scilit]
  40. Feki, K. Some bounds for the A -numerical radius of certain 2 × 2 operator matrices. Hacet. J. Math. Stat. 2021, 50, 795–810. [Google Scholar] [CrossRef] [Scilit]
  41. 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]
  42. Feki, K. Some A -numerical radius inequalities for d × d operator matrices. Rend. Circ. Mat. Palermo II. Ser. 2022, 71, 85–103. [Google Scholar]
  43. 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]
  44. Hansen, F.; Pedersen, G.K. Jensen’s inequality for operators and Löwner’s theorem. Math. Ann. 1982, 258, 229–241. [Google Scholar]
  45. Hansen, F.; Pedersen, G.K. Jensen’s operator inequality. Bull. Lond. Math. Soc. 2003, 35, 553–564. [Google Scholar] [CrossRef] [Scilit]
  46. 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.

Article Metrics

Citations

Article Access Statistics

Article metric data becomes available approximately 24 hours after publication online.