A Lipschitz bound is any valid inequality of the displayed form with a finite constant . It need not use the least Lipschitz constant. For , both and are valid, but fails. The tighter bound gives a sharper error estimate: input error at most guarantees output error at most using , compared with the valid but weaker using . The bound constrains errors; it does not state that every pair achieves that amplification.
New to topics? Read the docs here!