LinearPMap.HasDenseDomain.orthogonal_range
theoremverifiedformalizationimported Lean
U.rangeᗮ = U†.ker c.f. LinearMap.orthogonal_range and ContinuousLinearMap.orthogonal_range
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_range [CompleteSpace H] (h : U.HasDenseDomain) : U.toFun.rangeᗮ = U†.toFun.ker.map U†.domain.subtype
- Formalizes
- Physlib, `LinearPMap.HasDenseDomain.orthogonal_range`
- 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_range← LinearPMap.HasDenseDomain.orthogonal_range (Physlib/QuantumMechanics/Operators/Unbounded.lean:206): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - LinearPMap.compRestricted_domainLinearPMap.compRestricted_domain
- dim_map_r_ERank of a restricted subspace of $\mathbb{F}_p^n \times \mathbb{F}_p^n$. Fix a prime $p$ and an integer $n \ge 0$, and let…
- ker_r_EKernel of the coordinate restriction map. Fix a prime $p$ and let $V = \bbf_p^n \times \bbf_p^n$. For a subset…
- catch_up_value_eq_draw_iff_not_lossThe outcome of Catch-Up on a nonempty set S is a draw if and only if Player 1 does not lose from the initial position and Player 2 does…
- LinearPMap.HasDenseDomainA LinearPMap
- Used by 2
- LinearPMap.IsUnbounded.orthogonal_adjoint_range
U†.rangeᗮ = U.closure.ker - LinearPMap.HasDenseDomain.orthogonal_adjoint_ker
U†.kerᗮ = U.range.closure
- 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 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''} in/-- `U.rangeᗮ = U†.ker` c.f. `LinearMap.orthogonal_range` and `ContinuousLinearMap.orthogonal_range` -/lemma LinearPMap.HasDenseDomain.orthogonal_range [CompleteSpace H] (h : U.HasDenseDomain) : U.toFun.rangeᗮ = U†.toFun.ker.map U†.domain.subtype := by ext u simp only [mem_orthogonal', Subtype.exists, mem_map, LinearMap.mem_ker, subtype_apply, exists_and_right, exists_eq_right, toFun_eq_coe] constructor · intro h' exact ⟨mem_adjoint_domain_of_exists u ⟨0, by simp [h']⟩, adjoint_apply_eq h _ (by simp [h'])⟩ · intro ⟨hu, hu'⟩ v ⟨x, hxv⟩ simp [← hxv, ← adjoint_isFormalAdjoint h ⟨u, hu⟩, hu']