Let $A$ be a real $d\times d$ matrix. The diagonal elements are strictly negative ($a\_{ii}<0$) and the off-diagonal elements are non-negative ($a\_{ij}\geq 0$ for $i\neq j$). $A$ is strictly column diagonally dominant ($\forall j, |a\_{jj}|>\sum\_{i\neq j}|a\_{ij}|$).


Consider the system of differential equations given by ${\bf \dot x}(t)=A {\bf x}(t)$ and suppose that the set of inequalities $\dot y\_i(t)\leq (A {\bf y}(t))\_i$ with $i=1,\ldots,d$ holds for all $t$. Given the initial conditions ${\bf x}(0)={\bf y}(0)$ with $x\_i(0)\geq 0 \,\forall i$, do we necessarily have $x\_i(t)\geq y\_i(t)\,\forall i$ at every $t>0$?



Differential inequalities for a strictly diagonal dominant system of linear ODEs
Yes. This is classic, see for instance Theorem 2.1 in [Cone-valued Lyapunov functions](https://uta-ir.tdl.org/uta-ir/bitstream/handle/10106/2205/MathTechReport045.pdf?sequence=1&isAllowed=y) by Lakshmikantham and Leela from 1977. (I apologize for the reference because there must be something more to the point of your question. To interpret the result in the paper just note that the cone in question is the cone of vectors with nonnegative entries). The conditions on the diagonal and the off-diagonal elements of your matrix mean that you are looking at what is called a [Metzler matrix](https://en.wikipedia.org/wiki/Metzler_matrix). The dominance condition is not needed. It is not even needed that the diagonal entries are negative.


The point is that Metzler matrices, i.e., matrices with nonnegative off-diagonal entries are precisely the matrices for which $e^{At}$ has nonnegative entries for all $t\geq 0$. 


The argument for the case that $y$ is continuously differentiable goes something like this. (A bit more care also yields the result with less regularity, see the reference). Assume that $y$ is about to overtake $x$ in some entry at time $t$ and $y(s) \leq x(s)$ for all $s \in [0,t]$. Thus, by continuity, $y\_i(t) = x\_i(t)$ and $y(t) \leq x(t)$ componentwise. Then
$$ \dot y\_i(t) \leq (A y(t))\_i = a\_{ii} y\_i(t) + \sum\_{j\neq i} a\_{ij} y\_j(t) \leq
a\_{ii} x\_i(t) + \sum\_{j\neq i} a\_{ij} x\_j(t) = (A x(t))\_i = \dot x\_i(t)$$
so that $y\_i(t+s) \not > x\_i(t+s)$ for small $s>0$. Thus $y$ can never overtake $x$ in any component.


Note that for the inequality we use that $x\_i(t) = y\_i(t)$, as there is no information about the sign of $a\_{ii}$ and the condition that the off-diagonal entries are nonnegative.


