Non-self-adjoint graphs Petr Siegl Mathematical Institute, - - PowerPoint PPT Presentation

non self adjoint graphs
SMART_READER_LITE
LIVE PREVIEW

Non-self-adjoint graphs Petr Siegl Mathematical Institute, - - PowerPoint PPT Presentation

Non-self-adjoint graphs Petr Siegl Mathematical Institute, University of Bern, Switzerland http://gemma.ujf.cas.cz/siegl/ Based on [1] A. Hussein, D. Krej ci r k and P. Siegl: Non-self-adjoint graphs , Transactions of the AMS 367,


slide-1
SLIDE 1

Non-self-adjoint graphs

Petr Siegl Mathematical Institute, University of Bern, Switzerland http://gemma.ujf.cas.cz/˜siegl/ Based on [1] A. Hussein, D. Krejˇ ciˇ r´ ık and P. Siegl: Non-self-adjoint graphs, Transactions of the AMS 367, (2015) 2921-2957

slide-2
SLIDE 2

Outline

  • 1. Introduction and “the example”
  • 2. Classes of boundary conditions
  • 3. Spectral properties
  • 4. Similarity transforms
slide-3
SLIDE 3

Outline

  • 1. Introduction and “the example”
  • 2. Classes of boundary conditions
  • 3. Spectral properties
  • 4. Similarity transforms

−∆ ≡ − d2 dx2 + boundary/vertex conditions in L2(G)

G

L2(G) = ⊕N

j=1L2((0, aj)),

aj ∈ (0, +∞], N = #edges < ∞

slide-4
SLIDE 4

Introduction

Non-self-adjoint graphs

  • “fundamental non-self-adjointness”:
  • non-symmetric boundary/vertex conditions, e.g. complex δ-interactions
  • no problems with too little or too many conditions
  • 1S. Albeverio, S. M. Fei, and P. Kurasov. Lett. Math. Phys. 59 (2002), pp. 227–242;
  • S. Albeverio, U. Gunther, and S. Kuzhel. J. Phys. A: Math. Theor. 42 (2009), 105205 (22pp);
  • S. Albeverio and S. Kuzhel. J. Phys. A: Math. Gen. 38 (2005), pp. 4975–4988; A. V. Kiselev.
  • Op. Theory: Adv. and Appl. 186 (2008), pp. 267–283; S. Kuzhel and C. Trunk. J. Math. Anal.
  • Appl. 379 (2011), pp. 272–289.
  • 2A. Hussein. J. Evol. Equ. 14 (2014), pp. 477–497; V. Kostrykin, J. Potthoff, and
  • R. Schrader. J. Math. Phys. 53 (2012), p. 095206; V. Kostrykin, J. Potthoff, and R. Schrader.
  • Proc. Symp. in Pure Math. 77 (2008), pp. 423–458; V. Kostrykin, J. Potthoff, and R. Schrader.

Adventures in math. phys. Vol. 447. Contemp. Math. AMS, Providence, 2007, pp. 175–198.

  • 3P. Freitas and J. Lipovsk´
  • y. arXiv:1307.6377.
slide-5
SLIDE 5

Introduction

Non-self-adjoint graphs

  • “fundamental non-self-adjointness”:
  • non-symmetric boundary/vertex conditions, e.g. complex δ-interactions
  • no problems with too little or too many conditions
  • motivation for complex potentials/interactions:
  • electromagnetism, optics with losses and gains
  • superconductivity, damped wave equation
  • stochastic processes
  • open quantum systems, effective models
  • existing literature
  • non-self-adjoint point interactions1
  • m-accretive and m-dissipative graphs2
  • damped wave equation on graphs3
  • 1S. Albeverio, S. M. Fei, and P. Kurasov. Lett. Math. Phys. 59 (2002), pp. 227–242;
  • S. Albeverio, U. Gunther, and S. Kuzhel. J. Phys. A: Math. Theor. 42 (2009), 105205 (22pp);
  • S. Albeverio and S. Kuzhel. J. Phys. A: Math. Gen. 38 (2005), pp. 4975–4988; A. V. Kiselev.
  • Op. Theory: Adv. and Appl. 186 (2008), pp. 267–283; S. Kuzhel and C. Trunk. J. Math. Anal.
  • Appl. 379 (2011), pp. 272–289.
  • 2A. Hussein. J. Evol. Equ. 14 (2014), pp. 477–497; V. Kostrykin, J. Potthoff, and
  • R. Schrader. J. Math. Phys. 53 (2012), p. 095206; V. Kostrykin, J. Potthoff, and R. Schrader.
  • Proc. Symp. in Pure Math. 77 (2008), pp. 423–458; V. Kostrykin, J. Potthoff, and R. Schrader.

Adventures in math. phys. Vol. 447. Contemp. Math. AMS, Providence, 2007, pp. 175–198.

  • 3P. Freitas and J. Lipovsk´
  • y. arXiv:1307.6377.
slide-6
SLIDE 6

Basic concepts

Minimal and maximal operators

  • minimal operator

Dom(−∆min) = W 2,2 (G) := ⊕N

j=1W 2,2

((0, aj)) (−∆minψ)j := −ψ′′

j

slide-7
SLIDE 7

Basic concepts

Minimal and maximal operators

  • minimal operator

Dom(−∆min) = W 2,2 (G) := ⊕N

j=1W 2,2

((0, aj)) (−∆minψ)j := −ψ′′

j

  • maximal operator

Dom(−∆max) = W 2,2(G) := ⊕N

j=1W 2,2((0, aj))

(−∆maxψ)j := −ψ′′

j

  • −∆min is symmetric, closed with def. indices (d, d)

d = (#unbounded edges) + 2(#bounded edges)

slide-8
SLIDE 8

Basic concepts

Minimal and maximal operators

  • minimal operator

Dom(−∆min) = W 2,2 (G) := ⊕N

j=1W 2,2

((0, aj)) (−∆minψ)j := −ψ′′

j

  • maximal operator

Dom(−∆max) = W 2,2(G) := ⊕N

j=1W 2,2((0, aj))

(−∆maxψ)j := −ψ′′

j

  • −∆min is symmetric, closed with def. indices (d, d)

d = (#unbounded edges) + 2(#bounded edges) Our Laplacians −∆min ⊂ −∆M ⊂ −∆max, ∆M = ∆∗

M

Dom(−∆M) := {ψ ∈ Dom(−∆max) : [ψ] ⊕ [ψ′] ∈ M ⊂ C2d} we assume : dim M = d

slide-9
SLIDE 9

“The example”

τ-interaction4

τ ψ1 ψ2

ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0) ,

τ ∈ [0, π/2]

  • 4S. Albeverio, S. M. Fei, and P. Kurasov. Lett. Math. Phys. 59 (2002), pp. 227–242;
  • S. Albeverio and S. Kuzhel. J. Phys. A: Math. Gen. 38 (2005), pp. 4975–4988; S. Kuzhel and
  • C. Trunk. J. Math. Anal. Appl. 379 (2011), pp. 272–289; P. Siegl. J. Phys. A: Math. Theor. 41

(2008), 244025 (11pp).

slide-10
SLIDE 10

“The example”

τ-interaction4

τ ψ1 ψ2

ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0) ,

τ ∈ [0, π/2]

  • τ = 0:
  • −∆M = −∆∗

M = −∆R with σ(−∆M) = [0, +∞)

  • QM[ψ] = ψ′2

L2(G)

  • 4S. Albeverio, S. M. Fei, and P. Kurasov. Lett. Math. Phys. 59 (2002), pp. 227–242;
  • S. Albeverio and S. Kuzhel. J. Phys. A: Math. Gen. 38 (2005), pp. 4975–4988; S. Kuzhel and
  • C. Trunk. J. Math. Anal. Appl. 379 (2011), pp. 272–289; P. Siegl. J. Phys. A: Math. Theor. 41

(2008), 244025 (11pp).

slide-11
SLIDE 11

“The example”

τ-interaction4

τ ψ1 ψ2

ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0) ,

τ ∈ [0, π/2]

  • τ = 0:
  • −∆M = −∆∗

M = −∆R with σ(−∆M) = [0, +∞)

  • QM[ψ] = ψ′2

L2(G)

  • τ ∈ (0, π/2):
  • −∆M = −∆∗

M with σ(−∆M) = [0, +∞)

  • in fact:

−∆M ∼ −∆R : Φ−1(−∆M)Φ = −∆R Φ, Φ−1 ∈ B(L2(G))

  • QM[ψ] = ψ′2

L2(G) + (1 − e2iτ)ψ2(0) ψ′ 2(0)

  • cannot be defined through sectorial forms:

Num(−∆M) = C

  • 4S. Albeverio, S. M. Fei, and P. Kurasov. Lett. Math. Phys. 59 (2002), pp. 227–242;
  • S. Albeverio and S. Kuzhel. J. Phys. A: Math. Gen. 38 (2005), pp. 4975–4988; S. Kuzhel and
  • C. Trunk. J. Math. Anal. Appl. 379 (2011), pp. 272–289; P. Siegl. J. Phys. A: Math. Theor. 41

(2008), 244025 (11pp).

slide-12
SLIDE 12

“The example”

τ-interaction4

τ ψ1 ψ2

ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0) ,

τ ∈ [0, π/2]

  • τ = 0:
  • −∆M = −∆∗

M = −∆R with σ(−∆M) = [0, +∞)

  • QM[ψ] = ψ′2

L2(G)

  • τ ∈ (0, π/2):
  • −∆M = −∆∗

M with σ(−∆M) = [0, +∞)

  • in fact:

−∆M ∼ −∆R : Φ−1(−∆M)Φ = −∆R Φ, Φ−1 ∈ B(L2(G))

  • QM[ψ] = ψ′2

L2(G) + (1 − e2iτ)ψ2(0) ψ′ 2(0)

  • cannot be defined through sectorial forms:

Num(−∆M) = C

  • τ = π/2:
  • −∆M = −∆∗

M with σ(−∆M) = [0, +∞) ∪ C \ [0, +∞) = C

  • no sectorial forms: Num(−∆M) = C
  • 4S. Albeverio, S. M. Fei, and P. Kurasov. Lett. Math. Phys. 59 (2002), pp. 227–242;
  • S. Albeverio and S. Kuzhel. J. Phys. A: Math. Gen. 38 (2005), pp. 4975–4988; S. Kuzhel and
  • C. Trunk. J. Math. Anal. Appl. 379 (2011), pp. 272–289; P. Siegl. J. Phys. A: Math. Theor. 41

(2008), 244025 (11pp).

slide-13
SLIDE 13

Classes of boundary conditions

Boundary conditions

  • subspaces M parametrized by matrices A, B ∈ Cd×d, M = M(A, B)

Dom(−∆(A, B)) = ψ ∈ Dom(−∆max) : A[ψ] + B[ψ′] = 0 ✶ ✶

  • 5V. Kostrykin and R. Schrader. J. Phys. A: Math. Gen. 32 (1999), pp. 595–630.
  • 6P. Kuchment. Waves Random Media 14 (2004), pp. 107–128.
slide-14
SLIDE 14

Classes of boundary conditions

Boundary conditions

  • subspaces M parametrized by matrices A, B ∈ Cd×d, M = M(A, B)

Dom(−∆(A, B)) = ψ ∈ Dom(−∆max) : A[ψ] + B[ψ′] = 0 Self-adjoint case: −∆(A, B) = −∆(A, B)∗ ⇐ ⇒ (A,B) parametrization5: AB∗ = BA∗ ✶ ✶

  • 5V. Kostrykin and R. Schrader. J. Phys. A: Math. Gen. 32 (1999), pp. 595–630.
  • 6P. Kuchment. Waves Random Media 14 (2004), pp. 107–128.
slide-15
SLIDE 15

Classes of boundary conditions

Boundary conditions

  • subspaces M parametrized by matrices A, B ∈ Cd×d, M = M(A, B)

Dom(−∆(A, B)) = ψ ∈ Dom(−∆max) : A[ψ] + B[ψ′] = 0 Self-adjoint case: −∆(A, B) = −∆(A, B)∗ ⇐ ⇒ (A,B) parametrization5: AB∗ = BA∗ ⇐ ⇒ Cayley transform: S ≡ U unitary S := − (A + ikB)−1 (A − ikB) , k > 0 − 1 2 (U − ✶) [ψ] + 1 2ik (U + ✶) [ψ′] = 0

  • 5V. Kostrykin and R. Schrader. J. Phys. A: Math. Gen. 32 (1999), pp. 595–630.
  • 6P. Kuchment. Waves Random Media 14 (2004), pp. 107–128.
slide-16
SLIDE 16

Classes of boundary conditions

Boundary conditions

  • subspaces M parametrized by matrices A, B ∈ Cd×d, M = M(A, B)

Dom(−∆(A, B)) = ψ ∈ Dom(−∆max) : A[ψ] + B[ψ′] = 0 Self-adjoint case: −∆(A, B) = −∆(A, B)∗ ⇐ ⇒ (A,B) parametrization5: AB∗ = BA∗ ⇐ ⇒ Cayley transform: S ≡ U unitary S := − (A + ikB)−1 (A − ikB) , k > 0 − 1 2 (U − ✶) [ψ] + 1 2ik (U + ✶) [ψ′] = 0 ⇐ ⇒ m-sectorial parametrization6: (A, B) ≃ (L + P, P ⊥) QM[ψ] = ψ′2

L2(G) − LP ⊥[ψ], P ⊥[ψ]Cd

  • 5V. Kostrykin and R. Schrader. J. Phys. A: Math. Gen. 32 (1999), pp. 595–630.
  • 6P. Kuchment. Waves Random Media 14 (2004), pp. 107–128.
slide-17
SLIDE 17

Classes of boundary conditions

Regular boundary conditions

  • BC defined by A, B are regular if

i) dim M(A, B) = d ii) for some k ∈ C, A + ikB is invertible

slide-18
SLIDE 18

Classes of boundary conditions

Regular boundary conditions

  • BC defined by A, B are regular if

i) dim M(A, B) = d ii) for some k ∈ C, A + ikB is invertible

  • the Cayley transform S = − (A + ikB)−1 (A − ikB) exists
  • any self-adjoint BC are regular
  • τ-interaction is regular iff τ ∈ [0, π/2)
slide-19
SLIDE 19

Classes of boundary conditions

Regular boundary conditions

  • BC defined by A, B are regular if

i) dim M(A, B) = d ii) for some k ∈ C, A + ikB is invertible

  • the Cayley transform S = − (A + ikB)−1 (A − ikB) exists
  • any self-adjoint BC are regular
  • τ-interaction is regular iff τ ∈ [0, π/2)

Irregular boundary conditions

  • BC defined by A, B are irregular if

i) dim M(A, B) = d ii) A + ikB is not invertible for any k ∈ C

slide-20
SLIDE 20

Classes of boundary conditions

Regular boundary conditions

  • BC defined by A, B are regular if

i) dim M(A, B) = d ii) for some k ∈ C, A + ikB is invertible

  • the Cayley transform S = − (A + ikB)−1 (A − ikB) exists
  • any self-adjoint BC are regular
  • τ-interaction is regular iff τ ∈ [0, π/2)

Irregular boundary conditions

  • BC defined by A, B are irregular if

i) dim M(A, B) = d ii) A + ikB is not invertible for any k ∈ C ⇔ KerA ∩ KerB = {0}

  • τ-interaction is irregular iff τ = π/2
slide-21
SLIDE 21

Classes of boundary conditions

Regular boundary conditions

  • BC defined by A, B are regular if

i) dim M(A, B) = d ii) for some k ∈ C, A + ikB is invertible

  • the Cayley transform S = − (A + ikB)−1 (A − ikB) exists
  • any self-adjoint BC are regular
  • τ-interaction is regular iff τ ∈ [0, π/2)

Irregular boundary conditions

  • BC defined by A, B are irregular if

i) dim M(A, B) = d ii) A + ikB is not invertible for any k ∈ C ⇔ KerA ∩ KerB = {0}

  • τ-interaction is irregular iff τ = π/2

m-sectorial boundary conditions

  • regular BC are called m-sectorial if (A, B) ≃ (L + P, P ⊥)
  • all self-adjoint BC are m-sectorial
  • τ-interaction is m-sectorial iff τ = 0
slide-22
SLIDE 22

Examples

Totally degenerated7 BC - irregular

  • BC: ψ(0) = 0, ψ′(0) = 0,

A =

1

  • , B =

1

  • dim M(A, B) = 2 = d and A + ikB is not invertible for any k ∈ C
  • spectral pathology:

σ(−∆(A, B)) = ∅

  • 7N. Dunford and J. T. Schwartz. Linear Operators, Part 3, Spectral Operators.

Wiley-Interscience, 1971.

  • 8S. Kuzhel and C. Trunk. J. Math. Anal. Appl. 379 (2011), pp. 272–289.
slide-23
SLIDE 23

Examples

Totally degenerated7 BC - irregular

  • BC: ψ(0) = 0, ψ′(0) = 0,

A =

1

  • , B =

1

  • dim M(A, B) = 2 = d and A + ikB is not invertible for any k ∈ C
  • spectral pathology:

σ(−∆(A, B)) = ∅ Indefinite Laplacian8 - irregular

  • BC: ψ1(0) = ψ2(0), ψ′

1(0) = ψ′ 2(0),

A =

1

−1

  • , B =

1 −1

  • spectral pathology:

σ(−∆(A, B)) = C

  • −∆(A, B) ≃ − sgn(x) d

dx sgn(x) d dx in L2(R)

  • 7N. Dunford and J. T. Schwartz. Linear Operators, Part 3, Spectral Operators.

Wiley-Interscience, 1971.

  • 8S. Kuzhel and C. Trunk. J. Math. Anal. Appl. 379 (2011), pp. 272–289.
slide-24
SLIDE 24

Examples

Complex δ-interaction - m-sectorial ψ1(0) = ψ2(0) = · · · = ψN(0)

N

  • i=1

ψ′

i(0) = γψ1(0),

γ ∈ C A =

    

1 −1 . . . 1 −1 . . . . . . . . . . . . . . . . 1 −1 −γ . . .

    

, B =

    

. . . . . . . . . . . . . . . . . . . 1 1 1 . . . 1 1

    

slide-25
SLIDE 25

Examples

Complex δ-interaction - m-sectorial ψ1(0) = ψ2(0) = · · · = ψN(0)

N

  • i=1

ψ′

i(0) = γψ1(0),

γ ∈ C A =

    

1 −1 . . . 1 −1 . . . . . . . . . . . . . . . . 1 −1 −γ . . .

    

, B =

    

. . . . . . . . . . . . . . . . . . . 1 1 1 . . . 1 1

    

σ(−∆(A, B)) =

  • {−(γ/N)2} ∪ [0, ∞),

if Re γ < 0 [0, ∞), if Re γ ≥ 0

slide-26
SLIDE 26

Spectral properties for regular BC

Point spectrum

  • σp(−∆(A, B)) is discrete set ( = C ) and

λ ∈ σp(−∆(A, B)) \ [0, ∞) ⇐ ⇒ λ ∈ σp(−∆(A, B)∗) \ [0, ∞)

slide-27
SLIDE 27

Spectral properties for regular BC

Point spectrum

  • σp(−∆(A, B)) is discrete set ( = C ) and

λ ∈ σp(−∆(A, B)) \ [0, ∞) ⇐ ⇒ λ ∈ σp(−∆(A, B)∗) \ [0, ∞) Residual spectrum

  • σr(−∆(A, B)) ⊂ [0, ∞) (discrete subset)
  • σr(−∆(A, B)) = ∅ if there are no bounded/unbounded edges
  • σr(−∆(A, B)) may be non-empty!
slide-28
SLIDE 28

Spectral properties for regular BC

Point spectrum

  • σp(−∆(A, B)) is discrete set ( = C ) and

λ ∈ σp(−∆(A, B)) \ [0, ∞) ⇐ ⇒ λ ∈ σp(−∆(A, B)∗) \ [0, ∞) Residual spectrum

  • σr(−∆(A, B)) ⊂ [0, ∞) (discrete subset)
  • σr(−∆(A, B)) = ∅ if there are no bounded/unbounded edges
  • σr(−∆(A, B)) may be non-empty!

Essential spectrum

  • warning: at least 5 different definitions of essential spectrum of nsa operators!
  • σe5: complement of isolated eigenvalues of finite algebraic multiplicity

σe5(−∆(A, B)) =

if there are no unbounded edges [0, ∞) if there is an unbounded edge

slide-29
SLIDE 29

Spectral properties

M-sectorial complex Robin BC9 ψ′(0) + iαψ(0) = 0 ψ′(π) + iαψ(π) = 0, α ∈ R A =

−iα

  • ,

B =

1

1

  • 9D. Krejˇ

ciˇ r´ ık. J. Phys. A: Math. Theor. 41 (2008), p. 244012; D. Krejˇ ciˇ r´ ık, H. B´ ıla, and

  • M. Znojil. J. Phys. A: Math. Gen. 39 (2006), pp. 10143–10153; D. Krejˇ

ciˇ r´ ık, P. Siegl, and

  • J. ˇ

Zelezn´

  • y. Complex Anal. Oper. Theory 8 (2014), pp. 255–281.
slide-30
SLIDE 30

Spectral properties

M-sectorial complex Robin BC9 ψ′(0) + iαψ(0) = 0 ψ′(π) + iαψ(π) = 0, α ∈ R A =

−iα

  • ,

B =

1

1

  • σ(−∆(A, B)) = {α2} ∪ {n2}n∈N ⊂ R

ψn(x) =

  • eiαx,

n = 0 cos(nx) − i α

n sin(nx),

n ∈ N.

1 2 3 4 5 Α 5 10 15 20 Λ

  • 9D. Krejˇ

ciˇ r´ ık. J. Phys. A: Math. Theor. 41 (2008), p. 244012; D. Krejˇ ciˇ r´ ık, H. B´ ıla, and

  • M. Znojil. J. Phys. A: Math. Gen. 39 (2006), pp. 10143–10153; D. Krejˇ

ciˇ r´ ık, P. Siegl, and

  • J. ˇ

Zelezn´

  • y. Complex Anal. Oper. Theory 8 (2014), pp. 255–281.
slide-31
SLIDE 31

Spectral properties

M-sectorial complex Robin BC9 ψ′(0) + iαψ(0) = 0 ψ′(π) + iαψ(π) = 0, α ∈ R A =

−iα

  • ,

B =

1

1

  • σ(−∆(A, B)) = {α2} ∪ {n2}n∈N ⊂ R

ψn(x) =

  • eiαx,

n = 0 cos(nx) − i α

n sin(nx),

n ∈ N.

1 2 3 4 5 Α 5 10 15 20 Λ

More than real spectrum

  • eigenfunctions {ψn}n∈N0 form a Riesz basis

⇒ similarity to a self-adjoint operator −∆(A, B) ∼ −∆N + α2 π ·, 1, α / ∈ Z \ {0}

  • 9D. Krejˇ

ciˇ r´ ık. J. Phys. A: Math. Theor. 41 (2008), p. 244012; D. Krejˇ ciˇ r´ ık, H. B´ ıla, and

  • M. Znojil. J. Phys. A: Math. Gen. 39 (2006), pp. 10143–10153; D. Krejˇ

ciˇ r´ ık, P. Siegl, and

  • J. ˇ

Zelezn´

  • y. Complex Anal. Oper. Theory 8 (2014), pp. 255–281.
slide-32
SLIDE 32

Spectral properties

Graph with residual spectrum ψ1 ψ2 −∆(A, B) ψ′

1(0) + iαψ1(0) = 0

ψ′

1(π) + iαψ1(π) = 0

−ψ1(π) = ψ′

2(0)

A =

−iα 1

  • B =
  • 1

1 1

slide-33
SLIDE 33

Spectral properties

Graph with residual spectrum ψ1 ψ2 −∆(A, B) ψ′

1(0) + iαψ1(0) = 0

ψ′

1(π) + iαψ1(π) = 0

−ψ1(π) = ψ′

2(0)

A =

−iα 1

  • B =
  • 1

1 1

  • −∆(A, B)∗

ψ′

1(0) − iαψ1(0) = 0

ψ′

1(π) − iαψ1(π) = 0

0 = ψ′

2(0)

A∗ =

  • −iα

iα 1

  • B∗ =
  • 1

1 1

slide-34
SLIDE 34

Spectral properties

Graph with residual spectrum ψ1 ψ2 −∆(A, B) ψ′

1(0) + iαψ1(0) = 0

ψ′

1(π) + iαψ1(π) = 0

−ψ1(π) = ψ′

2(0)

A =

−iα 1

  • B =
  • 1

1 1

  • −∆(A, B)∗

ψ′

1(0) − iαψ1(0) = 0

ψ′

1(π) − iαψ1(π) = 0

0 = ψ′

2(0)

A∗ =

  • −iα

iα 1

  • B∗ =
  • 1

1 1

  • same spectra: σ(−∆(A, B)) = σ(−∆(A, B)∗) = [0, ∞)
slide-35
SLIDE 35

Spectral properties

Graph with residual spectrum ψ1 ψ2 −∆(A, B) ψ′

1(0) + iαψ1(0) = 0

ψ′

1(π) + iαψ1(π) = 0

−ψ1(π) = ψ′

2(0)

A =

−iα 1

  • B =
  • 1

1 1

  • −∆(A, B)∗

ψ′

1(0) − iαψ1(0) = 0

ψ′

1(π) − iαψ1(π) = 0

0 = ψ′

2(0)

A∗ =

  • −iα

iα 1

  • B∗ =
  • 1

1 1

  • same spectra: σ(−∆(A, B)) = σ(−∆(A, B)∗) = [0, ∞)
  • but for point spectra:

σp(−∆(A, B)) = ∅ vs. σp(−∆(A, B)∗) = {α2} ∪ {n2}n∈N ⇒ σr(−∆(A, B)) = {α2} ∪ {n2}n∈N Recall: σr(−∆(A, B)) = {λ / ∈ σp(−∆(A, B)) : λ ∈ σp(−∆(A, B)∗)}

slide-36
SLIDE 36

Similarity transforms

Compact m-sectorial graphs

  • discrete spectrum & Riesz basis of finite dimensional invariant subspaces
  • in very special cases (complex Robin BC) ⇒ similarity to normal (or

self-adjoint) operator but typically not a graph Laplacian

slide-37
SLIDE 37

Similarity transforms

Compact m-sectorial graphs

  • discrete spectrum & Riesz basis of finite dimensional invariant subspaces
  • in very special cases (complex Robin BC) ⇒ similarity to normal (or

self-adjoint) operator but typically not a graph Laplacian Similarity of graph Laplacians: assumptions i) restriction on graphs: all bounded edges of the same length ii) similarity of matrices A, B and A′, B′ A′ = G−1AG, B′ = G−1BG where G :=

  • Gunbdd

Gbdd Gbdd

slide-38
SLIDE 38

Similarity transforms

Compact m-sectorial graphs

  • discrete spectrum & Riesz basis of finite dimensional invariant subspaces
  • in very special cases (complex Robin BC) ⇒ similarity to normal (or

self-adjoint) operator but typically not a graph Laplacian Similarity of graph Laplacians: assumptions i) restriction on graphs: all bounded edges of the same length ii) similarity of matrices A, B and A′, B′ A′ = G−1AG, B′ = G−1BG where G :=

  • Gunbdd

Gbdd Gbdd

  • Theorem: similarity of graph Laplacians

−∆(A′, B′) = Φ−1

G (−∆(A′, B′))ΦG

where (ΦGψ)(xj) :=

N

  • i=1

Gjiψi(xj)

slide-39
SLIDE 39

Similarity transforms

Corollaries for regular BC

  • sufficient to check the Cayley transform:

S = G−1UG

  • U unitary ⇒ similarity to a self-adjoint graph Laplacian
slide-40
SLIDE 40

Similarity transforms

Corollaries for regular BC

  • sufficient to check the Cayley transform:

S = G−1UG

  • U unitary ⇒ similarity to a self-adjoint graph Laplacian

Back to “the example” τ ψ1 ψ2 ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0),

τ ∈ [0, π/2] A =

1

−eiτ

  • B =

1 e−iτ

slide-41
SLIDE 41

Similarity transforms

Corollaries for regular BC

  • sufficient to check the Cayley transform:

S = G−1UG

  • U unitary ⇒ similarity to a self-adjoint graph Laplacian

Back to “the example” τ ψ1 ψ2 ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0),

τ ∈ [0, π/2] A =

1

−eiτ

  • B =

1 e−iτ

  • regular case τ ∈ [0, π/2): σ(−∆(A, B) = [0, ∞))

−∆(A, B) ∼ −∆R G =

1 √cos τ

−i cos τ

sin τ −i

slide-42
SLIDE 42

Similarity transforms

Corollaries for regular BC

  • sufficient to check the Cayley transform:

S = G−1UG

  • U unitary ⇒ similarity to a self-adjoint graph Laplacian

Back to “the example” τ ψ1 ψ2 ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0),

τ ∈ [0, π/2] A =

1

−eiτ

  • B =

1 e−iτ

  • regular case τ ∈ [0, π/2): σ(−∆(A, B) = [0, ∞))

−∆(A, B) ∼ −∆R G =

1 √cos τ

−i cos τ

sin τ −i

  • irregular case τ = π/2:

σ(−∆(A, B) = C −∆(A, B) ∼ −∆max ⊕ −∆min G =

1

1 −i i

slide-43
SLIDE 43

Similarity transforms

Corollaries for regular BC

  • sufficient to check the Cayley transform:

S = G−1UG

  • U unitary ⇒ similarity to a self-adjoint graph Laplacian

Back to “the example” τ ψ1 ψ2 ψ1(0) = eiτψ2(0), ψ′

1(0) = −e−iτψ′ 2(0),

τ ∈ [0, π/2] A =

1

−eiτ

  • B =

1 e−iτ

  • regular case τ ∈ [0, π/2): σ(−∆(A, B) = [0, ∞))

−∆(A, B) ∼ −∆R G =

1 √cos τ

−i cos τ

sin τ −i

  • irregular case τ = π/2:

σ(−∆(A, B) = C −∆(A, B) ∼ −∆max ⊕ −∆min G =

1

1 −i i

  • −∆(A, B) ∼ − sgn(x) d

dx sgn(x) d dx

G =

1

−i

slide-44
SLIDE 44

Conclusions

Regular vs. irregular boundary/vertex conditions

  • “usual” spectrum vs. possible pathologies σ(−∆) = ∅/C
  • possibly (discrete) non-empty residual spectrum in [0, ∞)
  • irregular −∆’s are strong graph limits of regular −∆’s
  • 10B. Mityagin and P. Siegl. arxiv:1608.00224. 2016.
slide-45
SLIDE 45

Conclusions

Regular vs. irregular boundary/vertex conditions

  • “usual” spectrum vs. possible pathologies σ(−∆) = ∅/C
  • possibly (discrete) non-empty residual spectrum in [0, ∞)
  • irregular −∆’s are strong graph limits of regular −∆’s

m-sectorial BC

  • proper subclass of regular BC, −∆ associated with a closed sectorial form
  • Riesz basis of finite dimensional invariant subspaces for compact graphs
  • dimensions of subspaces & asymptotics of eigenvalues10
  • 10B. Mityagin and P. Siegl. arxiv:1608.00224. 2016.
slide-46
SLIDE 46

Conclusions

Regular vs. irregular boundary/vertex conditions

  • “usual” spectrum vs. possible pathologies σ(−∆) = ∅/C
  • possibly (discrete) non-empty residual spectrum in [0, ∞)
  • irregular −∆’s are strong graph limits of regular −∆’s

m-sectorial BC

  • proper subclass of regular BC, −∆ associated with a closed sectorial form
  • Riesz basis of finite dimensional invariant subspaces for compact graphs
  • dimensions of subspaces & asymptotics of eigenvalues10

Similarity criterion (special graphs)

  • (A, B) ∼ (A′, B′) =

⇒ −∆(A, B) ∼ −∆(A′, B′)

  • irregular BC not excluded (⇒ equivalence of irregular examples in literature)
  • 10B. Mityagin and P. Siegl. arxiv:1608.00224. 2016.
slide-47
SLIDE 47

Conclusions

Regular vs. irregular boundary/vertex conditions

  • “usual” spectrum vs. possible pathologies σ(−∆) = ∅/C
  • possibly (discrete) non-empty residual spectrum in [0, ∞)
  • irregular −∆’s are strong graph limits of regular −∆’s

m-sectorial BC

  • proper subclass of regular BC, −∆ associated with a closed sectorial form
  • Riesz basis of finite dimensional invariant subspaces for compact graphs
  • dimensions of subspaces & asymptotics of eigenvalues10

Similarity criterion (special graphs)

  • (A, B) ∼ (A′, B′) =

⇒ −∆(A, B) ∼ −∆(A′, B′)

  • irregular BC not excluded (⇒ equivalence of irregular examples in literature)

Outlook ??? Schr¨

  • dinger operators on graphs: − d2

dx2 + V on edges

??? pseudospectral analysis

  • 10B. Mityagin and P. Siegl. arxiv:1608.00224. 2016.
slide-48
SLIDE 48

2017 CIRM conference

CIRM conference on

Mathematical aspects of the physics with non-self-adjoint operators

5 – 9 June 2017 Marseille, France

Marseille, colonie grecque 1869 by Pierre Puvis de Chavannes Mus´ ee des beaux-arts de Marseille

http://www.ujf.cas.cz/NSAatCIRM

Invited speakers:

Wolfgang Arendt (Ulm) Anne Sophie Bonnet-BenDhia (Paris) Lyonell Boulton (Edinburgh) Nicolas Burq (Orsay) Cristina Cˆ amara (Lisbon) A.F.M. ter Elst (Auckland) Luca Fanelli (Rome) Eduard Feireisl (Prague) Didier Felbacq (Montpellier) Eva A. Gallardo Guti´ errez (Madrid) Ilya Goldsheid (London) Bernard Helffer (Orsay) Patrick Joly (Paris) Martin Kolb (Paderborn) Vadim Kostrykin (Mainz) Stanislas Kupin (Bordeaux) Yehuda Pinchover (Haifa) Zdenˇ ek Strakoˇ s (Prague) Christiane Tretter (Bern)

Organisers:

David Krejˇ ciˇ r´ ık (Prague) Petr Siegl (Bern)

Advisory board:

Guy Bouchitt´ e (Toulon) Fritz Gesztesy (Columbia) Alain Joye (Grenoble) Luis Vega (Bilbao)

The conference is made possible by the kind financial support from and organised at:

Centre International de Rencontres Math´ ematiques