Professional Documents
Culture Documents
Proof of The Lagrange Inversion Formula
Proof of The Lagrange Inversion Formula
Proof. Let φ(u) = k≥0 φk uk . We first note that u(x) = φ0 x + O(x2 ) and
P
2 Hayman’s Method
Example 1 Stirling’s formula
1 1 e n
∼√ .
n! 2πn n
Date: Nov. ? , 2004 Nov. 08, 2007 Page: 2
Lecturer: Daniel Panario Jason Z. Gao Scribe:
Example 3 The EGF for permutations with cycle length at most 2 is f (z) =
2
ez+z /2 . By (A), f (z) is Hayman-admissible with R = ∞, and we have a(r) =
r(1 + r), b(r) = r(1 + 2r). Hence
1/2
√
p 1
rn = n + 1/4 − 1/2 = n 1 + − 1/2
4n
√
1 1
= n 1− √ + + O n−3/2 .
2 n 8n
√
f (rn ) ∼ en/2+ n/2−1/4
,
b(rn ) ∼ 2n,
−n
1 1
rn−n = n −n/2
1− √ − + O(n −3/2
)
2 n 8n
−1 !!
1 1
= n−n/2 exp n ln 1 − √ − + O(n−3/2
2 n 8n
√
∼ n−n/2 e n/2
.
Date: Nov. ? , 2004 Nov. 08, 2007 Page: 4
Lecturer: Daniel Panario Jason Z. Gao Scribe:
Hence √
en/2+ n−1/4 −n/2
fn /n! ∼ √ n ,
2 nπ
and
1 √
fn ∼ √ nn/2 e−n/2+ n−1/4 .
2
and hence
X 1 X 1 k/2
u= tk [uk−1 ](1 + u)k/2 = tk ,
k k k−1
k≥1 k≥1
or
1 1 1
= n−1/2 + n−1 + n−3/2 + O n−2 .
r 2 8
This gives
−1
rn = n1/2 1 + (1/2)n−1/2 + (1/8)n−1 + O(n−3/2 ) = n1/2 1 − (1/2)n−1/2 + (1/8)n−1 + O(n−3/2 ) ,
1
ln = ln n−1/2 +ln 1 + (1/2)n−1/2 + (1/8)n−1 + O(n−3/2 ) = −(1/2) ln n+(1/2)n−1/2 +O n−3/2
rn