LinearPMap.IsUnbounded.adjoint_adjoint_eq_closure
theoremverifiedformalizationimported Lean
LinearPMap.IsUnbounded.adjoint_adjoint_eq_closure
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in open Submodule in open InnerProductSpace in open InnerProductSpaceSubmodule 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 variable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) in variable {u A} in @[simp] lemma LinearPMap.IsUnbounded.adjoint_adjoint_eq_closure [CompleteSpace H] [CompleteSpace H'] (h : U.IsUnbounded) : U†† = U.closure
- Formalizes
- Physlib, `LinearPMap.IsUnbounded.adjoint_adjoint_eq_closure`
- 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.adjoint_adjoint_eq_closure← LinearPMap.IsUnbounded.adjoint_adjoint_eq_closure (Physlib/QuantumMechanics/Operators/Unbounded.lean:700): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- LinearPMap.IsUnboundedA LinearPMap is an unbounded operator iff it has dense domain and is closable.
- InnerProductSpaceSubmodule.mem_submodule_closure_iff_mem_submoduleToLp_closureInnerProductSpaceSubmodule.mem_submodule_closure_iff_mem_submoduleToLp_closure
- LinearPMap.IsUnbounded.adjointLinearPMap.IsUnbounded.adjoint
- InnerProductSpaceSubmodule.mem_submodule_adjoint_adjoint_iff_mem_submoduleToLp_orthogonal_orthogonalInnerProductSpaceSubmodule.mem_submodule_adjoint_adjoint_iff_mem_submoduleToLp_orthogonal_orthogonal
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - LinearPMap.IsUnbounded.adjoint_closure_eq_adjointLinearPMap.IsUnbounded.adjoint_closure_eq_adjoint
- UnitaryOneParameterGroup.instCoeFunForallRealContinuousLinearMapComplexIdUnitaryOneParameterGroup.instCoeFunForallRealContinuousLinearMapComplexId
- InnerProductSpaceSubmodule.submoduleToLpThe submodule of
WithLp 2 (E × F)defined byM.
- Used by 19
- LinearPMap.IsUnbounded.orthogonal_adjoint_range
U†.rangeᗮ = U.closure.ker - LinearPMap.IsEssentiallySelfAdjoint.negLinearPMap.IsEssentiallySelfAdjoint.neg
- LinearPMap.IsSelfAdjoint.isEssentiallySelfAdjointLinearPMap.IsSelfAdjoint.isEssentiallySelfAdjoint
- 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.IsEssentiallySelfAdjoint.smulLinearPMap.IsEssentiallySelfAdjoint.smul
- 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.IsSymmetric.isUnbounded_iff_hasDenseDomainLinearPMap.IsSymmetric.isUnbounded_iff_hasDenseDomain
- LinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iffLinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iff
- LinearPMap.IsUnbounded.isClosed_iffLinearPMap.IsUnbounded.isClosed_iff
- LinearPMap.IsEssentiallySelfAdjoint.isClosableLinearPMap.IsEssentiallySelfAdjoint.isClosable
- LinearPMap.IsUnbounded.le_adjoint_adjointLinearPMap.IsUnbounded.le_adjoint_adjoint
- LinearPMap.IsEssentiallySelfAdjoint.isUnboundedLinearPMap.IsEssentiallySelfAdjoint.isUnbounded
- LinearPMap.IsEssentiallySelfAdjoint.hasDenseDomainLinearPMap.IsEssentiallySelfAdjoint.hasDenseDomain
- LinearPMap.IsEssentiallySelfAdjoint.real_smulLinearPMap.IsEssentiallySelfAdjoint.real_smul
- 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.IsUnbounded.orthogonal_adjoint_range
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen LinearPMap inopen Submodule inopen InnerProductSpace inopen InnerProductSpaceSubmodule inopen Complex ComplexConjugate invariable {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''} invariable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) invariable {u A} in@[simp]lemma LinearPMap.IsUnbounded.adjoint_adjoint_eq_closure [CompleteSpace H] [CompleteSpace H'] (h : U.IsUnbounded) : U†† = U.closure := by refine eq_of_eq_graph ?_ ext rw [adjoint_graph_eq_graph_adjoint h.adjoint.1, adjoint_graph_eq_graph_adjoint h.1, ← IsClosable.graph_closure_eq_closure_graph h.2, mem_submodule_adjoint_adjoint_iff_mem_submoduleToLp_orthogonal_orthogonal, orthogonal_orthogonal_eq_closure, mem_submodule_closure_iff_mem_submoduleToLp_closure]