LinearPMap.HasDenseDomain
defimported Lean
A LinearPMap U has dense domain iff U.domain is dense in H.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true 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.HasDenseDomain (U : H →ₗ.[ℂ] H') : Prop
- Defined in
- Physlib, `LinearPMap.HasDenseDomain`
- 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.HasDenseDomain← LinearPMap.HasDenseDomain (Physlib/QuantumMechanics/Operators/Unbounded.lean:122): verbatim
- Verified
- 10 Oct 2026
- Axioms
- none listed
- Used by 45
- LinearPMap.adjoint_compRestricted_le_compRestricted_adjointLinearPMap.adjoint_compRestricted_le_compRestricted_adjoint
- LinearPMap.adjoint_pow_le_pow_adjointLinearPMap.adjoint_pow_le_pow_adjoint
- LinearPMap.pow_hasDenseDomain_of_leLinearPMap.pow_hasDenseDomain_of_le
- LinearPMap.adjoint_sub_le_sub_adjointLinearPMap.adjoint_sub_le_sub_adjoint
- LinearPMap.hasDenseDomain_defLinearPMap.hasDenseDomain_def
- LinearPMap.IsUnboundedA LinearPMap is an unbounded operator iff it has dense domain and is closable.
- LinearPMap.HasDenseDomain.sum_of_leLinearPMap.HasDenseDomain.sum_of_le
- LinearPMap.HasDenseDomain.closureLinearPMap.HasDenseDomain.closure
- LinearPMap.IsUnbounded.isClosableLinearPMap.IsUnbounded.isClosable
- LinearPMap.adjoint_of_zeroThe adjoint of a zero LinearPMap (any domain) is zero (domain
⊤). - LinearPMap.HasDenseDomain.negLinearPMap.HasDenseDomain.neg
- LinearPMap.adjoint_smulLinearPMap.adjoint_smul
- LinearPMap.isUnbounded_of_dense_of_isSymmetric'Variant of
of_dense_of_isSymmetricfor an endomorphism satisfyingLinearMap.IsSymmetric. - LinearPMap.HasDenseDomain.add_of_leLinearPMap.HasDenseDomain.add_of_le
- 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.isSymmetric_iff_le_adjointLinearPMap.isSymmetric_iff_le_adjoint
- LinearPMap.IsSymmetric.isSelfAdjoint_iffLinearPMap.IsSymmetric.isSelfAdjoint_iff
- LinearPMap.IsSymmetric.closure_le_adjointLinearPMap.IsSymmetric.closure_le_adjoint
- LinearPMap.IsSelfAdjoint.isUnboundedLinearPMap.IsSelfAdjoint.isUnbounded
- LinearPMap.HasDenseDomain.unitaryConj_dense_domainIf
Ahas dense domain, then so doesu A u⁻¹: the domainu⁻¹ ⁻¹' (A.domain)is the preimage of a dense set under a homeomorphism. - LinearPMap.HasDenseDomain.sub_of_leLinearPMap.HasDenseDomain.sub_of_le
- LinearPMap.IsUnbounded.adjointLinearPMap.IsUnbounded.adjoint
- LinearPMap.adjoint_antitoneLinearPMap.adjoint_antitone
- LinearPMap.IsSymmetric.isUnbounded_iff_hasDenseDomainLinearPMap.IsSymmetric.isUnbounded_iff_hasDenseDomain
- LinearPMap.HasDenseDomain.orthogonal_adjoint_ker
U†.kerᗮ = U.range.closure - LinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iffLinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iff
- LinearPMap.IsSymmetric.isClosableLinearPMap.IsSymmetric.isClosable
- LinearPMap.IsUnbounded.isClosed_iffLinearPMap.IsUnbounded.isClosed_iff
- LinearPMap.IsUnbounded.adjoint_closure_eq_adjointLinearPMap.IsUnbounded.adjoint_closure_eq_adjoint
- LinearPMap.isClosable_of_exists_dense_formalAdjointA LinearPMap with densely-defined formal adjoint is closable.
- LinearPMap.IsUnbounded.adjoint_adjoint_eq_closureLinearPMap.IsUnbounded.adjoint_adjoint_eq_closure
- LinearPMap.IsEssentiallySelfAdjoint.isUnboundedLinearPMap.IsEssentiallySelfAdjoint.isUnbounded
- LinearPMap.IsEssentiallySelfAdjoint.hasDenseDomainLinearPMap.IsEssentiallySelfAdjoint.hasDenseDomain
- LinearPMap.IsSymmetric.closureThe closure of a symmetric densely-defined operator is symmetric:
T††is a symmetric closed extension ofT, so it extendsT.closure,… - LinearPMap.IsUnbounded.closureLinearPMap.IsUnbounded.closure
- LinearPMap.IsSymmetric.isSelfAdjoint_of_range_eq_topSelf-adjointness from surjectivity of
T ± i: a symmetric, densely-defined operatorTfor whichT + I • 1andT - I • 1both have… - LinearPMap.add_adjoint_isSymmetricLinearPMap.add_adjoint_isSymmetric
- LinearPMap.hasDenseDomain_iff_closure_hasDenseDomainLinearPMap.hasDenseDomain_iff_closure_hasDenseDomain
- LinearPMap.adjoint_add_le_add_adjointLinearPMap.adjoint_add_le_add_adjoint
- LinearPMap.HasDenseDomain.smulLinearPMap.HasDenseDomain.smul
- LinearPMap.HasDenseDomain.orthogonal_range
U.rangeᗮ = U†.kerc.f.LinearMap.orthogonal_rangeandContinuousLinearMap.orthogonal_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
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true 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 `U` has dense domain iff `U.domain` is dense in `H`. -/ def LinearPMap.HasDenseDomain (U : H →ₗ.[ℂ] H') : Prop := Dense (U.domain : Set H)