When subproblems are contiguous intervals, the final operation separates the interval at one split point. A small computation will anchor the general statement before the abstraction takes over.
Notation
A full dynamic-programming state \(dp[i][s]\) states exactly which prefix \(i\) and mathematical state \(s\) have been processed. The recurrence is a theorem about transitions between these states.
The formulas should not be merged too early. The datum \(\mathsf D\), the conclusion \(\mathsf C\), and the bridge \(\Longrightarrow\) have three different logical jobs.
Stress the formula
This is the algebraic core of the note. Once this line is correct, the surrounding interpretation has something solid to refer to.
Interpretation
What survives the example is not its particular numbers but the relation encoded by the two rows below. That relation is the part worth transporting to a new setting.
Limit of the argument
State compression is an implementation change, not the definition. Loop order is safe only after the uncompressed dependency graph is understood.
I would use the boxed line as a reference later, while returning to the full display whenever a hypothesis becomes uncertain. That division keeps compression from becoming ambiguity.