  In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial
of a graph satisfy an inequality. In this short article we show that the
conjecture generalized to matroids holds for the large class of all split
matroids by exploiting the structure of their lattice of cyclic flats. This
class of matroids strictly contains all paving and copaving matroids.
