Suppose we propose yet another definition of the order condition of identifiability:

K ≥ m + k − 1

which states that the number of predetermined variables in the system can be no less than the number of unknown coefficients in the equation to be identified. Show that this definition is equivalent to the two other definitions of the order condition given in the text.