Let $A$ with real positive entries be a Hermitian positive definite matrix. I'm wondering if one perturbs $A$, e.g., $\hat{A}=A+\Delta A$, would the matrix still be positive definite? I'm told this is particularly true so long as the perturbation satisfies the condition number bound $$\frac{\|\Delta A\|}{\|A\|} < \frac{1}{K(A)},$$ where $K(A)$ is the condition number $K(A)=\|A^{-1}\|\|A\|$ (all in the Frobenius norm). I'm stuck figuring out how to prove this. Since $A$ is positive definite, it has a unique Cholesky decomposition $A=LL^*$ and so $\hat A=LL^*+\Delta A$. But this leads me nowhere in proving that $\hat A$ too has unique Cholesky decomposition dependent on the condition number.
2026-03-28 07:51:47.1774684307
Preservation of Positive-Definiteness from Small Perturbations
2.1k 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 NUMERICAL-LINEAR-ALGEBRA
- sources about SVD complexity
- Showing that the Jacobi method doesn't converge with $A=\begin{bmatrix}2 & \pm2\sqrt2 & 0 \\ \pm2\sqrt2&8&\pm2\sqrt2 \\ 0&\pm2\sqrt2&2 \end{bmatrix}$
- Finding $Ax=b$ iteratively using residuum vectors
- Pack two fractional values into a single integer while preserving a total order
- Use Gershgorin's theorem to show that a matrix is nonsingular
- Rate of convergence of Newton's method near a double root.
- Linear Algebra - Linear Combinations Question
- Proof of an error estimation/inequality for a linear $Ax=b$.
- How to find a set of $2k-1$ vectors such that each element of set is an element of $\mathcal{R}$ and any $k$ elements of set are linearly independent?
- Understanding iterative methods for solving $Ax=b$ and why they are iterative
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?)
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?
The condition you've given will follow from the weaker bound $$ \|\Delta A\|_2 < \|A^{-1}\|^{-1}_2 $$ where $\|\cdot\|_2$ is the induced norm from the Euclidean metric.
We can argue as follows. For $t > 0$ sufficiently small, $A_t = A + t \Delta A$ is going to be PD by some general considerations (this is a good exercise). Assume that $\Delta A$ obeys the bound given, and for the sake of contradiction, assume that for some $t \leq 1$, $A_t$ is not positive definite.
I claim that there is a $t' \leq 1$ such that $A_{t'}$ has a zero eigenvalue. Pursuing this, let $v \in \ker A_{t'}$ be a unit vector. Then $A_{t'} v = 0 = A v + t'\Delta A v$ and so $$ \|A^{-1}\|_2^{-1} \leq \|A v\|_2 = t' \|\Delta A v\|_2 \leq \|\Delta A\|_2 $$ which is a contradiction.
Something to consider: this proof uses the connectedness of the set of PD matrices and the fact that when crossing continuously from the PD region to the SPD region, you necessary hit an SPD matrix with nontrivial kernel.
EDIT: Below is a simpler proof that doesn't use any topology.
Let $A$ be PD with eigenvalues $\sigma_1 \geq \sigma_2 \geq \cdots \geq \sigma_n > 0$, counted with multiplicity. In particular, $\sigma_1 = \|A\|_2$ and $\sigma_n = \|A^{-1}\|_2^{-1}$. Writing the eigenvalues of the perturbation $\Delta A$ as $\{\eta_i\}_{1 \leq i \leq n}$ (with multiplicity) we have $\|\Delta A\|_2 = |\eta_j| = \max\{\eta_i \mid 1 \leq i \leq n\}$ for some $j$, which we take to be $1$ by re-indexing. Our condition ensures that $$|\eta_1| < \sigma_n$$.
Let $A' = A + \Delta A$ and assume that $(A'v, v) \leq 0$ for some unit vector $v$. We have $$ (A v, v) \leq - (\Delta A v, v) $$ Notice that $(Av, v) \geq \sigma_n$ and that $(\Delta Av, v) \leq |\eta_1|$ (this amounts to checking the Raleigh quotient and applying an appropriate minmax principle, if you like). Thus $\sigma_n \leq |\eta_1|$, which is a contradiction to our initial estimate.