TheoremBase

The Trace as a Sum of Quadratic Forms, its Monotonicity and a Norm Bound

For a real m×pm\times p matrix AA with rows a1,…,ama_1,\dots,a_m and a symmetric XX, the trace of A⊤AXA^{\top}AX is the sum of the quadratic forms ak⋅(Xak)a_k\cdot(Xa_k). Consequences: the trace of a symmetric matrix is the sum of its diagonal quadratic forms, it is monotone for the semidefinite ordering, and it is bounded by a multiple of the matrix norm.

Statement

Throughout we work in the setting of Euclidean Space and Real Matrices: Standing Notation, whose notation is in force in the dimensions mm and pp, natural numbers with 1≤m1\le m and 1≤p1\le p. In addition tr⁡\operatorname{tr} denotes the trace of a square real matrix.

Let A∈Mm×p(R)A\in\mathcal{M}_{m\times p}(\mathbb{R}), and for k∈[m]k\in[m] let ak∈Rpa_{k}\in\mathbb{R}^{p} be the kkth row of AA, the point whose jjth coordinate is AkjA_{kj} for j∈[p]j\in[p]. For X∈Mp(R)X\in\mathcal{M}_{p}(\mathbb{R}) the matrices A⊤AA^{\top}A and AXAX lie in Mp(R)\mathcal{M}_{p}(\mathbb{R}) and Mm×p(R)\mathcal{M}_{m\times p}(\mathbb{R}) respectively, and (A⊤A)X=A⊤(AX)(A^{\top}A)X=A^{\top}(AX) by Associativity of the Matrix Product, so that the notation A⊤AXA^{\top}AX is unambiguous and denotes an element of Mp(R)\mathcal{M}_{p}(\mathbb{R}). Finally put

βp=∑k=1p1,\beta_{p}=\sum_{k=1}^{p}1 ,

a finite sum in R\mathbb{R}; since 0<10<1 by claim 6 of Elementary Order Arithmetic in an Ordered Field, claim 6 of Properties of Finite Sums gives 1≤βp1\le\beta_{p}.

Then the following hold.

1. (Quadratic forms) For every X∈S(p)X\in\mathcal{S}(p),

tr⁡(A⊤AX)=∑k=1mak⋅(Xak).\operatorname{tr}\bigl(A^{\top}AX\bigr)=\sum_{k=1}^{m}a_{k}\cdot(Xa_{k}).

2. (Squared rows)

tr⁡(A⊤A)=∑k=1m∥ak∥2.\operatorname{tr}\bigl(A^{\top}A\bigr)=\sum_{k=1}^{m}\lVert a_{k}\rVert^{2}.

3. (Trace of a symmetric matrix) For every X∈S(p)X\in\mathcal{S}(p),

tr⁡(X)=∑k=1pek⋅(Xek).\operatorname{tr}(X)=\sum_{k=1}^{p}e_{k}\cdot(Xe_{k}).

4. (Monotonicity) If X,Y∈S(p)X,Y\in\mathcal{S}(p) satisfy X⪯YX\preceq Y, then

tr⁡(A⊤AX)≤tr⁡(A⊤AY);\operatorname{tr}\bigl(A^{\top}AX\bigr)\le\operatorname{tr}\bigl(A^{\top}AY\bigr);

in particular tr⁡(X)≤tr⁡(Y)\operatorname{tr}(X)\le\operatorname{tr}(Y).

5. (Norm bound) For every X∈S(p)X\in\mathcal{S}(p),

∣tr⁡(X)∣≤βp∥X∥.\bigl|\operatorname{tr}(X)\bigr|\le\beta_{p}\lVert X\rVert .

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…