{"id":511,"date":"2014-11-27T10:50:03","date_gmt":"2014-11-27T15:50:03","guid":{"rendered":"http:\/\/web.colby.edu\/thegeometricviewpoint\/?p=511"},"modified":"2015-04-12T19:20:00","modified_gmt":"2015-04-12T23:20:00","slug":"operator-topologies","status":"publish","type":"post","link":"https:\/\/web.colby.edu\/thegeometricviewpoint\/2014\/11\/27\/operator-topologies\/","title":{"rendered":"<wbr>Topology &#038; <wbr>Infinite-<wbr>Dimensional <wbr>Linear <wbr>Algebra"},"content":{"rendered":"<p>For the student wishing to see interplay between the three major branches of mathematics (analysis, algebra, topology), Hilbert Space is a great place to explore! \u00a0Hilbert Space\u00a0is a tool that gives us the ability to do linear algebra in infinite dimensions. \u00a0The very fact that infinity is involved should tell us that we will need analysis, and where ever there&#8217;s analysis, there&#8217;s also topology. \u00a0Oftentimes, interplay between analysis, algebra, and topology is not glimpsed at the undergraduate level; such connections are designated as &#8220;grad school material&#8221;. \u00a0Hilbert Space will offer us a chance to see these connections at work. Rather than give a host of definitions that define Hilbert Space and then give an example, it will perhaps be useful to work in the reverse order. \u00a0Consider the set of all complex-valued sequences. \u00a0An element of this set\u00a0might look like this: <img src='https:\/\/s0.wp.com\/latex.php?latex=%284%2B+i%2C+3+-+i%2C+1+-+7i%2C+5%2C+0%2C+5-9i%2C+2i%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(4+ i, 3 - i, 1 - 7i, 5, 0, 5-9i, 2i,\\ldots)' title='(4+ i, 3 - i, 1 - 7i, 5, 0, 5-9i, 2i,\\ldots)' class='latex' \/>. \u00a0We look at a special subset: \u00a0let <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> be the subset consisting of sequences that are square summable; that is, the sequences <img src='https:\/\/s0.wp.com\/latex.php?latex=%28x_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x_n)' title='(x_n)' class='latex' \/> satisfying<\/p>\n<p style=\"text-align: center;\"><img src='https:\/\/s0.wp.com\/latex.php?latex=%5Csum%5Climits_%7Bi%3D1%7D%5E%5Cinfty+%7B%5Cvert+x_%7Bi%7D+%5Cvert%7D%5E2+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\sum\\limits_{i=1}^\\infty {\\vert x_{i} \\vert}^2 &lt; \\infty' title='\\sum\\limits_{i=1}^\\infty {\\vert x_{i} \\vert}^2 &lt; \\infty' class='latex' \/>.<\/p>\n<p style=\"text-align: left;\">It shouldn&#8217;t be entirely clear why we are interested in sequences satisfying this seemingly arbitrary condition, but shortly we will see its importance. \u00a0Notice the\u00a0similarity between\u00a0the dot product\u00a0and the infinite sum on the left &#8211; the sum looks a lot like the dot product of a vector in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/> with itself. \u00a0The set <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is an example of Hilbert Space; it is just the natural extension of <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/>. \u00a0We will work a lot with <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>, but first let&#8217;s make sure we really understand this space. \u00a0We set out on defining Hilbert Space &#8211; a fairly tall order as we shall see!<\/p>\n<div id=\"attachment_551\" style=\"width: 254px\" class=\"wp-caption alignright\"><a href=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/hilbert.jpg\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-551\" class=\"size-medium wp-image-551\" src=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/hilbert-244x300.jpg\" alt=\"David Hilbert first introduced the concept of Hilbert Space\" width=\"244\" height=\"300\" srcset=\"https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/hilbert-244x300.jpg 244w, https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/hilbert.jpg 288w\" sizes=\"(max-width: 244px) 100vw, 244px\" \/><\/a><p id=\"caption-attachment-551\" class=\"wp-caption-text\">David Hilbert first introduced the concept of Hilbert Space<\/p><\/div>\n<p>This may sound intimidating; it shouldn&#8217;t be. A Hilbert Space is just a very special type of vector space. Recall from linear algebra that a (real or complex) vector space <img src='https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' \/>\u00a0is a set that is closed under addition and scalar multiplication (by real or complex numbers). We call a subset <img src='https:\/\/s0.wp.com\/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' \/> of <img src='https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' \/> a basis if <img src='https:\/\/s0.wp.com\/latex.php?latex=V+%3D+span%28B%29+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V = span(B) ' title='V = span(B) ' class='latex' \/> and if <img src='https:\/\/s0.wp.com\/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' \/> is linearly independent. In this case we define the dimension of <img src='https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' \/> by saying <img src='https:\/\/s0.wp.com\/latex.php?latex=dim%28V%29+%3D+%5Cvert+B+%5Cvert+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='dim(V) = \\vert B \\vert ' title='dim(V) = \\vert B \\vert ' class='latex' \/>. Notice that there is nothing about this definition which requires <img src='https:\/\/s0.wp.com\/latex.php?latex=B+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B ' title='B ' class='latex' \/> to be a finite set. Indeed, while finite dimensional vector spaces are the primary object of consideration in linear algebra, so-called infinite dimensional vector spaces are the central object in a subject called operator theory, and Hilbert Space is to operator theory what <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}^n' title='\\mathbb{R}^n' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/> are to linear algebra. We need a few preliminary definitions in order to define a Hilbert Space. We will work over <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}' title='\\mathbb{C}' class='latex' \/> (it is no more difficult to do so than to work over <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/>). We first define an inner product on a vector space <img src='https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' \/>. \u00a0An inner product is just a generalization of the dot product on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}^n' title='\\mathbb{R}^n' class='latex' \/> or <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/>. \u00a0Recall the importance of the dot product: it gives us a notion of length, angle, and orthogonality. \u00a0So an inner product on an arbitrary vector space is a way of giving the space some geometry. An inner product is denoted <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+%5Ccdot+%2C+%5Ccdot+%5Crangle&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle \\cdot , \\cdot \\rangle' title='\\langle \\cdot , \\cdot \\rangle' class='latex' \/>, and we replace the dots with vectors to indicate that we&#8217;re taking the inner product of those two vectors. \u00a0Of course, there is a\u00a0more rigorous, axiomatic definition. \u00a0For thoroughness, we state this definition, but it can be safely ignored without loss of understanding later on. \u00a0An inner product on a vector space <img src='https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' \/> is a function from <img src='https:\/\/s0.wp.com\/latex.php?latex=V+%5Ctimes+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V \\times V' title='V \\times V' class='latex' \/> to <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}' title='\\mathbb{C}' class='latex' \/> that satisfies the following four rules:<\/p>\n<ol>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+a+%2B+b%2C+c+%5Crangle+%3D+%5Clangle+a+%2C+c+%5Crangle+%2B+%5Clangle+b+%2C+c+%5Crangle+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle a + b, c \\rangle = \\langle a , c \\rangle + \\langle b , c \\rangle ' title='\\langle a + b, c \\rangle = \\langle a , c \\rangle + \\langle b , c \\rangle ' class='latex' \/> for every <img src='https:\/\/s0.wp.com\/latex.php?latex=a%2C+b%2C+c+%5Cin+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a, b, c \\in V' title='a, b, c \\in V' class='latex' \/>.<\/li>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+%5Clambda+a+%2C+b+%5Crangle+%3D+%5Clambda+%5Clangle+a+%2C+b+%5Crangle+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle \\lambda a , b \\rangle = \\lambda \\langle a , b \\rangle ' title='\\langle \\lambda a , b \\rangle = \\lambda \\langle a , b \\rangle ' class='latex' \/> for every <img src='https:\/\/s0.wp.com\/latex.php?latex=a%2C+b+%5Cin+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a, b \\in V' title='a, b \\in V' class='latex' \/>, <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clambda+%5Cin+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\lambda \\in \\mathbb{C}' title='\\lambda \\in \\mathbb{C}' class='latex' \/>.<\/li>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+a+%2C+b+%5Crangle+%3D+%5Coverline%7B%5Clangle+b+%2C+a+%5Crangle%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle a , b \\rangle = \\overline{\\langle b , a \\rangle}' title='\\langle a , b \\rangle = \\overline{\\langle b , a \\rangle}' class='latex' \/> for every <img src='https:\/\/s0.wp.com\/latex.php?latex=a%2C+b+%5Cin+V+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a, b \\in V ' title='a, b \\in V ' class='latex' \/>.<\/li>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+a+%2C+a+%5Crangle&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle a , a \\rangle' title='\\langle a , a \\rangle' class='latex' \/> is real and greater than <img src='https:\/\/s0.wp.com\/latex.php?latex=0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0' title='0' class='latex' \/> if <img src='https:\/\/s0.wp.com\/latex.php?latex=a+%5Cneq+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a \\neq 0' title='a \\neq 0' class='latex' \/>.<\/li>\n<\/ol>\n<p>Note that if we were working over <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/>, property (3) would just say that the inner product is symmetric. \u00a0We call a vector space with an associated inner product an inner product space. Recall that the definition of the dot product on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/> is <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Ccdot+y+%3D+%5Csum%5Climits_%7Bi%3Dl%7D%5En+x_%7Bi%7D%5Coverline%7By_%7Bi%7D%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\cdot y = \\sum\\limits_{i=l}^n x_{i}\\overline{y_{i}}' title='x \\cdot y = \\sum\\limits_{i=l}^n x_{i}\\overline{y_{i}}' class='latex' \/>, where <img src='https:\/\/s0.wp.com\/latex.php?latex=x_%7Bi%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_{i}' title='x_{i}' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=y_%7Bi%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='y_{i}' title='y_{i}' class='latex' \/> are the components of <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='y' title='y' class='latex' \/>, respectively. The dot product satisfies all the properties above, and so it is an inner product on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/>. \u00a0Once one has verified that the dot product on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/> is an inner product, it is not too hard to convince oneself\u00a0that the extension of the dot product to <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is an inner product as well. \u00a0We define an inner product on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> by<\/p>\n<p style=\"text-align: center;\"><img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+x+%2C+y+%5Crangle+%3D+%5Csum%5Climits_%7Bi%3D1%7D%5E%5Cinfty+x_i+%5Coverline%7By_i%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle x , y \\rangle = \\sum\\limits_{i=1}^\\infty x_i \\overline{y_i}' title='\\langle x , y \\rangle = \\sum\\limits_{i=1}^\\infty x_i \\overline{y_i}' class='latex' \/><\/p>\n<p>&nbsp;<\/p>\n<div id=\"attachment_553\" style=\"width: 200px\" class=\"wp-caption alignright\"><a href=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/la_r2vector_length.jpg\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-553\" class=\" wp-image-553\" src=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/la_r2vector_length-300x287.jpg\" alt=\"An example of a norm, just the usual distance function on the plane\" width=\"190\" height=\"182\" srcset=\"https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/la_r2vector_length-300x287.jpg 300w, https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/la_r2vector_length.jpg 670w\" sizes=\"(max-width: 190px) 100vw, 190px\" \/><\/a><p id=\"caption-attachment-553\" class=\"wp-caption-text\">An example of a norm, just the usual distance function on the plane<\/p><\/div>\n<p>The square summable condition we imposed on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> suddenly makes sense. \u00a0If we tried to compute the above inner product on sequences that are not square summable, we might end up with a divergent series on the right\u00a0side of the equation &#8211; and we don&#8217;t want that! We define the <em>norm<\/em> of an element <img src='https:\/\/s0.wp.com\/latex.php?latex=v&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='v' title='v' class='latex' \/> in an inner product space <img src='https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' \/> to be <img src='https:\/\/s0.wp.com\/latex.php?latex=%5CVert+v+%5CVert+%3D+%5Clangle+v+%2C+v+%5Crangle+%5E%5Cfrac%7B1%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\Vert v \\Vert = \\langle v , v \\rangle ^\\frac{1}{2}' title='\\Vert v \\Vert = \\langle v , v \\rangle ^\\frac{1}{2}' class='latex' \/>. We will denote the norm on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> by <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+%5Ccdot+%5CVert%7D_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert \\cdot \\Vert}_2' title='{\\Vert \\cdot \\Vert}_2' class='latex' \/>. \u00a0Notice that if one applies this definition to <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}^n' title='\\mathbb{R}^n' class='latex' \/>, the norm of a point is just its distance in the origin. \u00a0So we think of a norm as a function that assigns lengths to vectors in our vector space. \u00a0In general, a norm is any function <img src='https:\/\/s0.wp.com\/latex.php?latex=%5CVert+%5Ccdot+%5CVert%3A+V+%5Cto+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\Vert \\cdot \\Vert: V \\to \\mathbb{R}' title='\\Vert \\cdot \\Vert: V \\to \\mathbb{R}' class='latex' \/> that satisfies the following three axioms:<\/p>\n<ol>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=%5CVert+x+%5CVert+%5Cgeq+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\Vert x \\Vert \\geq 0' title='\\Vert x \\Vert \\geq 0' class='latex' \/> for all <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in V' title='x \\in V' class='latex' \/>, with equality if and only if <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x = 0' title='x = 0' class='latex' \/>.<\/li>\n<li style=\"text-align: left;\"><img src='https:\/\/s0.wp.com\/latex.php?latex=%5CVert+%5Clambda+x+%5CVert+%3D+%5Clambda+%5CVert+x+%5CVert&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\Vert \\lambda x \\Vert = \\lambda \\Vert x \\Vert' title='\\Vert \\lambda x \\Vert = \\lambda \\Vert x \\Vert' class='latex' \/> for all <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in V' title='x \\in V' class='latex' \/>, <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clambda+%5Cin+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\lambda \\in \\mathbb{C}' title='\\lambda \\in \\mathbb{C}' class='latex' \/>.<\/li>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=%5CVert+x+%2B+y+%5CVert+%5Cleq+%5CVert+x+%5CVert+%2B+%5CVert+y+%5CVert&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\Vert x + y \\Vert \\leq \\Vert x \\Vert + \\Vert y \\Vert' title='\\Vert x + y \\Vert \\leq \\Vert x \\Vert + \\Vert y \\Vert' class='latex' \/> for all <img src='https:\/\/s0.wp.com\/latex.php?latex=x%2Cy+%5Cin+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x,y \\in V' title='x,y \\in V' class='latex' \/>.<\/li>\n<\/ol>\n<p>One can verify that any inner product induces a norm. Although we defined the norm in terms of an inner product, we say that any function satisfying (1), (2), and (3) is a norm, whether or not it is given in terms of an inner product. So, any inner product defines a norm, but not every norm is given by an inner product. For example, it is impossible to define an inner product on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}^2' title='\\mathbb{R}^2' class='latex' \/> such that the induced norm is <img src='https:\/\/s0.wp.com\/latex.php?latex=%5CVert+%28x%2Cy%29+%5CVert+%3D+max%5C%7B+%5Cvert+x+%5Cvert+%2C+%5Cvert+y+%5Cvert+%5C%7D+&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\Vert (x,y) \\Vert = max\\{ \\vert x \\vert , \\vert y \\vert \\} ' title='\\Vert (x,y) \\Vert = max\\{ \\vert x \\vert , \\vert y \\vert \\} ' class='latex' \/>.<\/p>\n<div id=\"attachment_557\" style=\"width: 310px\" class=\"wp-caption alignleft\"><a href=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Completeness.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-557\" class=\"size-medium wp-image-557\" src=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Completeness-300x120.png\" alt=\"&lt;img src=&#039;https:\/\/s0.wp.com\/latex.php?latex=%5Cmathhbb%7BQ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0&#039; alt=&#039;\\mathhbb{Q}&#039; title=&#039;\\mathhbb{Q}&#039; class=&#039;latex&#039; \/&gt;\" width=\"300\" height=\"120\" srcset=\"https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Completeness-300x120.png 300w, https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Completeness-1024x409.png 1024w, https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Completeness.png 2000w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/a><p id=\"caption-attachment-557\" class=\"wp-caption-text\">Sequences of rational numbers can &#8221;converge&#8221; to irrational numbers, so the rationals are not complete<\/p><\/div>\n<p>We need one more definition before we can define a Hilbert Space. We need the concept of <em>completeness<\/em>. This is a fundamental property of the real numbers &#8211; completeness is what allows us to do real analysis. Essentially a space is complete if there are no &#8220;gaps&#8221; in it. For example, <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{Q}' title='\\mathbb{Q}' class='latex' \/> is not complete because the sequence <img src='https:\/\/s0.wp.com\/latex.php?latex=3%2C+3.1%2C+3.14%2C+3.141%2C+3.1415%2C+%5Cldots&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='3, 3.1, 3.14, 3.141, 3.1415, \\ldots' title='3, 3.1, 3.14, 3.141, 3.1415, \\ldots' class='latex' \/> should converge, but it doesn&#8217;t (in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{Q}' title='\\mathbb{Q}' class='latex' \/>). Such a gap does not exist in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/>, so we say the reals are complete. We are now in a position to define a Hilbert Space: a Hilbert Space is a complete vector space equipped with an inner product. A similar structure is a Banach Space, which is a complete vector space equipped with a norm. So any Hilbert Space is a Banach Space, but the converse is not true. We can immediately get our hands on some Hilbert Spaces: <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}^n' title='\\mathbb{R}^n' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{C}^n' title='\\mathbb{C}^n' class='latex' \/> are both finite-dimensional Hilbert Spaces. These are not particularly interesting Hilbert Spaces because they are finite-dimensional. But we are also ready\u00a0to consider an infinite-dimensional Hilbert Space. \u00a0As we stated before, <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is a Hilbert Space. \u00a0It is not difficult to show that <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is a vector space, and we&#8217;ve already defined an inner product on it. \u00a0Showing that <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is complete does take a bit of work, but it&#8217;s doable. \u00a0We can also readily see that <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> has no finite basis. \u00a0Indeed, an example of a basis for <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is the collection of sequences <img src='https:\/\/s0.wp.com\/latex.php?latex=e_%7Bi%7D+%3D+%280%2C+0%2C%5Cldots%2C+1%2C+0%2C+0%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='e_{i} = (0, 0,\\ldots, 1, 0, 0,\\ldots)' title='e_{i} = (0, 0,\\ldots, 1, 0, 0,\\ldots)' class='latex' \/> where the <img src='https:\/\/s0.wp.com\/latex.php?latex=1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='1' title='1' class='latex' \/> appears in the <img src='https:\/\/s0.wp.com\/latex.php?latex=i%5E%7Bth%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='i^{th}' title='i^{th}' class='latex' \/> entry. \u00a0Of course, there are many other examples of Hilbert Spaces, but a somewhat remarkable fact is that <em>every<\/em> Hilbert Space that has a countable (indexed by <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{N}' title='\\mathbb{N}' class='latex' \/>)\u00a0basis is isomorphic to <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>! For this reason, mathematicians sometimes refer to &#8220;the&#8221; Hilbert Space, as if there is only one. The upshot is that we can work exclusively in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> without sacrificing the generality obtained by referring to a general Hilbert Space.<\/p>\n<div id=\"attachment_563\" style=\"width: 207px\" class=\"wp-caption alignright\"><a href=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/rotate.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-563\" class=\" wp-image-563\" src=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/rotate.png\" alt=\"A rotation about the origin is a linear operator on the plane\" width=\"197\" height=\"197\" srcset=\"https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/rotate.png 222w, https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/rotate-150x150.png 150w\" sizes=\"(max-width: 197px) 100vw, 197px\" \/><\/a><p id=\"caption-attachment-563\" class=\"wp-caption-text\">A rotation about the origin is a linear operator on the plane<\/p><\/div>\n<p style=\"text-align: left;\">Since <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is a vector space, the natural thing to do is think about linear transformations of the space. \u00a0We define a <em>linear operator<\/em> on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> in the same way a linear transformation is defined in linear algebra. A function\u00a0<img src='https:\/\/s0.wp.com\/latex.php?latex=T%3A+%5Cell_2+%5Cto+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T: \\ell_2 \\to \\ell_2' title='T: \\ell_2 \\to \\ell_2' class='latex' \/> is a linear operator if<\/p>\n<p>&nbsp;<\/p>\n<ol>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=T%28x%2By%29+%3D+T%28x%29+%2B+T%28y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T(x+y) = T(x) + T(y)' title='T(x+y) = T(x) + T(y)' class='latex' \/>\u00a0for every\u00a0<img src='https:\/\/s0.wp.com\/latex.php?latex=x%2Cy+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x,y \\in \\ell_2' title='x,y \\in \\ell_2' class='latex' \/>.<\/li>\n<li><img src='https:\/\/s0.wp.com\/latex.php?latex=T%28%5Clambda+x%29+%3D+%5Clambda+T%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T(\\lambda x) = \\lambda T(x)' title='T(\\lambda x) = \\lambda T(x)' class='latex' \/> for every <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in \\ell_2' title='x \\in \\ell_2' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clambda+%5Cin+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\lambda \\in \\mathbb{C}' title='\\lambda \\in \\mathbb{C}' class='latex' \/>.<\/li>\n<\/ol>\n<p>It should be noted that not everything one may have learned about linear transformations in linear algebra is true for linear operators on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>. For example, consider the shift operators <img src='https:\/\/s0.wp.com\/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=S%5E%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S^*' title='S^*' class='latex' \/> on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> defined by <img src='https:\/\/s0.wp.com\/latex.php?latex=S%28x_1%2Cx_2%2Cx_3%2C%5Cldots%29+%3D+%280%2Cx_1%2Cx_2%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S(x_1,x_2,x_3,\\ldots) = (0,x_1,x_2,\\ldots)' title='S(x_1,x_2,x_3,\\ldots) = (0,x_1,x_2,\\ldots)' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=S%5E%2A%28x_1%2Cx_2%2Cx_3%2C%5Cldots%29+%3D+%28x_2%2C+x_3%2Cx_4%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S^*(x_1,x_2,x_3,\\ldots) = (x_2, x_3,x_4,\\ldots)' title='S^*(x_1,x_2,x_3,\\ldots) = (x_2, x_3,x_4,\\ldots)' class='latex' \/>. It is easily verified that these are both linear operators, and that <img src='https:\/\/s0.wp.com\/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' \/> is injective but not surjective, <img src='https:\/\/s0.wp.com\/latex.php?latex=S%5E%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S^*' title='S^*' class='latex' \/> is surjective but not injective, and <img src='https:\/\/s0.wp.com\/latex.php?latex=S%5E%2AS+%3D+I&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S^*S = I' title='S^*S = I' class='latex' \/> but <img src='https:\/\/s0.wp.com\/latex.php?latex=SS%5E%2A+%5Cneq+I&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='SS^* \\neq I' title='SS^* \\neq I' class='latex' \/>. In linear algebra, one learns that all of these conditions are equivalent, but in Hilbert Space this is not the case. \u00a0An important part of operator theory is determining what kinds of operators on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> behave like linear transformations on a finite-dimensional vector space.<\/p>\n<p>We call a linear operator <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> bounded if there is a constant <img src='https:\/\/s0.wp.com\/latex.php?latex=M&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='M' title='M' class='latex' \/> such that <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> is bounded on the unit ball <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BB%7D+%3D+%5C%7B+x+%5Cin+%5Cell_2+%3A+%7B%5CVert+x+%5CVert%7D_2+%5Cleq+1+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{B} = \\{ x \\in \\ell_2 : {\\Vert x \\Vert}_2 \\leq 1 \\}' title='\\mathbb{B} = \\{ x \\in \\ell_2 : {\\Vert x \\Vert}_2 \\leq 1 \\}' class='latex' \/> by <img src='https:\/\/s0.wp.com\/latex.php?latex=M&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='M' title='M' class='latex' \/>. The norm <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+T+%5CVert%7D_%7Bop%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert T \\Vert}_{op}' title='{\\Vert T \\Vert}_{op}' class='latex' \/> of a linear operator is defined to be the smallest such <img src='https:\/\/s0.wp.com\/latex.php?latex=M&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='M' title='M' class='latex' \/> that works in the preceding definition. Equivalently, <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+T+%5CVert%7D_%7Bop%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert T \\Vert}_{op}' title='{\\Vert T \\Vert}_{op}' class='latex' \/> is the largest value of <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+T%28x%29+%5CVert%7D_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert T(x) \\Vert}_2' title='{\\Vert T(x) \\Vert}_2' class='latex' \/>, where <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/> ranges over the unit ball in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>. An interesting fact about linear operators on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> is that they are continuous if and only if they are bounded (an exercise!). We define <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> to be the set of all bounded (continuous) linear operators on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>.<\/p>\n<p><img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> is an interesting space in and of itself: equipped with the norm defined in the preceding paragraph, <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> is a Banach Space (a complete normed vector space) with respect to pointwise addition and multiplication by complex scalars. We have seen a little bit of analysis and algebra, so it&#8217;s time to introduce some topology to the mix. Our goal is to define and understand some topologies on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/>. This should be a bit surprising. After all, what does it mean for a subset of linear operators to be &#8220;open&#8221;? There are many topologies that can be put this set, but we will consider the three most common ones: the norm topology, the strong operator topology, and the weak operator topology. In describing a topology on a space, it is difficult to pin down <em>exactly<\/em>\u00a0what the topology is; this is because in most interesting spaces, there are so many open sets that it&#8217;s impossible to list all of them. Instead we can define a topology by describing what properties our set has when equipped with this topology. For example, we might say that a topology on a set <img src='https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' \/> is &#8220;the smallest topology such that our space <img src='https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' \/> has property <img src='https:\/\/s0.wp.com\/latex.php?latex=X&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X' title='X' class='latex' \/>&#8220;. We can also define a topology in terms of a base which, roughly speaking, is a collection of open sets that generates the rest of the open sets (by taking unions). Before we embark on defining different topologies on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/>, let&#8217;s stop and think about why we may need different topologies on the same set, and whether it is of real importance. A question one may ask is, &#8220;What properties of <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> will change when the topology changes?&#8221; As we will see shortly, the definition of convergent sequence changes drastically. It may not seem obvious that changing the topology will have a big effect on convergence of sequences; after all, the definition of convergence that one meets in a real analysis course does not explicitly mention open sets! But let&#8217;s examine this a little closer. In real analysis, convergence is usually defined in regards to a metric. In more general topological spaces, there may be no metric (although in Hilbert Space the metric is induced by the norm), so the definition from real analysis may not be applicable. Nevertheless, we can define convergence in terms of open sets thusly (and this definition works in <em>every\u00a0<\/em>topological space, including metric spaces):<\/p>\n<div id=\"attachment_648\" style=\"width: 310px\" class=\"wp-caption aligncenter\"><a href=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Cauchy-Sequence.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-648\" class=\"size-medium wp-image-648\" src=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Cauchy-Sequence-300x224.png\" alt=\"Take an open interval about 1 on the vertical axis, eventually, all but finitely many points are in this interval\" width=\"300\" height=\"224\" srcset=\"https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Cauchy-Sequence-300x224.png 300w, https:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Cauchy-Sequence.png 506w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/a><p id=\"caption-attachment-648\" class=\"wp-caption-text\">Take an open interval about 1 on the vertical axis and eventually, all but finitely many points are in this interval<\/p><\/div>\n<p>Let <img src='https:\/\/s0.wp.com\/latex.php?latex=%28x_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x_n)' title='(x_n)' class='latex' \/> be a sequence in a topological space <img src='https:\/\/s0.wp.com\/latex.php?latex=X&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X' title='X' class='latex' \/>. \u00a0We say <img src='https:\/\/s0.wp.com\/latex.php?latex=x_n+%5Cto+x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_n \\to x' title='x_n \\to x' class='latex' \/> if for every open set <img src='https:\/\/s0.wp.com\/latex.php?latex=U+%5Csubset+X&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='U \\subset X' title='U \\subset X' class='latex' \/> containing <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/>, we have <img src='https:\/\/s0.wp.com\/latex.php?latex=x_n+%5Cin+U&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_n \\in U' title='x_n \\in U' class='latex' \/> for sufficiently large <img src='https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' \/>. It is clear, now, that convergence depends on the definition of open set. As we introduce new topologies on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/>, we can describe what convergence &#8220;means&#8221; with respect to this new topology.<\/p>\n<p style=\"text-align: right;\">The norm topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> is the topology induced by the operator norm. To explain what this means, let us consider that any normed space has a corresponding topology induced by its norm. Think about <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/> for example. The norm of a point in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/> is<\/p>\n<div id=\"attachment_654\" style=\"width: 294px\" class=\"wp-caption alignleft\"><a href=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Image5.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-654\" class=\" wp-image-654\" src=\"http:\/\/web.colby.edu\/thegeometricviewpoint\/files\/2014\/11\/Image5-300x72.png\" alt=\"The open set O(1.5, 1.5)\" width=\"284\" height=\"90\" \/><\/a><p id=\"caption-attachment-654\" class=\"wp-caption-text\">The open set O(1.5, 1.5)<\/p><\/div>\n<p style=\"text-align: right;\">just its absolute value. Think about the subsets of <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/> defined by <img src='https:\/\/s0.wp.com\/latex.php?latex=O%28x%2C%5Cepsilon%29+%3D+%5C%7B+y+%5Cin+%5Cmathbb%7BR%7D%5E2+%3A+%5Cvert+x+-+y+%5Cvert+%3C+%5Cepsilon+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='O(x,\\epsilon) = \\{ y \\in \\mathbb{R}^2 : \\vert x - y \\vert &lt; \\epsilon \\}' title='O(x,\\epsilon) = \\{ y \\in \\mathbb{R}^2 : \\vert x - y \\vert &lt; \\epsilon \\}' class='latex' \/>, where <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in \\mathbb{R}' title='x \\in \\mathbb{R}' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\epsilon' title='\\epsilon' class='latex' \/> is a positive real number. Each set is an open interval centered at <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/> and of radius <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\epsilon' title='\\epsilon' class='latex' \/>. The open sets in <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/> are open intervals and unions of open intervals, so the collection <img src='https:\/\/s0.wp.com\/latex.php?latex=%5C%7BO%28x%2C%5Cepsilon%29+%3A+x+%5Cin+%5Cmathbb%7BR%7D%2C+%5Cepsilon+%3E+0+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\{O(x,\\epsilon) : x \\in \\mathbb{R}, \\epsilon &gt; 0 \\}' title='\\{O(x,\\epsilon) : x \\in \\mathbb{R}, \\epsilon &gt; 0 \\}' class='latex' \/> is a base for the usual topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\mathbb{R}' title='\\mathbb{R}' class='latex' \/>. Now we return to our set <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/>, where the norm topology will be defined analogously. The collection of all subsets of <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> of the form <img src='https:\/\/s0.wp.com\/latex.php?latex=O%28T%2C+%5Cepsilon%29+%3D+%5C%7B+S+%5Cin+B%28%5Cell_2%29+%3A+%7B%5CVert+S+-+T+%5CVert%7D_%7Bop%7D+%3C+%5Cepsilon+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='O(T, \\epsilon) = \\{ S \\in B(\\ell_2) : {\\Vert S - T \\Vert}_{op} &lt; \\epsilon \\}' title='O(T, \\epsilon) = \\{ S \\in B(\\ell_2) : {\\Vert S - T \\Vert}_{op} &lt; \\epsilon \\}' class='latex' \/> is a base for the norm topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/>. \u00a0Remember that a norm is a way of defining length or distance in our space. \u00a0So the set <img src='https:\/\/s0.wp.com\/latex.php?latex=O%28T%2C+%5Cepsilon%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='O(T, \\epsilon)' title='O(T, \\epsilon)' class='latex' \/> is the set of all operators that have distance from <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> less than <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\epsilon' title='\\epsilon' class='latex' \/>. \u00a0It probably seems\u00a0odd think about the distance between two functions &#8211; this is why we need careful and precise definitions of norms and, in particular, the operator norm. \u00a0The norm topology is a very important topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28H%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(H)' title='B(H)' class='latex' \/> indeed &#8211; it is the topology which makes <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> a Banach Space.<\/p>\n<p>Before looking at any special properties of the norm topology, we introduce the next topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> because the interesting thing to do is to compare the different topologies. Next we consider the Strong Operator Topology (SOT). The SOT is defined to be the smallest topology containing all sets of the form <img src='https:\/\/s0.wp.com\/latex.php?latex=U%28T%2Cx%2C%5Cepsilon%29+%3D+%5C%7B+S+%5Cin+B%28%5Cell_2%29+%3A+%7B%5CVert+S%28x%29+-+T%28x%29+%5CVert%7D_2+%3C+%5Cepsilon+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='U(T,x,\\epsilon) = \\{ S \\in B(\\ell_2) : {\\Vert S(x) - T(x) \\Vert}_2 &lt; \\epsilon \\}' title='U(T,x,\\epsilon) = \\{ S \\in B(\\ell_2) : {\\Vert S(x) - T(x) \\Vert}_2 &lt; \\epsilon \\}' class='latex' \/> where <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> is any bounded linear operator, <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/> is any element of <img src='https:\/\/s0.wp.com\/latex.php?latex=H&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='H' title='H' class='latex' \/>, and <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\epsilon' title='\\epsilon' class='latex' \/> is any positive real number. Equivalently, SOT is the smallest topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> such that the evaluation maps <img src='https:\/\/s0.wp.com\/latex.php?latex=T+%5Cmapsto+T%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T \\mapsto T(x)' title='T \\mapsto T(x)' class='latex' \/> are continuous for every choice of <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in \\ell_2' title='x \\in \\ell_2' class='latex' \/>. A word of caution: The sets <img src='https:\/\/s0.wp.com\/latex.php?latex=U%28T%2Cx%2C%5Cepsilon%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='U(T,x,\\epsilon)' title='U(T,x,\\epsilon)' class='latex' \/> may seem very similar to the sets we defined in the previous paragraph, but they&#8217;re not. Notice that we use the <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/> norm here, and the operator norm in the preceding paragraph. It is important to keep track of which norm function is being used and what quantity is inside the norm &#8211; of course, it wouldn&#8217;t make sense to take the operator norm of the quantity <img src='https:\/\/s0.wp.com\/latex.php?latex=S%28x%29+-+T%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S(x) - T(x)' title='S(x) - T(x)' class='latex' \/>! We can describe some of the properties of the SOT. The SOT is (somewhat paradoxically) weaker than the norm topology; that is, there are more open sets in the norm topology than there are in the SOT. The SOT is perhaps a more natural choice of topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/>. To explain this, I first pose a question: what does it mean for a sequence of bounded linear operators <img src='https:\/\/s0.wp.com\/latex.php?latex=%28T_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(T_n)' title='(T_n)' class='latex' \/> to converge to an operator <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/>? Well, it depends on which topology you use! In the SOT, the sequence <img src='https:\/\/s0.wp.com\/latex.php?latex=%28T_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(T_n)' title='(T_n)' class='latex' \/> converges to <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> if for every <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in \\ell_2' title='x \\in \\ell_2' class='latex' \/>, the sequence <img src='https:\/\/s0.wp.com\/latex.php?latex=%28T_n%28x%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(T_n(x))' title='(T_n(x))' class='latex' \/> converges to <img src='https:\/\/s0.wp.com\/latex.php?latex=T%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T(x)' title='T(x)' class='latex' \/>. That is, convergence in SOT means that a sequence of operators converges pointwise to some operator. This indeed seems like a very natural definition of convergence. Contrast this with convergence in the norm topology: the sequence <img src='https:\/\/s0.wp.com\/latex.php?latex=%28T_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(T_n)' title='(T_n)' class='latex' \/> converges to <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> in the norm topology if <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+T+-+T_n+%5CVert%7D_%7Bop%7D+%5Cto+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert T - T_n \\Vert}_{op} \\to 0' title='{\\Vert T - T_n \\Vert}_{op} \\to 0' class='latex' \/>. \u00a0In a way, this definition of convergence seems more complicated and less natural than convergence in SOT. \u00a0This already is an advantage of using SOT instead of the norm topology. We mentioned that SOT is weaker than the norm topology. It isn&#8217;t too difficult to show that convergence in the norm topology implies convergence in SOT (for the reader who wants a challenge: assume <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+T_n+-+T+%5CVert%7D_%7Bop%7D+%5Cto+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert T_n - T \\Vert}_{op} \\to 0' title='{\\Vert T_n - T \\Vert}_{op} \\to 0' class='latex' \/>. Pick <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \\in \\ell_2' title='x \\in \\ell_2' class='latex' \/> and show <img src='https:\/\/s0.wp.com\/latex.php?latex=T_n%28x%29+%5Cto+T%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T_n(x) \\to T(x)' title='T_n(x) \\to T(x)' class='latex' \/>). Using the given definitions of convergence in each topology, we can show that the converse is not true. Consider the following sequence of operators <img src='https:\/\/s0.wp.com\/latex.php?latex=%28P_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(P_n)' title='(P_n)' class='latex' \/> on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>:<\/p>\n<p style=\"text-align: center;\"><img src='https:\/\/s0.wp.com\/latex.php?latex=P_n%28x%29+%3D+%5Csum%5Climits_%7Bi%3D1%7D%5En+%5Clangle+x+%2C+e_i+%5Crangle+x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n(x) = \\sum\\limits_{i=1}^n \\langle x , e_i \\rangle x' title='P_n(x) = \\sum\\limits_{i=1}^n \\langle x , e_i \\rangle x' class='latex' \/>,<\/p>\n<p>where <img src='https:\/\/s0.wp.com\/latex.php?latex=%5C%7Be_i%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\{e_i\\}' title='\\{e_i\\}' class='latex' \/> is the basis we defined earlier. The operators <img src='https:\/\/s0.wp.com\/latex.php?latex=P_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n' title='P_n' class='latex' \/> are called projections, because they take an input <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/> and project <img src='https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x' title='x' class='latex' \/> onto the linear span of the first <img src='https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' \/> basis vectors. It is not hard to see that as <img src='https:\/\/s0.wp.com\/latex.php?latex=n+%5Cto+%5Cinfty&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n \\to \\infty' title='n \\to \\infty' class='latex' \/>, we have <img src='https:\/\/s0.wp.com\/latex.php?latex=P_n%28x%29+%5Cto+x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n(x) \\to x' title='P_n(x) \\to x' class='latex' \/>, i.e. <img src='https:\/\/s0.wp.com\/latex.php?latex=P_n+%5Cto+I&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n \\to I' title='P_n \\to I' class='latex' \/> in SOT (<img src='https:\/\/s0.wp.com\/latex.php?latex=I&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I' title='I' class='latex' \/> is the identity operator). However, the claim is that <img src='https:\/\/s0.wp.com\/latex.php?latex=P_n+%5Cnrightarrow+I&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n \\nrightarrow I' title='P_n \\nrightarrow I' class='latex' \/> in the norm topology. \u00a0We will just sketch a proof here. \u00a0Let <img src='https:\/\/s0.wp.com\/latex.php?latex=m%2Cn+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m,n \\in \\mathbb{N}' title='m,n \\in \\mathbb{N}' class='latex' \/> with <img src='https:\/\/s0.wp.com\/latex.php?latex=m+%3E+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m &gt; n' title='m &gt; n' class='latex' \/>. \u00a0Then find a lower bound on\u00a0<img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%5CVert+P_m+-+P_n+%5CVert%7D_%7Bop%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\\Vert P_m - P_n \\Vert}_{op}' title='{\\Vert P_m - P_n \\Vert}_{op}' class='latex' \/> (a bound of 1 is easy to obtain by picking the unit vector that has a <img src='https:\/\/s0.wp.com\/latex.php?latex=1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='1' title='1' class='latex' \/> in the <img src='https:\/\/s0.wp.com\/latex.php?latex=m%5E%7Bth%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m^{th}' title='m^{th}' class='latex' \/> entry and else all zeroes). \u00a0What this tells us is that every element of the sequence is at least distance 1 from every other element of the sequence, and clearly no sequence\u00a0with this property can converge.<\/p>\n<p>The third and final topology we introduce on the space <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> is the Weak Operator Topology (WOT). The WOT is the smallest topology on <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> containing the following sets <img src='https:\/\/s0.wp.com\/latex.php?latex=U%28T%2Cx%2Cy%2C%5Cepsilon%29+%3D+%5C%7B+S+%5Cin+B%28%5Cell_2%29+%3A+%5Cvert+%5Clangle+T%28x%29+-+S%28x%29+%2C+y+%5Crangle+%5Cvert+%3C+%5Cepsilon+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='U(T,x,y,\\epsilon) = \\{ S \\in B(\\ell_2) : \\vert \\langle T(x) - S(x) , y \\rangle \\vert &lt; \\epsilon \\}' title='U(T,x,y,\\epsilon) = \\{ S \\in B(\\ell_2) : \\vert \\langle T(x) - S(x) , y \\rangle \\vert &lt; \\epsilon \\}' class='latex' \/>, where <img src='https:\/\/s0.wp.com\/latex.php?latex=T+%5Cin+B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T \\in B(\\ell_2)' title='T \\in B(\\ell_2)' class='latex' \/>, <img src='https:\/\/s0.wp.com\/latex.php?latex=x%2C+y+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x, y \\in \\ell_2' title='x, y \\in \\ell_2' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\epsilon' title='\\epsilon' class='latex' \/> is a positive real number. Equivalently, the WOT is the smallest topology such that the map (called a <a href=\"http:\/\/en.wikipedia.org\/wiki\/Linear_form\">linear functional<\/a>) <img src='https:\/\/s0.wp.com\/latex.php?latex=T+%5Cmapsto+%5Clangle+T%28x%29+%2C+y+%5Crangle&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T \\mapsto \\langle T(x) , y \\rangle' title='T \\mapsto \\langle T(x) , y \\rangle' class='latex' \/> is continuous for any choice of <img src='https:\/\/s0.wp.com\/latex.php?latex=x%2C+y+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x, y \\in \\ell_2' title='x, y \\in \\ell_2' class='latex' \/>. \u00a0So a sequence of operators <img src='https:\/\/s0.wp.com\/latex.php?latex=%28T_n%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(T_n)' title='(T_n)' class='latex' \/> converges to an operator <img src='https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' \/> if <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Clangle+T_n%28x%29+%2C+y+%5Crangle+%5Cto+%5Clangle+T%28x%29+%2C+y+%5Crangle&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\langle T_n(x) , y \\rangle \\to \\langle T(x) , y \\rangle' title='\\langle T_n(x) , y \\rangle \\to \\langle T(x) , y \\rangle' class='latex' \/> for every choice of <img src='https:\/\/s0.wp.com\/latex.php?latex=x%2C+y+%5Cin+%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x, y \\in \\ell_2' title='x, y \\in \\ell_2' class='latex' \/>. \u00a0 In order for the names given to these topologies to make sense, we had better hope WOT is weaker than SOT. Alas, this is indeed the case. Again, it is not hard to prove that SOT convergence implies WOT convergence (the only part that may be difficult is to show that an inner product is continuous). Again we can show the converse does not hold. Recall the definition of the shift operator <img src='https:\/\/s0.wp.com\/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' \/> on <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Cell_2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\ell_2' title='\\ell_2' class='latex' \/>. Define <img src='https:\/\/s0.wp.com\/latex.php?latex=S_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S_n' title='S_n' class='latex' \/> by composing <img src='https:\/\/s0.wp.com\/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' \/> <img src='https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' \/> times. That is, <img src='https:\/\/s0.wp.com\/latex.php?latex=S_n%28x_1%2C+x_2%2C+x_3%2C%5Cldots%29+%3D+%280%2C+0%2C%5Cldots%2Cx_1%2C+x_2%2C+x_3%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S_n(x_1, x_2, x_3,\\ldots) = (0, 0,\\ldots,x_1, x_2, x_3,\\ldots)' title='S_n(x_1, x_2, x_3,\\ldots) = (0, 0,\\ldots,x_1, x_2, x_3,\\ldots)' class='latex' \/> where the sequence on the right starts with <img src='https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' \/> zeroes. First we can show that <img src='https:\/\/s0.wp.com\/latex.php?latex=S_n+%5Cnrightarrow+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S_n \\nrightarrow 0' title='S_n \\nrightarrow 0' class='latex' \/> in SOT. Consider <img src='https:\/\/s0.wp.com\/latex.php?latex=x+%3D+%281%2C0%2C0%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x = (1,0,0,\\ldots)' title='x = (1,0,0,\\ldots)' class='latex' \/>. Then the sequence <img src='https:\/\/s0.wp.com\/latex.php?latex=%28S_n%28x%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(S_n(x))' title='(S_n(x))' class='latex' \/> does not converge to the <img src='https:\/\/s0.wp.com\/latex.php?latex=0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0' title='0' class='latex' \/> sequence. To see this, take any <img src='https:\/\/s0.wp.com\/latex.php?latex=m%2Cn+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m,n \\in \\mathbb{N}' title='m,n \\in \\mathbb{N}' class='latex' \/> with <img src='https:\/\/s0.wp.com\/latex.php?latex=m+%5Cneq+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m \\neq n' title='m \\neq n' class='latex' \/>. Then <img src='https:\/\/s0.wp.com\/latex.php?latex=S_m%28x%29+-+S_n%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S_m(x) - S_n(x)' title='S_m(x) - S_n(x)' class='latex' \/> is a sequence with <img src='https:\/\/s0.wp.com\/latex.php?latex=1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='1' title='1' class='latex' \/> in the <img src='https:\/\/s0.wp.com\/latex.php?latex=m%5E%7Bth%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m^{th}' title='m^{th}' class='latex' \/> entry and <img src='https:\/\/s0.wp.com\/latex.php?latex=-1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='-1' title='-1' class='latex' \/> in the <img src='https:\/\/s0.wp.com\/latex.php?latex=n%5E%7Bth%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n^{th}' title='n^{th}' class='latex' \/> entry, hence we have <img src='https:\/\/s0.wp.com\/latex.php?latex=%7B%7B%5CVert+S_n%28x%29+-+S_m%28x%29+%5CVert%7D%5E2_%7B2%7D%7D+%3D+2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{{\\Vert S_n(x) - S_m(x) \\Vert}^2_{2}} = 2' title='{{\\Vert S_n(x) - S_m(x) \\Vert}^2_{2}} = 2' class='latex' \/>. Since this is true for any choice of <img src='https:\/\/s0.wp.com\/latex.php?latex=m&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='m' title='m' class='latex' \/> and <img src='https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' \/>, the distance between any two distinct points in the sequence <img src='https:\/\/s0.wp.com\/latex.php?latex=%28S_n%28x%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(S_n(x))' title='(S_n(x))' class='latex' \/> is <img src='https:\/\/s0.wp.com\/latex.php?latex=%5Csqrt%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\\sqrt{2}' title='\\sqrt{2}' class='latex' \/>. \u00a0So the sequence does not converge to any limit, including <img src='https:\/\/s0.wp.com\/latex.php?latex=0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0' title='0' class='latex' \/>. It is harder (but not too difficult) to show that <img src='https:\/\/s0.wp.com\/latex.php?latex=S_n+%5Cto0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S_n \\to0' title='S_n \\to0' class='latex' \/> in WOT. The reader who wishes to provide a proof of this statement may\u00a0want to read about linear functionals and the <a href=\"http:\/\/en.wikipedia.org\/wiki\/Riesz_representation_theorem\">Riesz Representation Theorem<\/a>.<\/p>\n<p>&nbsp;<\/p>\n<p>Of course, there is much more to say about Hilbert Space (and even about <img src='https:\/\/s0.wp.com\/latex.php?latex=B%28%5Cell_2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B(\\ell_2)' title='B(\\ell_2)' class='latex' \/> than I could fit into this post. \u00a0Hilbert Space could easily be the sole focus of a semester- or even year-long course. \u00a0In his <i>Mathematics: a Very Short Introduction, <\/i>mathematician Timothy Gowers wrote, &#8220;The notion of a Hilbert Space sheds light on so much of modern mathematics, from number theory to quantum mechanics, that if you do not know at least the rudiments of Hilbert Space theory then you cannot claim to be a well-educated mathematician.&#8221; \u00a0Hopefully the reader leaves with an appreciation for the fact that Hilbert Space is a (relatively) easy space to understand and that algebra, analysis, and topology are all lurking around in Hilbert Space.<\/p>\n<p><em>The author Dan Medici was a student in Scott Taylor&#8217;s Fall 2014 Topology class at Colby College.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"<p>For the student wishing to see interplay between the three major branches of mathematics (analysis, algebra, topology), Hilbert Space is a great place to explore! \u00a0Hilbert Space\u00a0is a tool that gives us the ability to do linear algebra in infinite dimensions. \u00a0The very fact that infinity is involved should tell us that we will need [&hellip;]<\/p>\n","protected":false},"author":4925,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ngg_post_thumbnail":0,"footnotes":""},"categories":[1],"tags":[],"_links":{"self":[{"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/posts\/511"}],"collection":[{"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/users\/4925"}],"replies":[{"embeddable":true,"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/comments?post=511"}],"version-history":[{"count":82,"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/posts\/511\/revisions"}],"predecessor-version":[{"id":791,"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/posts\/511\/revisions\/791"}],"wp:attachment":[{"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/media?parent=511"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/categories?post=511"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/web.colby.edu\/thegeometricviewpoint\/wp-json\/wp\/v2\/tags?post=511"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}