--- title: Interpolation Conditions for Linear Operators url: https://www.emergentmind.com/topics/interpolation-conditions-for-linear-operators type: topic --- # Interpolation Conditions for Linear Operators Interpolation conditions for linear operators are analytical characterizations—typically in terms of scalar product data, Gram matrices, or operator-theoretic constraints—which are necessary and sufficient to ensure the existence of a linear operator (or a class thereof) interpolating given finite sets of input–output relations, with or without additional spectral structure. These conditions underpin tractable formulations for operator approximation, performance estimation, and control, integrating areas such as convex optimization, operator theory, and interpolation of function spaces. ## 1. Gram Matrix-Based Interpolation and Necessity/Sufficiency Interpolation conditions for real (or complex) finite-dimensional linear operators are most effectively expressed via convex constraints on Gram matrices of the specified vectors. For the class $L_{[\sigma_\text{min}, \sigma_\text{max}]}$ of $m \times n$ real matrices $M$ whose singular values $\sigma_i(M)$ lie in $[\sigma_\text{min}, \sigma_\text{max}]$, given two sets of input–output pairs $\{(x_i, y_i)\}_{i=1}^{N_1}$ ($x_i \in \mathbb{R}^n$, $y_i \in \mathbb{R}^m$) and $\{(u_j, v_j)\}_{j=1}^{N_2}$ ($u_j \in \mathbb{R}^m$, $v_j \in \mathbb{R}^n$), there exists an interpolant $M$ such that $y_i = M x_i$, $v_j = M^T u_j$ if and only if there exist auxiliary variables $Z \in \mathbb{R}^{n \times N_1}$, $W \in \mathbb{R}^{n \times N_2}$ fulfilling the constraints [2511.16360] (Theorem 1): - $Y^T Y = Z^T Z$ - $Y^T U = Z^T W$ - $U^T U \succeq W^T W$ - $[X; W]^T [Z; V] = [Z; V]^T [X; W]$ - $([Z; V] - \sigma_\text{min}[X; W])^T (\sigma_\text{max}[X; W] - [Z; V]) \succeq 0$ This five-line system gives a complete necessary and sufficient description for Gram-data-based interpolation in terms of operator spectral intervals. A similar but more specialized necessary and sufficient characterization holds for symmetric linear operators $Q$ with spectrum in $[\lambda_\text{min}, \lambda_\text{max}]$: - $X^T Y = Y^T X$ and - $(Y - \lambda_{\min} X)^T (\lambda_{\max} X - Y) \succeq 0$ [2302.08781, 2511.16360] Any convex interpolation condition depending only on Gram data that is both necessary and sufficient must reduce to such spectral (singular value or eigenvalue) characterizations; no further convex scalar-product constraints are admissible [2511.16360]. ## 2. Polar Decomposition and Reduction to Symmetric/Isometric Interpolation The proofs and construction of interpolation conditions exploit the operator polar decomposition: $M = R Q$ where $Q$ is positive semidefinite symmetric with spectrum in $[\sigma_{\min}, \sigma_{\max}]$, and $R$ is a partial isometry. This allows reduction of the general interpolation system to (i) a symmetric interpolation problem for $Q$ and (ii) an isometric interpolation problem for $R$ [2511.16360]. The isometry interpolation block is fully characterized by - $Y^T Y = Z^T Z$ - $Y^T U = Z^T W$ - $U^T U \succeq W^T W$ while the symmetric block involves the spectral constraints above. These matrix inequalities can all be written as linear matrix inequalities and thus embedded into semidefinite programming frameworks. ## 3. Extensions: Spectral Unions, Gram Decompositions, and Limitations The interpolation conditions generalize to classes of symmetric operators whose spectra are constrained to unions of intervals $\mathcal{S}_{\bigcup_k S_k}$. Here, the corresponding Gram matrix $G$ admits a decomposition $G = \sum_{k} G^k$, each $G^k$ satisfying the interval interpolation inequalities for $S_k$ [2511.16360]. This enables exact interpolation for more general spectral classes (e.g., block-diagonal or sectorial constraints). A fundamental limitation is that, up to convex closure, the only information about classes of operators encoded in scalar products of data is the spectrum (or multiset of singular values) of the interpolant. Thus, imposing non-convex or non-spectral constraints (such as trace-norm, rank, or other nonlinear functionals) is inexpressible in a convex Gram matrix system [2511.16360]. ## 4. Applications: Performance Estimation, Model Reduction, and Operator Theory Interpolation conditions are foundational in worst-case performance analysis of iterative optimization algorithms—Performance Estimation Problems (PEPs)—where such conditions are imposed as constraints in a semidefinite program for all linear operators appearing in the iteration graphs [2302.08781, 2511.16360]. For example, in analyzing the rate of the gradient method for $F(x) = g(Mx)$ with $M$ spectrally constrained and $g$ smooth and strongly convex, convex interpolation inequalities for $M$ and for $g$ allow semi-analytic or numerical derivation of exact convergence rates that are minimax-optimal. Similarly, in $\mathcal{H}_2$-optimal model reduction of linear quadratic-output systems, interpolatory optimality conditions—expressed as multipoint tangential interpolation constraints—ensure reduced-order surrogates can be constructed to exactly match low-order moments (including quadratic ones) of the original system, via Petrov-Galerkin projections [2505.03057]. In function space theory, interpolation of operators connects deeply with factorization theorems, Fredholm theory (including the necessary/sufficient index inequalities in real interpolation spaces) [1408.7024], and maximal regularity for evolution equations [1404.2967]. ## 5. Complex Interpolation in Operator Theory Complex interpolation frameworks yield operator-norm bounds via analytic families of the type $A(z) = T_2^{-z} S T_1^{-1+z}$ under appropriate spectral (sectorial, self-adjoint, bounded imaginary powers) assumptions. Main estimates interpolate operator or trace ideal norms between two endpoint spaces [1405.1517]: \[ \|T_2^{-x} S T_1^{-1+x}\| \leq N_1 N_2 e^{(\theta_1 + \theta_2) \sqrt{x(1-x)}} \| S T_1^{-1}\|^{1-x} \| S^* T_2^{-1} \|^x \] for $x \in [0,1]$. These results depend on balancing domain conditions, polar decomposition, and the three-lines theorem, delivering optimal two-point interpolation bounds which are critical in spectral and index theory. ## 6. Function Space and Sequence Interpolation Conditions In Banach and Hilbert space settings, classical interpolation conditions—such as the Carleson condition and Besselian/hilbertian basis properties—are both necessary and sufficient for the existence of bounded linear extension/interpolation operators for function evaluation sequences in spaces of holomorphic functions (e.g., $H^\infty(B_H)$, Hardy/Bergman spaces) [1510.01529, 1912.01989]. For $H^\infty(B_H)$, the extended Carleson product condition \[ \prod_{k \neq j} PH(x_j, x_k) \geq \delta > 0, \;\; \forall j \] ensures complete interpolability with explicit, norm-controlled linear extensions. In $L^p$ and operator ideal contexts, the improved Calderón–Ryff interpolation theorem characterizes the lattice ideals invariant under conditional expectations as precisely those which are interpolation spaces for $(L^1,L^\infty)$ bounded operators [1803.09796]. ## 7. Interpolation and Linear Algebraic Operations The evaluation of a function $F(A)$ of a linear operator (or matrix) $A$ can be recast as an interpolation problem once $A$ satisfies a minimal polynomial $P(A)=0$ [2203.01822]. By constructing the unique degree $