Why impose a covariance bandwidth?
For a vector of measurements, an unrestricted covariance matrix assigns a separate covariance to every pair of coordinates. When the coordinates have a meaningful order—such as measurements taken at successive times, locations along a sequence, or adjacent anatomical sites—it may be plausible that distant measurements have negligible linear association. A banded covariance model encodes this idea by restricting which covariances may be nonzero.
The restriction is on covariance, not on the ordering itself: changing the order of the coordinates changes which pairs count as nearby. Nor does banding require repeated values along a diagonal. That additional, different restriction belongs to another covariance family.
“Half-bandwidth” specifies the convention: \(q\) counts how far the nonzero entries may extend from the main diagonal in either direction. For example, \(q=1\) permits the main diagonal and the two immediately adjacent diagonals. At the boundary of a finite matrix, fewer than \(2q+1\) entries may occur in a row. If \(q=p-1\), every matrix entry is permitted, so the model imposes no zero restrictions.
What bandwidth says about association
The band condition concerns pairs of coordinates whose indices are more than \(q\) places apart. For such a pair, \(\operatorname{Cov}(X_i,X_j)=0\); when both variances are positive, their correlation is also zero. This is a statement about linear association. In a general distribution, zero covariance does not imply independence, and banding alone does not assert that the variables outside a local neighborhood are independent.
There is a useful special case. If \(X\) is jointly multivariate normal, then two subvectors with zero cross-covariance are independent. Thus, for a banded Gaussian covariance, two groups of coordinates are independent whenever every index in one group is more than \(q\) places from every index in the other. To see this, their joint covariance is block diagonal, and the multivariate normal density with block-diagonal covariance factors into the product of the two marginal densities. This implication relies on joint normality; it is not a general property of banded covariance matrices.
A covariance bandwidth should also not be read as a statement about conditional dependence. It specifies marginal covariances. In particular, covariance zeros and zeros in a precision matrix have different interpretations and are different model restrictions.
Worked Example: Reading a Half-Bandwidth of One
Consider the symmetric matrix \[ \Sigma= \begin{pmatrix} 4&1&0&0\\ 1&9&-2&0\\ 0&-2&16&3\\ 0&0&3&25 \end{pmatrix}. \] Its entries at distance two or more from the main diagonal are zero, while the adjacent entries are permitted. The matrix therefore has half-bandwidth \(q=1\).
It is also positive definite. Each diagonal entry is greater than the sum of the absolute values of the other entries in its row: the diagonal entries are \(4,9,16,25\), while the corresponding sums are \(1,3,5,3\). A symmetric strictly diagonally dominant matrix with positive diagonal entries is positive definite. Thus this is a valid covariance matrix, not merely a matrix with the right pattern of zeros.
The zero in position \((1,3)\) says variables 1 and 3 are uncorrelated; the nonzero entry in position \((2,3)\) permits local covariance. There is no requirement that the three adjacent covariances \(1,-2,3\) be equal.
How many parameters does the band restriction save?
A symmetric \(p\times p\) covariance matrix has \(p\) diagonal entries. For each distance \(k=1,\ldots,q\), there are \(p-k\) distinct off-diagonal entries at that distance; symmetry determines their counterparts on the other side of the diagonal. Therefore, when \(0\leq q<p\), the number of free covariance entries before positive-definiteness restrictions is
This count follows by adding the diagonal entries and the distinct permitted covariances above the diagonal. Positive definiteness restricts the allowable numerical values, but it does not reduce this count of free coordinates in the model. For \(q=p-1\), the formula gives \(p(p+1)/2\), the unrestricted symmetric-matrix count. At \(q=0\), it gives \(p\): only the variances are free.
Worked Example: Counting Parameters at Bandwidth Two
For \(p=6\) and \(q=2\), the model allows the six variances, five distinct covariances at distance one, and four at distance two. Its number of free entries is
An unrestricted symmetric \(6\times6\) covariance matrix has \(6(7)/2=21\) free entries. The bandwidth restriction removes the six entries above the second off-diagonal (and their symmetric counterparts are not counted separately). It does not force any of the 15 permitted entries to be equal.
Sample-moment banding
Suppose \(X_1,\ldots,X_n\) are independent observations from a \(p\)-variate population with unknown mean. Write \(\bar X=n^{-1}\sum_{r=1}^n X_r\) and define the centered sample covariance with divisor \(n\) by
The divisor \(n\) is convenient for likelihood calculations. The usual unbiased sample covariance uses \(n-1\) instead; choosing that divisor rescales all entries and does not change whether a banded matrix is positive definite. A direct sample-moment estimate at bandwidth \(q\) keeps the entries of \(S\) inside the band and sets the others to zero. This is a simple entrywise construction, but positive definiteness is not guaranteed.
Worked Example: Banded Sample Moments Can Be Indefinite
Suppose \(p=3\), the target bandwidth is \(q=1\), and the sample covariance with divisor \(n\) is \[ S= \begin{pmatrix} 1&0.9&0.7\\ 0.9&1&0.9\\ 0.7&0.9&1 \end{pmatrix}. \] First check that \(S\) is positive definite. Its leading principal minors are \(1\), \(1-0.9^2=0.19\), and \[ \det(S)=1+2(0.9)(0.9)(0.7)-(0.9^2+0.7^2+0.9^2) =1+1.134-2.11=0.024. \] All three are positive, so \(S\) is positive definite.
Directly banding \(S\) at \(q=1\) sets the \((1,3)\) and \((3,1)\) entries to zero: \[ \widetilde S= \begin{pmatrix} 1&0.9&0\\ 0.9&1&0.9\\ 0&0.9&1 \end{pmatrix}. \] Its determinant is \(1-0.9^2-0.9^2=-0.62\), so \(\widetilde S\) is not positive definite. It cannot be used as a valid covariance matrix in a nonsingular Gaussian model. The original sample covariance can be positive definite even though its entrywise banding is not.
Gaussian likelihood uses the whole covariance structure
For a likelihood comparison, assume the observations are independent and identically distributed as \(N(\mu,\Sigma)\), where \(\mu\) is unrestricted and \(\Sigma\) is positive definite with half-bandwidth \(q\). Maximizing over \(\mu\) gives \(\hat\mu=\bar X\). Up to an additive constant and a positive factor, maximizing the remaining likelihood is equivalent to minimizing
over positive-definite banded \(\Sigma\). The trace term involves the inverse of the full covariance matrix. As a result, the likelihood estimates of permitted covariances are generally coupled to each other and to the sample covariances outside the band. Entrywise truncation is not, in general, the likelihood solution.
The score equations make this distinction explicit. For a symmetric perturbation \(H\) in an allowed covariance direction, the differential of \(Q\) is \[ dQ=\operatorname{tr}\left\{\left(\Sigma^{-1}-\Sigma^{-1}S\Sigma^{-1}\right)H\right\}. \] At an interior likelihood optimum, this differential is zero for every symmetric \(H\) supported on the allowed band. Thus the score matrix must have zero entries in the free covariance directions. This is not the same equation as setting the forbidden entries of \(S\) to zero.
Proof. Let \(c>0\) be the smallest eigenvalue of \(S\). Then \(S-cI\) is positive semidefinite. Since \(\Sigma^{-1}\) is positive definite, \[ \operatorname{tr}(S\Sigma^{-1}) \geq c\,\operatorname{tr}(\Sigma^{-1}). \] If \(\lambda_1,\ldots,\lambda_p\) are the eigenvalues of \(\Sigma\), it follows that \[ Q(\Sigma)\geq \sum_{i=1}^{p}\left(\log\lambda_i+\frac{c}{\lambda_i}\right). \] For each \(i\), the summand tends to \(+\infty\) as \(\lambda_i\) tends to zero or to infinity, and it is bounded below on \((0,\infty)\). Consequently, any sequence of matrices on which \(Q\) is bounded above must have all eigenvalues bounded away from zero and infinity. A minimizing sequence therefore has a subsequence converging to a positive-definite matrix. The fixed band constraints are closed under limits, and \(Q\) is continuous on the positive-definite matrices. The limit is in the banded model and attains the infimum. \(\square\)
Worked Example: Diagonal Gaussian Likelihood and Sample Moments
Consider four centered two-dimensional observations whose coordinate values are \[ (\sqrt{2},\,1/\sqrt{2}+\sqrt{3}/2),\quad (-\sqrt{2},\,-1/\sqrt{2}+\sqrt{3}/2),\quad (0,\,-\sqrt{3}/2),\quad (0,\,-\sqrt{3}/2). \] Each coordinate sums to zero. The first coordinate has sum of squares \(4\); the second has sum of squares \(4\); and the sum of cross-products is \(2\). Hence the sample covariance with divisor \(n=4\) is \[ S=\begin{pmatrix}1&0.5\\0.5&1\end{pmatrix}. \]
Fit the bandwidth \(q=0\) model, so \(\Sigma=\operatorname{diag}(v_1,v_2)\) with \(v_1,v_2>0\). The likelihood objective is \[ Q(\Sigma)=\log v_1+\log v_2+\frac{1}{v_1}+\frac{1}{v_2}, \] because the trace with the diagonal inverse uses only the diagonal entries of \(S\). For either variance \(v\), the derivative of \(\log v+1/v\) is \(1/v-1/v^2=(v-1)/v^2\); it is negative for \(v<1\) and positive for \(v>1\). The minimum is therefore at \(v=1\). The likelihood estimate is \(\hat\Sigma=\operatorname{diag}(1,1)\), exactly the sample-moment estimate obtained by setting the off-diagonal sample covariance to zero.
This agreement is a feature of the diagonal model, not a general rule for banded models. In models with permitted off-diagonal entries, the likelihood equations involve \(\Sigma^{-1}\) and can couple the estimates. Moreover, as the three-variable example showed, the directly banded sample moments may not even be positive definite.
Choosing and interpreting a bandwidth
A smaller bandwidth imposes more zero restrictions and uses fewer covariance parameters. This can stabilize estimation when the dimension is large relative to the sample size, but it also rules out associations at longer separations. A larger bandwidth is more flexible but requires estimating more entries. The choice should reflect the order and scientific meaning of the coordinates, as well as the available information in the data.
The bandwidth is a structural assumption, not a claim that all relationships within the band are strong or equal. It also does not automatically describe dependence in every aspect of a distribution: it specifies the covariance matrix only. Interpret the zero restrictions at the level of uncorrelatedness unless additional distributional assumptions, such as joint normality, justify an independence interpretation.
Common mistake
- Wrong reasoning: “The sample covariance is positive definite, so setting its distant entries to zero must leave a valid covariance matrix.”
- Correction: Positive definiteness depends jointly on all entries. The three-variable calculation above gives a positive-definite \(S\) whose bandwidth-one truncation has determinant \(-0.62\). Check positive definiteness after banding, or estimate within the positive-definite banded model, as likelihood does.
- Another overinterpretation: “A zero covariance means the variables are independent.” This is not generally true. It is justified for jointly normal subvectors when their cross-covariance block is zero.
Check Your Understanding
Work through these questions before moving on.
- For a \(7\times7\) covariance matrix with half-bandwidth \(q=2\), which index pairs are required to have zero covariance?
- How many free entries does a \(p=8\), \(q=1\) symmetric banded covariance matrix have?
- Why does a banded covariance matrix not generally imply independence between distant variables?
- What property failed for the banded sample-moment matrix in the three-variable worked example, and how was it checked?
- Why can the Gaussian likelihood estimate differ from entrywise banding of the sample covariance?