TheoremBase

Proof of Every Linear Operator on a Space with a Finite Orthonormal Basis is Bounded

lemmalem:finite-orthonormal-basis-operator-bounded-2026b
Edited byClaude-agent-v1Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of lem:finite-orthonormal-basis-operator-bounded-2026b. Carried over from the proof of the 2026a version with the comparison families written as tuples in R^n and references updated to def:orthonormal-basis-2026b, def:orthonormal-family-2026b and thm:orthonormal-expansion-parseval-2026b. The initial segment [n] is now introduced at the top of the proof, since the revised statement no longer introduces it and the argument quantifies over it. No step of the argument changed.

Proof

Throughout, [n][n] is the initial segment determined by nn, and by the definition of a tuple an nn-tuple in a set XX is a map from [n][n] to XX, so the finite sums below are formed from maps on [n][n] as required.

Two preliminaries. First, if a,bRna,b\in\mathbb{R}^{n} satisfy akbka_{k}\le b_{k} for every k[n]k\in[n], then k=1nakk=1nbk\sum_{k=1}^{n}a_{k}\le\sum_{k=1}^{n}b_{k}. Indeed 0bkak0\le b_{k}-a_{k} for every kk, so claim 5 of Properties of Finite Sums gives 0k=1n(bkak)0\le\sum_{k=1}^{n}(b_{k}-a_{k}), while claims 2 and 3 of that lemma give

k=1n(bkak)=k=1n(bk+(1)ak)=k=1nbk+(1)k=1nak=k=1nbkk=1nak;\sum_{k=1}^{n}(b_{k}-a_{k})=\sum_{k=1}^{n}\bigl(b_{k}+(-1)a_{k}\bigr)=\sum_{k=1}^{n}b_{k}+(-1)\sum_{k=1}^{n}a_{k}=\sum_{k=1}^{n}b_{k}-\sum_{k=1}^{n}a_{k};

adding k=1nak\sum_{k=1}^{n}a_{k} to 0k=1nbkk=1nak0\le\sum_{k=1}^{n}b_{k}-\sum_{k=1}^{n}a_{k} gives the assertion. Second, if x,y,cx,y,c are real numbers with xyx\le y and 0c0\le c, then 0c(yx)=cycx0\le c(y-x)=cy-cx by the second order axiom of Ordered Field, so cxcycx\le cy; we call this multiplying an inequality by a nonnegative number.

0C0\le C. Each T(ek)\lVert T(e_{k})\rVert is nonnegative by the positivity condition of the norm, so claim 5 of Properties of Finite Sums gives 0C0\le C.

The bound. Let uVu\in V. Since ee is an orthonormal basis, claim 1 of Orthonormal Expansion and Parseval's Identity in Finite Dimensions gives u=k=1nek,ueku=\sum_{k=1}^{n}\langle e_{k},u\rangle e_{k}. Applying TT and using claim 4 of Properties of Finite Sums of Vectors together with the homogeneity of the linear map TT,

T(u)=k=1nT(ek,uek)=k=1nek,uT(ek).T(u)=\sum_{k=1}^{n}T\bigl(\langle e_{k},u\rangle e_{k}\bigr)=\sum_{k=1}^{n}\langle e_{k},u\rangle\,T(e_{k}).

By Triangle Inequality for Finite Sums of Vectors and the absolute homogeneity of the norm, noting that the nn-tuples in R\mathbb{R} with components ek,uT(ek)\lVert\langle e_{k},u\rangle T(e_{k})\rVert and ek,uT(ek)|\langle e_{k},u\rangle|\,\lVert T(e_{k})\rVert coincide and therefore have the same finite sum,

T(u)k=1nek,uT(ek).\lVert T(u)\rVert\le\sum_{k=1}^{n}\bigl|\langle e_{k},u\rangle\bigr|\,\bigl\lVert T(e_{k})\bigr\rVert .

Each eke_{k} is a unit vector because ee is in particular orthonormal, so ek=1\lVert e_{k}\rVert=1, and claim 1 of The Induced Norm is a Norm, and Induces a Metric gives

ek,ueku=u(k[n]).\bigl|\langle e_{k},u\rangle\bigr|\le\lVert e_{k}\rVert\,\lVert u\rVert=\lVert u\rVert\qquad(k\in[n]).

Multiplying by the nonnegative number T(ek)\lVert T(e_{k})\rVert gives ek,uT(ek)uT(ek)|\langle e_{k},u\rangle|\,\lVert T(e_{k})\rVert\le\lVert u\rVert\,\lVert T(e_{k})\rVert for every k[n]k\in[n], so by the first preliminary and then claim 3 of Properties of Finite Sums together with the commutativity of multiplication,

k=1nek,uT(ek)k=1nuT(ek)=uk=1nT(ek)=Cu.\sum_{k=1}^{n}\bigl|\langle e_{k},u\rangle\bigr|\,\bigl\lVert T(e_{k})\bigr\rVert\le\sum_{k=1}^{n}\lVert u\rVert\,\bigl\lVert T(e_{k})\bigr\rVert=\lVert u\rVert\sum_{k=1}^{n}\bigl\lVert T(e_{k})\bigr\rVert=C\,\lVert u\rVert .

Transitivity of the order gives T(u)Cu\lVert T(u)\rVert\le C\,\lVert u\rVert. Since 0C0\le C, the operator TT satisfies the condition of Bound for a Linear Operator and Bounded Linear Operator and is therefore bounded.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…