In the mathematical discipline of functional analysis, the concept of a compact operator on Hilbert space is an extension of the concept of a matrix acting on a finite-dimensional vector space; in Hilbert space, compact operators are precisely the closure of finite-rank operators (representable by finite-dimensional matrices) in the topology induced by the operator norm. As such, results from matrix theory can sometimes be extended to compact operators using similar arguments. By contrast, the study of general operators on infinite-dimensional spaces often requires a genuinely different approach. For example, the spectral theory of compact operators on Banach spaces takes a form that is very similar to the Jordan canonical form of matrices. In the context of Hilbert spaces, a square matrix is unitarily diagonalizable if and only if it is normal. A corresponding result holds for normal compact operators on Hilbert spaces. More generally, the compactness assumption can be dropped. As stated above, the techniques used to prove results, e.g., the spectral theorem, in the non-compact case are typically different, involving operator-valued measures on the spectrum. Some results for compact operators on Hilbert space will be discussed, starting with general properties before considering subclasses of compact operators. Let be a Hilbert space and be the set of bounded operators on . Then, an operator is said to be a compact operator if the image of each bounded set under is relatively compact. We list in this section some general properties of compact operators. If X and Y are separable Hilbert spaces (in fact, X Banach and Y normed will suffice), then T : X → Y is compact if and only if it is sequentially continuous when viewed as a map from X with the weak topology to Y (with the norm topology). (See , and note in this reference that the uniform boundedness will apply in the situation where F ⊆ X satisfies (∀φ ∈ Hom(X, K)) sup{x**(φ) = φ(x) : x} < ∞, where K is the underlying field.

À 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.