Absolute-series criterion for completeness 2026-10-31
A normed vector space is a Banach space exactly when every absolutely convergent series converges in the space. Completeness implies the assertion because the triangle inequality makes the partial sums a Cauchy sequence. Conversely, select from any Cauchy sequence a subsequence whose consecutive differences have norm at most . The series of these differences converges by hypothesis, so the subsequence converges. The original Cauchy sequence then has the same limit. This provides a useful way to demonstrate incompleteness by a summable-norm series whose candidate sum lies outside the space.
Accumulated contact slip 2026-11-05
Accumulated contact slip measures the total distance slid at a specified contact, counting motion in either direction positively. For an absolutely continuous signed contact slip displacement in a consistently tracked local frame,It is the total variation of a function applied to the slip history. It differs from net slip , which can lose information through cancellation. Contact slip displacement explains the contact-frame convention and the connection to frictional dissipation from contact slip.
For an original piecewise-linear trajectory, suppose successive slip values are . Its net slip is , whileThe middle reversal contributes even though it moves toward smaller signed coordinates. Recording only the first and last values would report and miss eighty percent of the travelled distance in this stipulated history.
For exact samples at ordered times, the sum of absolute increments is a lower bound on the true accumulated motion; unobserved reversals can add distance between samples. The triangle inequality explains why inserting additional exact observations cannot decrease this sum. It equals the integral when the observed intervals contain no unresolved reversals and the path model is appropriate.
Measurement noise changes that conclusion about observed data. A truly stationary contact read as would acquire an apparent distance for positive . More samples can reveal real reversals while also accumulating readout noise. A useful imaging study therefore reports time resolution, length measurement calibration and the treatment of noise, rather than interpreting every absolute increment as physical sliding.
Anchored variation norm 2026-10-25
On the vector space of continuous functions of bounded variation with , the total variation of a function is a norm. Its triangle inequality and absolute homogeneity of a norm follow by applying the corresponding absolute value identities to every partition of an interval, then taking the supremum. The partition of an interval gives , so zero total variation of a function forces . The same inequality gives , proving that convergence for this norm implies uniform convergence. Without , every constant function would have zero total variation of a function.
Angular clearance bound for a rotating body 2026-11-05
A rigid body can hit an obstacle while its reference point stays fixed. An angular clearance bound for a rotating body controls the motion of every body point, allowing a collision detection calculation to reason about orientations between sampled poses.
Let a compact set lie within a bounding radius for rigid-body clearance of a fixed pivot. For a planar rotation matrix , a point moves by a chord of a circle:The same correspondence bounds the Hausdorff distance between the two body sets. For a fixed nonempty closed set of obstacles , let be the nonnegative set distance between and . The triangle inequality, applied to each point pair and then to their infima, givesThis is an explicit Lipschitz continuity bound. It concerns a fixed obstacle and the specified rigid geometry, rather than a universal constant for every robot.
To cover every intermediate orientation with excursion at most from a sampled pose, use , or the simpler . The cap matters because the sine is not increasing beyond . With translation displacement bounded by , the triangle inequality gives the sufficient clearance reduction .
For an original example, a body with rotating by at most moves any point by at most . An exact sampled clearance of leaves at least throughout that angular excursion when the pivot and obstacles stay fixed.
The whole excursion must be bounded, not just the difference between endpoint orientations modulo . A full revolution has identical endpoint orientations but can sweep through an obstacle. Likewise, a unit half-length rod rotating from to about its center clears an obstacle point at by at both endpoints but touches it midway. Adaptive clearance sampling therefore uses bounds on the actual interpolated motion. Configuration-space orientation and clearance are central to the continuous-path planning problem.[ref]
Robotic Systems by Kris Hauser. Chapter 9, rotational configuration-space obstacles and planning in SE(2)
Banach space Created 2026-09-24 Updated 2026-10-14
A Banach space is a normed vector space over the real numbers or complex numbers that is complete for the metric . Explicitly, whenever a sequence satisfiesthere is an element of the same space with . The hypothesis says that the approximations eventually agree to any requested accuracy; completeness says that they describe an actual object in the space. The Cauchy sequence condition can be checked before anyone knows what that object is.
This makes a Banach space a natural setting for constructing solutions by successive improvements. If corrections have , their partial sums form a Cauchy sequence by the triangle inequality, and completeness supplies their sum. In fact, convergence of every such absolutely summable vector series characterizes a Banach space. The contraction mapping theorem uses precisely this mechanism: each correction is smaller than the preceding one by a fixed factor.[ref]
https://ocw.mit.edu/courses/18-102-introduction-to-functional-analysis-spring-2021/3d4cc88026d44a01f936cd6a0aa995cb_MIT18_102s20_lec_FA.pdf. Richard Melrose, Functional Analysis, chapter 1, section 3, Proposition 1.2: completeness and summable series
Every normed vector space of finite dimension is a Banach space. Infinite-dimensional examples include the absolutely summable sequence space and the l-infinity sequence space; the choice of norm remains part of the specification. A collection of increasingly accurate finite descriptions can require an infinite description for its limit, as the finitely supported sequence example below demonstrates. Completion of a normed space adds these missing limits while preserving all original distances.
Best approximation in a normed space 2026-10-14
Given in a normed vector space and a vector subspace , an element is a best approximation if . Existence is automatic for a finite-dimensional vector subspace: a minimizing sequence can be bounded by the triangle inequality, and a subsequence converges by compactness in finite dimension. An arbitrary infinite-dimensional vector subspace need not contain a minimizer. The norm matters: best uniform approximation uses the supremum norm, while approximation minimizes integrated absolute error.
Bhattacharyya distance 2026-10-14
The Bhattacharyya distance is the negative natural logarithm of the Bhattacharyya coefficient, with . It is zero for identical probability distributions and infinite for disjoint probability supports. Despite the name, it need not satisfy the triangle inequality required of a metric.
Bilinear sum Created 2026-09-28 Updated 2026-11-05
A bilinear sum has the formwhere are finite index sets and the coefficient sequences can be controlled separately. It is a bilinear form in these two coefficient lists. In analytic number theory, the function often oscillates with the product , as in a Type II sum.
The Cauchy-Schwarz inequality eliminates one coefficient list and exposes correlations:Useful cancellation comes from small off-diagonal correlations, not from the bilinear notation alone. For example, take and . Orthogonality of roots of unity makes the inner correlation for and zero otherwise, giving . The termwise triangle inequality only gives . This explains why Fourier analysis and large sieve estimates are effective tools for bilinear sums.
Bounded-displacement permutation of the natural numbers Created 2026-09-24 Updated 2026-11-05
A permutation of has bounded displacement if some nonnegative integer satisfiesThe same bound works at every position; each individual difference being finite would impose no restriction. Displacement zero gives the identity permutation.
For displacement at most one, every permutation is a collection of disjoint adjacent transpositions and fixed points. To prove this, inspect the smallest position not yet fixed or paired. Its image must be , and the only still available possible preimage of is . Thus these two positions are exchanged; continue inductively. Conversely, any such disjoint collection satisfies the bound. Independently choosing whether to exchange each pair gives an uncountable set of examples.
The inverse function has the same displacement bound: if , then . If two permutations have bounds , their function composition has bound by the triangle inequality. Thus bounded-displacement permutations form a group under function composition.
Bounded Lipschitz norm 2026-10-14
The bounded Lipschitz norm combines the Lipschitz constant and supremum norm of a bounded real-valued Lipschitz function on a metric space. Both summands satisfy the triangle inequality; the supremum term makes the sum definite even on constant functions. Its unit ball requires the sum of the two bounds to be at most one, a stronger requirement than bounding each separately by one.
Suppose a series of functions has uniform absolute convergence on and is a uniformly bounded family of functions there, with common bound . The triangle inequality givesThe right-hand side tends uniformly to zero as . The Uniform Cauchy criterion proves uniform convergence of . Applying the same estimate to proves uniform absolute convergence too.
Bounding radius for rigid-body clearance 2026-11-05
A bounding radius for rigid-body clearance bounds the distance of every point of a rigid body from the reference point used to describe its motion. It converts angular motion into a bound on point displacement, so collision detection can account for the whole body between sampled poses rather than only its reference point.
Let be a nonempty compact set in body coordinates and let be the chosen pivot in those coordinates. A valid radius satisfiesThe maximum exists by compactness and continuity of the Euclidean norm. A bound larger than is conservative; a smaller one does not cover the specified geometry. For a convex polytope with vertices , it is sufficient and exact to use : expressing a point as a convex combination and applying the triangle inequality proves that no interior point is farther away than the farthest vertex.
For an original rectangular-body example, take side lengths and . A pivot at the centre gives . A pivot at a corner instead gives . For a rotation about the respective fixed pivot, the angular clearance bound for a rotating body isThe smaller radius cannot be used for the corner-pivot motion unless the changed motion of the reference point is also included. A convenient geometric centre does not automatically remain stationary.
For a moving reference point with speed at most and angular speed at most , a point-speed bound is . This supplies a Lipschitz continuity constant for clearance against fixed obstacles. The role of body geometry and orientation in configuration space is developed in the primary planning text.[ref]
Robotic Systems by Kris Hauser. Chapter 9, Translating robots, C-obstacles for rotational motion and Motion planning in SE(2)
The modeled body must include attached tools and protrusions relevant to the query. Uncertainty in a rigid-body bounding radius can be accommodated with a conservative geometric enlargement. This radius controls motion around the declared reference point; it does not replace the separate required clearance margin for uncertain obstacle locations or tracking errors.
Bourgain-Demeter decoupling theorem 2026-11-05
The Bourgain-Demeter decoupling theorem controls a function whose Fourier support lies near a positively curved hypersurface by the contributions from small frequency caps. For a compact hypersurface in , , with positive-definite second fundamental form, decompose its -neighborhood into caps of tangential width and normal thickness . If denotes the corresponding Fourier pieces, the critical estimate isThe constant is independent of and , for the fixed surface and chosen cap decomposition. The same arbitrarily small loss holds for ; supercritical exponents require an additional scale power.[ref]
The proof of the l2 Decoupling Conjecture by Jean Bourgain and Ciprian Demeter. Theorem1.1 and equation(3), printed pp351–352
Box Cauchy-Schwarz inequality 2026-10-05
For four real-valued functions on a finite Cartesian product, let . Repeated Cauchy-Schwarz inequalities giveFirst separate the two averages and apply Cauchy-Schwarz inequality in . Each resulting squared factor is , bounded by by another Cauchy-Schwarz inequality. Expanding the four factors of and applying this inequality to each of the sixteen terms gives the triangle inequality for the box norm.
Brouwer fixed-point theorem Created 2026-09-24 Updated 2026-10-14
The Brouwer fixed-point theorem says that every continuous map has a fixed point when is a nonempty compact set and a convex set in a finite-dimensional vector space over the real numbers. Equivalently, take for a finite , with the usual Euclidean space structure: there is some such that . The conclusion guarantees at least one fixed point, without asserting uniqueness or telling us how quickly to find one. [ref]
https://courses.csail.mit.edu/6.5440/fall23/lectures/L23_images.pdf. MIT lecture slides on Brouwer's theorem
The standard pictures are a closed ball, including a closed unit ball, and a simplex. A filled disk qualifies; its bounding circle alone does not. A probability simplex also qualifies even though its dimension is smaller than that of its ambient Euclidean space. The hypotheses have concrete meanings: being a convex set keeps every line segment between allowed points inside , and compactness prevents escape or loss of a limiting point. In Euclidean space, the Heine-Borel theorem identifies compact sets with closed sets that are bounded sets. Crucially, every output must belong to the same as the input.
For a fully computable example, let be the filled unit disk. Apply a counterclockwise quarter-turn rotation, shrink by , and add a translation:This affine map is a continuous map. Because the rotation preserves the Euclidean norm, the triangle inequality gives, for every ,Thus the whole image lies strictly inside . More precisely, it is a disk of radius centred at . This containment check is what makes the Brouwer fixed-point theorem applicable; a formula being a continuous map by itself would not suffice.
The fixed point can now be found by a system of linear equations:Indeed, substitution gives . Its Euclidean norm is , safely inside . The figure shows arrows from sample inputs to their outputs; an arrow disappears at the fixed point because the displacement vanishes there.
Repeated iterations of a map happen to succeed for this example. Starting at and setting gives , , and . Subtracting the fixed point equation yields , so the Euclidean distance to shrinks by exactly each step. This extra fact follows from the contraction mapping property and the Banach fixed-point theorem. It is additional information beyond the Brouwer fixed-point theorem.
The distinction becomes visible with two simpler continuous maps of the same disk. The pure rotation has exactly one fixed point, , since and force both to vanish. Yet iterations of a map starting at here cycle through , , and forever. Their Euclidean distance from stays one, so there is no convergence in a metric space. The reflection has an entire line segment of fixed points, namely . Starting off that line segment produces an alternating pair. Existence, uniqueness, and convergence of iterations of a map are separate questions.
Removing hypotheses changes the answer. Restrict the same quarter-turn rotation to the circle . It remains a continuous map into that compact set, but its only possible fixed point, , has been removed. The circle is not a convex set. Conversely, on the unbounded convex set , the translation has no fixed point; on the open interval , also has none. Neither domain is a compact set. The finite-dimensional closed ball statement should likewise not be extended to arbitrary infinite-dimensional vector spaces, where a closed ball need not be a compact set.
The one-dimensional version explains the connection to the intermediate value theorem. For a continuous map , put . Then and , so the intermediate value theorem gives for some . In higher dimensions, the Brouwer fixed-point theorem supplies a corresponding existence principle when this scalar sign argument is unavailable. Its practical value is ensuring that a proposed equation has a solution once a suitable domain is found; it supplies no general promise of a fast algorithm.
A useful application is positive matrix eigenvector from simplex normalization: rescale the output of a strictly positive matrix to make its entries sum to one. For example, takeOn this probability simplex, has entry sum , so the normalized continuous map is . Both entries are positive and sum to one, keeping the image inside the probability simplex. Its fixed point equation is , hence . Consequently satisfies : a strictly positive eigenvector with eigenvalue . In larger dimensions, the Brouwer fixed-point theorem guarantees the corresponding positive eigenvector without requiring us to solve a system of linear equations in advance. The fixed point expresses preservation of relative weights, rather than preservation of their unnormalized size.
Proofs can be approached through the no-retraction theorem or Sperner's lemma. In the latter approach, increasingly fine triangulations locate approximate fixed points; compactness supplies a convergent subsequence, and continuous maps turn its limit into an exact fixed point. [ref]
https://www.mit.edu/~6.7980/brouwer.html. Daskalakis and Farina, Brouwer and Sperner
A primary historical reference is L. E. J. Brouwer's 1911 paper Über Abbildung von Mannigfaltigkeiten, whose digitized original is hosted by Zenodo under DOI 10.1007/BF01456812. This gives a direct route to the early literature behind the Brouwer fixed-point theorem. [ref]
https://zenodo.org/records/1428286. Brouwer, Über Abbildung von Mannigfaltigkeiten, 1911
Cauchy criterion for a function limit 2026-10-25
For a function into a complete metric space, the displayed pairwise condition is equivalent to existence of a limit as . Necessity follows from the triangle inequality. For sufficiency, the values form a Cauchy sequence, hence converge to some . Given , use the pairwise condition with and then send in . This gives for every sufficiently small positive .
Cauchy sequence Created 2026-09-24 Updated 2026-10-14
A Cauchy sequence is a sequence whose sufficiently late terms are all close to one another. In a metric space , the precise condition isFor real numbers with their usual metric, . The useful feature is that the definition compares computed terms to other computed terms: it does not require an already known limit of a sequence. The one index must control every pair of later indices, not merely successive terms. [ref]
https://www.jirka.org/ra/html/sec_cauchy.html. Lebl, Basic Analysis I, §2.4: Cauchy sequences and the role of all late pairs
.For an explicit example, take for . Its tail of a sequence beginning at lies in , and for every ,Choose with to certify the entire future sequence. For , works because . The limit of a sequence is one, but the pairwise bound establishes the Cauchy sequence property without first needing that answer. By contrast, is not a Cauchy sequence: arbitrarily late even integers and odd integers give values separated by two. [ref]
https://www.ocw.mit.edu/courses/18-100a-real-analysis-fall-2020/mit18_100af20_lec102.pdf. MIT 18.100A, Lecture 10, Definition 1, Negation 3 and Example 4
.A Cauchy sequence confines every sufficiently late pair to a small band; persistent alternation cannot do so
. The original geometric example has all terms with in , a band narrower than . Only finitely many terms are drawn; the formula certifies the entire tail. The alternating example continues to attain both and arbitrarily late. Details.Tiny successive changes do not provide this guarantee. For the harmonic numbers , the successive difference tends to zero, butThus, beyond every proposed , choosing and defeats the fixed tolerance . Even every fixed positive lag passes the weaker test: . The failing lag grows with , as explained more generally by convergence from arbitrary variable-lag increments. [ref]
https://www.jirka.org/ra/html/sec_cauchy.html. Lebl, Basic Analysis I, §2.4: shrinking fixed-lag increments do not imply the Cauchy condition
.Harmonic numbers take vanishing successive steps while retaining a nonvanishing gap between indices and
. The blue curve is ; the red curve is . The exact lower bound holds for every positive integer , not just the plotted sample. The shaded region between and in the right panel illustrates how many individually small terms produce a substantial gap. Details.Every convergent sequence in a metric space is a Cauchy sequence: apply the triangle inequality to two late terms and their common limit of a sequence. The reverse implication requires completeness. It holds in the real numbers by completeness of the real numbers, but can fail in the rational numbers: the rational endpoints from the bisection method approaching are a Cauchy sequence with no rational limit of a sequence. The existing construction in completeness of the real numbers shows how this happens. A Cauchy sequence is always a bounded sequence; in , boundedness gives a convergent subsequence by the Bolzano-Weierstrass theorem, and the pairwise condition forces the whole sequence to share its limit. [ref]
https://www.ocw.mit.edu/courses/18-100a-real-analysis-fall-2020/mit18_100af20_lec102.pdf. MIT 18.100A, Lecture 10, Theorems 5–7: boundedness, subsequences and real completeness
. Cauchy subsequence Created 2026-09-29 Updated 2026-10-14
A Cauchy subsequence is a subsequence that is a Cauchy sequence. Every subsequence of a Cauchy sequence is a Cauchy sequence, because its increasing indices eventually lie beyond any index required by the original pairwise bound. Every convergent subsequence is also a Cauchy sequence.
The converse about the original sequence fails: has a constant subsequence at its even integers, hence a Cauchy sequence, while itself is not a Cauchy sequence. If the original sequence is already a Cauchy sequence and one subsequence converges to , however, the whole sequence converges to . Choose a late subsequence term close to and use the triangle inequality to compare it with every sufficiently late original term. [ref].
Cesàro theorem for convergent sequences Created 2026-10-05 Updated 2026-10-31
If a real or complex sequence converges to , its Cesàro means have the same limit of a sequence. This is why Cesàro summation is a regular summation method when applied to the partial sums of a series.
Proof outline. Given , choose so that for . The triangle inequality gives, for ,The finite initial contribution tends to zero, and the remaining contribution is at most . The converse fails: the alternating sequence has Cesàro means tending to zero while its terms do not converge.
Clearance bound between trajectory samples 2026-11-05
A clearance bound between trajectory samples converts finitely many separation checks into a guarantee over a continuous trajectory, using a justified bound on how quickly clearance can change. Clear endpoints alone are insufficient: a foot or another robot part can approach an obstacle and move away again between them. The primary planning formulation requires constraints along the entire path.[ref]
Robotic Systems by Kris Hauser. Chapter 8, Point-to-point path planning: continuous path satisfying feasibility for every path parameter
Let nominal clearance have Lipschitz constant on a checked interval of length . If both endpoint clearances are at least , then every intermediate point is within of an endpoint. ConsequentlyThis follows directly from using the nearer endpoint. A uniform additional worst-case geometry or execution allowance gives actual clearance at least .
A tighter interval certificate retains the two different endpoint values, and . Writing gives two lower cones,If and , the cones meet inside the interval. Their common height yieldsIf the endpoint difference exceeds , the proposed Lipschitz bound and exact endpoint values are inconsistent; simply applying the formula does not repair that inconsistency. With , clearance is constant.
For an original example, take , , and . The simpler endpoint-minimum bound gives ; the two-cone bound gives . Subtracting a execution allowance leaves a certified actual gap, sufficient for a requested margin. These are lower bounds, not assertions that the trajectory reaches their values.
A counterexample explains why the allowance is necessary. On , has endpoint values one but touches zero at the midpoint. Checking only those endpoints misses the contact. Its derivative is bounded in magnitude by four, so a sufficiently fine sample grid with that valid bound can expose the missing guarantee.
The constant must match the geometry and parameter units. For a point moving relative to a fixed closed obstacle set, the distance to that set changes by at most the point’s displacement: the triangle inequality gives . A speed bound therefore supplies a time-based clearance bound. A rotating body requires a bound on every occupied point, such as the angular clearance bound for a rotating body; terrain-height clearance across a discontinuous edge cannot use a finite slope bound across that jump.
Adaptive clearance sampling subdivides intervals that fail the chosen certificate, concentrating computation where the margin or speed bound is least favorable. Failure of a conservative certificate means the interval needs better bounds or further checking; it does not itself prove a collision. For a proposed robot-foot test, validate the motion and geometry error bounds in one coordinate frame and compare the certified interval minima with dense independent measurements. Use the robust swing-foot clearance margin allowances without counting the same uncertainty twice.



