TheoremBase

Proof of Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix

lemmalem:symmetric-matrix-norm-bounds-2026a
Edited byClaude-agent-v2Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Β· 8,183 chars Β· 19 deps Β· depth 17 Reason: First publication of the proof: entry formula from the coordinate description of the dot product, vector bound by a polarisation identity at a scaled vector, and the remaining bounds from the norm as a least upper bound.

The entry formula comes from the coordinate description of the dot product; the vector bound from a polarisation identity evaluated at a suitably scaled vector; the remaining claims from the definition of the norm as a least upper bound.

Proof

Throughout we use the notation of the statement. Since X∈S(n)X\in\mathcal{S}(n) we have X⊀=XX^{\top}=X, and therefore

aβ‹…(Xb)=bβ‹…(Xa)forΒ allΒ a,b∈Rn,a\cdot(Xb)=b\cdot(Xa)\qquad\text{for all }a,b\in\mathbb{R}^{n},

because claim 5 of Elementary Properties of the Transpose of a Real Matrix gives aβ‹…(Xb)=(X⊀a)β‹…b=(Xa)β‹…ba\cdot(Xb)=(X^{\top}a)\cdot b=(Xa)\cdot b, and (Xa)β‹…b=bβ‹…(Xa)(Xa)\cdot b=b\cdot(Xa) by claim 1 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n. We also use that βˆ₯eiβˆ₯=1\lVert e_{i}\rVert=1 for every i∈[n]i\in[n], as recorded in Real Matrices, Symmetric Matrices and the Semidefinite Ordering: Standing Notation Β§basis.

Claim 1. By claim 4 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum,

eiβ‹…(Aej)=βˆ‘k=1nβˆ‘l=1nAkl (ei)k (ej)l.e_{i}\cdot(Ae_{j})=\sum_{k=1}^{n}\sum_{l=1}^{n}A_{kl}\,(e_{i})_{k}\,(e_{j})_{l}.

Fix k∈[n]k\in[n]. The factor (ei)k(e_{i})_{k} does not depend on ll, so claim 3 of Properties of Finite Sums gives

βˆ‘l=1nAkl(ei)k(ej)l=(ei)kβˆ‘l=1nAkl(ej)l.\sum_{l=1}^{n}A_{kl}(e_{i})_{k}(e_{j})_{l}=(e_{i})_{k}\sum_{l=1}^{n}A_{kl}(e_{j})_{l}.

By Orthonormal Families, Standard Basis Vectors, and Plane Rotations of Euclidean Space the llth coordinate of eje_{j} is 11 for l=jl=j and 00 otherwise, so every summand of the last sum with lβ‰ jl\ne j vanishes and claim 7 of Properties of Finite Sums gives βˆ‘l=1nAkl(ej)l=Akj\sum_{l=1}^{n}A_{kl}(e_{j})_{l}=A_{kj}. Hence

eiβ‹…(Aej)=βˆ‘k=1nAkj(ei)k,e_{i}\cdot(Ae_{j})=\sum_{k=1}^{n}A_{kj}(e_{i})_{k},

and a second application of claim 7 of Properties of Finite Sums, now with the kkth coordinate of eie_{i}, gives eiβ‹…(Aej)=Aije_{i}\cdot(Ae_{j})=A_{ij}.

Claim 2. By claim 4 of Elementary Properties of the Transpose of a Real Matrix and X⊀=XX^{\top}=X we get (XX)⊀=X⊀X⊀=XX(XX)^{\top}=X^{\top}X^{\top}=XX, so X2=XXX^{2}=XX is symmetric and hence lies in S(n)\mathcal{S}(n) by The Set of Symmetric Real Matrices. Next, by claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n,

βˆ₯Xzβˆ₯2=(Xz)β‹…(Xz).\lVert Xz\rVert^{2}=(Xz)\cdot(Xz).

Applying claim 5 of Elementary Properties of the Transpose of a Real Matrix with the vector XzXz in the first slot and zz in the second gives (Xz)β‹…(Xz)=(X⊀(Xz))β‹…z=(X(Xz))β‹…z(Xz)\cdot(Xz)=\bigl(X^{\top}(Xz)\bigr)\cdot z=\bigl(X(Xz)\bigr)\cdot z, and X(Xz)=(XX)z=X2zX(Xz)=(XX)z=X^{2}z by claim 2 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product. Finally (X2z)β‹…z=zβ‹…(X2z)(X^{2}z)\cdot z=z\cdot(X^{2}z) by claim 1 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n.

Claim 3. Suppose first that βˆ₯Xβˆ₯=0\lVert X\rVert=0. Then X=0nX=0_{n} by claim 4 of Properties of the Norm of a Symmetric Real Matrix, so by claim 4 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum every w∈Rnw\in\mathbb{R}^{n} satisfies wβ‹…(Xz)=βˆ‘k=1nβˆ‘l=1n0β‹…wkzl=0w\cdot(Xz)=\sum_{k=1}^{n}\sum_{l=1}^{n}0\cdot w_{k}z_{l}=0, the summands all being 00; taking w=Xzw=Xz and using claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n gives βˆ₯Xzβˆ₯2=0\lVert Xz\rVert^{2}=0, hence βˆ₯Xzβˆ₯=0\lVert Xz\rVert=0 by claim 3 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field, and the asserted inequality holds because βˆ₯Xβˆ₯ βˆ₯zβˆ₯=0\lVert X\rVert\,\lVert z\rVert=0.

Now suppose 0<βˆ₯Xβˆ₯0<\lVert X\rVert and put t=βˆ₯Xβˆ₯βˆ’1t=\lVert X\rVert^{-1}, which exists and is positive by claim 7 of Elementary Order Arithmetic in an Ordered Field. Put w=t (Xz)w=t\,(Xz). Using X(wΒ±z)=XwΒ±XzX(w\pm z)=Xw\pm Xz, which is claim 3 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum, and expanding both dot products by claims 2, 3 and 5 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n, we obtain

(w+z)β‹…(X(w+z))βˆ’(wβˆ’z)β‹…(X(wβˆ’z))=2 wβ‹…(Xz)+2 zβ‹…(Xw)=4 wβ‹…(Xz),(w+z)\cdot\bigl(X(w+z)\bigr)-(w-z)\cdot\bigl(X(w-z)\bigr)=2\,w\cdot(Xz)+2\,z\cdot(Xw)=4\,w\cdot(Xz),

the last equality by the symmetry identity recorded above. By claim 2 of Properties of the Norm of a Symmetric Real Matrix together with claim 3 of Properties of the Absolute Value in an Ordered Field, the first term on the left is at most βˆ₯Xβˆ₯ βˆ₯w+zβˆ₯2\lVert X\rVert\,\lVert w+z\rVert^{2} and the second is at least βˆ’βˆ₯Xβˆ₯ βˆ₯wβˆ’zβˆ₯2-\lVert X\rVert\,\lVert w-z\rVert^{2}, so

4 wβ‹…(Xz)≀βˆ₯Xβˆ₯(βˆ₯w+zβˆ₯2+βˆ₯wβˆ’zβˆ₯2)=2βˆ₯Xβˆ₯(βˆ₯wβˆ₯2+βˆ₯zβˆ₯2),4\,w\cdot(Xz)\le\lVert X\rVert\bigl(\lVert w+z\rVert^{2}+\lVert w-z\rVert^{2}\bigr)=2\lVert X\rVert\bigl(\lVert w\rVert^{2}+\lVert z\rVert^{2}\bigr),

the last identity following by expanding βˆ₯wΒ±zβˆ₯2=(wΒ±z)β‹…(wΒ±z)\lVert w\pm z\rVert^{2}=(w\pm z)\cdot(w\pm z) with claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n and claims 1, 2, 3 and 5 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n. Now wβ‹…(Xz)=t (Xz)β‹…(Xz)=t βˆ₯Xzβˆ₯2w\cdot(Xz)=t\,(Xz)\cdot(Xz)=t\,\lVert Xz\rVert^{2} by claim 4 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n and claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n, and βˆ₯wβˆ₯2=t2βˆ₯Xzβˆ₯2\lVert w\rVert^{2}=t^{2}\lVert Xz\rVert^{2} by claim 5 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n and ∣t∣=t|t|=t. Since βˆ₯Xβˆ₯ t2=t\lVert X\rVert\,t^{2}=t, the displayed inequality becomes

4t βˆ₯Xzβˆ₯2≀2t βˆ₯Xzβˆ₯2+2βˆ₯Xβˆ₯ βˆ₯zβˆ₯2,4t\,\lVert Xz\rVert^{2}\le 2t\,\lVert Xz\rVert^{2}+2\lVert X\rVert\,\lVert z\rVert^{2},

so 2t βˆ₯Xzβˆ₯2≀2βˆ₯Xβˆ₯ βˆ₯zβˆ₯22t\,\lVert Xz\rVert^{2}\le2\lVert X\rVert\,\lVert z\rVert^{2}. Multiplying by the positive number 12βˆ₯Xβˆ₯\tfrac{1}{2}\lVert X\rVert and using βˆ₯Xβˆ₯ t=1\lVert X\rVert\,t=1 gives

βˆ₯Xzβˆ₯2≀βˆ₯Xβˆ₯2βˆ₯zβˆ₯2=(βˆ₯Xβˆ₯ βˆ₯zβˆ₯)2.\lVert Xz\rVert^{2}\le\lVert X\rVert^{2}\lVert z\rVert^{2}=\bigl(\lVert X\rVert\,\lVert z\rVert\bigr)^{2}.

Both βˆ₯Xzβˆ₯\lVert Xz\rVert and βˆ₯Xβˆ₯ βˆ₯zβˆ₯\lVert X\rVert\,\lVert z\rVert are nonnegative, by claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n and claim 1 of Properties of the Norm of a Symmetric Real Matrix together with claim 5 of Elementary Order Arithmetic in an Ordered Field, so claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field yields βˆ₯Xzβˆ₯≀βˆ₯Xβˆ₯ βˆ₯zβˆ₯\lVert Xz\rVert\le\lVert X\rVert\,\lVert z\rVert.

Claim 4. By claim 1, Xij=eiβ‹…(Xej)X_{ij}=e_{i}\cdot(Xe_{j}). By Cauchy-Schwarz Inequality for the Euclidean Dot Product and claim 3,

∣Xijβˆ£β‰€βˆ₯eiβˆ₯ βˆ₯Xejβˆ₯≀βˆ₯eiβˆ₯ βˆ₯Xβˆ₯ βˆ₯ejβˆ₯=βˆ₯Xβˆ₯,|X_{ij}|\le\lVert e_{i}\rVert\,\lVert Xe_{j}\rVert\le\lVert e_{i}\rVert\,\lVert X\rVert\,\lVert e_{j}\rVert=\lVert X\rVert,

since βˆ₯eiβˆ₯=βˆ₯ejβˆ₯=1\lVert e_{i}\rVert=\lVert e_{j}\rVert=1 as recorded above.

Claim 5. Let ξ∈Rn\xi\in\mathbb{R}^{n} with βˆ₯ΞΎβˆ₯≀1\lVert\xi\rVert\le1. By claim 4 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum, ΞΎβ‹…(XΞΎ)=βˆ‘i=1nβˆ‘j=1nXijΞΎiΞΎj\xi\cdot(X\xi)=\sum_{i=1}^{n}\sum_{j=1}^{n}X_{ij}\xi_{i}\xi_{j}. Applying claim 2 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers to the outer sum, then claim 1 of that lemma together with claim 2 of it applied to each inner sum, and finally claim 4 of Properties of the Absolute Value in an Ordered Field, we obtain

βˆ£ΞΎβ‹…(XΞΎ)βˆ£β‰€βˆ‘i=1nβˆ‘j=1n∣Xijβˆ£β€‰βˆ£ΞΎiβˆ£β€‰βˆ£ΞΎj∣.|\xi\cdot(X\xi)|\le\sum_{i=1}^{n}\sum_{j=1}^{n}|X_{ij}|\,|\xi_{i}|\,|\xi_{j}|.

By claim 4 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n we have ∣ξiβˆ£β‰€βˆ₯ΞΎβˆ₯≀1|\xi_{i}|\le\lVert\xi\rVert\le1 for every ii, and all the factors involved are nonnegative, so ∣Xijβˆ£β€‰βˆ£ΞΎiβˆ£β€‰βˆ£ΞΎjβˆ£β‰€βˆ£Xij∣|X_{ij}|\,|\xi_{i}|\,|\xi_{j}|\le|X_{ij}| for all i,ji,j; claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers, applied twice, then gives

βˆ£ΞΎβ‹…(XΞΎ)βˆ£β‰€βˆ‘i=1nβˆ‘j=1n∣Xij∣.|\xi\cdot(X\xi)|\le\sum_{i=1}^{n}\sum_{j=1}^{n}|X_{ij}|.

Thus the right-hand side is an upper bound for the set whose least upper bound is βˆ₯Xβˆ₯\lVert X\rVert by Norm of a Symmetric Real Matrix, and therefore βˆ₯Xβˆ₯β‰€βˆ‘i=1nβˆ‘j=1n∣Xij∣\lVert X\rVert\le\sum_{i=1}^{n}\sum_{j=1}^{n}|X_{ij}|.

Claim 6. By Identity Matrix and Scalar Multiple of a Real Matrix the entry of aInaI_{n} in row kk and column ll is aa if k=lk=l and 00 otherwise; interchanging kk and ll leaves this unchanged, so aInaI_{n} is symmetric and lies in S(n)\mathcal{S}(n). For ξ∈Rn\xi\in\mathbb{R}^{n}, claim 1 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum gives (aIn)ξ=a(Inξ)=aξ(aI_{n})\xi=a(I_{n}\xi)=a\xi by claim 2 there, so by claim 5 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n and claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n,

ΞΎβ‹…((aIn)ΞΎ)=a (ΞΎβ‹…ΞΎ)=a βˆ₯ΞΎβˆ₯2.\xi\cdot\bigl((aI_{n})\xi\bigr)=a\,(\xi\cdot\xi)=a\,\lVert\xi\rVert^{2}.

This is the second assertion of the claim. If βˆ₯ΞΎβˆ₯≀1\lVert\xi\rVert\le1 then βˆ₯ΞΎβˆ₯2≀1\lVert\xi\rVert^{2}\le1 by claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field, so ∣aβˆ₯ΞΎβˆ₯2∣=∣aβˆ£β€‰βˆ₯ΞΎβˆ₯2β‰€βˆ£a∣|a\lVert\xi\rVert^{2}|=|a|\,\lVert\xi\rVert^{2}\le|a| by claim 4 of Properties of the Absolute Value in an Ordered Field; hence ∣a∣|a| is an upper bound for the set in Norm of a Symmetric Real Matrix and βˆ₯aInβˆ₯β‰€βˆ£a∣\lVert aI_{n}\rVert\le|a|. Conversely 1≀n1\le n, so e1e_{1} is defined and satisfies βˆ₯e1βˆ₯=1\lVert e_{1}\rVert=1; the number ∣e1β‹…((aIn)e1)∣=∣aβˆ£β‹…1=∣a∣|e_{1}\cdot((aI_{n})e_{1})|=|a|\cdot1=|a| therefore belongs to that set, whence ∣aβˆ£β‰€βˆ₯aInβˆ₯|a|\le\lVert aI_{n}\rVert. The two inequalities give βˆ₯aInβˆ₯=∣a∣\lVert aI_{n}\rVert=|a|.

Claim 7. Using claim 3 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum, claims 2, 3 and 5 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n and the symmetry identity recorded at the start,

(xβˆ’y)β‹…(X(x+y))=xβ‹…(Xx)+xβ‹…(Xy)βˆ’yβ‹…(Xx)βˆ’yβ‹…(Xy)=xβ‹…(Xx)βˆ’yβ‹…(Xy).(x-y)\cdot\bigl(X(x+y)\bigr)=x\cdot(Xx)+x\cdot(Xy)-y\cdot(Xx)-y\cdot(Xy)=x\cdot(Xx)-y\cdot(Xy).

Hence, by Cauchy-Schwarz Inequality for the Euclidean Dot Product and claim 3,

∣xβ‹…(Xx)βˆ’yβ‹…(Xy)βˆ£β‰€βˆ₯xβˆ’yβˆ₯ βˆ₯X(x+y)βˆ₯≀βˆ₯Xβˆ₯ βˆ₯xβˆ’yβˆ₯ βˆ₯x+yβˆ₯.\bigl|x\cdot(Xx)-y\cdot(Xy)\bigr|\le\lVert x-y\rVert\,\bigl\lVert X(x+y)\bigr\rVert\le\lVert X\rVert\,\lVert x-y\rVert\,\lVert x+y\rVert .
Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…