LinearPMap.IsUnbounded
defimported Lean
A LinearPMap is an unbounded operator iff it has dense domain and is closable.
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 def LinearPMap.IsUnbounded (U : H →ₗ.[ℂ] H') : Prop
- Defined in
- Physlib, `LinearPMap.IsUnbounded`
- 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.IsUnbounded← LinearPMap.IsUnbounded (Physlib/QuantumMechanics/Operators/Unbounded.lean:127): verbatim
- Verified
- 10 Oct 2026
- Axioms
- none listed
- Built on 2
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - UnitaryOneParameterGroup.instCoeFunForallRealContinuousLinearMapComplexIdUnitaryOneParameterGroup.instCoeFunForallRealContinuousLinearMapComplexId
- LinearPMap.HasDenseDomainA LinearPMap
- Used by 23
- LinearPMap.IsUnbounded.orthogonal_adjoint_range
U†.rangeᗮ = U.closure.ker - LinearPMap.IsUnbounded.isClosableLinearPMap.IsUnbounded.isClosable
- LinearPMap.isUnbounded_of_dense_of_isSymmetric'Variant of
of_dense_of_isSymmetricfor an endomorphism satisfyingLinearMap.IsSymmetric. - QuantumMechanics.QuantumSystem.mkESACreate a quantum system from a Hamiltonian operator which is merely essentially self-adjoint by taking its closure.
- LinearPMap.IsUnbounded.hasDenseDomainLinearPMap.IsUnbounded.hasDenseDomain
- LinearPMap.isUnbounded_defLinearPMap.isUnbounded_def
- LinearPMap.IsEssentiallySelfAdjoint.unique_self_adjoint_extensionThe closure is the unique self-adjoint extension of an essentially self-adjoint operator.
- LinearPMap.IsSelfAdjoint.isUnboundedLinearPMap.IsSelfAdjoint.isUnbounded
- LinearPMap.IsUnbounded.adjointLinearPMap.IsUnbounded.adjoint
- LinearPMap.IsSymmetric.isUnbounded_iff_hasDenseDomainLinearPMap.IsSymmetric.isUnbounded_iff_hasDenseDomain
- LinearPMap.IsEssentiallySelfAdjointA LinearPMap is essentially self-adjoint iff its closure is self-adjoint.
- LinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iffLinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iff
- LinearPMap.IsUnbounded.isClosed_iffLinearPMap.IsUnbounded.isClosed_iff
- LinearPMap.IsUnbounded.adjoint_closure_eq_adjointLinearPMap.IsUnbounded.adjoint_closure_eq_adjoint
- LinearPMap.IsUnbounded.le_adjoint_adjointLinearPMap.IsUnbounded.le_adjoint_adjoint
- LinearPMap.IsUnbounded.adjoint_adjoint_eq_closureLinearPMap.IsUnbounded.adjoint_adjoint_eq_closure
- LinearPMap.IsEssentiallySelfAdjoint.isUnboundedLinearPMap.IsEssentiallySelfAdjoint.isUnbounded
- LinearPMap.IsEssentiallySelfAdjoint.hasDenseDomainLinearPMap.IsEssentiallySelfAdjoint.hasDenseDomain
- LinearPMap.IsUnbounded.closureLinearPMap.IsUnbounded.closure
- LinearPMap.IsEssentiallySelfAdjoint.isSymmetricLinearPMap.IsEssentiallySelfAdjoint.isSymmetric
- LinearPMap.IsUnbounded.orthogonal_closure_ker
U.closure.kerᗮ = U†.range - LinearPMap.isUnbounded_of_dense_of_isSymmetricA LinearPMap constructed from a symmetric LinearMap with dense domain is an unbounded operator.
- LinearPMap.HasDenseDomain.isUnbounded_iff_isClosableLinearPMap.HasDenseDomain.isUnbounded_iff_isClosable
- LinearPMap.IsUnbounded.orthogonal_adjoint_range
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 /-- A LinearPMap is an unbounded operator iff it has dense domain and is closable. -/ def LinearPMap.IsUnbounded (U : H →ₗ.[ℂ] H') : Prop := U.HasDenseDomain ∧ U.IsClosable