Relative monotonicity of secular determinants of quantum graphs Present by Yaqi Dai

advertisement
Relative monotonicity of
secular determinants of
quantum graphs
Present by Yaqi Dai
Supervisor : Professor Berkolaiko
Motivation
ο‚΄ Quantum graph provides useful models for complex systems in the fields of
natural science, engineering and social sciences
ο‚΄ In the long term, our project is to find a more efficient algorithm of
computing eigenvalues of quantum graphs
ο‚΄ we conjectured that the secular determinants of quantum graphs are
relatively monotonic
Background
DEFINITION: Quantum graph (V,E) ,where V is the set of vertices and E
is the set of edges, is a metric graph equipped with a Hamiltonian
operator H (1) , accompanied by “appropriate” vertex conditions (2).
ο‚΄ eigenvalue equation for the Schrödinger operator:
(1)
𝑑2 𝑓
− 2
𝑑π‘₯
+ 𝑉 π‘₯ βˆ™ 𝑓 π‘₯ = π‘˜ 2 βˆ™ 𝑓(π‘₯)
ο‚΄ (2) Vertex conditions:
ο‚΄ Neumann condition:
𝑓 π‘₯ is continuous on
and at each vertex v one has
ο‚΄ Dirichlet condition:
𝑓 π‘₯ is continuous on
and 𝑓
𝑣 =0
𝑑𝑓
𝑒∈𝐸𝑣 𝑑π‘₯ (𝑣)
𝑒
=0
A trivial example: interval
(1)
𝐿
𝑉 π‘₯ ≡ 0;
Solution for −𝑓 ′′ = π‘˜ 2 𝑓 on 𝐿:
𝐴
𝐡
(2)
𝑓 π‘₯ = 𝐢1 cos π‘˜π‘₯ + 𝐢2 sin(π‘˜π‘₯)
Apply vertex conditions:
Figure 1. interval [0,L],
Neumann condition on endpoints
A,B, and 0 corresponding A ;
(3)
𝑓′ 0 = 0
(4)
−𝑓 ′ 𝐿 = 0
we can solve eigenvalues:
(5)
πœ‹π‘›
π‘˜ 2 = ( 𝐿 )2
,𝑛 ∈ 𝑁
Example: Lasso graph
Solution for −𝑓 ′′ = π‘˜ 2 𝑓 on 𝐿1 , 𝐿2 :
2
1
𝐴
𝐿1
𝐿2
𝐡
1
2
Figure 2. (V,E) Lasso graph
V={A,B} ; E={[0, 𝐿1 ], [0, 𝐿2 ]} where 0
corresponding connected point ;
Neumann condition on vertices
(6)
𝑓1 = π‘Ž1 βˆ™ 𝑒 π‘–π‘˜π‘₯ + π‘Ž1 βˆ™ 𝑒 π‘–π‘˜(𝐿1−π‘₯)
(7)
𝑓2 = π‘Ž2 βˆ™ 𝑒 π‘–π‘˜π‘₯ + π‘Ž2 βˆ™ 𝑒 π‘–π‘˜(𝐿2−π‘₯)
Apply vertex condition:
(8)
−𝑓1′ 𝐿1 = −π‘–π‘˜π‘Ž1 𝑒 π‘–π‘˜πΏ1 + π‘–π‘˜π‘Ž1 = 0
(9)
𝑓1′ 0 + 𝑓2′ 0 − 𝑓2′ 𝐿2 = 0
(10)
𝑓1 0 = 𝑓2 0 = 𝑓2 (𝐿2 )
Example: Lasso graph
2
1
𝐴
We get the system
𝐿1
𝐿2
𝐡
1
2
3
2
3
π‘Ž1 =
(12)
π‘Ž1 = π‘Ž1 𝑒 π‘–π‘˜πΏ1
(13)
π‘Ž2 =
2
π‘Ž1 𝑒 π‘–π‘˜πΏ1
3
+ π‘Ž2 𝑒 π‘–π‘˜πΏ2 − π‘Ž2 𝑒 π‘–π‘˜πΏ2
(14)
π‘Ž2 =
2
π‘Ž1 𝑒 π‘–π‘˜πΏ1
3
− π‘Ž2 𝑒 π‘–π‘˜πΏ2 + π‘Ž2 𝑒 π‘–π‘˜πΏ2
2
Figure 2. (V,E) Lasso graph
V={A,B} ; E={[0, 𝐿1 ], [0, 𝐿2 ]}
where 0 corresponding
connected point ; Neumann
condition on vertices
1
3
− π‘Ž1 𝑒 π‘–π‘˜πΏ1 + π‘Ž2 𝑒 π‘–π‘˜πΏ2 + π‘Ž2 𝑒 π‘–π‘˜πΏ2
(11)
2
3
1
3
1
3
2
3
Example: Lasso graph
2
1
𝐴
The system can be written as:
(15)
𝐿1
𝐿2
𝐡
1
2
Figure 2. (V,E) Lasso graph
V={A,B} ; E={[0, 𝐿1 ], [0, 𝐿2 ]}
where 0 corresponding
connected point ; Neumann
condition on vertices
Notation:
𝑆
𝐷(π‘˜)
π‘˜ 2 (π‘˜ ≠ 0) is the eigenvalue of the graph iff
𝐝𝐞𝐭 𝑰 − 𝑺𝑫 π’Œ = 𝟎, we call the determinant
secular determinant.
Secular determinant (Neumann condition graph)
For the general Neumann condition graph (V,E), first consider the single vertex in
(V,E), which has d edges attach to it. Denote the length of j-th edge is 𝐿𝑗 ,
the solution on j-th edge:
(16)
𝑓𝑗 = π‘Žπ‘— βˆ™ 𝑒 π‘–π‘˜π‘₯ + π‘Žπ‘— βˆ™ 𝑒 π‘–π‘˜(𝐿𝑗 −π‘₯)
Apply the vertex condition:
(17)
(18)
𝑑
𝑗=1 π‘Žπ‘—
−
𝑑
π‘–π‘˜πΏπ‘—
𝑗=1 π‘Žπ‘— 𝑒
=0
π‘Žπ‘— + π‘Žπ‘— 𝑒 π‘–π‘˜πΏπ‘— = π‘Žπ‘™ + π‘Žπ‘™ 𝑒 π‘–π‘˜πΏπ‘™ , for ∀𝑙, π‘˜ ∈ 𝑁 ∗ π‘Žπ‘›π‘‘ 𝑙, π‘˜ ≤ 𝑑
By (16)&(17)&(18) we solving π‘Žπ‘› for 1 ≤ 𝑛 ≤ 𝑑:
(19)
Figure 3. a vertex with
Neumann condition c
π‘Žπ‘› = −π‘Žπ‘› 𝑒 π‘–π‘˜πΏπ‘› +
2
𝑑
𝑑
π‘–π‘˜πΏπ‘—
𝑗=1 π‘Žπ‘— 𝑒
Secular determinant (Neumann condition graph)
Then we consider the whole graph
𝑏
𝑉, 𝐸
𝑏
In the 2|E|-dimensional complex space, with dimensions indexed by the
directed edges. we get 2 𝐸 × 2|𝐸| matrix S and D(k)for 𝑉, 𝐸 :
(20)
𝐷(π‘˜)𝑏,𝑏 = 𝑒 π‘–π‘˜πΏπ‘
(21)
𝑆𝑏′ ,𝑏 =
The secular determinant is 𝐝𝐞𝐭 𝑰 − 𝑺𝑫 π’Œ
2
−1
𝑑
if 𝑏′ = 𝑏
2
𝑑
if 𝑏′ follows 𝑏 and 𝑏′ ≠ 𝑏
0
otherwise
Proposal
ο‚΄ Change a vertex condition (Neumann condition to Dirichlet condition )
e.g.
𝜏′
𝜏
Figure 4.
Conjecture:
Define a quantum graph 𝜏 with Neumann condition on its vertices, obtained
the quantum graph 𝜏 ′ by changing one of the vertices condition to Dirichlet
condition.
Define
𝑓 π‘˜ =
det(𝐼−π‘†πœ 𝐷𝜏 (π‘˜))
det(𝐼−π‘†πœ′ 𝐷𝜏′ (π‘˜))
,
and
f(k)
derivatives except the location where π‘˜ 2 is eigenvalue of 𝜏 ′ .
p
o
l
e
s
has
negative
.
Application
𝜏′
𝜏
π‘˜π‘™′
π‘˜π‘™
Graph 1. part of the graph for f(k)
′
π‘˜π‘™+1
det(𝐼 − π‘†πœ 𝐷𝜏 (π‘˜))
𝑓 π‘˜ =
det(𝐼 − π‘†πœ′ 𝐷𝜏′ (π‘˜))
There is only one eigenvalue lies
between two poles and the
derivative is always negative.
Using Secant Algorithm can easily
solve this eigenvalue
Application
……
To find the eigenvalues of a complicated quantum graph, we can always
“break it down” into trivial intervals, and iteratively we solve the
eigenvalues.
Acknowledgement
Supervisor: Professor Berkolaiko
An analogous result in the case of matrix
Theorem:
Define a vector 𝑉 ∈ 𝐢 𝑛 , obtained matrix B by 𝐡 = 𝑉 βˆ™ 𝑉 𝑇 , for any real
det(𝐴+𝐡−πœ†πΌ)
Hermitian matrix 𝐴 ∈ 𝐢 𝑛×𝑛 , we have the function 𝑓 πœ† = det(𝐴−πœ†πΌ) has
negative derivatives except for the locations λ is the eigenvalue for A.
Secular Determinant
𝑏′
𝑏
𝑆𝑏′ ,𝑏 = 0
𝑏
𝑆𝑏′ ,𝑏 =
2
−1
𝑑
if 𝑏′ = 𝑏
𝑆𝑏′ ,𝑏 =
2
𝑑
if 𝑏′ follows 𝑏 and 𝑏′ ≠ 𝑏
𝑏
𝑏
𝑏′
Download