Solvability of the Adjoint-Composition Equation
ProvedFunctionalInequalities.Analysis.Semigroup.Generated.exists_adjointComp_eq_of_gap_readableThis is an existence theorem for the equation on the orthogonal complement of .
Let be complete real Hilbert spaces, let be closed with dense domain, and write . Fix and assume the gap condition
for every orthogonal to . If is orthogonal to every with , then there exists such that
This provides existence of an inverse on the kernel complement; uniqueness is supplied by the corresponding uniqueness lemma.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis.Semigroup.Generated. Shown in its original module context. Proof omitted.
theorem exists_adjointComp_eq_of_gap {C : ℝ}
(hgap : ∀ y : T.domain, (∀ k : T.domain, T k = 0 → ⟪(y : H₀), (k : H₀)⟫ = 0) →
‖(y : H₀)‖ ^ 2 ≤ C * ‖T y‖ ^ 2)
(g : H₀) (hg : ∀ k : T.domain, T k = 0 → ⟪g, (k : H₀)⟫ = 0) :
∃ u : (adjointComp T).domain,
(∀ k : T.domain, T k = 0 → ⟪(u : H₀), (k : H₀)⟫ = 0) ∧ adjointComp T u = g
Module navigation
Module: Analysis/Semigroup/Generated/Inverse.
Definition modules: Analysis/Semigroup/AdjointComp.
Supporting theorems: mem_closure_range_of_inner_eq_zero, norm_le_of_gap.
Previous: norm_le_of_gap · Next: eq_of_adjointComp_eq.
Source excerpt, lines 153–158 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Semigroup_Generated_Inverse
open scoped InnerProductSpace RealInnerProductSpace
variable {H₀ H₁ : Type*} [NormedAddCommGroup H₀] [InnerProductSpace ℝ H₀] [CompleteSpace H₀]
[NormedAddCommGroup H₁] [InnerProductSpace ℝ H₁] [CompleteSpace H₁]
(T : H₀ →ₗ.[ℝ] H₁) (hT : T.IsClosed) (hd : Dense (T.domain : Set H₀))
include hT hd
theorem FunctionalInequalities.Analysis.Semigroup.Generated.exists_adjointComp_eq_of_gap_readable {C : ℝ}
(hgap : ∀ y : T.domain, (∀ k : T.domain, T k = 0 → ⟪(y : H₀), (k : H₀)⟫ = 0) →
‖(y : H₀)‖ ^ 2 ≤ C * ‖T y‖ ^ 2)
(g : H₀) (hg : ∀ k : T.domain, T k = 0 → ⟪g, (k : H₀)⟫ = 0) :
∃ u : (adjointComp T).domain,
(∀ k : T.domain, T k = 0 → ⟪(u : H₀), (k : H₀)⟫ = 0) ∧ adjointComp T u = g := by sorry