Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Maximal-domain composition of a partial operator with its adjoint

Definition
KLSModular_FunctionalInequalities_Analysis_Semigroup_AdjointComp

by Lazyfill · Oct 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitiesklskls-conjecturekls-modularlog-concavemodule-context

For partially defined real-linear operators T:H0→H1T:H_0\to H_1T:H0​→H1​ between real inner-product spaces, adjointCompDomain T is the submodule of H0H_0H0​ consisting of those x∈D(T)x\in D(T)x∈D(T) for which Tx∈D(T†)Tx\in D(T^\dagger)Tx∈D(T†). adjointComp T is the partial operator T†TT^\dagger TT†T on this maximal domain, constructed by restricting TTT before composing with the adjoint. The accompanying results characterize domain membership, verify the required adjoint-domain side condition, and state the pointwise formula for adjointComp.

Original module imports

import Mathlib.Analysis.InnerProductSpace.LinearPMap

Original declaration excerpt

Shown in the original module context.

def adjointCompDomain (T : H₀ →ₗ.[ℝ] H₁) : Submodule ℝ H₀ :=
  (Submodule.comap T.toFun T†.domain).map T.domain.subtype

Module navigation

Project result: The KLS conjecture.

Original module · FunctionalInequalities.Analysis.Semigroup.AdjointComp · Frozen source 408915f.

Definition code
import Mathlib.Analysis.InnerProductSpace.LinearPMap

noncomputable section
open scoped LinearPMap
namespace FunctionalInequalities
namespace Analysis
namespace Semigroup
variable {H₀ H₁ : Type*} [NormedAddCommGroup H₀] [InnerProductSpace ℝ H₀] [CompleteSpace H₀]
  [NormedAddCommGroup H₁] [InnerProductSpace ℝ H₁]
/-- The domain of `T†T`, as a submodule of `H₀`: those `x ∈ D(T)` with `T x ∈ D(T†)`. -/
def adjointCompDomain (T : H₀ →ₗ.[ℝ] H₁) : Submodule ℝ H₀ :=
  (Submodule.comap T.toFun T†.domain).map T.domain.subtype
/-- Membership in the domain of `T†T`. -/
theorem mem_adjointCompDomain {T : H₀ →ₗ.[ℝ] H₁} {x : H₀} :
    x ∈ adjointCompDomain T ↔ ∃ hx : x ∈ T.domain, T ⟨x, hx⟩ ∈ T†.domain := by
  constructor
  · rintro ⟨⟨y, hy⟩, h, rfl⟩
    exact ⟨hy, h⟩
  · rintro ⟨hx, h⟩
    exact ⟨⟨x, hx⟩, h, rfl⟩
/-- On the restricted domain, `T` takes values in `D(T†)`; this is the side condition that
`LinearPMap.comp` demands. -/
theorem domRestrict_mem_adjoint_domain (T : H₀ →ₗ.[ℝ] H₁)
    (x : ↥(adjointCompDomain T ⊓ T.domain)) :
    T.domRestrict (adjointCompDomain T) x ∈ T†.domain := by
  obtain ⟨hx, h⟩ := mem_adjointCompDomain.mp x.2.1
  rw [T.domRestrict_apply (y := ⟨x, hx⟩) rfl]
  exact h
/-- `T†T` with its maximal domain `{x ∈ D(T) | T x ∈ D(T†)}`. -/
def adjointComp (T : H₀ →ₗ.[ℝ] H₁) : H₀ →ₗ.[ℝ] H₀ :=
  T†.comp (T.domRestrict (adjointCompDomain T)) (domRestrict_mem_adjoint_domain T)
/-- `adjointComp T x = T† (T x)`. -/
theorem adjointComp_apply (T : H₀ →ₗ.[ℝ] H₁) (x : (adjointComp T).domain) :
    adjointComp T x = T† ⟨T ⟨x, x.2.2⟩,
      by simpa [T.domRestrict_apply (y := ⟨x, x.2.2⟩) rfl] using domRestrict_mem_adjoint_domain T x⟩ := by
  change T† ⟨T.domRestrict (adjointCompDomain T) x, _⟩ = _
  congr 1
end Semigroup
end Analysis
end FunctionalInequalities
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Semigroup/AdjointComp.lean#L27-L76 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Semigroup.AdjointComp`, definition bundle `KLSModular_FunctionalInequalities_Analysis_Semigroup_AdjointComp`; the repository is private at upload time).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me