|This article needs additional citations for verification. (February 2013) (Learn how and when to remove this template message)|
In mathematics, the Lindström–Gessel–Viennot lemma provides a way to count the number of tuples of non-intersecting lattice paths.
Let G be a locally finite directed acyclic graph. This means that each vertex has finite degree, and that G contains no directed cycles. Consider base vertices and destination vertices , and also assign a weight to each directed edge e. These edge weights are assumed to belong to some commutative ring. For each directed path P between two vertices, let be the product of the weights of the edges of the path. For any two vertices a and b, write e(a,b) for the sum over all paths from a to b. This is well-defined if between any two points there are only finitely many paths; but even in the general case, this can be well-defined under some circumstances (such as all edge weights being pairwise distinct formal indeterminates, and being regarded as a formal power series). If one assigns the weight 1 to each edge, then e(a,b) counts the number of paths from a to b.
With this setup, write
An n-tuple of non-intersecting paths from A to B means an n-tuple (P1, ..., Pn) of paths in G with the following properties:
- There exists a permutation of such that, for every i, the path Pi is a path from to .
- Whenever , the paths Pi and Pj have no two vertices in common (not even endpoints).
Given such an n-tuple (P1, ..., Pn), we denote by the permutation of from the first condition.
The Lindström–Gessel–Viennot lemma then states that the determinant of M is the signed sum over all n-tuples P = (P1, ..., Pn) of non-intersecting paths from A to B:
That is, the determinant of M counts the weights of all n-tuples of non-intersecting paths starting at A and ending at B, each affected with the sign of the corresponding permutation of , given by taking to .
In particular, if the only permutation possible is the identity (i.e., every n-tuple of non-intersecting paths from A to B takes ai to bi for each i) and we take the weights to be 1, then det(M) is exactly the number of non-intersecting n-tuples of paths starting at A and ending at B.
To prove the Lindström–Gessel–Viennot lemma, we first introduce some notation.
An n-path from an n-tuple of vertices of G to an n-tuple of vertices of G will mean an n-tuple of paths in G, with each leading from to . This n-path will be called nonintersecting if the paths Pi and Pj have no two vertices in common (not even endpoints) whenever .
Given an n-path , the weight of this n-path is defined as the product .
A twisted n-path from an n-tuple of vertices of G to an n-tuple of vertices of G will mean an n-path from to for some permutation in the symmetric group . This permutation will be called the twist of this twisted n-path, and denoted by (where P is the n-path). This, of course, generalizes the notation introduced before.
Recalling the definition of M, we can expand det M as a signed sum of permutations; thus we obtain
(since every factor is a sum over paths , and thus the product is a sum over n-paths from to , with the summands being precisely the weights of these n-paths). Using the notion of a twisted n-path, we can simplify the right hand side of this to
Now, we have to prove that this is equal to
In other words, we have to prove that the sum of the terms over all twisted n-paths from to equals the same sum but only over nonintersecting n-paths. This clearly is equivalent to proving that the sum of over all twisted n-paths from to which are not nonintersecting vanishes.
To establish this vanishing, we will use an involution on the set of all twisted n-paths from to which are not nonintersecting. This involution will have the property that it flips the sign (as a consequence, it has no fixed points), while leaving invariant. Hence, the sum of over all twisted n-paths from to will have to be 0, because the involution splits it into pairs of mutually cancelling summands.
It remains to construct the involution, which we call f. Let be any twisted n-path from to which is not non-intersecting. The idea behind the definition of f is to take two intersecting paths and , and switch their tails after their point of intersection. However, there are (in general) several pairs of intersecting paths, which can also intersect several times; hence, a choice needs to be made (and f might fail to be an involution if this choice is done badly). We choose the following precise definition: Let i be the smallest index such that the path Pi (recall that this is the path starting at ai) contains an intersection; let m be the first (along Pi) of the points where Pi intersects other paths; and then let j be the largest index such that m lies on Pj. Then we define f(P) to be the same as P, but with the tails of the two paths Pi and Pj (that is, the parts of these two paths starting at m) switched. Clearly, f(P) is a twisted n-path, whose twist differs from by a transposition of and ; hence, . Moreover, f(P) has the same total multiset of edges as P; thus, . Furthermore, it is easy to see that f is, in fact, an involution; this is because in f(P), the smallest index corresponding to an intersecting path will again be i, its first point of intersection will again be m, and the largest index of a path containing m will again be j. So we have found an involution with the desired properties, and thus proven the Lindström-Gessel-Viennot lemma.
Arguments similar to the one above appear in several sources, with variations regarding the choice of which tails to switch. A version with j smallest (unequal to i) rather than largest appears in the Gessel-Viennot 1989 reference (proof of Theorem 1).
The Lindström–Gessel–Viennot lemma can be used to prove the equivalence of the following two different definitions of Schur polynomials. Given a partition of n, the Schur polynomial can be defined as:
where the sum is over all semistandard Young tableaux T of shape λ, and the weight of a tableau T is defined as the monomial obtained by taking the product of the xi indexed by the entries i of T. For instance, the weight of the tableau is .
where hi are the complete homogeneous symmetric polynomials (with hi understood to be 0 if i is negative). For instance, for the partition (3,2,2,1), the corresponding determinant is
To prove the equivalence, given any partition λ as above, one considers the r starting points and the r ending points , as points in the lattice , which acquires the structure of a directed graph by asserting that the only allowed directions are going one to the right or one up; the weight associated to any horizontal edge at height i is xi, and the weight associated to a vertical edge is 1. With this definition, r-tuples of paths from A to B are exactly semistandard Young tableaux of shape λ, and the weight of such an r-tuple is the corresponding summand in the first definition of the Schur polynomials. For instance, with the tableau , one gets the corresponding 4-tuple
On the other hand, the matrix M is exactly the matrix written above for D. This shows the required equivalence. (See also §4.5 in Sagan's book, or the First Proof of Theorem 7.16.1 in Stanley's EC2, or §3.3 in Fulmek's arXiv preprint, or §9.13 in Martin's lecture notes, for slight variations on this argument.)
The Cauchy–Binet formula
One can also use the Lindström–Gessel–Viennot lemma to prove the Cauchy–Binet formula, and in particular the multiplicativity of the determinant.
The acyclicity of G is an essential assumption in the Lindström–Gessel–Viennot lemma; it guarantees (in reasonable situations) that the sums are well-defined, and it advects into the proof (if G is not acyclic, then f might transform a self-intersection of a path into an intersection of two distinct paths, which breaks the argument that f is an involution). Nevertheless, Kelli Talaska's 2012 paper establishes a formula generalizing the lemma to arbitrary digraphs. The sums are replaced by formal power series, and the sum over nonintersecting path tuples now becomes a sum over collections of nonintersecting and non-self-intersecting paths and cycles, divided by a sum over collections of nonintersecting cycles. The reader is referred to Talaska's paper for details.
- Gessel, Ira M.; Viennot, Xavier G. (1989), Determinants, Paths and Plane Partitions (PDF)
- Sagan, Bruce E. (2001), The symmetric group, Springer
- Stanley, Richard P. (1999), Enumerative Combinatorics, volume 2, CUP
- Talaska, Kelli (2012), Determinants of weighted path matrices, arXiv:
- Martin, Jeremy (2012), Lecture Notes on Algebraic Combinatorics (PDF)
- Fulmek, Markus (2010), Viewing determinants as nonintersecting lattice paths yields classical determinantal identities bijectively, arXiv: