Lindström–Gessel–Viennot Lemma

In Mathematics, the Lindström–Gessel–Viennot lemma provides a way to count the number of tuples of non-intersecting lattice paths, or, more generally, paths on a directed graph. It was proved by Gessel–Viennot in 1985, based on previous work of Lindström published in 1973.

Statement

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 $A = \$ and destination vertices $B = \$, and also assign a weight $\omega_$ 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 $\omega(P)$ 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 $e(a,b) = \sum_ \omega(P)$ 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 $e(a,b)$ 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
:$M = \begin e(a_1,b_1) & e(a_1,b_2) & \cdots & e(a_1,b_n) \\ e(a_2,b_1) & e(a_2,b_2) & \cdots & e(a_2,b_n) \\ \vdots & \vdots & \ddots & \vdots \\ e(a_n,b_1) & e(a_n,b_2) & \cdots & e(a_n,b_n) \end$.

An ''n''-tuple of non-intersecting paths from ''A'' to ''B'' means an ''n''-tuple (''P''₁, ..., ''P''_''n'') of paths in ''G'' with the following properties:

* There exists a permutation $\sigma$ of $\left\$ such that, for every ''i'', the path ''P''_''i'' is a path from $a_i$ to $b_$.
* Whenever $i \neq j$, the paths ''P''_''i'' and ''P''_''j'' have no two vertices in common (not even endpoints).

Given such an ''n''-tuple (''P''₁, ..., ''P''_''n''), we denote by $\sigma(P)$ the permutation of $\sigma$ 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'' = (''P''₁, ..., ''P''_''n'') of ''non-intersecting'' paths from ''A'' to ''B'':

:$\det(M) = \sum_ \mathrm(\sigma(P)) \prod_^n \omega(P_i).$

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 $(1,2,\ldots,n)$, given by $P_i$ taking $a_i$ to $b_$.

In particular, if the only permutation possible is the identity (i.e., every ''n''-tuple of non-intersecting paths from ''A'' to ''B'' takes ''a''_''i'' to ''b''_''i'' 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''.

Proof

To prove the Lindström–Gessel–Viennot lemma, we first introduce some notation.

An ''n''-path from an ''n''-tuple $(a_1, a_2, \ldots, a_n)$ of vertices of ''G'' to an ''n''-tuple $(b_1, b_2, \ldots, b_n)$ of vertices of ''G'' will mean an ''n''-tuple $(P_1, P_2, \ldots, P_n)$ of paths in ''G'', with each $P_i$ leading from $a_i$ to $b_i$. This ''n''-path will be called non-intersecting just in case the paths ''P''_''i'' and ''P''_''j'' have no two vertices in common (including endpoints) whenever $i \neq j$. Otherwise, it will be called entangled.

Given an ''n''-path $P = (P_1, P_2, \ldots, P_n)$, the weight $\omega(P)$ of this ''n''-path is defined as the product $\omega(P_1) \omega(P_2) \cdots \omega(P_n)$.

A twisted ''n''-path from an ''n''-tuple $(a_1, a_2, \ldots, a_n)$ of vertices of ''G'' to an ''n''-tuple $(b_1, b_2, \ldots, b_n)$ of vertices of ''G'' will mean an ''n''-path from $(a_1, a_2, \ldots, a_n)$ to $\left(b_, b_, \ldots, b_\right)$ for some permutation $\sigma$ in the symmetric group $S_n$. This permutation $\sigma$ will be called the twist of this twisted ''n''-path, and denoted by $\sigma(P)$ (where ''P'' is the ''n''-path). This, of course, generalises the notation $\sigma(P)$ introduced before.

Recalling the definition of ''M'', we can expand det ''M'' as a signed sum of permutations; thus we obtain

:$\begin \det M &= &\sum_\mathrm(\sigma)\prod_^e(a_,b_)\\ &= &\sum_\mathrm(\sigma)\prod_^\sum_\omega(P_)\\ &= &\sum_\mathrm(\sigma) \sum\\\ &= &\sum\\\ &= &\sum\\\ &&+\sum\\\ &= &\sum_ \mathrm(\sigma(P))\omega(P)\\ &&+\underbrace_\\ \end$

It remains to show that the sum of $\mathrm(\sigma(P))\omega(P)$ over all entangled twisted ''n''-paths vanishes. Let $\mathcal$ denote the set of entangled twisted ''n''-paths. To establish this, we shall construct an involution$f:\mathcal\longrightarrow\mathcal$ with the properties $\omega(f(P))=\omega(P)$ and $\mathrm(\sigma(f(P)))=-\mathrm(\sigma(P))$ for all $P\in\mathcal$. Given such an involution, the rest-term

:$\sum\ = \sum_ \mathrm(\sigma(P))\omega(P)$

in the above sum reduces to 0, since its addends cancel each other out (namely, the addend corresponding to each $P \in \mathcal$ cancels the addend corresponding to $f(P)$).

Construction of the involution: The idea behind the definition of the involution $f$ is to take choose two intersecting paths within an entangled path, and switch their tails after their point of intersection. There are in general several pairs of intersecting paths, which can also intersect several times; hence, a careful choice needs to be made. Let $P = \left(P_1,P_2,...,P_n\right)$ be any entangled twisted ''n''-path. Then $f(P)$ is defined as follows. We call a vertex crowded if it belongs to at least two of the paths $P_1,P_2,...,P_n$. The fact that the graph is acyclic implies that this is equivalent to "appearing at least twice in all the paths".If the graph was not acyclic, the "crowdedness" might change after applying $f$ ; this proof would not work, and the lemma would actually become totally false. Since ''P'' is entangled, there is at least one crowded vertex. We pick the smallest $i \in \$ such that $P_i$ contains a crowded vertex. Then, we pick the first crowded vertex ''v'' on $P_i$ ("first" in sense of "encountered first when travelling along $P_i$"), and we pick the largest ''j'' such that ''v'' belongs to $P_j$. The crowdedness of ''v'' implies ''j'' > ''i''. Write the two paths $P_i$ and $P_j$ as

:$\begin P_ &\equiv &a_=u_\to u_\to u_\ldots u_\to\overbrace^\\ P_ &\equiv &a_=v_\to v_\to v_\ldots v_\to\underbrace_\\ \end$

where $\sigma=\sigma(P)$, and where $\alpha$ and $\beta$ are chosen such that ''v'' is the $\alpha$-th vertex along $P_i$ and the $\beta$-th vertex along $P_j$ (that is, $v = u_ = v_$). We set $\alpha_P = \alpha$ and $\beta_P = \beta$ and $i_ = i$ and $j_ = j$. Now define the twisted ''n''-path $f(P)$ to coincide with $P$ except for components $i$ and $j$, which are replaced by

:$\begin P'_ &\equiv &a_=u_\to u_\to u_\ldots u_\to\overbrace^\\ P'_ &\equiv &a_=v_\to v_\to v_\ldots v_\to\underbrace_\\ \end$

It is immediately clear that $f(P)$ is an entangled twisted ''n''-path. Going through the steps of the construction, it is easy to see that $i_=i_$, $j_=j_$ and furthermore that $\alpha_=\alpha_$ and $\beta_=\beta_$, so that applying $f$ again to $f(P)$ involves swapping back the tails of $f(P)_,f(P)_$ and leaving the other components intact. Hence $f(f(P))=P$. Thus $f$ is an involution. It remains to demonstrate the desired antisymmetry properties:

From the construction one can see that $\sigma(f(P))$ coincides with $\sigma=\sigma(P)$ except that it swaps $\sigma(i)$ and $\sigma(j)$, thus yielding $\mathrm(\sigma(f(P)))=-\mathrm(\sigma(P))$. To show that $\omega(f(P))=\omega(P)$ we first compute, appealing to the tail-swap

:$\begin \omega(P'_)\omega(P'_) &= &\left(\prod_^\omega(u_,u_)\cdot \prod_^\omega(v_,v_)\right) \cdot\left(\prod_^\omega(v_,v_)\cdot \prod_^\omega(u_,u_)\right)\\ &= &\prod_^\omega(u_,u_)\cdot\prod_^\omega(v_,v_)\\ &= &\omega(P_)\omega(P_).\\ \end$

Hence $\omega(f(P))=\prod_^\omega(f(P)_)=\prod_^\omega(P_)\cdot \omega(P'_)\omega(P'_)=\prod_^\omega(P_)\cdot \omega(P_)\omega(P_)=\prod_^\omega(P_)=\omega(P)$.

Thus we have found an involution with the desired properties and completed the proof of the Lindström-Gessel-Viennot lemma.

Remark. 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).

Applications

Schur polynomials

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 $\lambda = \lambda_1 + \cdots + \lambda_r$ of ''n'', the Schur polynomial $s_\lambda(x_1,\ldots,x_n)$ can be defined as:
*$s_\lambda(x_1,\ldots,x_n) = \sum_T w(T),$
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 ''x''_''i'' indexed by the entries ''i'' of ''T''. For instance, the weight of the tableau

is $x_1 x_3 x_4^3 x_5 x_6 x_7$.
*$s_\lambda(x_1, \ldots, x_n) = \det \left ( (h_ )_^ \right ),$
where ''h''_''i'' are the complete homogeneous symmetric polynomials (with ''h''_''i'' understood to be 0 if ''i'' is negative). For instance, for the partition (3,2,2,1), the corresponding determinant is
:$s_ = \begin h_3 & h_4 & h_5 & h_6 \\ h_1 & h_2 & h_3 & h_4 \\ 1 & h_1 & h_2 & h_3 \\ 0 & 0 & 1 & h_1 \end.$

To prove the equivalence, given any partition ''λ'' as above, one considers the ''r'' starting points $a_i = (r+1-i,1)$ and the ''r'' ending points $b_i = (\lambda_i + r+1-i, n)$, as points in the lattice $\mathbb^2$, 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 ''x''_''i'', 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.

Generalizations

Talaska's formula

The acyclicity of ''G'' is an essential assumption in the Lindström–Gessel–Viennot lemma; it guarantees (in reasonable situations) that the sums $e(a, b)$ 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 $e(a, b)$ 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.

See also

*Matrix tree theorem

References

*
*
*
*
*
*

{{DEFAULTSORT:Lindstrom-Gessel-Viennot lemma
Lemmas
Combinatorics
Theorems in combinatorics