A scalar neutral delay equation, where the derivative acts on the combination x(t) minus a(t)x(g(t)), can be converted into an ordinary (non-neutral) delay equation carrying infinitely many delayed terms: when the shift operator has norm below one it is invertible through its Neumann series, and the iterated delays of the neutral argument index the resulting terms. Combining that reduction with the Bohl-Perron principle, which trades exponential stability for the statement that bounded forcing yields bounded solutions, produces stability conditions written directly in the delay bounds and coefficient sup-norms, with no characteristic equation and no requirement that the neutral coefficient stay below one half. Students learn how an operator-series change of variable turns a structurally hard equation into a tractable one, and how measurable, variable, and even unbounded (pantograph-type) delays are handled by the same estimate.
A neutral delay differential equation is one in which the derivative acts on the combination x(t) - a(t)x(g(t)), so the delayed state enters under the derivative rather than only as a lagged term on …