Let $(A,B)\in M_n(\mathbb{R})\times M_n(\mathbb{R})$ be two matrices. We denote by $\|\cdot\|_2$ the spectral norm. Without any additional assumptions on $A$ and $B$, can we characterize the case of equality in the spectral norm matrix triangle inequality, i.e., when \begin{align*} \|A+B\|_2=\|A\|_2+\|B\|_2. \end{align*} If $A=U\Sigma_AV^T$ and $B=U\Sigma_BV^T$ (singular value decompositions), the equality holds but is there a full characterization? Best wishes.
2026-02-23 06:21:56.1771827716
Case of equality in spectral norm matrix triangle inequality
110 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in MATRIX-DECOMPOSITION
- Real eigenvalues of a non-symmetric matrix $A$ ?.
- Swapping row $n$ with row $m$ by using permutation matrix
- Block diagonalizing a Hermitian matrix
- $A \in M_n$ is reducible if and only if there is a permutation $i_1, ... , i_n$ of $1,... , n$
- Simplify $x^TA(AA^T+I)^{-1}A^Tx$
- Diagonalize real symmetric matrix
- How to solve for $L$ in $X = LL^T$?
- Q of the QR decomposition is an upper Hessenberg matrix
- Question involving orthogonal matrix and congruent matrices $P^{t}AP=I$
- Singular values by QR decomposition
Related Questions in TRIANGLE-INEQUALITY
- Norm squared inequality
- Gre question : finding length of sides of a triangle given the longest side length and each side has an integer length
- Successive prime numbers and triangles
- Use the triangle inequality to show that $|a|+|b| \leq |a+b|+|a-b|$
- For $a$, $b$, $c$ the sides of a triangle, show $ 7(a+b+c)^3-9(a+b+c)\left(a^2+b^2+c^2\right)-108abc\ge0$
- If $\vert x - a \vert < \frac{1}{2}\vert a\vert$, then $\frac{1}{2}\vert a\vert < \vert x \vert$?
- When does equality hold in the triangle inequality?
- Prove length relationship of median and sides in triangle using triangle inequality
- Prove $a^2 + b^2 \geq 2ab$ using Triangle Inequality
- Guessing the third side of the triangle from the given two sides
Related Questions in SPECTRAL-NORM
- Operator norm calculation for simple matrix
- Is the spectral norm of the Jacobian of an $M$-Lipschitz function bounded by $M$?
- Does Lipschitz-continuous gradient imply that the Hessian is bounded in spectral norm by the same Lipschitz constant?
- Spectral norm minimization
- Gradient of the spectral norm of a matrix
- Is it possible to upper bound this family of matrices in operator norm?
- The spectral norm of real matrices with positive entries is increasing in its entries?
- Computing the spectral norm of a projection matrix
- Fastest converging algorithm for computing spectral radius of symmetric matrix
- $2$-norm of a Vandermonde matrix
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Equality holds if and only if $A$ and $B$ share a common right singular vector $v$ corresponding to the largest singular value and $Av=\sigma_1(A)u,\,Bv=\sigma_1(B)u$ for the same left singular vector $u$.
To prove this, suppose equality holds. If $\|A\|_2=\|B\|_2=0$, there is nothing to prove. So, suppose also that $A,B\ne0$. Let $v$ be a right singular vector of $A+B$ corresponding to the largest singular value. Then $$ \begin{align} \|(A+B)v\|_2 &\le\|Av\|_2+\|Bv\|_2\tag{1}\\ &\le\max_{\|x\|_2=1}\|Ax\|_2+\max_{\|y\|_2=1}\|Ay\|_2\tag{2}\\ &=\|A\|_2+\|B\|_2\\ &=\|A+B\|_2\\ &=\|(A+B)v\|_2. \end{align} $$ Therefore ties occur in both $(1)$ and $(2)$. The tie that occurs in $(2)$ means that $v$ is also a unit right singular vector of both $A$ and $B$ corresponding to their largest singular values. Therefore $Av=\sigma_1(A)u$ and $Bv=\sigma_1(B)u'$ for some unit left singular vectors $u$ and $u'$ of $A$ and $B$ respectively. However, the tie in the triangle inequality $(1)$ implies that $Av$ and $Bv$ are real positive multiples of each other. Therefore $u=u'$ and we are done.
Using the characterisation $\|A\|_2=\max_{\|x\|_2=\|y\|_2=1}x^TAy$, the necessary and sufficient condition above can be rephrased as $$ \|A\|_2=u^TAv\quad\text{and}\quad\|B\|_2=u^TBv $$ for some unit vectors $u$ and $v$. This is also equivalent to the condition that there exist two orthogonal matrices $U$ and $V$ such that $$ U^TAV=\pmatrix{\sigma_1(A)\\ &A'} \quad\text{and}\quad U^TBV=\pmatrix{\sigma_1(B)\\ &B'} $$ for some matrices $A'$ and $B'$.