As per the dynamic Programming recurrence relation, the solution to $i^{th}$ subproblem

onlydepends on the solution to $(i-1)^{th}$ subproblem.

For example, in matrix multiplication the result does not depend **only** on the $(i-1)^{th}$ subproblem.

It requires us to find a combination even from results older than that.

So, shouldn't this be a False statement.