Parsimony and the rank of a flattening matrix

Abstract

AbstractThe standard models of sequence evolution on a tree determine probabilities for every character or site pattern. A flattening is an arrangement of these probabilities into a matrix, with rows corresponding to all possible site patterns for one setAof taxa and columns corresponding to all site patterns for another setBof taxa. Flattenings have been used to prove difficult results relating to phylogenetic invariants and consistency and also form the basis of several methods of phylogenetic inference. We prove that the rank of the flattening equals$$r^{\nu _T(A|B)}$$rνT(A|B), whereris the number of states and$$\nu _T(A|B)$$νT(A|B)is the minimum size of a vertex cut separatingAfromB. WhenTis binary the rank of the flattening equals$$r^{\ell _T(A|B)}$$rℓT(A|B)where$$\ell _T(A|B)$$ℓT(A|B)equals the parsimony length of the binary character separatingAandB. We provide a direct proof that requires little more than undergraduate algebra, but note that the formula could also be derived from work by Casanellas and Fernández-Sánchez (2011) on phylogenetic invariants.