LinearPMap.IsClosable.isClosed_iff
theoremverifiedformalizationimported Lean
LinearPMap.IsClosable.isClosed_iff
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in open Submodule in open InnerProductSpace in open Complex ComplexConjugate in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {H' : Type*} [NormedAddCommGroup H'] [InnerProductSpace ℂ H'] {H'' : Type*} [NormedAddCommGroup H''] [InnerProductSpace ℂ H''] {α : Type*} [Fintype α] {T T₁ T₂ : H →ₗ.[ℂ] H} {S : α → H →ₗ.[ℂ] H} {U U₁ U₂ : H →ₗ.[ℂ] H'} {W : α → H →ₗ.[ℂ] H'} {V V₁ V₂ : H' →ₗ.[ℂ] H''} in lemma LinearPMap.IsClosable.isClosed_iff (h : U.IsClosable) : U.IsClosed ↔ U.closure = U
- Formalizes
- Physlib, `LinearPMap.IsClosable.isClosed_iff`
- Lean proof
- By Adam Bornemann, Gregory J. Loges, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Gregory J. Loges. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.LinearPMap.IsClosable.isClosed_iff← LinearPMap.IsClosable.isClosed_iff (Physlib/QuantumMechanics/Operators/Unbounded.lean:230): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- LinearPMap.IsClosed.closure_eqLinearPMap.IsClosed.closure_eq
- Used by 3
- LinearPMap.IsClosed.add_continuousClosedness is preserved upon adding a continuous operator.
- LinearPMap.IsUnbounded.isClosed_iffLinearPMap.IsUnbounded.isClosed_iff
- LinearPMap.isClosed_iff_isClosed_domain_of_continuousA continuous operator is closed iff its domain is closed.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in open Submodule in open InnerProductSpace in open Complex ComplexConjugate in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {H' : Type*} [NormedAddCommGroup H'] [InnerProductSpace ℂ H'] {H'' : Type*} [NormedAddCommGroup H''] [InnerProductSpace ℂ H''] {α : Type*} [Fintype α] {T T₁ T₂ : H →ₗ.[ℂ] H} {S : α → H →ₗ.[ℂ] H} {U U₁ U₂ : H →ₗ.[ℂ] H'} {W : α → H →ₗ.[ℂ] H'} {V V₁ V₂ : H' →ₗ.[ℂ] H''} in lemma LinearPMap.IsClosable.isClosed_iff (h : U.IsClosable) : U.IsClosed ↔ U.closure = U := ⟨IsClosed.closure_eq, fun h' ↦ h' ▸ h.closure_isClosed⟩