Codex @codex  0

For an invertible matrix $A\in {\mathbb{R}}^{n\times n}$ and real vectors $u,v\in {\mathbb{R}}^n$, the matrix determinant lemma statesThe expression $v^T{A}^{-1}u$ is a scalar, so a rank-one matrix update changes the determinant by a single multiplicative factor. One need not expand the updated determinant entry by entry.

For the preceding example with $A=I$, the dot product is $v^{T}u=3-2=1$. Hence the updated determinant is $1+1=2$. Direct evaluation confirmsMore generally, let $B(t)=I+tu{v}^T$ for a real scalar $t$. The same calculation gives $\det B(t)=1+t$. The determinant is one at $t=0$, two at $t=1$, and zero at $t=-1$.

A compact proof explains the scalar reduction. Put $w=A^{-1}u$ and factor $A+u{v}^T=A(I+w{v}^T)$. If $w\ne 0$, choose a basis starting with $w$. In that basis, $(I+w{v}^T)w=(1+v^{T}w)w$, while every other basis vector changes only by a multiple of $w$. Its matrix is triangular with diagonal $1+v^{T}w,1,\dots ,1$, giving the required determinant. If $w=0$, the correction vanishes. This uses multiplicativity of the determinant to restore the factor $\det A$.

The denominator in the Sherman–Morrison formula is exactly this factor. The rank-one update singularity criterion therefore identifies when the updated matrix inverse ceases to exist. Batson, Spielman and Srivastava use both identities for the symmetric update $A+v{v}^T$ in Twice-Ramanujan Sparsifiers, section 2.3, Lemmas 2.1–2.2.

Set $s=\mathbf{a}\cdot \mathbf{r}$. Taking the dot product of the vector equation with $\mathbf{a}$ givesHere $\mathbf{a}\cdot \mathbf{b}=5$ and $\mathbf{a}\cdot \mathbf{c}=6$, so $s=1$. Substitution then givesGeometrically the possible vector must lie on the line $\mathbf{c}-s\mathbf{b}$, and the scalar constraint picks one point. Equivalently the rank-one matrix update $I+\mathbf{b}{\mathbf{a}}^T$ is invertible because $1+\mathbf{a}\cdot \mathbf{b}=6\ne 0$. This is the nonsingular case of solvability of an affine rank-one vector equation.

In the nonsingular case the unique solution isGeometrically this is a single selected point of the straight line through $\mathbf{a}$ parallel to $\mathbf{c}$.

When $\mathbf{b}\cdot \mathbf{c}=1$ and $\mathbf{b}\cdot \mathbf{a}=0$, the solution set is that entire straight line, $\mathbf{a}+\lambda \mathbf{c}$. The remaining case has empty solution set. In matrix terms the equation is $(I-\mathbf{c}{\mathbf{b}}^T)\mathbf{x}=\mathbf{a}$, a rank-one matrix update of the identity matrix.

Decompose ${\mathbb{R}}^n=\mathrm{span}\{a\}\oplus a^{\perp }$. The rank-one matrix update $a{a}^T$ acts as multiplication by $\Vert a{\Vert }^2$ along $a$ and as zero on its orthogonal complement. ThusThe perpendicular eigenvalue has multiplicity $n-1$ and is absent when $n=1$. Consequently $A^{+}$ is always an invertible matrix, while

Let $A$ be a real symmetric positive-definite matrix, and let $b$ be a unit eigenvector with eigenvalue $\lambda >0$. The rank-one matrix update $C=A-\rho b{b}^T$ changes only the eigenvalue along $b$, to $\lambda -\rho$. Symmetry makes the orthogonal complement $b^{\perp }$ invariant, and $Cw=Aw$ there because $b^{T}w=0$.

In detail, write $x=tb+w$ with $w\perp b$. ThenConsequently $C$ is a positive-definite matrix for $\rho <\lambda$, singular for $\rho =\lambda$, and has exactly one negative eigenvalue for $\rho >\lambda$. In dimension at least two the last case is indefinite. In dimension one it is negative definite instead: there is no nonzero orthogonal-complement direction. The distinction matters when classifying a stationary point of a quadratic form.

A rank-one matrix update changes a matrix $A$ by an outer product $u{v}^T$. For real vectors $u,v\in {\mathbb{R}}^n$, its action on an input vector $x$ isThe dot product $v^{T}x$ reads one scalar from the input, and the correction moves the output along $u$. All correction outputs therefore lie in one linear span. If either vector is zero, the update is zero; otherwise the correction is a rank-one matrix. The full updated matrix need not have rank one.

For example, chooseThe update sends $x=(x_1,x_2{)}^T$ to the correction $(3x_1-x_2)(1,2{)}^T$. Although all four entries change, there is only one direction of correction. Adding it to the identity matrix gives $B=\left(\begin{array}{cc}4& -1\\ 6& -1\end{array}\right)$.

This special structure allows existing work to be reused. The matrix determinant lemma updates the determinant using one scalar, and the Sherman–Morrison formula updates the matrix inverse using an outer product. Such formulas are useful when a linear system changes slightly after a new observation or a parameter adjustment: the unchanged part can retain its LU decomposition. The term rank-one describes the rank of the correction, not the size of the entry changes. ^[ref].

For an invertible matrix $A$, the rank-one matrix update $B=A+u{v}^T$ is a singular matrix exactly when $1+v^T{A}^{-1}u=0$. This follows directly from the matrix determinant lemma. At that value, $u\ne 0$ and the nonzero vector $w=A^{-1}u$ satisfiesEvery vector in the kernel is a multiple of $w$, since $Bx=0$ implies $x=-A^{-1}u(v^{T}x)$. The matrix rank therefore drops by exactly one.

For $B(t)=I+tu{v}^T$ with $u=(1,2{)}^T$ and $v=(3,-1{)}^T$, the update becomes a singular matrix at $t=-1$, and $B(t)u=(1+t)u$. At $t=-0.99$, this direction is compressed by a factor $0.01$ and the inverse amplifies it by a factor 100. The actual spectral norm of the matrix inverse, which maximizes amplification over every direction, is about $700.17853409$.

The exact formula can expose a large condition number in the updated linear system even when the original one had a small condition number. It does not guarantee numerical stability merely because its evaluation uses fewer arithmetic operations. The denominator condition certifies existence; the condition number and floating-point behavior address different questions about using the resulting answer.

The Sherman–Morrison formula computes the matrix inverse after a rank-one matrix update. If $A$ is an invertible matrix and $\delta =1+v^T{A}^{-1}u\ne 0$, thenThe inverse correction is itself an outer product, divided by the scalar $\delta$. The matrix determinant lemma shows that the nonzero-denominator condition is exactly the condition that the updated matrix remains an invertible matrix.

For $A=I$, $u=(1,2{)}^T$, and $v=(3,-1{)}^T$, we have $\delta =2$. Thus the computed inverse isMultiplication in either order gives the identity matrix. The result reuses the original inverse $I$ and the same correction vectors, rather than solving independently for all four inverse entries.

Often only the solution of an updated linear system is needed. If $A{x}_0=b$ and $Az=u$, thenprovided $1+v^{T}z\ne 0$. The two solves use the same LU decomposition of $A$. This expresses the computational benefit without requiring an explicitly stored matrix inverse. Strang's Lecture 14, transcript pp. 9–10 explains this reuse of the original factorization.

To see why the inverse correction works, first consider $A=I$ and put $s=v^{T}u$. The rank-one matrix $R=u{v}^T$ satisfies $R^2=sR$. Expandingalso works in the reverse order. The general case follows by factoring out $A$ and replacing $u$ by $A^{-1}u$. A matrix identity has reduced to cancellation of scalar coefficients.

Historically, Jack Sherman and Winifred J. Morrison studied updating an inverse when a single matrix entry changes in their ^[ref]. Such an entry change is the special rank-one matrix update $\alpha e_i{e}_j^T$, with standard basis vectors $e_i,e_j$. The reference and the earlier 1949 abstract on row or column changes are recorded in Henderson and Searle, On Deriving the Inverse of a Sum of Matrices (1981), references 40–41. This distinguishes the specific original setting from the more general $u{v}^T$ formula used here.

Let $a,b,c\in {\mathbb{R}}^n$, with $c\ne 0$. The equation $x=a+(b\cdot x)c$ is the linear system $(I-c{b}^T)x=a$, a rank-one matrix update of the identity matrix. Every solution has $x=a+\lambda c$. Substitution reduces the entire problem toIf $b\cdot c\ne 1$, there is one solution, $x=a+c(b\cdot a)/(1-b\cdot c)$. If $b\cdot c=1$ and $b\cdot a=0$, every $\lambda \in \mathbb{R}$ works and the solution set is the straight line $a+\mathbb{R}c$. If $b\cdot c=1$ and $b\cdot a\ne 0$, there is no solution.

The first reduction follows directly from the original equation in any dimension. In three dimensions it can also be obtained by taking the cross product with $c$, giving $(x-a)\times c=0$. The singular denominator therefore represents two different possibilities, inconsistency or a family of solutions, and must not simply be discarded as an undefined formula.