Skip to the passage panel
WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Operator theory

45 passages18 formalized16 partial11 not formalized

Statement only

More ways to filter
Library
Passages
About this page

This page

  • Wikipedia revision 1329640449, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • 45 passages checked, 68 Lean locations (and 31 related declarations).

Central statements: 11 of the 45 passages state the article's subject or a named result or definition; the other 34 are supporting (examples, setup). Of these 11: 5 formalized, 6 partial.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1a (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 f1e67e43a41f537cd8e4cdcbdbaba86bd4ed58f1277aef79f9e34fb275f3edcc.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1a, run by jack, 31 Oct 2026, 02:50–04:48 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location on a central or subject passage (25 locations); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 20 of 43 locations and 5 of 11 absences. In all, 45 of 68 Lean locations (66%) and 5 of 11 absences (45%) were re-checked.
  • Passage text: 45 of 45 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1329640449 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Select a highlighted passage to see where Lean formalizes it.

In mathematics, operator theory is the study of linear operators on function spaces, beginning with differential operators and integral operators. The operators may be presented abstractly by their characteristics, such as bounded linear operators or closed operators, and consideration may be given to nonlinear operators. The study, which depends heavily on the topology of function spaces, is a branch of functional analysis.

If a collection of operators forms an algebra over a field, then it is an operator algebra. The description of operator algebras is part of operator theory.

Single operator theory

Single operator theory deals with the properties and classification of operators, considered one at a time. For example, the classification of normal operators in terms of their spectra falls into this category.

Spectrum of operators

The spectral theorem is any of a number of results about linear operators or about matrices.[1] In broad terms the spectral theorem provides conditions under which an operator or a matrix can be diagonalized (that is, represented as a diagonal matrix in some basis). This concept of diagonalization is relatively straightforward for operators on finite-dimensional spaces, but requires some modification for operators on infinite-dimensional spaces. In general, the spectral theorem identifies a class of linear operators that can be modelled by multiplication operators, which are as simple as one can hope to find. In more abstract language, the spectral theorem is a statement about commutative C*-algebras. See also spectral theory for a historical perspective.

Examples of operators to which the spectral theorem applies are self-adjoint operators or more generally normal operators on Hilbert spaces.

The spectral theorem also provides a canonical decomposition, called the spectral decomposition, eigenvalue decomposition, or eigendecomposition, of the underlying vector space on which the operator acts.

Normal operators

A normal operator on a complex Hilbert space H {\displaystyle H} is a continuous linear operator N : H → H {\displaystyle N\colon H\rightarrow H} that commutes with its hermitian adjoint N ∗ {\displaystyle N^{\ast }} , that is: N N ∗ = N ∗ N {\displaystyle NN^{\ast }=N^{\ast }N} .[2]

Normal operators are important because the spectral theorem holds for them. Today, the class of normal operators is well understood. Examples of normal operators are

  • unitary operators: U ∗ = U − 1 {\displaystyle U^{\ast }=U^{-1}}
  • Hermitian operators (i.e., selfadjoint operators): N ∗ = N {\displaystyle N^{\ast }=N} ; (also, anti-selfadjoint operators: N ∗ = − N {\displaystyle N^{\ast }=-N} )
  • positive operators: N = M ∗ M {\displaystyle N=M^{\ast }M} , where M {\displaystyle M} is any operator
  • normal matrices can be seen as normal operators if one takes the Hilbert space to be C n {\displaystyle \mathbb {C} ^{n}} .

The spectral theorem extends to a more general class of matrices. Let A {\displaystyle A} be an operator on a finite-dimensional inner product space. A {\displaystyle A} is said to be normal if A ∗ A = A A ∗ {\displaystyle A^{\ast }A=AA^{\ast }} . One can show that A {\displaystyle A} is normal if and only if it is unitarily diagonalizable: By the Schur decomposition, we have A = U T U ∗ {\displaystyle A=UTU^{\ast }} , where U {\displaystyle U} is unitary and T {\displaystyle T} upper triangular. Since A {\displaystyle A} is normal, T ∗ T = T T ∗ {\displaystyle T^{\ast }T=TT^{\ast }} . Therefore, T {\displaystyle T} must be diagonal since normal upper triangular matrices are diagonal. The converse is obvious.

In other words, A {\displaystyle A} is normal if and only if there exists a unitary matrix U {\displaystyle U} such that A = U D U ∗ {\displaystyle A=UDU^{*}} where D {\displaystyle D} is a diagonal matrix. Then, the entries of the diagonal of D {\displaystyle D} are the eigenvalues of A {\displaystyle A} . The column vectors of U {\displaystyle U} are the eigenvectors of A {\displaystyle A} and they are orthonormal. Unlike the Hermitian case, the entries of D {\displaystyle D} need not be real.

Polar decomposition

The polar decomposition of any bounded linear operator A between complex Hilbert spaces is a canonical factorization as the product of a partial isometry and a non-negative operator.[3]

The polar decomposition for matrices generalizes as follows: if A is a bounded linear operator then there is a unique factorization of A as a product A = UP where U is a partial isometry, P is a non-negative self-adjoint operator and the initial space of U is the closure of the range of P.

The operator U must be weakened to a partial isometry, rather than unitary, because of the following issues. If A is the one-sided shift on l2(N), then |A| = (A*A)1/2 = I. So if A = U |A|, U must be A, which is not unitary.

The existence of a polar decomposition is a consequence of Douglas' lemma:

Lemma—If A, B are bounded operators on a Hilbert space H, and A*A ≤ B*B, then there exists a contraction C such that A = CB. Furthermore, C is unique if Ker(B*) ⊂ Ker(C).

The operator C can be defined by C(Bh) = Ah, extended by continuity to the closure of Ran(B), and by zero on the orthogonal complement of Ran(B). The operator C is well-defined since A*A ≤ B*B implies Ker(B) ⊂ Ker(A). The lemma then follows.

In particular, if A*A = B*B, then C is a partial isometry, which is unique if Ker(B*) ⊂ Ker(C). In general, for any bounded operator A, A ∗ A = ( A ∗ A ) 1 2 ( A ∗ A ) 1 2 , {\displaystyle A^{*}A=(A^{*}A)^{\frac {1}{2}}(A^{*}A)^{\frac {1}{2}},} where (A*A)1/2 is the unique positive square root of A*A given by the usual functional calculus. So by the lemma, we have A = U ( A ∗ A ) 1 2 {\displaystyle A=U(A^{*}A)^{\frac {1}{2}}} for some partial isometry U, which is unique if Ker(A) ⊂ Ker(U). (Note Ker(A) = Ker(A*A) = Ker(B) = Ker(B*), where B = B* = (A*A)1/2.) Take P to be (A*A)1/2 and one obtains the polar decomposition A = UP. Notice that an analogous argument can be used to show A = P'U' , where P' is positive and U' a partial isometry.

When H is finite dimensional, U can be extended to a unitary operator; this is not true in general (see example above). Alternatively, the polar decomposition can be shown using the operator version of singular value decomposition.

By property of the continuous functional calculus, |A| is in the C*-algebra generated by A. A similar but weaker statement holds for the partial isometry: the polar part U is in the von Neumann algebra generated by A. If A is invertible, U will be in the C*-algebra generated by A as well.

Connection with complex analysis

Many operators that are studied are operators on Hilbert spaces of holomorphic functions, and the study of the operator is intimately linked to questions in function theory. For example, Beurling's theorem describes the invariant subspaces of the unilateral shift in terms of inner functions, which are bounded holomorphic functions on the unit disk with unimodular boundary values almost everywhere on the circle. Beurling interpreted the unilateral shift as multiplication by the independent variable on the Hardy space.[4] The success in studying multiplication operators, and more generally Toeplitz operators (which are multiplication, followed by projection onto the Hardy space) has inspired the study of similar questions on other spaces, such as the Bergman space.

Operator algebras

The theory of operator algebras brings algebras of operators such as C*-algebras to the fore.

C*-algebras

A C*-algebra, A, is a Banach algebra over the field of complex numbers, together with a map * : A → A. One writes x* for the image of an element x of A. The map * has the following properties:[5]

  • It is an involution, for every x in A x ∗ ∗ = ( x ∗ ) ∗ = x {\displaystyle x^{**}=(x^{*})^{*}=x}
  • For all x, y in A: ( x + y ) ∗ = x ∗ + y ∗ {\displaystyle (x+y)^{*}=x^{*}+y^{*}} ( x y ) ∗ = y ∗ x ∗ {\displaystyle (xy)^{*}=y^{*}x^{*}}
  • For every λ in C and every x in A: ( λ x ) ∗ = λ ¯ x ∗ . {\displaystyle (\lambda x)^{*}={\overline {\lambda }}x^{*}.}
  • For all x in A: ‖ x ∗ x ‖ = ‖ x ‖ ‖ x ∗ ‖ . {\displaystyle \|x^{*}x\|=\left\|x\right\|\left\|x^{*}\right\|.}

Remark. The first three identities say that A is a *-algebra. The last identity is called the C* identity and is equivalent to: ‖ x x ∗ ‖ = ‖ x ‖ 2 , {\displaystyle \|xx^{*}\|=\|x\|^{2},}

The C*-identity is a very strong requirement. For instance, together with the spectral radius formula, it implies that the C*-norm is uniquely determined by the algebraic structure: ‖ x ‖ 2 = ‖ x ∗ x ‖ = sup { | λ | : x ∗ x − λ 1  is not invertible } . {\displaystyle \|x\|^{2}=\|x^{*}x\|=\sup\{|\lambda |:x^{*}x-\lambda \,1{\text{ is not invertible}}\}.}

See also

References

  1. ^ Sunder, V.S. Functional Analysis: Spectral Theory (1997) Birkhäuser Verlag
  2. ^ Hoffman, Kenneth; Kunze, Ray (1971), Linear algebra (2nd ed.), Englewood Cliffs, N.J.: Prentice-Hall, Inc., p. 312, MR 0276251
  3. ^ Conway, John B. (2000), A Course in Operator Theory, Graduate Studies in Mathematics, American Mathematical Society, ISBN 0821820656
  4. ^ Nikolski, Nikolai (1986), A treatise on the shift operator, Springer-Verlag, ISBN 0-387-90176-0. A sophisticated treatment of the connections between Operator theory and Function theory in the Hardy space.
  5. ^ Arveson, William (1976), An Invitation to C*-Algebra, Springer-Verlag, ISBN 0-387-90176-0. An excellent introduction to the subject, accessible for those with a knowledge of basic functional analysis.

Further reading