Closed-Form Covariance Rule

• Closed-Form Covariance Rule is the analytic expression of covariance matrices and moments, representing them as matrix polynomials in powers of P with trace-based coefficients.
• It encompasses methodologies for Gaussian quadratic forms, conditional laws, covariance kernels, and sparse inverse covariance estimation, enabling precise algebraic analysis.
• This approach reduces simulation and combinatorial complexity by providing explicit closed expressions that yield order relations, bounds, and efficient estimator formulations.

The phrase “closed-form covariance rule” is not used uniformly across the cited literature. As an Editor’s term, it denotes analytic formulas that express covariance matrices, covariance-dependent moments, or covariance-driven objectives directly in matrix form, rather than through simulation, explicit summation over permutations, or generic iterative optimization. In its most direct form, the rule arises for a centered Gaussian vector $X$ with covariance $P$, where $\mathcal X=XX'$ and expectations of products such as $\prod_i(\mathcal X P^{v_i})$ and central moments $\mathbb E[(\mathcal X-P)^n]$ are written as polynomials in powers of $P$ with coefficients depending on traces of those powers (Moral et al., 2017). Closely related constructions appear in conditional Gaussian laws, covariance kernels of Gaussian Markov processes, sparse inverse covariance estimation, Gaussian optimal transport, and covariance-based information decomposition.

1. Foundational matrix-product rule for Gaussian quadratic forms

A canonical closed-form covariance rule is given for the rank-one Wishart matrix $\mathcal X=XX'$, where $X$ is a centered Gaussian vector with covariance matrix $P$. The central quantities are the matrix-product moments

$$M(\mathbf v)=\mathbb E\!\left[(\mathcal X P^{v_1})\cdots(\mathcal X P^{v_m})\right]$$

and the central matrix moments $P$0. These objects are shown to admit closed forms as matrix polynomials in $P$1, with coefficients determined by traces such as $P$2 (Moral et al., 2017).

The recursive rule stated for the multi-indexed moments has the form

$P$3

which yields a sequential algorithm in the order parameter without explicitly summing over permutations. The paper also gives explicit low-order instances, including

$P$4

and

$P$5

The same framework introduces weighted moments

$P$6

with polynomial expansion

$P$7

where the coefficients are explicit non-negative integers. This formulation makes the covariance structure algebraic: powers of $P$8 encode the operator part, while traces encode the scalar combinatorics.

2. Trace-polynomial structure, noncommutative binomial formulas, and order inequalities

The same matrix-moment theory makes precise how Gaussian covariance enters through traces and permutation structure. One explicit expression generalizes Letac–Massam-type formulas: $P$9 so the dependence on the covariance matrix is reduced to powers of $\mathcal X=XX'$0 and trace factors associated with cycles (Moral et al., 2017).

For central moments, the paper derives a noncommutative binomial formula,

$\mathcal X=XX'$1

which has the appearance of the scalar binomial theorem but retains matrix noncommutativity through the weighted moments. In the special case $\mathcal X=XX'$2, these expressions collapse to formulas involving classical binomial coefficients, and the noncommutative formula reduces to the scalar one.

The same article gives scalar trace formulas for norm moments, including a Bell-polynomial representation for $\mathcal X=XX'$3. It also establishes Loewner-order inequalities. Among the displayed estimates are

$\mathcal X=XX'$4

and the crude but general bound

$\mathcal X=XX'$5

For even moments, the paper further states

$\mathcal X=XX'$6

These results are significant because they show that closed-form covariance rules need not be purely evaluative; they can also generate order relations and bounds in the positive semidefinite cone.

3. Conditional Gaussian laws, covariance kernels, and Schur-complement rules

A second major class of closed-form covariance rules concerns conditioning. For an i.i.d. standard normal vector $\mathcal X=XX'$7 subject to the linear constraint $\mathcal X=XX'$8, the conditional law remains Gaussian of dimension $\mathcal X=XX'$9, with explicit mean and covariance. For the reduced vector $\prod_i(\mathcal X P^{v_i})$0,

$\prod_i(\mathcal X P^{v_i})$1

and

$\prod_i(\mathcal X P^{v_i})$2

where $\prod_i(\mathcal X P^{v_i})$3 (Vrins, 2018). Here the rule is exact, finite-dimensional, and entirely explicit.

Closed-form covariance rules also characterize whole process classes. For Gaussian Markov processes with stationary increments, a covariance kernel of the form

$\prod_i(\mathcal X P^{v_i})$4

with $\prod_i(\mathcal X P^{v_i})$5 and $\prod_i(\mathcal X P^{v_i})$6 symmetric positive semidefinite and $\prod_i(\mathcal X P^{v_i})$7 positive definite, is described as necessary and sufficient for stationary increments and, in considerable generality, for the Markov property (Fendick, 2015). The same work derives closed-form maximum likelihood estimators for $\prod_i(\mathcal X P^{v_i})$8 and $\prod_i(\mathcal X P^{v_i})$9, and closed-form posterior moments for forecasting.

In multi-source Gaussian partial information decomposition, the key rule is a Schur-complement identity. If $\mathbb E[(\mathcal X-P)^n]$0 is jointly Gaussian and $\mathbb E[(\mathcal X-P)^n]$1 is the conditional-independent family built from source subsets, then

$\mathbb E[(\mathcal X-P)^n]$2

and every redundancy, unique-information, and synergy quantity becomes a log-determinant ratio of such conditional covariances (Lyu et al., 11 May 2026). For example, the total synergistic effect is

$\mathbb E[(\mathcal X-P)^n]$3

This is a closed-form covariance rule in a strict information-theoretic sense: the entire decomposition is reduced to covariance blocks and Schur complements.

4. Sparse inverse covariance, graphical models, and combinatorial covariance formulas

In sparse precision-matrix estimation, the closed-form covariance rule appears as an exact or approximate replacement for iterative Graphical Lasso solvers. The optimization problem

$\mathbb E[(\mathcal X-P)^n]$4

is shown to coincide structurally with thresholding under explicit sign-consistency and inverse-consistency conditions. When the thresholded support graph is acyclic, the optimal solution has an explicit closed form; for general sparse graphs, the same formula yields an approximation whose error decreases exponentially fast with the length of the minimum cycle (Fattahi et al., 2017).

For chordal support graphs, the same program can be reduced to a maximum-determinant matrix completion problem. If thresholding and Graphical Lasso have the same sparsity pattern, then $\mathbb E[(\mathcal X-P)^n]$5 is the unique max-det completion of the thresholded residual matrix, and a recursive closed-form solution follows from chordal structure (Fattahi et al., 2017). This is a closed-form covariance rule for inverse covariance estimation in the literal sense: the precision matrix is obtained analytically from a support graph and a thresholded covariance template.

A related combinatorial rule arises in linear structural equation models. For a mixed graph $\mathbb E[(\mathcal X-P)^n]$6, the covariance map is

$\mathbb E[(\mathcal X-P)^n]$7

and the entries of $\mathbb E[(\mathcal X-P)^n]$8, hence of $\mathbb E[(\mathcal X-P)^n]$9, admit finite rational expressions in terms of “1-connections” in a Coates digraph (Adhikari et al., 2022). This extends the trek rule beyond acyclic graphs. The significance is that covariance entries become finite sums of signed monomials over paths and cycles, which supports both identifiability arguments and systematic exploration of polynomials in the Gaussian vanishing ideal.

5. Structured covariance functions, covariance geometry, and analytic matrix distances

Closed-form covariance rules also govern the construction of covariance functions themselves. In asymmetric space-time modeling, a hierarchical mixture framework defines

$P$0

and positive-definiteness is guaranteed under integrability conditions (Ma, 11 Nov 2025). Specific choices produce closed-form covariances such as the Lagrangian Matérn model

$P$1

with asymmetry induced by nonzero velocity mean and long-range dependence obtained through further scale mixtures.

In covariance geometry, the log-Euclidean distance between independent sample covariance matrices admits a deterministic equivalent in the large-dimensional regime,

$P$2

where $P$3 and $P$4 are explicit algebraic functions of covariance eigenstructure and sample-size ratios (Mestre et al., 2024). This rule is not the population distance itself; it is an asymptotically exact correction for the plug-in distance under random-matrix scaling.

Entropic optimal transport between Gaussian measures yields another exact covariance formula. For $P$5 and $P$6,

$P$7

and the optimal coupling is Gaussian with cross-covariance

$P$8

(Janati et al., 2020). The paper emphasizes that, unlike the unregularized Bures case, the entropic formula is differentiable everywhere, including for degenerate covariance matrices.

Analytic covariance templates also appear in cosmological $P$9-point statistics. In the Gaussian random field approximation with

$\mathcal X=XX'$0

closed-form expressions are obtained for the 2-point covariance and for the $\mathcal X=XX'$1-integrals that build the 3- and 4-point covariances; the dominant contributions occur when closed triangles may be formed (Chellino et al., 29 Apr 2025). This reveals a sparsity pattern tied directly to geometry.

6. Exactness, approximation, and broader statistical extensions

A common misconception is that a closed-form covariance rule is always exact, universally optimal, and finite-sample. The literature is more differentiated. Some rules are exact identities, such as the Gaussian matrix-product formulas, the weighted-sum conditioning formulas, the stationary-increment kernel characterization, the Gaussian entropic OT coupling, and the Schur-complement PID expressions (Moral et al., 2017). Others are principled approximations: the log-Euclidean deterministic equivalent is asymptotic rather than finite-sample exact (Mestre et al., 2024), and the general sparse-graph Graphical Lasso formula is approximate when cycles are present, with error decaying exponentially in girth (Fattahi et al., 2017).

The same distinction appears in filtering and residual modeling. In distributed Poisson multi-Bernoulli filtering, the exact GCI fusion of PMB densities is intractable, so the power of a PMB density is approximated by an unnormalised PMB density; the normalized product is then a PMBM in closed form (García-Fernández et al., 23 Jun 2025). In the Spatial Adapter framework, residuals from a frozen first-stage predictor are modeled through

$\mathcal X=XX'$2

with plug-in estimator

$\mathcal X=XX'$3

and effective rank chosen by spectral thresholding (Wang et al., 12 May 2026). These are closed-form covariance estimators, but they are post-fit constructions rather than exact generative identities.

Broader statistical uses preserve the same analytic pattern. Under Stein loss, a generalized Bayes estimator of the covariance matrix is given in closed form by

$\mathcal X=XX'$4

with dominance properties established for $\mathcal X=XX'$5 under explicit parameter conditions (Yuasa et al., 2021). For the product $\mathcal X=XX'$6 of correlated zero-mean normal variables, variance and higher moments are available from closed-form variance-gamma formulas; in particular,

$\mathcal X=XX'$7

is recovered as a special case (Gaunt, 2022). In stochastic optimization, expected regret admits the decomposition

$\mathcal X=XX'$8

with $\mathcal X=XX'$9 exactly for linear programs with continuous cost distributions and for unconstrained quadratic programs, including the Markowitz case (Aldridge, 13 May 2026). This suggests that the logic of a closed-form covariance rule extends beyond covariance matrices themselves to covariance as a scalar operational identity.

Taken together, these results identify a stable pattern across disparate fields. Covariance is made tractable by reducing it to algebraic primitives—powers and traces, Schur complements, graph factorizations, log-determinants, or low-rank-plus-noise decompositions. The unifying significance is not a single universal formula, but a shared methodology: replacing simulation-heavy or combinatorially explosive covariance calculations by explicit analytic structure.