In functional analysis, the weak operator topology, often abbreviated WOT, is the weakest topology on the set of bounded operators on a Hilbert space , such that the functional sending an operator to the complex number is continuous for any vectors and in the Hilbert space. Explicitly, for an operator there is base of neighborhoods of the following type: choose a finite number of vectors , continuous functionals , and positive real constants indexed by the same finite set . An operator lies in the neighborhood if and only if for all . Equivalently, a net of bounded operators converges to in WOT if for all and , the net converges to . The WOT is the weakest among all common topologies on , the bounded operators on a Hilbert space . The strong operator topology, or SOT, on is the topology of pointwise convergence. Because the inner product is a continuous function, the SOT is stronger than WOT. The following example shows that this inclusion is strict. Let and consider the sequence of unilateral shifts. An application of Cauchy-Schwarz shows that in WOT. But clearly does not converge to in SOT. The linear functionals on the set of bounded operators on a Hilbert space that are continuous in the strong operator topology are precisely those that are continuous in the WOT (actually, the WOT is the weakest operator topology that leaves continuous all strongly continuous linear functionals on the set of bounded operators on the Hilbert space H). Because of this fact, the closure of a convex set of operators in the WOT is the same as the closure of that set in the SOT. It follows from the polarization identity that a net converges to in SOT if and only if in WOT. The predual of B(H) is the trace class operators C1(H), and it generates the w*-topology on B(H), called the weak-star operator topology or σ-weak topology. The weak-operator and σ-weak topologies agree on norm-bounded sets in B(H). A net {Tα} ⊂ B(H) converges to T in WOT if and only Tr(TαF) converges to Tr(TF) for all finite-rank operator F.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.