Theorems · Theorem · functional analysis

IsSelfAdjoint.conj_adjoint

∀ {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [inst : RCLike 𝕜] [inst_1 : NormedAddCommGroup E]
  [inst_2 : NormedAddCommGroup F] [inst_3 : InnerProductSpace 𝕜 E] [inst_4 : InnerProductSpace 𝕜 F]
  [inst_5 : CompleteSpace E] [inst_6 : CompleteSpace F] {T : E →L[𝕜] E},
  IsSelfAdjoint T → ∀ (S : E →L[𝕜] F), IsSelfAdjoint (S ∘SL T ∘SL ContinuousLinearMap.adjoint S)

Conjugating preserves self-adjointness.

Defined in

Mathlib.Analysis.InnerProductSpace.Adjoint

Cited by

1 results in Mathlib

Foundations

Depth 194 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

RCLikeNormedAddCommGroupNormedAddCommGroupInnerProductSpaceInnerProductSpaceCompleteSpaceCompleteSpace