LinearPMap.adjoint_antitone
theoremverifiedformalizationimported Lean
LinearPMap.adjoint_antitone
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 lemma LinearPMap.adjoint_antitone [CompleteSpace H] (h₁₂ : U₁.HasDenseDomain ∨ ¬U₂.HasDenseDomain) (h_le : U₁ ≤ U₂) : U₂† ≤ U₁†
- Formalizes
- Physlib, `LinearPMap.adjoint_antitone`
- 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.adjoint_antitone← LinearPMap.adjoint_antitone (Physlib/QuantumMechanics/Operators/Unbounded.lean:342): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH.
- LinearPMap.HasDenseDomainA LinearPMap
- Used by 2
- LinearPMap.IsEssentiallySelfAdjoint.unique_self_adjoint_extensionThe closure is the unique self-adjoint extension of an essentially self-adjoint operator.
- LinearPMap.IsSymmetric.closureThe closure of a symmetric densely-defined operator is symmetric:
T††is a symmetric closed extension ofT, so it extendsT.closure,…
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''} inlemma LinearPMap.adjoint_antitone [CompleteSpace H] (h₁₂ : U₁.HasDenseDomain ∨ ¬U₂.HasDenseDomain) (h_le : U₁ ≤ U₂) : U₂† ≤ U₁† := by have h_agree : ∀ w : U₁.domain, U₁ w = U₂ ⟨w, h_le.1 w.2⟩ := fun w ↦ @h_le.2 w ⟨w, h_le.1 w.2⟩ rfl constructor · intro v let f₁ : U₁.domain → ℂ := fun w ↦ ⟪v, U₁ w⟫_ℂ let f₂ : U₂.domain → ℂ := fun w ↦ ⟪v, U₂ w⟫_ℂ change Continuous f₂ → Continuous f₁ suffices f₁ = fun w : U₁.domain ↦ f₂ ⟨w, h_le.1 w.2⟩ by rw [this]; fun_prop simp [f₁, f₂, h_agree] · intro u v huv rcases h₁₂ with (h₁ | h₂) · have h₂ : U₂.HasDenseDomain := h₁.mono h_le.1 refine (adjoint_apply_eq h₁ v fun w ↦ ?_).symm rw [adjoint_isFormalAdjoint h₂ u ⟨w, h_le.1 w.2⟩, h_agree, huv] · have h₁ : ¬U₁.HasDenseDomain := fun h ↦ h₂ (h.mono h_le.1) rw [adjoint_apply_of_not_dense h₁ v, adjoint_apply_of_not_dense h₂ u]