We show how Jacobi's bound may be used to prove upper bound on the complexity of solve algorithms for solving DAE systems. We provide sharp bound on various notions of index for implicit DAE systems.