InnerProductSpaceSubmodule.submoduleToLp
defimported Lean
The submodule of WithLp 2 (E × F) defined by M.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap Submodule in variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℂ E] {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] (M : Submodule ℂ (E × F)) (f : E × F) (g : F × E) in def InnerProductSpaceSubmodule.submoduleToLp : Submodule ℂ (WithLp 2 (E × F))
- Defined in
- Physlib, `InnerProductSpaceSubmodule.submoduleToLp`
- Lean proof
- By 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.InnerProductSpaceSubmodule.submoduleToLp← InnerProductSpaceSubmodule.submoduleToLp (Physlib/Mathematics/InnerProductSpace/Submodule.lean:33): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Used by 10
- InnerProductSpaceSubmodule.mem_submodule_iff_mem_submoduleToLpInnerProductSpaceSubmodule.mem_submodule_iff_mem_submoduleToLp
- InnerProductSpaceSubmodule.mem_submodule_closure_adjoint_iff_mem_submoduleToLp_closure_orthogonalInnerProductSpaceSubmodule.mem_submodule_closure_adjoint_iff_mem_submoduleToLp_closure_orthogonal
- InnerProductSpaceSubmodule.mem_submodule_closure_iff_mem_submoduleToLp_closureInnerProductSpaceSubmodule.mem_submodule_closure_iff_mem_submoduleToLp_closure
- LinearPMap.IsUnbounded.adjointLinearPMap.IsUnbounded.adjoint
- InnerProductSpaceSubmodule.mem_submodule_adjoint_adjoint_iff_mem_submoduleToLp_orthogonal_orthogonalInnerProductSpaceSubmodule.mem_submodule_adjoint_adjoint_iff_mem_submoduleToLp_orthogonal_orthogonal
- LinearPMap.IsUnbounded.adjoint_closure_eq_adjointLinearPMap.IsUnbounded.adjoint_closure_eq_adjoint
- LinearPMap.isClosable_of_exists_dense_formalAdjointA LinearPMap with densely-defined formal adjoint is closable.
- LinearPMap.IsUnbounded.adjoint_adjoint_eq_closureLinearPMap.IsUnbounded.adjoint_adjoint_eq_closure
- InnerProductSpaceSubmodule.submoduleToLp_closureInnerProductSpaceSubmodule.submoduleToLp_closure
- InnerProductSpaceSubmodule.mem_submodule_adjoint_iff_mem_submoduleToLp_orthogonalInnerProductSpaceSubmodule.mem_submodule_adjoint_iff_mem_submoduleToLp_orthogonal
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap Submodule in variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℂ E] {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] (M : Submodule ℂ (E × F)) (f : E × F) (g : F × E) in /-- The submodule of `WithLp 2 (E × F)` defined by `M`. -/ def InnerProductSpaceSubmodule.submoduleToLp : Submodule ℂ (WithLp 2 (E × F)) where carrier := {x | x.ofLp ∈ M} add_mem' := by intro a b ha hb exact Submodule.add_mem M ha hb zero_mem' := Submodule.zero_mem M smul_mem' := by intro c x hx exact Submodule.smul_mem M c hx