The partial derivatives satisfy a global bound of in absolute value. For example,
because and ; the same argument applies to . Apply the one-dimensional mean value theorem first along a horizontal segment and then along a vertical segment:
Thus is Lipschitz with constant for the coordinate-sum norm.
Apply Itô's formula to . Its time derivative contributes and its Itô correction contributes , giving the required equation and initial value. Hence
In particular the solution stays positive. For , factor out and use independence and the normal law of :
The exponential moment exists, so this conditional expectation is well-defined for every finite .
Random-walk maximum limit from Donsker invariance Created 2026-10-07 Updated 2026-11-05
For a random walk with centered independent identically distributed increments of variance one, the maximum of its polygonal interpolation is the maximum at its grid vertices. The maximum functional is Lipschitz for the supremum norm, so the continuous mapping theorem applied to the Donsker invariance principle proves the displayed convergence in distribution. The Brownian reflection principle then gives upper-tail limits at all , since the limiting maximum has no atom there.
Required clearance margin 2026-11-05
A required clearance margin is the minimum separation requested by a geometric motion specification. In adaptive clearance sampling, it is the threshold that a continuous-interval lower bound must exceed. Positive separation from an obstacle is enough to exclude contact in an exact model, but can still be less than the requested margin.
Let be the modeled nonnegative set distance between a rigid body and fixed obstacles. Using the strict convention of adaptive clearance sampling, an interval is accepted only when its guaranteed lower bound exceeds . A query with violates that requested separation without demonstrating contact. Choosing is part of the specification, not something determined uniquely by the collision detection algorithm.
Geometric uncertainty can be incorporated with explicit bounds. Suppose robot geometry, obstacle geometry and reference-point tracking error can each change the relevant sets by at most in Hausdorff distance. The triangle inequality then gives
To guarantee an actual separation greater than , a sufficient modeled threshold is
These are simultaneous deterministic bounds. No independence assumption is needed to add them conservatively. The configuration-space construction in the primary planning text similarly represents body size by enlarging forbidden regions.[ref]
For an original error budget, require and take geometric bounds of , and respectively. The modeled threshold becomes . Suppose the smaller reported endpoint distance is , the distance-query error is bounded by , the clearance Lipschitz continuity constant is , and the interval duration is . The simple interval certificate gives
Subtracting the geometric budget leaves at least actual separation, exceeding the requested by in this model.
The query error was already subtracted from the interval bound and must not be subtracted again as an unrecorded duplicate allowance. Conversely, the motion term addresses unsampled motion; it does not automatically include obstacle-location error. An endpoint certificate for continuous collision clearance should state which effects are included in each quantity, while unresolved intervals in adaptive collision checking retain intervals whose lower bound is insufficient.
A second-order ordinary differential equation involves a second derivative as its highest derivative. In explicit form , introducing converts it into the first-order system , . Under local regularity and Lipschitz continuity in the dependent variables, an initial value problem is specified by both and . The linear case is a second-order linear differential equation.
For a globally Lipschitz nonlinearity of constant , the map taking to the zero-Dirichlet Poisson solution with load is a contraction in the gradient norm if the displayed inequality holds. Poincaré gives the factor from the Sobolev input to , and testing the linear Poisson equation gives another factor back to the gradient norm. The condition yields a unique weak solution without requiring . With the optimal Poincaré constant it reads .
Slowly varying function Created 2026-10-05 Updated 2026-10-14
A positive measurable function is slowly varying at infinity if
for every fixed . It has regular variation of index zero. “Slowly” concerns relative change under multiplication of the argument; it does not mean that the function must be bounded, have a small derivative, or converge to a finite value.
Every positive constant is a slowly varying function. So are , and for any fixed real number , on . Indeed,
The first grows without bound, the second tends to zero, and the constant does neither. Another unbounded example is :
This function can grow much faster than while retaining regular variation of index zero.
Even convergence is unnecessary. The bounded function
oscillates between and . It is nevertheless a slowly varying function: the change in the argument of the sine under is
and the Lipschitz continuity of the sine makes the logarithm of the ratio tend to zero. The sequences and give the two values and for every nonnegative integer , so there is no limit at infinity.
Contrast this with , which is positive and bounded but is not a slowly varying function. Fix . Along its rescaling ratio is ; along the ratio is . The persistent oscillations prevent even a limit for this one fixed rescaling. It is not regularly varying with any finite index either.
Figure 1.
Two bounded oscillating functions: logarithmic rescaling makes one ratio approach one, while the other keeps oscillating
. The horizontal coordinate is , and the fixed rescaling is . The displayed range illustrates the formulas; the limiting claims follow from the arguments in the text. Details.
The useful distinction is whether a fixed proportional change of input eventually produces a negligible proportional change of output. A slowly varying function can therefore preserve the scaling exponent of a power law while changing its magnitude substantially. The decomposition in regular variation explains why a logarithmic factor can matter in numerical estimates without changing the limiting exponent.
For the autonomous differential equation , the real solutions are nondecreasing and lie in . On each nonconstant interval, separation of variables gives , so the solution crosses from to in exactly time . Every nonconstant solution on the entire real time axis is consequently
for some real . The two constant solutions complete the list; solutions on shorter intervals are restrictions of these. At the joins both the derivative and the right-hand side are zero, so these are continuously differentiable functions. The right-hand side is continuous but fails Lipschitz continuity at both endpoints, allowing arbitrary waiting time at before departure. Once reaches , monotonicity forces it to stay there. The sine representation without the nonnegative-cosine restriction would incorrectly introduce decreasing pieces.
Sub-Gaussian random vector Created 2026-10-06 Updated 2026-11-05
A centered random vector is sub-Gaussian with variance proxy when the displayed inequality holds for every deterministic vector . Equivalently every scalar inner product is a sub-Gaussian random variable with proxy . independence of coordinates is not required. For vectors with Euclidean norms at most one, the union bound gives with probability at least . This assumption alone is weaker than concentration for all Lipschitz functions.
For an explicit Runge-Kutta method with coefficients , put and let mean componentwise squaring. The conditions , , and match the exact flow expansion through degree three: the two cubic differentials are and . For sufficiently smooth vector fields these give local error and, under the usual finite-interval Lipschitz continuity assumptions, global error .
A tolerance-budget residual bound for multiplier bisection controls the physical bias left unused by a numerical allocation, rather than only the numerical error in its Lagrange multiplier. Use from monotonicity of the multiplier equation for capped tolerances. Suppose a positive bracket satisfies . Choosing the upper endpoint gives a feasible allocation, with residual
Choosing the lower endpoint can violate the budget. The direction of monotonicity therefore matters even when both endpoints are numerically close.
For an a priori bound, put . On the entire bracket, each summand obeys Lipschitz continuity with constant at most , including across its breakpoint. Hence
After bisections of an original bracket with , the corresponding worst-case bound is . This is conservative; evaluating the two endpoint budgets can give a much tighter residual certificate.
For an original stopping example, use , and in common normalized bias units. The bracket straddles the root. Its feasible upper endpoint leaves unused. One bisection evaluates and replaces the upper endpoint, reducing that unused amount to about . A residual allowance of is now met, despite a breakpoint lying inside the bracket.
This gives a thresholded stopping of a capped-tolerance multiplier search in the same units as the permitted bias. Floating-point comparisons also need an allowance for rounding if they are to serve as hard certificates. The underlying bias coefficients and cost model remain assumptions of cost-weighted allocation of baseline-response tolerances; numerical precision cannot validate missing physical terms. NIST's pulse-radiometer account motivates the offset/leakage constraints rather than prescribing this numerical stopping rule.[ref]
Two-point lower bound with a triangular bump Created 2026-10-05 Updated 2026-11-05
Consider fixed-design nonparametric regression , with independent errors , and estimation at a fixed interior point . In the class of functions with Lipschitz continuity constant at most , compare with , with small enough to stay inside the design interval.
The target values differ by . At most equally spaced design points meet the bump, and its height is at most , so the joint Kullback-Leibler divergence is bounded by
Taking a sufficiently small constant times keeps this bounded away from a perfectly distinguishable experiment. Pinsker's inequality and the Le Cam two-point lemma give squared-error risk at least a constant times . The design-spacing assumption is essential to the count of observations inside the bump; it is not valid for arbitrary fixed designs.
Uniqueness theorem for ordinary differential equations Created 2026-09-24 Updated 2026-11-05
For the initial value problem , , continuity of and local Lipschitz continuity in ensure a unique local solution. The Lipschitz condition compares different state values at a common time: on a suitable neighborhood. Subtracting two integral equations and applying Gronwall's inequality proves uniqueness.
Continuity alone does not suffice. The scalar equation with has the zero solution and, for every , the solution up to and thereafter. The non-Lipschitz behavior at zero permits an arbitrary waiting time. This illustrates why the hypotheses of the Picard-Lindelöf theorem carry real information.
Unresolved intervals in adaptive collision checking are trajectory intervals for which the available queries and motion bounds prove neither the requested continuous clearance nor a violation at a known configuration. They are a computational result of incomplete information, rather than evidence that a collision occurred.
In adaptive clearance sampling, suppose endpoint distances and a valid clearance Lipschitz continuity constant are known over an interval of duration . If a lower bound such as does not exceed the required clearance margin, the interval needs further work. Its endpoints can both be clear while its interior remains undecided. The continuous-path requirement motivating this distinction is stated in the primary planning text.[ref]
An original indistinguishability example uses , and endpoint clearances . Both of the following functions satisfy the same endpoint data and motion bound:
They can be realized by the height of a point moving above a fixed horizontal wall. The first path stays clear; the second reaches the wall. For a requested separation, the initial endpoint certificate is , so the shared endpoint observations cannot distinguish them. A negative lower estimate does not establish a negative physical distance.
Querying the midpoint resolves this constructed example. Model A gives another reading, and each half-interval then has the sufficient bound . Model B gives zero, demonstrating contact. More generally, a strictly positive sampled distance at or below the requested margin establishes a margin violation but not a collision. Exact zero set distance establishes contact or intersection when the modeled body is a nonempty compact set and the obstacles form a nonempty closed set.
If the chosen query, time or subdivision budget expires first, retain the undecided intervals explicitly. Accepting the whole trajectory would discard the unverified portions; labeling every undecided portion a collision would also claim information not obtained.
For exact queries, finite and a true minimum clearance at least with , subdivision eventually yields , making the simple certificate sufficient everywhere. A trajectory merely touching the required threshold has no such surplus. A clearance certificate with bounded distance-query error must also account for how conservative query bounds affect that remaining surplus.
For the autonomous differential equation , the displayed family stays at until time and then decreases below it. Here . Direct differentiation verifies the equation on each side; since , the derivative tends to zero at departure, making the joined function continuously differentiable. Distinct departure times give different solutions from the same equilibrium initial condition. The ratio is unbounded, so the local Lipschitz continuity hypothesis of the Picard-Lindelöf theorem fails.
A solution starting above reaches it in finite time. It can then use any of these continuations. For , , and initial value , arrival occurs at time two; departure at gives afterwards. Waiting-time solutions of a sublinear Bernoulli equation give a related mechanism for departures in the opposite direction.
Let q be continuous and strictly positive, with a constant a. A nonnegative solution of a differential equation may stay zero until any prescribed point and become positive afterwards. For , define
and set before . The Bernoulli power substitution verifies the equation after . Continuity of q gives , so the joining derivative is zero and the equation also holds at the join. These different waiting times give nonunique solutions from zero. The right side lacks Lipschitz continuity as a function of y near zero, so the uniqueness conclusion of the Picard-Lindelöf theorem does not apply there.
Wasserstein distance Created 2026-09-24 Updated 2026-11-05
The first Wasserstein distance measures the least expected separation achievable when two random variables are coupled with specified marginal probability measures. For a metric space and measures with finite first moments,
A transport plan says how much probability mass moves from each starting location to each destination; the distance pays the corresponding metric cost. For point masses on the real line, , because there is only one coupling. In contrast, their Total variation distance is one whenever . Wasserstein distance therefore records that nearby displacements are small even when the two laws give mass to disjoint sets.
Every coupling gives an upper bound by its expected separation. Conversely, the Kantorovich–Rubinstein theorem gives lower bounds from differences of expectations of Lipschitz functions. The p-Wasserstein distance generalizes the construction by using the th power of the ground metric and then taking a th root.
Weierstrass function 2026-10-14
A standard Weierstrass function is a uniformly convergent lacunary cosine series, here parameterized by and an integer frequency multiplier . Its continuity follows from the Weierstrass M-test. In the range , its modulus of continuity has the fractional-power scale for the positive odd-frequency model; the critical case can have the larger scale . These examples distinguish small approximation error from ordinary Lipschitz continuity.
The diffusion coefficient obtained from a scale transform for an additive-noise diffusion need only be defined on an open interval. If it is Lipschitz, its limit at a finite endpoint is zero: a positive limit would bound the derivative of the inverse scale and prevent the inverse from diverging. Extending it by zero beyond finite endpoints therefore preserves global Lipschitz continuity.