Wikipedia·wikipedia:InvariantSubspaceProblem
Invariant Subspace Problem
Machine-checked by Palomar.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
AI activity
How grades workNo AI contribution recorded against this statement.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at e8f632e2: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
2As each project's formalization.yaml states it.
fc-isp-normal
- authors
- Zayn Blore
- method
- agent — Claude Opus 5.5
- review
- author-verified (Zayn Blore)
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 1 main results named, with an alignment table
- sources
- Invariant subspace problem — formalizes, authors n/a
- related
- google-deepmind/formal-conjectures/blob/40a8592cb6f7e96cb9a8275d96bb3e013feeb1dc/FormalConjectures/Wikipedia/InvariantSubspaceProblem.lean — builds-on
- divergences
- None in the statement, which is Formal Conjectures' own. The argument is the standard one that Formal Conjectures' docstring sketches. A normal operator whose spectrum is a single point is a multiple of the identity. Otherwise, continuous bump functions at two spectral points give a nonzero operator f(T) commuting with T whose kernel is nonzero. Both steps use Mathlib's continuous functional calculus, including its spectral mapping theorem, in place of the projection-valued spectral measure.
- checked by
- nobody independent of its authors yet
Read's theorem: a bounded operator on l1 with no nontrivial closed invariant subspace
- authors
- Zayn Blore
- method
- agent — Claude Opus 5.5
- review
- self-assessed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 2 main results named, with an alignment table
- sources
- An explicit example concerning the invariant subspace problem for Banach spaces — formalizes, authors not-contacted; A solution to the invariant subspace problem on the space l1 — background, authors n/a
- related
- google-deepmind/formal-conjectures/blob/40a8592cb6f7e96cb9a8275d96bb3e013feeb1dc/FormalConjectures/Wikipedia/InvariantSubspaceProblem.lean — builds-on
- divergences
- None in the statement, which is Formal Conjectures' text with its attributes removed, under Formal Conjectures' name. Challenge imports Mathlib rather than FormalConjecturesUtil and builds with Lean v4.35.0-rc3 rather than Formal Conjectures' v4.33.1, so the check against Formal Conjectures compares text, not elaborated terms. The proof follows Śliwa's paper lemma by lemma, with α fixed at 8, exact constants where the paper rounds, the bound on the polynomial Qₘe obtained through the basis rather than through Śliwa's √Aₘ · √Aₘ, and one concrete growth sequence (each term after the first a power 8^{2s}). Theorem 7 is proved from the inequalities its proof uses (GrowthHyp, Theorem7Hyp), not from Śliwa's growth condition dₙ₊₁ ≥ α^{(n dₙ)!}; the concrete sequence satisfies those inequalities but not Śliwa's condition at every step.
- checked by
- Palomar
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Cited proofs · 3
- baobingzhang/jsp-000024-lomonosov-lean/blob/8b43adc9781d70deb3d23bcdf38ec6195683669b/InvariantSubspaceLomonosov.lean#L422-L424
- zblore/fc-isp-normal/blob/399f8bd8b68d4e24f33a6077e01a4adf3ae51df6/ISPNormal/Normal.lean#L143-L144
- zblore/fc-read-l1/blob/57ceaa0ecdea86e90d82c1fd241c17e3bdb93e2d/ReadL1/Main.lean#L24-L27
Also known as · 2
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/InvariantSubspaceProblem.lean
- FormalConjectures/Wikipedia/InvariantSubspaceProblem.lean
Cite this record
qed.bot, “Invariant Subspace Problem”, https://qed.bot/s/wikipedia-invariantsubspaceproblem, as of 20 Nov 2026.