· 7,846 chars · 19 deps · depth 13 Reason: First publication of the proof: all claims read off from the entry description of a block matrix and its bilinear form on concatenated vectors.
All claims are read off from the entry description of a block matrix and from the action and bilinear form of a block matrix on concatenated vectors, together with the description of the norm of a symmetric matrix as a least upper bound over the closed unit ball.
Proof
Throughout we use the notation of the statement. We record first that for any real p×q matrix all of whose entries are 0 and any v∈Rq one has 0p×qv=0Rp, since by Matrix-Vector Product the ith coordinate of 0p×qv is ∑j=1q0⋅vj, a finite sum all of whose summands are 0 and hence equal to 0 by claim 7 of Properties of Finite Sums; and that ζ⋅0Rp=0 for every ζ∈Rp, by the same argument applied to the coordinate description of the dot product.
Claim 1. By Block Matrix with Two Row Blocks and Two Column Blocks, the entries of X⊕Y are (X⊕Y)kl=Xkl for k,l∈[m], (X⊕Y)k,m+j=0 for k∈[m] and j∈[n], (X⊕Y)m+i,l=0 for i∈[n] and l∈[m], and (X⊕Y)m+i,m+j=Yij for i,j∈[n]. Let k,l∈[N]. By the trichotomy recorded in the statement, each of k and l either lies in [m] or has the form m+i with i∈[n], and exactly one of these holds; in each of the four resulting cases the entry in position (k,l) equals the entry in position (l,k), using Xkl=Xlk in the first case, Yij=Yji in the fourth, and 0=0 in the two mixed cases. Hence X⊕Y is symmetric and lies in S(N).
The entries of (X⊕Y)−(X′⊕Y′) are the differences of the corresponding entries, by Difference of Real Matrices; comparing the four cases above with the corresponding entries of (X−X′)⊕(Y−Y′), and using 0−0=0 in the mixed cases, gives equality of the two matrices. Similarly, the (k,l) entry of (aIm)⊕(aIn) is, in the four cases, a(Im)kl, 0, 0 and a(In)ij; by Identity Matrix this equals a when k=l and 0 otherwise, since in the two mixed cases k and l are distinct by the trichotomy, and since k=l forces k,l to lie in the same one of the two ranges. That is exactly the (k,l) entry of aIN.
Conversely, let ξ∈Rm with ∥ξ∥≤1 and put w=ι(ξ,0Rn). Then ∥w∥2=∥ξ∥2≤1, so ∥w∥≤1, and claim 2 gives w⋅((X⊕Y)w)=ξ⋅(Xξ)+0Rn⋅(Y0Rn)=ξ⋅(Xξ). Hence ∣ξ⋅(Xξ)∣≤∥X⊕Y∥ for every such ξ, and therefore ∥X∥≤∥X⊕Y∥. The same argument with w=ι(0Rm,η) gives ∥Y∥≤∥X⊕Y∥, so λ≤∥X⊕Y∥ and the two bounds give ∥X⊕Y∥=λ.
For the distance, claim 1 gives (X⊕Y)−(X′⊕Y′)=(X−X′)⊕(Y−Y′), so by Distance Between Symmetric Real Matrices and what has just been proved, dS(N)(X⊕Y,X′⊕Y′)=∥(X−X′)⊕(Y−Y′)∥ is the larger of ∥X−X′∥=dS(m)(X,X′) and ∥Y−Y′∥=dS(n)(Y,Y′).
For the last assertion, note that a real number is smaller than ε if the larger of it and a second number is, and that the larger of two numbers is smaller than ε exactly when both are. Suppose (Xk⊕Yk) converges to X⊕Y and let ε be positive; taking N from Convergent Sequence in a Metric Space we get, for k≥N, that the larger of dS(m)(Xk,X) and dS(n)(Yk,Y) is smaller than ε, hence so is each of them; so both sequences converge. Conversely, if both converge, choose N1 and N2 for ε and put N=N1+N2, which is at least each of them; for k≥N both distances, and hence their larger, are smaller than ε.
for all ξ∈Rm and η∈Rn, by claim 2 and the fact that every w∈RN is ι(ξ,η) for exactly one pair. If X⪯X′ and Y⪯Y′, adding the two defining inequalities gives the display. Conversely, taking η=0Rn in the display and using 0Rn⋅(Y0Rn)=0=0Rn⋅(Y′0Rn) gives ξ⋅(Xξ)≤ξ⋅(X′ξ) for all ξ, that is X⪯X′; taking ξ=0Rm gives Y⪯Y′.
Claim 5. For i,j∈[m] we have (Z11)ij=Zij=Zji=(Z11)ji, so Z11∈S(m); likewise (Z22)ij=Zm+i,m+j=Zm+j,m+i=(Z22)ji, so Z22∈S(n).
Let W be the block matrix determined by Z11, Z12, (Z12)⊤ and Z22. By Block Matrix with Two Row Blocks and Two Column Blocks its entries are Wkl=(Z11)kl=Zkl for k,l∈[m]; Wk,m+j=(Z12)kj=Zk,m+j; Wm+i,l=((Z12)⊤)il=(Z12)li=Zl,m+i=Zm+i,l, the last step by symmetry of Z and the middle step by Transpose of a Real Matrix; and Wm+i,m+j=(Z22)ij=Zm+i,m+j. By the trichotomy every pair of indices in [N] falls under exactly one of these four cases, so W=Z.
If every entry of Z12 is 0 then Z12=0m×n and, by Transpose of a Real Matrix, (Z12)⊤=0n×m, so Z=W=Z11⊕Z22. Conversely if Z=Z11⊕Z22 then, comparing entries in position (i,m+j) using the entry description in the proof of claim 1, (Z12)ij=Zi,m+j=0 for all i∈[m] and j∈[n].