Suppose I have two positive semidefinite matrices (and their eigendecompositions) $A = U \Lambda_A U'$ and $B = V \Lambda_B V'$. I was wondering if $$ ||U_jU_j' - V_jV_j' || \leq C || A - B || $$ for some $C$. Here, $U_j$ is the $j$th column of $U$. Hence, I'm asking if the eigenprojections are Lipschitz continuous with respect to the original matrices. I've went through Kato's praised book on perturbation theory, which is great by the way, but the theory there is mostly about when the matrices depend on a single parameter. Any help would be greatly appreciated.
2026-03-26 01:14:39.1774487679
Bound on difference of eigen projections of positive definite matrices
284 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LINEAR-ALGEBRA
- An underdetermined system derived for rotated coordinate system
- How to prove the following equality with matrix norm?
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Summation in subsets
- $C=AB-BA$. If $CA=AC$, then $C$ is not invertible.
- Basis of span in $R^4$
- Prove if A is regular skew symmetric, I+A is regular (with obstacles)
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 EIGENVALUES-EIGENVECTORS
- Stability of system of parameters $\kappa, \lambda$ when there is a zero eigenvalue
- Stability of stationary point $O(0,0)$ when eigenvalues are zero
- Show that this matrix is positive definite
- Is $A$ satisfying ${A^2} = - I$ similar to $\left[ {\begin{smallmatrix} 0&I \\ { - I}&0 \end{smallmatrix}} \right]$?
- Determining a $4\times4$ matrix knowing $3$ of its $4$ eigenvectors and eigenvalues
- Question on designing a state observer for discrete time system
- Evaluating a cubic at a matrix only knowing only the eigenvalues
- Eigenvalues of $A=vv^T$
- A minimal eigenvalue inequality for Positive Definite Matrix
- Construct real matrix for given complex eigenvalues and given complex eigenvectors where algebraic multiplicity < geometric multiplicity
Related Questions in PERTURBATION-THEORY
- Is there a book on the purely mathematical version of perturbation theory?
- Limit of a function ("order of magnitude")
- Unusual normalization related to the eigenvector perturbation
- How to expand $\sqrt{x+\epsilon}$ in the following way?
- Perturbative expansion of an expression involving the matrix square root
- Question on perturbation theory
- How to find roots by perturbation methods for this problem?
- Find perturbed eigenvalues, eigenvectors by perturbation methods
- rationalize denominator for perturbation theory
- Solve recurrent ODE (elegantly?)
Related Questions in MATRIX-ANALYSIS
- Upper bound this family of matrices in induced $2$-norm
- Operator norm (induced $2$-norm) of a Kronecker tensor
- Is there a relation between the solutions to these two Lyapunov matrix equations?
- Are norms of solutions to two Lyapunov matrix equations comparable?
- Sequence of matrices: finding product and inverse
- Constructing a continuous path between two matrices
- Lorentz Cone is not polyhedral cone.
- Equivalence classes in $M_n(\mathbb{R})$
- $A$ be an irreducible matrix, $DA=AD$ then $D$ has to be a scalar multiple of $I$
- Matrix notations of binary operators (Multi-input operators)
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?
This is in fact related to the perturbation theory for sub-eigenspace.
Intuition: Suppose $\lambda_j(A)$ is the $j$-th largest eigenvalues of $A$. If $\lambda_j(A)$ is in the range $(\lambda_{j+1}(B), \lambda_{j-1}(B))$, then there is a hope to obtain such an upper bound. Otherwise, the eigenvector associated with $\lambda_j(A)$ in $A$ can have no relation with the eigenvector associated with $\lambda_{j}(B)$ in $B$.
Results: Suppose $\lambda_{j+1}(B)\leq \lambda_j(A) \leq \lambda_{j-1}(B)$, we have $$ \|U_jU_j' - V_jV_j'\|_2 \leq \frac{\sqrt{2}\|B-A\|_2}{\min(\lambda_{j}(A)-\lambda_{j+1}(B), \lambda_{j-1}(B) - \lambda_j(A))}. $$
Before showing the proof, let us introduce the following famous Davis-Kahan theorem:
Theorem: (Davis-Kahan sin(Θ) theorem) Let $A = E_0A_0E_0'+E_1A_1E_1'$ be the two complementary parts of the eigen-decomposition of $A$. In particular, $E_0 \in R^{n\times r}, E_1 \in R^{n\times (n-r)}, A_0 \in R^{r\times r}, A_1 \in R^{(n-r)\times (n-r)}$ where $E_0'E_0 = I_r, E_1'E_1 = I_{n-r}, E_0'E_1 = 0$ and $A_0, A_1$ are diagonal. Similarly, let $B = F_0B_0F_0' + F_1B_1F_1'$ be the two complementary parts of eigen-decomposition of $B$. If the eigenvalues of $A_0$ are contained in an interval $(a, b)$, and the eigenvalues of $B_1$ are excluded from the interval $(a−\delta, b+\delta)$ for some $\delta > 0$, then $$ \|F_1'E_0\| \leq \frac{\|F_1'(B-A)E_0\|}{\delta} $$ for any unitarily invariant norm $\|\cdot\|$.
Corollary: Apply the above theorem to Frobenious norm, we have $$ \|F_1'E_0\|_{F} \leq \frac{\|F_1'(B-A)E_0\|_{F}}{\delta} \leq \frac{\|F_1'\|_{2} \|B-A\|_{2} \|E_0\|_{F}}{\delta} \leq \frac{\|B-A\|_2 \|E_0\|_2 \sqrt{r}}{\delta} \leq \frac{\sqrt{r} \|B-A\|_2}{\delta} $$ where $|A|_2$ is the spectral norm and $|A|_{F}$ is the Frobenious norm, and we use the fact that $|E_0|_2 \leq 1, |F_1|_2 \leq 1$ and $|AB|_{F} \leq |A|_2 |B|_F, |A|_{F} \leq \sqrt{min(n,m)}|A|_{2}$ if $A \in n\times m.$ On the other hand, suppose $F_0 \in R^{n\times r}$. Notice that \begin{align} \|E_0E_0' - F_0 F_0'\|_{F}^2 &= tr(E_0E_0'E_0E_0' + F_0F_0'F_0F_0') - 2 tr(E_0E_0'F_0F_0')\\ &= tr(E_0E_0') + tr(F_0 F_0') - 2tr(E_0E_0'F_0F_0')\\ &= 2r - 2tr(E_0E_0'F_0F_0')\\ &= 2tr(E_0E_0') - 2tr(E_0E_0'F_0F_0')\\ &= 2tr(E_0E_0'(I - F_0F_0'))\\ &= 2tr(E_0E_0'F_1F_1')\\ &= 2\|F_1'E_0\|_{F}^2. \end{align} Therefore, $$ \|E_0E_0' - F_0F_0'\|_{F} \leq \frac{\sqrt{2r}\|B-A\|_2}{\delta}. $$ This provides an upper bound for the subspace distance between $E_0E_0'$ and $F_0F_0'$ based on the perturbation $\|B-A\|_2.$
Application: Now we apply this theorem (corollary) to your problem. Here $E_0 = U_j, E_1 = U_{-j}$ where $U_{-j}$ removes the $j$-th column from $U$ and $A_0 = \lambda_{j}(A)$, $A_1$ is the diagonal matrix consists of eigenvalues $\lambda_1(A), \dotsc, \lambda_{j-1}(A), \lambda_{j+1}(A), \dotsc, \lambda_{n}(A)$ where we assume $\lambda_1(A) \geq \lambda_2(A) \geq \dotsc \geq \lambda_n(A).$ Similarly, $F_0 = V_j, F_1 = V_{-j}$ and $B_1$ consists of eigenvalues $\lambda_1(B), \dotsc, \lambda_{j-1}(B), \lambda_{j+1}(B), \dotsc, \lambda_n(B).$ Therefore, $r = 1$ in your problem.
In a typical case, we shall assume $\lambda_{j+1}(B) \leq \lambda_j(A) \leq \lambda_{j-1}(B)$ otherwise there is no hope to have some continuity from the eigenvector $U_j$ to $V_j$.
Then this corollary implies that $$ \|U_jU_j' - V_jV_j'\|_{F} \leq \frac{\sqrt{2}\|B-A\|_2}{\delta} $$ where $\delta = \min(\lambda_{j}(A)-\lambda_{j+1}(B), \lambda_{j-1}(B) - \lambda_j(A)).$ Note that $$ \frac{1}{\sqrt{2}}\|U_jU_j' - V_jV_j'\|_{F} \leq \|U_jU_j' - V_jV_j'\|_2 \leq \|U_jU_j' - V_jV_j'\|_{F} $$ since $U_jU_j'-V_jV_j'$ is at most rank 2. This provides (almost tight) bound for your question: $$ \|U_jU_j' - V_jV_j'\|_2 \leq \frac{\sqrt{2}\|B-A\|_2}{\min(\lambda_{j}(A)-\lambda_{j+1}(B), \lambda_{j-1}(B) - \lambda_j(A))}. $$
See further references on the proof of Davis-Kahan theorem (the proof is in fact very neat. Highly recommend this!) and the user-friendly variant of Davis-Kahan theorem.