Reachable set 2026-10-14
The reachable set collects all endpoints attainable from at exactly by admissible control inputs. If arrival any time up to is allowed, use , with . These definitions differ: a general dynamical system may drift away after early arrival, so waiting need not preserve the target. The reachable set is always relative to a declared input class and any constraints on the entire path.
For the double integrator starting from , now require measurable functions as control inputs with almost everywhere. Write for its endpoint at . Two integrals determine the endpoint:Our mathematical example has the exact reachable setTo see the upper boundary, fix : put first and last, switching at . This maximizes the weighted integral for position because early commands have the largest weight ; the required net velocity fixes . Formally, has the same sign as this maximizing command, so changing to any other admissible command with the same integral cannot increase . Reversing the order gives the lower boundary. Pointwise convex combinations of these two commands preserve and attain every intermediate , so the formula describes the whole region, not merely a bound. The extreme commands are bang-bang control.
In particular, the bounded double integrator can move from rest to position and rest again exactly when . Its minimum duration is therefore in these normalized units. With freely chosen time every rest-to-rest distance is attainable; with a fixed deadline many are excluded. Changing the amplitude bound to with scales this condition to . This shows why specifying the controls matters even when the Kalman rank criterion gives full rank of a matrix.
In closed quantum control, a density operator reachable set lies inside its unitary orbit of a density operator, since coherent evolution preserves the spectrum. That orbit need not be fully reachable under the available control inputs.
Suppose one row of a finite discrete memoryless channel is a convex combination of other rows: . Deleting input leaves the channel capacity unchanged. Given any input law with mass on , move that mass to the other symbols in proportions . The output law stays the same. By the concavity of information entropy, , so this replacement cannot increase conditional entropy and cannot decrease mutual information. Taking maxima proves the claim; the smaller channel is also trivially a restriction of the original one. If the entropy inequality is strict, every positive use of the redundant row is strictly suboptimal compared with its redistribution.
Schauder approximation lemma Created 2026-10-25 Updated 2026-10-31
Let be a nonempty compact convex set in a Banach space and a continuous map. For every , there is a finite-dimensional linear subspace and a continuous map that approximates uniformly to within in norm.
Choose whose open radius- balls cover the compact image . Set andThe denominator is positive. This convex combination belongs to and depends continuously on . Every contributing has distance less than from , so the triangle inequality gives .
Separable quantum state Created 2026-09-24 Updated 2026-10-14
A bipartite quantum state is separable when its density operator is a convex combination of product states; otherwise it has entanglement. Operationally, Alice and Bob can prepare a separable quantum state by sharing a classical random label and each preparing the corresponding local state.
Separable does not mean uncorrelated. The mixture in Bell correlations versus a classical mixture is separable with two terms of weight , yet the parties' records agree perfectly. A single product state would give independent local outcomes. Allowing a mixture of products captures shared classical randomness; excluding this possibility would incorrectly classify ordinary correlations as entanglement.
Sequentially weakly closed set 2026-10-25
A subset of a normed space is sequentially weakly closed when every weakly convergent sequence in has its limit in . Every weakly closed set has this property. For a convex set in a Banach space, it is equivalent to closure in the norm topology: Mazur lemma produces norm convergent convex combinations from any weakly convergent sequence, and conversely norm convergence implies weak convergence. For a Hilbert space, the weak Banach–Saks theorem in a Hilbert space supplies these convex combinations as subsequence averages. No equivalence with weak closedness is asserted here for arbitrary nonconvex sets.
Sharp bounds from binary conditional probabilities Created 2026-10-18 Updated 2026-10-25
Write , and . The law of total probability gives the displayed convex combination. With fixed and free in ,With fixed and free in ,The joint cell masses are nonnegative and sum to one, proving sharpness in the joint-model interpretation. For ordinary conditional probabilities, a conditioning event must have positive mass. If both and are specified by ratios, then : for the last bounds are strict and their endpoints are the infimum and supremum. If , the marginal equals that common value for every . Endpoint mixtures remain meaningful if the unused zero-mass conditional is treated as a prescribed conditional model rather than a defined ratio.
Support polygon 2026-11-05
A support polygon is the convex hull of a body's supporting contact positions, projected onto a horizontal plane. For a rigid body resting on that plane in a uniform gravitational field, with gravity as the only applied load besides support reactions, it describes which horizontal center of mass positions can admit static equilibrium. Widely separated feet can support a center of mass above empty space between them: the footprint's convex hull, rather than the material under every point, matters.[ref]
Robotic Systems by Kris Hauser. Chapter 12, Equilibrium conditions, support-polygon definition and Figure 3
The geometry follows directly from force and torque balance. Let the contact positions be and their upward normal forces be . The inequality expresses unilateral contact: an ordinary unbonded support can push the body upward but cannot pull it downward. For total mass , gravitational acceleration and horizontal center of mass projection , balance givesDivide by and write . ThenThus must be a convex combination of the contacts, which is exactly membership in their convex hull. Conversely, any such convex combination supplies nonnegative reactions satisfying this model's balance equations. The center of pressure of these vertical contact forces coincides with . This proves existence of allowable reactions; it does not determine every reaction uniquely when there are more contacts than independent balance equations.
For an original three-foot example, take contact positions , and in metres. The support polygon is the triangle described by , , . A body with requires the convex combination coefficientsWith , the corresponding normal forces are , and . Moving the projection to would require , a downward reaction at the first foot. No set of nonnegative normal forces can hold that configuration at rest under the stated loads.
A simple test uses a rigid plate on three small supports, a movable known mass, and three load cells measuring the upward reactions. Include the plate's own mass and center of mass when calculating the combined projection. As that projection approaches the edge , the first support's reading approaches zero. Beyond the edge, maintaining the same contact configuration would require the forbidden downward reaction; the observed motion or changed contact set marks the failure of the original static equilibrium. This is a proposed apparatus test of the balance equations, not reported experimental data.
The distance from an interior projection to the polygon's nearest edge is a static tipping margin; here it is . A boundary projection has zero margin: some supports unload, and an arbitrarily small outward shift can make balance impossible. A strictly interior projection gives a positive geometric margin against small horizontal shifts under the same model. It is not a general certificate of dynamical stability for a flexible or articulated system.
This explains a constraint in a quadrupedal robot's gait. Four feet at the corners of a square give a square support polygon. Lifting the corner leaves the triangle , , . A center of mass projection at was inside the square but is outside that triangle, so the body must shift or use dynamics to lift that foot without losing the assumed balance. The contact set must be updated when computing the support polygon.
The assumptions matter when applying the test. Nonhorizontal contacts require the full balance equations and admissible contact forces, including Coulomb friction; a projected hull alone need not decide feasibility on irregular terrain.[ref]
Robotic Systems by Kris Hauser. Chapter 12, Contact modeling, Equilibrium conditions and Multi-modal motion planning, Example 1
Additional horizontal loads also change the balance problem. For example, a horizontal force applied at center of mass height produces an overturning torque about the relevant edge. If the inward horizontal distance to that edge is , incipient tipping of a rigid body satisfies . Whether the body slides first depends on static friction. The gravity-only support polygon contains no information about or that additional load.Let . The reciprocal basis gives the coordinates of any position vector asThe point lies in the closed tetrahedron with vertices exactly when and . Indeed, these conditions express it as a convex combination of the four vertices, with fourth weight . They also describe the intersection of the four inward half-spaces bounded by its faces. Strict inequalities characterize its interior.
Weighted arithmetic mean Created 2026-10-03 Updated 2026-10-14
The weighted arithmetic mean combines values according to how much each contributes to the quantity being summarized. For a finite list of real numbers and nonnegative weights with , defineZero weights ignore an entry; at least one weight must be positive. Multiplying every weight by the same positive number leaves the result unchanged. Writing makes the weighted mean a convex combination, since and . It therefore lies between the smallest and largest input values. [ref]
https://www.itl.nist.gov/div898/software/dataplot/refman2/ch2/weigmean.pdf. NIST Dataplot reference manual: weighted mean
For example, give the values and weights and :The larger weight pulls the result closer to . The balancing identityexplains a geometric interpretation: if the weights were masses placed at positions , the weighted mean would be their center of mass. Here , so the two sides balance even though their distances from the mean differ.
Weights need an interpretation. They can represent numbers of observations, masses, or probabilities in a finite probability distribution. These meanings lead to the same formula, while answering different questions. For instance, combining means of groups uses group sizes as weights to recover the mean over individual observations. For a function and nonnegative weight function , the analogous integral is , provided is integrable and the total weight is positive and finite.

