Block matrix inverse 2026-09-24
The inverse of a block matrix can be expressed through the inverse of one diagonal block and the inverse of its Schur complement. This reduces many deletion and conditioning identities to smaller matrix inversions.
For a nondegenerate isometry direction and initially zero two-form, the local T-dual fields in alpha-prime-one units are , , , and . Gauging the isometry and eliminating its auxiliary connection derives these rules. The spectator metric is a Schur complement. The sign of the mixed two-form follows the multiplier and dual-coordinate orientation convention.
Complement theta number 2026-10-05
For a finite simple graph with at least one vertex, the complement theta number has the equivalent semidefinite program formulations
and
The Schur complement and prove the equivalence; any feasible is at least one, so division by is valid. For a graph with an edge, is the Gram matrix of a strict vector coloring. Consequently is the strict vector chromatic number, and an ordinary -graph colouring gives by assigning the colors the vertices of a regular simplex.
For gauge fixing with , integrating out the Nakanishi-Lautrup field produces gauge-scalar mixing. The Schur complement of the free gauge-field kernel cancels the extra in the scalar kernel, leaving . This is independent of the gauge vector , but still depends on the full momentum .
In the intermediate-index range, if an attaching sphere meets a belt sphere at exactly one transverse point, handle slides can remove the intersections of every other attaching sphere with . The dual slides then remove the intersections of with the other belt spheres. Each move uses a band to the unique pivot sheet and a local isotopy removing the old and new intersections. If and , the remaining incidence block is , the Schur complement of the pivot. Extreme-index cases need separate hypotheses.
LDL decomposition Created 2026-09-24 Updated 2026-10-03
An LDL decomposition of a real symmetric matrix is
where is unit lower triangular and is diagonal. Symmetric elimination computes it one Schur complement at a time. The matrix is positive definite exactly when every diagonal pivot in is positive.
Work with in the upper half-plane. Write the Stieltjes matrix resolvents and their normalized matrix traces as
The minor trace is normalized by , not by . This sign convention is the negative of the convention used in the general resolvent of an operator article. Here is the Stieltjes transform of a measure of the empirical spectral measure, with kernel .
The diagonal entries of are zero, so the preceding Schur complement formula gives . Taking the matrix trace, subtracting the comparison value , and combining fractions gives the resolvent self-consistency defect
The positive numerator sign is fixed by this subtraction. All denominators are nonzero in the upper half-plane, as the imaginary-part estimate in the next part shows. The identity is deterministic and does not use entry independence or moment assumptions.
Use block matrix elimination with the invertible square block :
The left multiplier is block triangular with identity diagonal blocks, so its determinant is . Taking the determinant of the block-triangular product proves
The matrix is the Schur complement of . The proof needs invertible, but does not assume the Schur complement or the full matrix is invertible.
Use the standard Euclidean convention and restore the curvature normalization explicitly. Let be the conventional dimensionless dilaton, whose worldsheet term is
For constant , the Gauss-Bonnet theorem gives . A closed surface of genus has Euler characteristic , so its contribution is weighted by
Thus
This is the dilaton normalization and Euler-characteristic weighting of string perturbation theory. If the unit curvature coefficient in the printed expression is retained literally in this Euclidean convention, then and . If denotes the conventional dilaton, the usual omitted is understood and . One must specify that normalization before exponentiating the field. Lorentzian overall signs are fixed consistently by Wick rotation.
For the sigma-model beta function, use
with vanishing two-form and dilaton. Perform the background field expansion of a string sigma model covariantly by setting . In Riemann normal coordinates, the quadratic fluctuation action is
The covariant derivative contains the pulled-back target connection. This expansion accounts for the connection vertices as well as the normal-coordinate metric expansion; keeping only a single metric tadpole would not give a covariant answer.
Integrating the Gaussian fluctuations gives , where
Contracting the curvature vertex with the short-distance propagator traces to the Ricci tensor . In dimensional regularization at , the logarithmic integral is . With the stated curvature convention the divergent effective action is
It is cancelled by the metric counterterm . Equivalently, write . Differentiating the bare coupling at fixed value gives the one-loop metric beta function of a string sigma model
This loop is a loop of two-dimensional fluctuation fields: its expansion is in , not a change of worldsheet genus or an extra power of . The sign here defines the renormalization scale to increase toward the ultraviolet. For a round target sphere, positive Ricci curvature makes its squared radius increase with that scale, consistent with the usual asymptotic freedom of the inverse-radius sigma-model coupling. With the printed kinetic coefficient taken literally, and the leading coefficient is . Requiring the metric beta function to vanish gives at this order. Full bosonic-string Weyl consistency also requires the other anomaly coefficients, including the critical-dimension condition when the dilaton vanishes.
For T-duality, choose coordinates adapted to the isometry and use units for the local Buscher rules. Assume , with a spacelike isometry for the usual unitary circle duality. In light-cone worldsheet coordinates take the convention that multiplies . Gauge translations of , replace by , gauge fix , and impose flatness with a multiplier . The relevant first-order Lagrangian is
Integrating out gives a locally pure-gauge connection and hence the original model. Instead integrate the last term by parts and solve the algebraic equations for :
Substitution gives
Reading its symmetric and antisymmetric parts yields the Buscher dual of a metric with vanishing two-form:
The spectator metric is the Schur complement of . Reversing the orientation of reverses the displayed mixed two-form signs; our multiplier and conventions fix them.
The metric rules arise already from the classical algebraic elimination. For quantum equivalence the regulated Gaussian measure also produces the Buscher dilaton shift
For a compact isometry the multiplier periodicity and flat-connection sectors implement the exchange of momentum and winding. On a circle, restoring dimensions gives . Thus the calculation derives the local dual background, while the measure and global sectors explain how it becomes a string-theory duality.
Put , the precision matrix. The conditional independence graph has an edge between and exactly when and are not conditionally independent given all the remaining components. For the multivariate normal distribution,
Indeed, the conditional density of the pair given the others has its quadratic term determined by the corresponding two-by-two principal submatrix of ; its cross term vanishes exactly when , making the two conditional Gaussian variables independent. This is a Gaussian graphical model.
To derive the conditional law of one component, isolate in the multivariate normal density and complete the square. The terms involving it are
Therefore
Equivalently, its mean is and its variance is the Schur complement . These forms agree because the block of gives , and its block then identifies the variance. This proves the relevant conditional multivariate normal distribution formula.
In particular, the population regression of component on the other components has coefficients
intercept , and a Gaussian residual independent of the predictors with variance . These are the conditional regression coefficients from a Gaussian precision matrix. The coefficient is zero exactly when the corresponding edge is absent. Its counterpart has the same zero pattern and sign, but generally a different magnitude.
This motivates nodewise regression: for each , regress on , estimating an intercept as well. For sparse graph estimation, use the Nodewise Lasso criterion
The Lasso penalty encourages many fitted coefficients to be zero and remains usable when the number of predictors exceeds the sample size. Ordinary unpenalized sample regressions would usually give a dense estimated graph. Separate regressions can disagree about a pair, so an undirected graph can use the OR rule for nodewise graph selection, retaining an edge if either fitted direction is nonzero, or the more conservative AND rule for nodewise graph selection, retaining it only if both are nonzero. These are choices for combining estimated neighbourhoods, rather than identities forced by finite-sample fits.
The printed joint objective uses a Group Lasso penalty on the unordered pairs
This is paired group Lasso for Gaussian graph estimation. Each group represents a single undirected edge, coupling its two directional regressions. A sum of group norms encourages entire pairs to be zero; a squared group norm would give smooth ridge-type shrinkage instead of edge deletion. The constraint removes self-prediction, and the intercepts are not penalized.
The free symbols called in the objective are regression intercepts, not generally the marginal means of the original Gaussian vector. Profiling them out gives
and replaces all columns by their centred versions in the squared-error terms. This is profiling intercepts in nodewise regression. Scaling predictors to comparable units can also help interpret a common penalty, although the displayed objective itself is well defined on the given data.
The grouped KKT conditions make the sparsity mechanism precise. With centred residuals , define
The subdifferential of the Euclidean norm at zero is its closed unit ball, and away from zero is . Hence a minimizer satisfies
These are the paired group Lasso optimality conditions. They jointly threshold the two directional scores, matching the population fact that both directions represent the same edge.
Estimate the graph by including exactly when . This graph is undirected by construction. The penalty does not impose , nor does it mathematically require both coordinates of every selected pair to be nonzero. That distinction is appropriate because the population regression coefficients themselves need not have equal magnitudes. The fitted coefficient matrix is not automatically a symmetric positive definite precision matrix; its pair supports, rather than its entries as a precision estimate, supply the requested conditional independence graph.