Introduction
Many functions and objects in mathematics have natural
perturbations, called q-analogues.
They contain an extra variable q.
When q = 1, everything goes back to normal.
Goals of this talk:
To see an example of a q-analogue, and how it arises.
To see that by making a problem more difficult, it sometimes
becomes easier to solve.
Question 1 (of 3)
Question 1, continued
y x
(4, 5)
y x
y x
x
y
x
y
(0, 0)
Question 2 (of 3)
(x
(x
(x
(x
(x
(x
+ y )0
+ y )1
+ y )2
+ y )3
+ y )4
+ y )5
(x +
y )n
=
1
=
x +y
=
x 2 + 2xy + y 2
=
x 3 + 3x 2 y + 3xy 2 + y 3
=
x 4 + 4x 3 y + 6x 2 y 2 + 4xy 3 + y 4
5
= x + 5x 4 y + 10x 3 y 2 + 10x 2 y 3 + 5xy 4 + y 5
=
n
X
n
k=0
x k y nk
n
n!
The binomial coefficient
=
is the number of
k
k!(n k)!
lattice paths of length n, that contain k xs and (n k) y s.
Pascals triangle
1
1
1
1
..
.
n
0
4
10
n
k
n!
= k!(nk)!
n
Recurrence relation: k1
+ kn =
1
..
.
n
n
n+1
n+1
n
k
1
5
n+1
k
Formula:
4
10
n
k1
n+1
0
1
3
n+1
k
Question 3 (of 3)
(4, 5)
y
x
(0, 0)
The lattice path yyyxxyxyx
How many lattice paths:
have length 9
and end at (4, 5)
Ans: 29 = 512
Ans: 94 = 126
Question 3 (of 3)
(4, 5)
y
x
(0, 0)
The lattice path yyyxxyxyx
General question: Suppose 0 j k(n k).
How many lattice paths
have length n
and end at (k, n k)
and enclose an area of j square units?
Ans: 2n
Ans: kn
yx
xy
Example
yx = qxy ,
yxyxyy
yxyxyy
= yx(yx)yy
= q(yx)xyyy
= q 2 x(yx)yyy
= q3x 2y 4.
qx = xq,
qy = yq
= yx(qxy )yy
= q(qxy )xyyy
= q 2 x(qxy )yyy
= qyxxyyy
= q 2 xyxyyy
= q 3 xxyyyy
An algorithm
Question
Find the number of lattice paths
of length n
that go from (0, 0) to (k, n k)
and enclose an area of j square units
Solution
Expand (x + y )n according to the q-Weyl laws
yx = qxy ,
qx = xq,
qy = yq.
Examples
(x + y )(x + y ) = xx + xy + yx + yy
So
(x + y )2 = xx + xy + qxy + yy
= x 2 + (1 + q)xy + y 2 .
(x + y )3 = (x + y )(x + y )2
= (x + y )(x 2 + (1 + q)xy + y 2 )
= x 3 + (1 + q)x 2 y + xy 2 + yx 2 + (1 + q)yxy + y 3
= x 3 + (1 + q)x 2 y + xy 2 + q 2 x 2 y + (1 + q)qxy 2 +y 3
= x 3 + (1 + q + q 2 )x 2 y + (1 + q + q 2 )xy 2 + y 3 .
Examples
q-Weyl relations:
yx = qxy ,
qx = xq,
qy = yq
(x + y )2 = x 2 + (1 + q)xy + y 2
(x + y )3 = x 3 + (1 + q + q 2 )x 2 y + (1 + q + q 2 )xy 2 + y 3
(x + y )4 = x 4 + (1 + q + q 2 + q 3 )x 3 y
+ (1 + q + 2q 2 + q 3 + q 4 )x 2 y 2
+ (1 + q + q 2 + q 3 )xy 3 + y 4
(x + y )n =
n
X
k=0
c(n, k)x nk y k ,
c(n, k) = ?
(x + y )n+1
= (x + y )(x + y )n
n
n
X
X
nk k
= x
c(n, k)x
y +y
c(n, k)x nk y k
k=0
n
X
k=0
k=0
n
X
k=0
(x + y )n+1
= (x + y )n (x + y )
n
n
X
X
=
c(n, k)x nk y k x +
c(n, k)x nk y k y
=
k=0
n
X
k=0
k=0
n
X
k=0
c(n, k) =
c(4, 2) =
=
=
cf.
4
=
2
(1 q n+1k )
c(n, k 1)
(1 q k )
(1 q 3 )
c(4, 1)
(1 q 2 )
(1 q 3 )(1 q 4 )
c(4, 0)
(1 q 2 )(1 q)
(1 q 4 )(1 q 3 )(1 q 2 )(1 q)
(1 q 2 )(1 q)(1 q 2 )(1 q)
4!
4321
=
2!2!
2121
c(4, 2) =
1 q4 1 q3 1 q2 1 q
1q 1q 1q 1q
=
1 q2 1 q 1 q2 1 q
1q 1q 1q 1q
The q-integer:
[n]q = 1 + q + q 2 + q 3 + + q n1
(=n, when q = 1)
The q-factorial:
n!q = [n]q [n 1]q [2]q [1]q
(=n!, when q = 1)
The solution of
c(n, k) =
(1 q n+1k )
c(n, k 1),
(1 q k )
c(n, 0) = 1
k=0
where
n
k
=
q
n!q
k!q (n k)!q
and
n!q = 1(1 + q)(1 + q + q 2 ) (1 + q + q 2 + q 3 + + q n1 ).
Example, again
How many lattice paths:
Ans: 29 = 512
Ans: 94 = 126
have length 9
and end at (4, 5)
k=0
9
4
=
q
= q 20 + q 19 + 2q 18 + 3q 17 + 5q 16 + 6q 15 + 8q 14 + 9q 13
+ 11q 12 + 11q 11 + 12q 10 + 11q 9 + 11q 8 + 9q 7 + 8q 6
+ 6q 5 + 5q 4 + 3q 3 + 2q 2 + q + 1
n+1
k
n
k
=
q
=
q
= qk
The q-binomial coefficient
n
k
n
k
n!q
k!q (n k)!q
+q
n+1k
n
k
+
q
n
k 1
n
k
q
is a polynomial in q
q
n
k 1
n
as q 1
q
x =
1 0 0
0 q 0
0 0 q2
.. .. ..
. . .
0 0 0
0
0
0
..
.
q n1
y =
0 1 0
0 0 1
.. .. ..
. . .
0 0 0
0 0 0
y (f (t)) = f (qt).
0
0
..
.
1
0
Exercises
Prove that
(a + b)(a + qb)(a + q 2 b) (a + q n1 b)
n
X
n
=
q k(k1)/2 ank b k ,
k q
k=0
(1 + xq
k=1
2k1
)(1 + x
1 2k1
2k
)(1 q ) =
X
k=
qk x k
(a + b)(a + qb)(a + q b) (a + q
n1
b) =
n
X
f (n, k)ak b nk
k=0
Then
(a + b)(a + qb)(a + q 2 b) (a + q n1 b)(a + q n b)
= (a + b)(a + qb)(a + q 2 b) (a + q n1 b)(a + q n b)
So
n
X
k=0
k nk
f (n, k)a b
(a + q b) = (a + b)
n
X
k=0
Start with
(a + b)(a + qb)(a + q 2 b) (a + q n1 b)
n
X
n
=
q k(k1)/2 ank b k .
k q
k=0
k=1
X
k=
qk x k
Summary
We have seen q-analogues of:
integers
factorials
binomial coefficients
the binomial theorem
The q-binomial coefficients have combinatorial significance.
The extra variable q allowed us to deduce the q-binomial theorem
instead of just verifying it.
The end!