LinearPMap.HasDenseDomain.orthogonal_adjoint_ker
theoremverifiedformalizationimported Lean
U†.kerᗮ = U.range.closure
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.HasDenseDomain.orthogonal_adjoint_ker [CompleteSpace H] [CompleteSpace H'] (h : U.HasDenseDomain) : (U†.toFun.ker.map U†.domain.subtype)ᗮ = U.toFun.range.closure
- Formalizes
- Physlib, `LinearPMap.HasDenseDomain.orthogonal_adjoint_ker`
- 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.orthogonal_adjoint_ker← LinearPMap.HasDenseDomain.orthogonal_adjoint_ker (Physlib/QuantumMechanics/Operators/Unbounded.lean:218): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- LinearPMap.HasDenseDomain.closureLinearPMap.HasDenseDomain.closure
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - LinearPMap.HasDenseDomain.orthogonal_range
U.rangeᗮ = U†.kerc.f.LinearMap.orthogonal_rangeandContinuousLinearMap.orthogonal_range
- Used by 1
- LinearPMap.IsUnbounded.orthogonal_closure_ker
U.closure.kerᗮ = U†.range
- LinearPMap.IsUnbounded.orthogonal_closure_ker
Lean source view module on GitHub
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 /-- `U†.kerᗮ = U.range.closure` -/ lemma LinearPMap.HasDenseDomain.orthogonal_adjoint_ker [CompleteSpace H] [CompleteSpace H'] (h : U.HasDenseDomain) : (U†.toFun.ker.map U†.domain.subtype)ᗮ = U.toFun.range.closure := h.orthogonal_range ▸ orthogonal_orthogonal_eq_closure _