LinearPMap.IsSymmetric.closure
theoremverifiedformalizationimported Lean
The closure of a symmetric densely-defined operator is symmetric: T†† is a symmetric closed extension of T, so it extends T.closure, whose symmetry then descends.
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 variable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) in variable {u A} in lemma LinearPMap.IsSymmetric.closure [CompleteSpace H] (hsym : T.IsSymmetric) (hdense : T.HasDenseDomain) : T.closure.IsSymmetric
- Formalizes
- Physlib, `LinearPMap.IsSymmetric.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.IsSymmetric.closure← LinearPMap.IsSymmetric.closure (Physlib/QuantumMechanics/Operators/Unbounded.lean:854): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- LinearPMap.HasDenseDomain.closureLinearPMap.HasDenseDomain.closure
- LinearPMap.isSymmetric_iff_le_adjointLinearPMap.isSymmetric_iff_le_adjoint
- LinearPMap.adjoint_antitoneLinearPMap.adjoint_antitone
- LinearPMap.IsSymmetricA LinearPMap
Tis symmetric iff⟪T x, y⟫_ℂ = ⟪x, T y⟫_ℂfor allx y : T.domain. - LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - LinearPMap.IsSymmetric.of_leLinearPMap.IsSymmetric.of_le
- LinearPMap.IsClosed.closure_eqLinearPMap.IsClosed.closure_eq
- LinearPMap.isSymmetric_defLinearPMap.isSymmetric_def
- Used by 2
- LinearPMap.IsSymmetric.closure_le_adjointLinearPMap.IsSymmetric.closure_le_adjoint
- LinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iffLinearPMap.IsSymmetric.isEssentiallySelfAdjoint_iff
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 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/-- The closure of a symmetric densely-defined operator is symmetric: `T††` is a symmetric closed extension of `T`, so it extends `T.closure`, whose symmetry then descends. -/lemma LinearPMap.IsSymmetric.closure [CompleteSpace H] (hsym : T.IsSymmetric) (hdense : T.HasDenseDomain) : T.closure.IsSymmetric := by have hle : T ≤ T† := (isSymmetric_def.mp hsym).le_adjoint hdense have hadj_dense : T†.HasDenseDomain := hdense.mono hle.1 have hT_le : T ≤ T†† := (adjoint_isFormalAdjoint hdense).le_adjoint hadj_dense have hc : (T††).IsClosed := adjoint_isClosed hadj_dense have h1 : (T††).IsSymmetric := (isSymmetric_iff_le_adjoint (hdense.mono hT_le.1)).mpr (adjoint_antitone (Or.inl (hdense.mono hT_le.1)) (adjoint_antitone (Or.inl hdense) hle)) exact h1.of_le (hc.closure_eq ▸ hc.isClosable.closure_mono hT_le)