Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Invariant subspace problem (Hilbert space)

Open
InvariantSubspaceProblem.invariant_subspace_problem

by Lucas · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysisoperator-theory

Invariant subspace problem. Let HHH be an infinite-dimensional, separable, complex Hilbert space and let T ⁣:H→HT\colon H\to HT:H→H be a bounded linear operator. Then there is a closed linear subspace S⊆HS\subseteq HS⊆H such that

{0}≠S≠HandT(S)⊆S.\{0\}\neq S\neq H \qquad\text{and}\qquad T(S)\subseteq S .{0}=S=HandT(S)⊆S.

The source asks this as a yes/no question ("Does every bounded linear operator on an infinite-dimensional separable Hilbert space have a non-trivial closed invariant subspace?"); this item states the affirmative answer. A proof of the statement or a proof of its negation both settle the problem. It is one of the most famous open problems in functional analysis.

Formalization Note Complex scalars are used, as is standard for this problem. Separability is assumed because on non-separable spaces the answer is easily positive; infinite dimension is assumed because the finite-dimensional case is elementary. The zero operator is not excluded (it trivially satisfies the conclusion).

Preamble
import Definitions.Def_InvariantSubspaceProblem_Defs
Formal statement
namespace InvariantSubspaceProblem

theorem invariant_subspace_problem (H : Type*) [NormedAddCommGroup H] [InnerProductSpace ℂ H]
    [CompleteSpace H] [TopologicalSpace.SeparableSpace H] (hinf : ¬ FiniteDimensional ℂ H)
    (T : H →L[ℂ] H) : HasNontrivialClosedInvariantSubspace T := by sorry

end InvariantSubspaceProblem
Source
Open Problem Garden, 'Invariant subspace problem' (posted by tchow, 9 Feb 2009), http://www.openproblemgarden.org/op/invariant_subspace_problem (problem statement).
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me