LinearPMap.IsEssentiallySelfAdjoint.unique_self_adjoint_extension
theoremverifiedformalizationimported Lean
The closure is the unique self-adjoint extension of an essentially self-adjoint operator.
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.IsEssentiallySelfAdjoint.unique_self_adjoint_extension [CompleteSpace H] (h : T.IsEssentiallySelfAdjoint) {T₂ : H →ₗ.[ℂ] H} (h_le : T ≤ T₂) (h₂ : IsSelfAdjoint T₂) : T₂ = T.closure
- Formalizes
- Physlib, `LinearPMap.IsEssentiallySelfAdjoint.unique_self_adjoint_extension`
- 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.IsEssentiallySelfAdjoint.unique_self_adjoint_extension← LinearPMap.IsEssentiallySelfAdjoint.unique_self_adjoint_extension (Physlib/QuantumMechanics/Operators/Unbounded.lean:975): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 12
- LinearPMap.IsUnboundedA LinearPMap is an unbounded operator iff it has dense domain and is closable.
- LinearPMap.HasDenseDomain.closureLinearPMap.HasDenseDomain.closure
- LinearPMap.IsSelfAdjoint.isClosedLinearPMap.IsSelfAdjoint.isClosed
- LinearPMap.adjoint_antitoneLinearPMap.adjoint_antitone
- LinearPMap.IsEssentiallySelfAdjointA LinearPMap is essentially self-adjoint iff its closure is self-adjoint.
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - LinearPMap.IsUnbounded.adjoint_closure_eq_adjointLinearPMap.IsUnbounded.adjoint_closure_eq_adjoint
- LinearPMap.IsUnbounded.adjoint_adjoint_eq_closureLinearPMap.IsUnbounded.adjoint_adjoint_eq_closure
- LinearPMap.IsSelfAdjoint.isClosableLinearPMap.IsSelfAdjoint.isClosable
- UnitaryOneParameterGroup.instCoeFunForallRealContinuousLinearMapComplexIdUnitaryOneParameterGroup.instCoeFunForallRealContinuousLinearMapComplexId
- LinearPMap.IsEssentiallySelfAdjoint.hasDenseDomainLinearPMap.IsEssentiallySelfAdjoint.hasDenseDomain
- LinearPMap.IsClosed.closure_eqLinearPMap.IsClosed.closure_eq
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 is the unique self-adjoint extension of an essentially self-adjoint operator. -/lemma LinearPMap.IsEssentiallySelfAdjoint.unique_self_adjoint_extension [CompleteSpace H] (h : T.IsEssentiallySelfAdjoint) {T₂ : H →ₗ.[ℂ] H} (h_le : T ≤ T₂) (h₂ : IsSelfAdjoint T₂) : T₂ = T.closure := by have h_cl : T₂.IsClosed := IsSelfAdjoint.isClosed h₂ have h_le' : T.closure ≤ T₂ := h_cl.closure_eq ▸ h_cl.isClosable.closure_mono h_le exact eq_of_le_of_ge (h ▸ h₂ ▸ adjoint_antitone (Or.inl h.hasDenseDomain.closure) h_le') h_le'