Documentation

TauCeti.Analysis.InnerProductSpace.LinearPMap.SelfAdjoint

Formally self-adjoint partial linear maps and their shifts #

For a formally self-adjoint partial linear map A on an inner-product space over an RCLike field π•œ (Mathlib's LinearPMap.IsFormalAdjoint A A, the symmetric operators), the quadratic form βŸͺx, A x⟫ is real, so for a scalar c the shift x ↦ c β€’ x - A x satisfies

β€–c β€’ x - A xβ€–Β² = (im c)Β² β€–xβ€–Β² + β€–re c β€’ x - A xβ€–Β².

For im c β‰  0 the shift is therefore bounded below with respect to the graph norm of A; if A is closed, its range is closed (LinearPMap.isClosed_range_smul_sub_of_graph_norm_le). When A is self-adjoint the range is also dense, because a vector orthogonal to it is an eigenvector of A† for the eigenvalue conj c (LinearPMap.exists_adjoint_apply_eq_of_inner_smul_sub_eq_zero), and a symmetric operator has no nonreal eigenvalue (LinearPMap.IsFormalAdjoint.eq_zero_of_apply_eq_smul). Hence every nonreal shift of a self-adjoint operator is surjective (IsSelfAdjoint.smul_sub_surjective), and with the lower bound it is bijective with bounded inverse (IsSelfAdjoint.smul_sub_bijective): the resolvent set contains every nonreal point. The shifts Β± i - A are the classical deficiency operators, and their surjectivity is the range condition that makes Β± i β€’ A m-dissipative.

The file also provides the formal-adjointness and quadratic-form API of self-adjoint partial linear maps used by the semigroup development.

Main results #

References #

theorem IsSelfAdjoint.isFormalAdjoint {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {A : E β†’β‚—.[π•œ] E} (hA : IsSelfAdjoint A) :

A self-adjoint partial linear map is formally self-adjoint on its domain.

theorem LinearPMap.IsFormalAdjoint.im_inner_self_apply {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (x : β†₯A.domain) :
RCLike.im (inner π•œ (↑x) (↑A x)) = 0

The quadratic form of a formally self-adjoint partial linear map is real.

theorem LinearPMap.exists_adjoint_apply_eq_of_inner_smul_sub_eq_zero {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {A : E β†’β‚—.[π•œ] E} (hdense : Dense ↑A.domain) {c : π•œ} {y : E} (h : βˆ€ (x : β†₯A.domain), inner π•œ y (c β€’ ↑x - ↑A x) = 0) :
βˆƒ (hy : y ∈ A.adjoint.domain), ↑A.adjoint ⟨y, hy⟩ = (starRingEnd π•œ) c β€’ y

Deficiency vectors are adjoint eigenvectors. A vector orthogonal to the range of the shift c β€’ x - A x of a densely defined partial linear map lies in the domain of the adjoint A†, which acts on it as multiplication by conj c.

theorem LinearPMap.IsFormalAdjoint.re_inner_smul_self_apply {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (c : π•œ) (x : β†₯A.domain) :
RCLike.re (inner π•œ (c β€’ ↑x) (↑A x)) = RCLike.re c * RCLike.re (inner π•œ (↑x) (↑A x))

For a formally self-adjoint partial linear map, the real cross term between c β€’ x and A x is re c times the (real) quadratic form. The inner product is conjugate-linear in its first argument.

theorem LinearPMap.IsFormalAdjoint.re_inner_smul_apply_self {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (c : π•œ) (x : β†₯A.domain) :
RCLike.re (inner π•œ (c β€’ ↑A x) ↑x) = RCLike.re c * RCLike.re (inner π•œ (↑x) (↑A x))

The mirror image of re_inner_smul_self_apply: the real cross term between c β€’ A x and x is re c times the quadratic form.

theorem LinearPMap.IsFormalAdjoint.norm_smul_sub_sq {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (c : π•œ) (x : β†₯A.domain) :
β€–c β€’ ↑x - ↑A xβ€– ^ 2 = RCLike.im c ^ 2 * ‖↑xβ€– ^ 2 + ‖↑(RCLike.re c) β€’ ↑x - ↑A xβ€– ^ 2

Square-sum identity for shifts. For a formally self-adjoint partial linear map and a scalar c, β€–c β€’ x - A xβ€–Β² = (im c)Β² β€–xβ€–Β² + β€–re c β€’ x - A xβ€–Β².

theorem LinearPMap.IsFormalAdjoint.abs_im_mul_norm_le_norm_smul_sub {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (c : π•œ) (x : β†₯A.domain) :
|RCLike.im c| * ‖↑xβ€– ≀ β€–c β€’ ↑x - ↑A xβ€–

A shift dominates the imaginary part of the scalar times the input.

theorem LinearPMap.IsFormalAdjoint.norm_le_inv_abs_im_mul_norm_smul_sub {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) (x : β†₯A.domain) :

The resolvent bound: a nonreal shift of a formally self-adjoint partial linear map dominates |im c| times the input, so its inverse (where defined) has norm at most |im c|⁻¹.

theorem LinearPMap.IsFormalAdjoint.smul_sub_injective {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) :
Function.Injective fun (x : β†₯A.domain) => c β€’ ↑x - ↑A x

A nonreal shift of a formally self-adjoint partial linear map is injective.

theorem LinearPMap.IsFormalAdjoint.norm_re_smul_sub_le_norm_smul_sub {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (c : π•œ) (x : β†₯A.domain) :
‖↑(RCLike.re c) β€’ ↑x - ↑A xβ€– ≀ β€–c β€’ ↑x - ↑A xβ€–

A shift dominates the shift by the real part of the scalar.

theorem LinearPMap.IsFormalAdjoint.norm_apply_le_mul_norm_smul_sub {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) (x : β†₯A.domain) :

A nonreal shift dominates the image, up to the constant 1 + |re c| / |im c|: together with abs_im_mul_norm_le_norm_smul_sub this bounds the graph norm max β€–xβ€– β€–A xβ€– by the shift.

theorem LinearPMap.IsFormalAdjoint.isClosed_range_smul_sub {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) (hcl : A.IsClosed) {c : π•œ} (hc : RCLike.im c β‰  0) :
_root_.IsClosed (Set.range fun (x : β†₯A.domain) => c β€’ ↑x - ↑A x)

The range of a nonreal shift of a closed, formally self-adjoint partial linear map is closed: the shift is bounded below with respect to the graph norm (LinearPMap.isClosed_range_smul_sub_of_graph_norm_le).

theorem LinearPMap.IsFormalAdjoint.eq_zero_of_apply_eq_smul {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {A : E β†’β‚—.[π•œ] E} (hA : A.IsFormalAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) {x : β†₯A.domain} (h : ↑A x = c β€’ ↑x) :
↑x = 0

A symmetric operator has no nonreal eigenvalue: the quadratic form at an eigenvector for c is c * β€–xβ€–Β², whose imaginary part vanishes only if x = 0.

theorem IsSelfAdjoint.denseRange_smul_sub {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {A : E β†’β‚—.[π•œ] E} (hA : IsSelfAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) :
DenseRange fun (x : β†₯A.domain) => c β€’ ↑x - ↑A x

The range of a nonreal shift of a self-adjoint partial linear map is dense.

theorem IsSelfAdjoint.smul_sub_surjective {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {A : E β†’β‚—.[π•œ] E} (hA : IsSelfAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) :
Function.Surjective fun (x : β†₯A.domain) => c β€’ ↑x - ↑A x

Nonreal shifts of a self-adjoint partial linear map are surjective: their ranges are closed and dense.

theorem IsSelfAdjoint.smul_sub_bijective {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {A : E β†’β‚—.[π•œ] E} (hA : IsSelfAdjoint A) {c : π•œ} (hc : RCLike.im c β‰  0) :
Function.Bijective fun (x : β†₯A.domain) => c β€’ ↑x - ↑A x

Nonreal shifts of a self-adjoint partial linear map are bijective. Together with the lower bound IsFormalAdjoint.abs_im_mul_norm_le_norm_smul_sub, which bounds the inverse by |im c|⁻¹, this says that the resolvent set of a self-adjoint operator contains every nonreal point.

theorem LinearPMap.adjoint_smul {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace π•œ F] [CompleteSpace E] {T : E β†’β‚—.[π•œ] F} (hT : Dense ↑T.domain) {c : π•œ} (hc : c β‰  0) :

The adjoint of a scalar multiple. For a densely defined partial linear map T and a nonzero scalar c, (c β€’ T)† = conj c β€’ T†; in particular the two adjoints have the same domain.

theorem LinearPMap.dense_domain_of_adjoint_eq_neg {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {G : E β†’β‚—.[π•œ] E} (hG : G.adjoint = -G) :
Dense ↑G.domain

A partial linear map whose adjoint is its negative has dense domain: otherwise the adjoint is the junk value 0, so the map vanishes and every vector lies in the adjoint domain.

theorem LinearPMap.isSelfAdjoint_smul_of_adjoint_eq_neg {π•œ : Type u_1} {E : Type u_2} [RCLike π•œ] [NormedAddCommGroup E] [InnerProductSpace π•œ E] [CompleteSpace E] {G : E β†’β‚—.[π•œ] E} {c : π•œ} (hre : RCLike.re c = 0) (hc : c β‰  0) (hG : G.adjoint = -G) :

A skew-adjoint map times a nonzero purely imaginary scalar is self-adjoint: if G† = -G and re c = 0, c β‰  0, then c β€’ G is self-adjoint. At c = Β± i this recovers the self-adjoint operator behind a skew-adjoint generator.