The condition number of singular subspaces, revisited
Nick Vannieuwenhoven
TL;DR
This work provides a clear, expository derivation of the Rice-type condition number for computing left (and hence right) singular subspaces, presenting an alternative computation in terms of the Euclidean input-distance and unitarily invariant Grassmannian distances. For real matrices with distinct nonzero singular values, the condition number κ_π(A) is given by the maximum inverse singular-value-gap over i∈π and j∈π^c, scaled by a factor between 1/√2 and 1, namely κ_π(A) = max_{i∈π,j∈π^c} [1/|σ_i−σ_j|] sqrt{(σ_i^2+σ_j^2)/(σ_i+σ_j)^2}; the result extends to the cokernel case and to complex matrices via a restriction-of-scalars argument. The paper also proves symmetry between left and right subspaces, invariance under field extension, a first-order sharp perturbation bound, and identifies a worst-case perturbation direction achieving the bound. A concrete real-data example illustrates well- and ill-conditioned cases and confirms the theoretical predictions. Overall, the work links geometric perturbation theory on Grassmannians with a compact, explicit condition-number formula for singular subspaces, bridging classical perturbation theory and modern manifold-valued analysis.
Abstract
I revisit the condition number of computing left and right singular subspaces from [J.-G. Sun, Perturbation analysis of singular subspaces and deflating subspaces, Numer. Math. 73(2), pp. 235--263, 1996]. For real and complex matrices, I present an alternative computation of this condition number in the Euclidean distance on the input space of matrices and the chordal, Grassmann, and Procrustes distances on the output Grassmannian manifold of linear subspaces. Up to a small factor, this condition number equals the inverse minimum singular value gap between the singular values corresponding to the selected singular subspace and those not selected.
