J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
P r o o f
2
S p e c i f i c c a s e s
3
S e e a l s o
4
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
C h r i s t o f f e l – D a r b o u x f o r m u l a
2 l a n g u a g e s
● C a t a l à
● T ü r k ç e
E d i t l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
( R e d i r e c t e d f r o m C h r i s t o f f e l - D a r b o u x r e l a t i o n )
In mathematics, the Christoffel–Darboux formula or Christoffel–Darboux theorem is an identity for a sequence of orthogonal polynomials , introduced by Elwin Bruno Christoffel (1858 ) and Jean Gaston Darboux (1878 ). It states that
∑
j
=
0
n
f
j
(
x
)
f
j
(
y
)
h
j
=
k
n
h
n
k
n
+
1
f
n
(
y
)
f
n
+
1
(
x
)
−
f
n
+
1
(
y
)
f
n
(
x
)
x
−
y
{\displaystyle \sum _{j=0}^{n}{\frac {f_{j}(x )f_{j}(y )}{h_{j}}}={\frac {k_{n}}{h_{n}k_{n+1}}}{\frac {f_{n}(y )f_{n+1}(x )-f_{n+1}(y )f_{n}(x )}{x-y}}}
where f j (x ) is the j th term of a set of orthogonal polynomials of squared norm h j and leading coefficient k j .
There is also a "confluent form" of this identity by taking
y
→
x
{\displaystyle y\to x}
limit:
∑
j
=
0
n
f
j
2
(
x
)
h
j
=
k
n
h
n
k
n
+
1
[
f
n
+
1
′
(
x
)
f
n
(
x
)
−
f
n
′
(
x
)
f
n
+
1
(
x
)
]
.
{\displaystyle \sum _{j=0}^{n}{\frac {f_{j}^{2}(x )}{h_{j}}}={\frac {k_{n}}{h_{n}k_{n+1}}}\left[f_{n+1}'(x )f_{n}(x )-f_{n}'(x )f_{n+1}(x )\right].}
Proof
[ edit ]
Let
p
n
{\displaystyle p_{n}}
be a sequence of polynomials orthonormal with respect to a probability measure
μ
{\displaystyle \mu }
, and define
a
n
=
⟨
x
p
n
,
p
n
+
1
⟩
,
b
n
=
⟨
x
p
n
,
p
n
⟩
,
n
≥
0
{\displaystyle a_{n}=\langle xp_{n},p_{n+1}\rangle ,\qquad b_{n}=\langle xp_{n},p_{n}\rangle ,\qquad n\geq 0}
(they are called the "Jacobi parameters"), then we have the three-term recurrence[1]
p
0
(
x
)
=
1
,
p
1
(
x
)
=
x
−
b
0
a
0
,
x
p
n
(
x
)
=
a
n
p
n
+
1
(
x
)
+
b
n
p
n
(
x
)
+
a
n
−
1
p
n
−
1
(
x
)
,
n
≥
1
{\displaystyle {\begin{array}{l l}{p_{0}(x )=1,\qquad p_{1}(x )={\frac {x-b_{0}}{a_{0}}},}\\{xp_{n}(x )=a_{n}p_{n+1}(x )+b_{n}p_{n}(x )+a_{n-1}p_{n-1}(x ),\qquad n\geq 1}\end{array}}}
Proof:
By definition,
⟨
x
p
n
,
p
k
⟩
=
⟨
p
n
,
x
p
k
⟩
{\displaystyle \langle xp_{n},p_{k}\rangle =\langle p_{n},xp_{k}\rangle }
, so if
k
≤
n
−
2
{\displaystyle k\leq n-2}
, then
x
p
k
{\displaystyle xp_{k}}
is a linear combination of
p
0
,
.
.
.
,
p
n
−
1
{\displaystyle p_{0},...,p_{n-1}}
, and thus
⟨
x
p
n
,
p
k
⟩
=
0
{\displaystyle \langle xp_{n},p_{k}\rangle =0}
. So, to construct
p
n
+
1
{\displaystyle p_{n+1}}
, it suffices to perform Gram-Schmidt process on
x
p
n
{\displaystyle xp_{n}}
using
p
n
,
p
n
−
1
{\displaystyle p_{n},p_{n-1}}
, which yields the desired recurrence.
Proof of Christoffel–Darboux formula:
Since both sides are unchanged by multiplying with a constant, we can scale each
f
n
{\displaystyle f_{n}}
to
p
n
{\displaystyle p_{n}}
.
Since
k
n
+
1
k
n
x
p
n
−
p
n
+
1
{\displaystyle {\frac {k_{n+1}}{k_{n}}}xp_{n}-p_{n+1}}
is a degree
n
{\displaystyle n}
polynomial, it is perpendicular to
p
n
+
1
{\displaystyle p_{n+1}}
, and so
⟨
k
n
+
1
k
n
x
p
n
,
p
n
+
1
⟩
=
⟨
p
n
+
1
,
p
n
+
1
⟩
=
1
{\displaystyle \langle {\frac {k_{n+1}}{k_{n}}}xp_{n},p_{n+1}\rangle =\langle p_{n+1},p_{n+1}\rangle =1}
.
Now the Christoffel-Darboux formula is proved by induction, using the three-term recurrence.
Specific cases
[ edit ]
Hermite polynomials :
∑
k
=
0
n
H
k
(
x
)
H
k
(
y
)
k
!
2
k
=
1
n
!
2
n
+
1
H
n
(
y
)
H
n
+
1
(
x
)
−
H
n
(
x
)
H
n
+
1
(
y
)
x
−
y
.
{\displaystyle \sum _{k=0}^{n}{\frac {H_{k}(x )H_{k}(y )}{k!2^{k}}}={\frac {1}{n!2^{n+1}}}\,{\frac {H_{n}(y )H_{n+1}(x )-H_{n}(x )H_{n+1}(y )}{x-y}}.}
∑
k
=
0
n
H
e
k
(
x
)
H
e
k
(
y
)
k
!
=
1
n
!
H
e
n
(
y
)
H
e
n
+
1
(
x
)
−
H
e
n
(
x
)
H
e
n
+
1
(
y
)
x
−
y
.
{\displaystyle \sum _{k=0}^{n}{\frac {He_{k}(x )He_{k}(y )}{k!}}={\frac {1}{n!}}\,{\frac {He_{n}(y )He_{n+1}(x )-He_{n}(x )He_{n+1}(y )}{x-y}}.}
Associated Legendre polynomials :
(
μ
−
μ
′
)
∑
l
=
m
L
(
2
l
+
1
)
(
l
−
m
)
!
(
l
+
m
)
!
P
l
m
(
μ
)
P
l
m
(
μ
′
)
=
(
L
−
m
+
1
)
!
(
L
+
m
)
!
[
P
L
+
1
m
(
μ
)
P
L
m
(
μ
′
)
−
P
L
m
(
μ
)
P
L
+
1
m
(
μ
′
)
]
.
{\displaystyle {\begin{aligned}(\mu -\mu ')\sum _{l=m}^{L}\,(2l+1){\frac {(l-m)!}{(l+m)!}}\,P_{lm}(\mu )P_{lm}(\mu ')=\qquad \qquad \qquad \qquad \qquad \\{\frac {(L-m+1)!}{(L+m)!}}{\big [}P_{L+1\,m}(\mu )P_{Lm}(\mu ')-P_{Lm}(\mu )P_{L+1\,m}(\mu '){\big ]}.\end{aligned}}}
See also
[ edit ]
References
[ edit ]
Andrews, George E.; Askey, Richard; Roy, Ranjan (1999), Special functions , Encyclopedia of Mathematics and its Applications, vol. 71, Cambridge University Press , ISBN 978-0-521-62321-6 , MR 1688958
Christoffel, E. B. (1858), "Über die Gaußische Quadratur und eine Verallgemeinerung derselben." , Journal für die Reine und Angewandte Mathematik (in German), 55 : 61–82, doi :10.1515/crll.1858.55.61 , ISSN 0075-4102 , S2CID 123118038
Darboux, Gaston (1878), "Mémoire sur l'approximation des fonctions de très-grands nombres, et sur une classe étendue de développements en série", Journal de Mathématiques Pures et Appliquées (in French), 4 : 5–56, 377–416, JFM 10.0279.01
Abramowitz, Milton; Stegun, Irene A. (1972), Handbook of Mathematical Functions , Dover Publications, Inc., New York , p. 785, Eq. 22.12.1
Olver, Frank W. J.; Lozier, Daniel W.; Boisvert, Ronald F.; Clark, Charles W. (2010), "NIST Handbook of Mathematical Functions" , NIST Digital Library of Mathematical Functions , Cambridge University Press , p. 438, Eqs. 18.2.12 and 18.2.13, ISBN 978-0-521-19225-5 (Hardback, ISBN 978-0-521-14063-8 Paperback)
Simons, Frederik J.; Dahlen, F. A.; Wieczorek, Mark A. (2006), "Spatiospectral concentration on a sphere", SIAM Review , 48 (1 ): 504–536, arXiv :math/0408424 , Bibcode :2006SIAMR..48..504S , doi :10.1137/S0036144504445765 , S2CID 27519592
t
e
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=Christoffel–Darboux_formula&oldid=1195315386 "
C a t e g o r i e s :
● O r t h o g o n a l p o l y n o m i a l s
● F u n c t i o n a l a n a l y s i s
● M a t h e m a t i c a l a n a l y s i s s t u b s
H i d d e n c a t e g o r i e s :
● C S 1 G e r m a n - l a n g u a g e s o u r c e s ( de )
● C S 1 F r e n c h - l a n g u a g e s o u r c e s ( fr )
● A l l s t u b a r t i c l e s
● T h i s p a g e w a s l a s t e d i t e d o n 1 3 J a n u a r y 2 0 2 4 , a t 1 0 : 0 5 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w