Suppose that $$M=\left( \begin{array}{cc} A & B\\ B^\top & C \end{array} \right)$$ for some symmetric matrices $A$ and $C$, and $C$ is invertible. Is it true that: $$\lambda_{\min}(M) \ge \min\left\{\lambda_{\min}(C)~,~\lambda_{\min}(A-BC^{-1}B^\top)\right\}~?$$ Here, $\lambda_{\min}$ refers to the minimum eigenvalue of a matrix. Even if the above inequality is incorrect, is there a way to lower bound $\lambda_{\min}(A)$ in terms of $\lambda_{\min}(C)$ and $\lambda_{\min}(A-BC^{-1}B^\top)$? You may even assume that $M$ is non-negative definite, and $$A=u^\top u~, ~B = u^\top X~\textrm{and}~C= X^\top X$$ for some vector $u$ and some matrix $X$, if that helps! Any help will be greatly appreciated!
2026-03-26 09:45:50.1774518350
Lower-bounding minimal eigenvalue via the Schur complement
609 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$
- 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$
- Distribution of min/max row sum of matrix with i.i.d. uniform random variables
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 UPPER-LOWER-BOUNDS
- Bound for difference between arithmetic and geometric mean
- Show that $\frac{1}{k}-\ln\left(\frac{k+1}{k}\right)$ is bounded by $\frac{1}{k^2}$
- Bounding Probability with Large Variance
- Connectivity of random graphs - proof $\frac{logn}{n}$ is threshold
- Natural log integral inequality
- Spectrum of a matrix after applying an element-wise function (e.g. elementwise log)
- Majorization form for a given set of integers in some interval.
- Proving $(λ^d + (1-λ^d)e^{(d-1)s})^{\frac{1}{1-d}}\leq\sum\limits_{n=0}^\infty\frac1{n!}λ^{\frac{(d^n-1)d}{d-1}+n}s^ne^{-λs}$
- Upper bound for distribution function of the standard normal distribution
- Show $0 < f'(x) \leqslant \frac{1}{2}$
Related Questions in SCHUR-COMPLEMENT
- Positive-definiteness of the Schur Complement
- Use Schur complement to show that $ 1^TD1 \ge 0$
- Is Schur complement better conditioned than the original matrix?
- Solving saddle-point matrix with projection when Schur's complement doesn't exist
- Positive semidefinite matrix using Schur Complement
- Boyd & Vandenberghe, example 3.4 — question on Schur complements and LMIs
- Searching an analogues for Schur complement
- matrix identity extends to real entries?
- Determinant of block matrix with singular blocks on the diagonal
- Graham's formula for determinant of distance matrix of a tree
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 assumption that $A,B$ and $C$ take the forms of $A=uu^\top,\ B=u^\top X\text{ and }C=X^\top X$ is useless. Once $M$ is assumed to be positive semidefinite, it always admits a decomposition $M=Y^\top Y$ and one can always take $\pmatrix{u&X}=Y$.
In general, when $M$ is positive semidefinite, the inequality $\lambda_\min(M)\ge\min\{\lambda_\min(C),\lambda_\min(S)\}$ is true when $M$ is singular, because both sides of the inequality are zero.
When $M$ is positive definite, let $S=A-BCB^\top$. Since $M=P^\top\left(S\oplus C\right)P$ where $$ P=\pmatrix{I&0\\ C^{-1}B^\top&I}, $$ if $x$ is a unit eigenvector of $M$ corresponding to the minimum eigenvalue and $y=Px$, we have \begin{aligned} \lambda_\min(M)=x^\top Mx &=y^\top\left(S\oplus C\right)y\\ &\ge\lambda_\min\left(S\oplus C\right)\|y\|^2\\ &\ge\min\{\lambda_\min(C),\lambda_\min(S)\}\,\sigma_\min(P)^2. \end{aligned} Note that we cannot replace the factor $\sigma_\min(P)^2$ in the above by any positive constant. In particular, the inequality in your question is false in general. For instance, let $A=(r^2+1)I,\,B=rI$ and $C=I$. Then $S=A-BCB^\top$ is always equal to $I$ and $M$ is close to singular when $r$ is sufficiently large. Therefore $$ \lim_{r\to+\infty}\lambda_\min(M)=0 \text{ while} \min\{\lambda_\min(C),\lambda_\min(S)\}=1. $$ In this counterexample, $\sigma_\max(P)\ge\|C^{-1}B^\top\|=r$. Since $\det(P)=1\ge\sigma_\max(P)\sigma_\min(P)^{n-1}$, we have $\sigma_\min(P)\le\frac{1}{r^{n-1}}$. Therefore $\lim_{r\to+\infty}\sigma_\min(P)=0$.