Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OS descent and adjoint compatibility for densely defined operators

Proved
QAlgorithms.Papers.Independent.Intakethird100.P92.operator_descent

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let (E,E+,θ)(E,E_+,\theta)(E,E+​,θ) be a reflection-positive complex Hilbert space with canonical quotient q:E+→E^q:E_+\to\widehat Eq:E+​→E. Let D⊆E+D\subseteq E_+D⊆E+​ be a linear subspace with q(D)q(D)q(D) dense in E^\widehat EE. Suppose T,U:D→E+T,U:D\to E_+T,U:D→E+​ are linear and satisfy

⟨θTv,w⟩=⟨θv,Uw⟩(v,w∈D).\langle\theta Tv,w\rangle=\langle\theta v,Uw\rangle\quad(v,w\in D).⟨θTv,w⟩=⟨θv,Uw⟩(v,w∈D).

Both maps preserve N∩DN\cap DN∩D, where N=ker⁡qN=\ker qN=kerq, and induce linear operators T^,U^\widehat T,\widehat UT,U on the common domain q(D)q(D)q(D) with T^(qv)=q(Tv)\widehat T(qv)=q(Tv)T(qv)=q(Tv) and U^(qv)=q(Uv)\widehat U(qv)=q(Uv)U(qv)=q(Uv). They satisfy U^⊆T^∗\widehat U\subseteq\widehat T^*U⊆T∗, equivalently the adjoint pairing identity on this dense domain. If T=UT=UT=U, then T^\widehat TT is symmetric. If additionally D=E+D=E_+D=E+​ and TTT is bounded, its induced operator has a continuous extension to E^\widehat EE satisfying ∥T^∥≤∥T∥\|\widehat T\|\leq\|T\|∥T∥≤∥T∥.

This result supplies descent, symmetry, and the norm estimate; none of them is assumed as input.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P92
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P92

open scoped ComplexConjugate BigOperators NNReal ENNReal

open MeasureTheory

attribute [local instance] Classical.propDecidable

universe u v

variable (E : Type u) [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E]

variable {E}

/-- Lemma 2.2, PDF pp. 8--9, all four clauses. The adjoint inclusion is stated
by its defining pairing identity on the dense common domain q(D), so it does not
incorrectly treat unbounded adjoints as everywhere-defined bounded operators.
The printed Eplus domain in (i) is D, as explicitly used in equation (5). -/
theorem operator_descent [hHilbert : CompleteSpace E] (r : ReflectionData E) (D : Submodule ℂ r.plus)
    (hDense : Dense ((D.map (osQ r) : Submodule ℂ (OS r)) : Set (OS r)))
    (T U : D →ₗ[ℂ] r.plus)
    (hPair : ∀ v w : D,
      inner ℂ (r.theta (T v : E)) (w : E) =
        inner ℂ (r.theta (v : E)) (U w : E)) :
    (∀ v : D, osQ r v = 0 → osQ r (T v) = 0 ∧ osQ r (U v) = 0) ∧
    ∃ Tq Uq : D.map (osQ r) →ₗ[ℂ] OS r,
      (∀ v, Tq (domainQ r D v) = osQ r (T v)) ∧
      (∀ v, Uq (domainQ r D v) = osQ r (U v)) ∧
      (∀ v w : D.map (osQ r),
        inner ℂ (Tq v) (w : OS r) = inner ℂ (v : OS r) (Uq w)) ∧
      (T = U → ∀ v w : D.map (osQ r),
        inner ℂ (Tq v) (w : OS r) = inner ℂ (v : OS r) (Tq w)) ∧
      (∀ B : r.plus →L[ℂ] r.plus, (∀ v : D, B v = T v) → D = ⊤ → T = U →
        (∀ v : r.plus, osExtension r B.toLinearMap (osQ r v) = osQ r (B v)) ∧
        (∀ v : D.map (osQ r), osExtension r B.toLinearMap v = Tq v) ∧
        ‖osExtension r B.toLinearMap‖ ≤ ‖B‖) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P92

end
Source
Reflection positive one-parameter groups and dilations, arXiv:1312.6161v2, PDF p. 8, Lemma 2.2
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let EEE be a complete complex inner product space, and let rrr consist of a closed complex linear subspace H+H_+H+​ and a complex linear surjective isometry θ\thetaθ satisfying θ2=I\theta^2=Iθ2=I and Re⁡⟨θv,v⟩≥0\operatorname{Re}\langle\theta v,v\rangle\geq0Re⟨θv,v⟩≥0 for all v∈H+v\in H_+v∈H+​. Let Hr\mathcal H_rHr​ be the separated completion of H+H_+H+​ for the form [v,w]=⟨θv,w⟩[v,w]=\langle\theta v,w\rangle[v,w]=⟨θv,w⟩ and seminorm Re⁡⟨θv,v⟩\sqrt{\operatorname{Re}\langle\theta v,v\rangle}Re⟨θv,v⟩​, and let q:H+→Hrq:H_+\to\mathcal H_rq:H+​→Hr​ be its canonical complex linear map. Let DDD be a complex linear subspace of H+H_+H+​ such that its image q(D)q(D)q(D) is dense in Hr\mathcal H_rHr​, and let T,U:D→H+T,U:D\to H_+T,U:D→H+​ be complex linear maps satisfying

⟨θ(Tv),w⟩=⟨θv,Uw⟩for every v,w∈D.\langle\theta(Tv),w\rangle=\langle\theta v,Uw\rangle \quad\text{for every }v,w\in D.⟨θ(Tv),w⟩=⟨θv,Uw⟩for every v,w∈D.

Then every v∈Dv\in Dv∈D with q(v)=0q(v)=0q(v)=0 satisfies both q(Tv)=0q(Tv)=0q(Tv)=0 and q(Uv)=0q(Uv)=0q(Uv)=0, and there exist complex linear maps Tq,Uq:q(D)→HrT_q,U_q:q(D)\to\mathcal H_rTq​,Uq​:q(D)→Hr​ such that, for every v∈Dv\in Dv∈D, Tq(q(v))=q(Tv)T_q(q(v))=q(Tv)Tq​(q(v))=q(Tv) and Uq(q(v))=q(Uv)U_q(q(v))=q(Uv)Uq​(q(v))=q(Uv), where q(v)q(v)q(v) is regarded as an element of q(D)q(D)q(D); for every a,b∈q(D)a,b\in q(D)a,b∈q(D),

⟨Tqa,b⟩Hr=⟨a,Uqb⟩Hr;\langle T_qa,b\rangle_{\mathcal H_r} =\langle a,U_qb\rangle_{\mathcal H_r};⟨Tq​a,b⟩Hr​​=⟨a,Uq​b⟩Hr​​;

and if T=UT=UT=U, then ⟨Tqa,b⟩Hr=⟨a,Tqb⟩Hr\langle T_qa,b\rangle_{\mathcal H_r}=\langle a,T_qb\rangle_{\mathcal H_r}⟨Tq​a,b⟩Hr​​=⟨a,Tq​b⟩Hr​​ for all a,b∈q(D)a,b\in q(D)a,b∈q(D). These same chosen maps also satisfy the following conditional statement: for every continuous complex linear map B:H+→H+B:H_+\to H_+B:H+​→H+​, if Bv=TvBv=TvBv=Tv for every v∈Dv\in Dv∈D, D=H+D=H_+D=H+​, and T=UT=UT=U, then

EB(qv)=q(Bv)(v∈H+),EB(a)=Tq(a)(a∈q(D)),∥EB∥≤∥B∥.\mathcal E_B(qv)=q(Bv)\quad(v\in H_+),\qquad \mathcal E_B(a)=T_q(a)\quad(a\in q(D)),\qquad \|\mathcal E_B\|\leq\|B\|.EB​(qv)=q(Bv)(v∈H+​),EB​(a)=Tq​(a)(a∈q(D)),∥EB​∥≤∥B∥.

Here H+H_+H+​ carries its norm inherited from EEE when defining ∥B∥\|B\|∥B∥, and EB\mathcal E_BEB​ means a chosen continuous complex linear operator on Hr\mathcal H_rHr​ satisfying EB(qv)=q(Bv)\mathcal E_B(qv)=q(Bv)EB​(qv)=q(Bv) for all v∈H+v\in H_+v∈H+​, if any such operator exists, and the zero operator otherwise.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

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