The Dynamic time warping is applied for time normalization. As shown in the diagram, two different signals with $Tx$ and $Ty$ time instants, are time-normalized to have $T$ time instants. $\phi$ is the warping function.
A path P is represented as having increments $p_i$, and $q_i$ along their respective axis. These incremental values are usually 1 or 2.
$$P \to (p_1,q_1)(p_2,q_2)...(p_T,q_T)$$
The warping functions are given by
$$ \phi _x(k) = \sum _{i=1}^{k} p_i $$
$$ \phi _y(k) = \sum _{i=1}^{k} q_i $$
There are $T_x . T_y$ number of grid points in the 2D space. You can visualize the path as any traversal from (1,1) to (Tx,Ty). Local continuity constraints like $\phi _x(k+1) - \phi _x(k) \leq 1$ or $2$ make sure that we do not omit any important information-bearing sound segment.
Up to this point, things make sense. However, I could not reason out the inequities (at the last), that determine the area within which the optimal path is to be found.
The allowable regions for each of the local constraints are defined using these two parameters.
$$Q_{max} = \max_l \left [\frac{\sum_{i=1}^{T_l} p_i^{(l)}}{\sum_{i=1}^{T_l} q_i^{(l)}} \right ]$$
$$Q_{min} = \min_l \left [\frac{\sum_{i=1}^{T_l} p_i^{(l)}}{\sum_{i=1}^{T_l} q_i^{(l)}} \right ]$$
Here, $l$ signifies the index of allowed path $P$ and $T_l$ is the total number of moves in that path.
Then, the global path constraints are given by
$$ 1+\frac{[\phi x(k) - 1]}{Q{max}} \leq \phi y(k) \leq 1 + Q{max}\cdot [\phi _x(k) - 1] $$
$$ T_y + Q{max}\cdot [\phi _x(k) - Tx] \leq \phi y(k) \leq T_y+\frac{[\phi x(k) - T_x]}{Q{max}} $$
How do you prove these constraints?

