# For what functions, “$=$” instead of “$\leq$”

Theorem: Suppose $f,g\in C(U,\mathbb R^n)$ and let $f$ be locally Lipschitz-continuous in the second argument, uniformly with repsect to the first. If $x(t)$ and $y(t)$ are respective solutions of the Iinitial value problems; $x'=f(t,x), x(t_0)=x_0$ and $y'=g(t,y), y(t_0)=y_0$ then $$|x(t)-y(t)| \leq |x_0-y_0|\cdot e^{L\cdot |t-t_0|}+\frac{M}{L}\left(e^{L\cdot |t-t_0|}-1\right),$$ where $L=\sup \frac{|f(t,x)-f(t,y)|}{|x-y|}$ and $M=\sup|f(t,x)-g(t,x)|$.

This is a theorem in one of my books about ODEs . Now I was wondering, for what functions $f(t,x)=f(x)$ and $g(t,x)=g(x)$, the inequality becomes an equality?

The first supremum is over $(t,x)\neq (t,y)\in V$, the second supremum is over $(t,x)\in V$.

-

Just curious, what book is this from? – Christopher A. Wong Oct 30 '12 at 20:05
– Montaigne Oct 30 '12 at 20:12
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 14, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9106460809707642, "perplexity_flag": "head"}