In a triangle with root , assign and . Among graph paths, the unique shortest path from to is , and that from to is , both of weight one. A shortest-path tree would have to contain all three edges, impossible for a tree. The example uses shortest simple paths; arbitrary walks can have unboundedly negative weight by repeatedly traversing the negative edge.
In a finite connected graph with strictly positive edge weights, choose any shortest path from a root to every other vertex , and let be its penultimate vertex. Every prefix is shortest: a better prefix followed by the final edge would give a cheaper walk, whose positive-weight cycles can be erased to give a cheaper path. Thus the displayed distance identity holds.
Following predecessors strictly decreases the shortest-path distance, so no predecessor cycle is possible. Since every nonroot vertex has a predecessor, every chain reaches the root. Opposite predecessor choices cannot select the same undirected edge, again by strict distance decrease. The selected graph is connected and has exactly one edge per nonroot vertex, so is a spanning tree. Along its root paths the distance differences telescope, proving that it is a shortest-path tree even if the original shortest paths were chosen independently.
Gradient catastrophe 2026-10-31
A smooth solution undergoes a gradient catastrophe when a spatial derivative becomes unbounded while the solution itself remains bounded. For , characteristics have and ; thus . Vanishing of the characteristic projection derivative gives the first such time. A weak solution with an entropy condition can continue after this breakdown of the smooth description.
Sl1QP 2026-10-31
Roger Fletcher's method uses an L1 exact penalty on linearized constraints and a bounded trust region. It therefore admits a model minimizer even when hard linearized constraints are inconsistent or the quadratic model is indefinite.[ref]
On , is a norm, bounded above by . The partial-sum map is an isometric linear embedding into the space of convergent sequences with the supremum norm. Its range contains every eventually constant sequence: take successive differences of such a sequence to obtain a finitely supported element of . These sequences are dense in , so the completion of a normed space is .
The range is proper: partial sums of the alternating harmonic series converge but their successive differences do not belong to . The finite truncations of these differences are -Cauchy and cannot have a limit in . Thus this normed version of is incomplete, despite the completeness of its usual norm.
Totally separated space 2026-10-31
A topological space is totally separated when any two distinct points are separated by a clopen set. Such a space has no nontrivial connected subset. A zero-dimensional space with its usual clopen-base definition and is totally separated. Conversely these conditions agree for compact Hausdorff spaces by the Šura-Bura lemma and compactness, although the definitions should not be conflated for arbitrary spaces. Any closed totally separated subset of the unit square is nowhere dense, since every nonempty relatively open subset of the square contains a nontrivial connected line segment. Restricting a clopen set separating the segment's endpoints would disconnect that segment.
Regular topological space 2026-10-31
A topological space is regular when a point and a closed set not containing it have disjoint open neighborhoods. Equivalently, for every point in an open set , there is an open with . To obtain shrinking, separate from the closed complement of ; the closure of the point's neighborhood avoids the other neighborhood. Conversely use such a shrinking and the complement of its closure. This definition alone does not require .
Suppose the are pairwise nonisomorphic simple modules. Any submodule of their finite direct sum that projects onto every summand is the entire sum. Induct on . Projection onto the first factors is onto by induction. Its kernel is a submodule of , hence zero or all of . If zero, is isomorphic to the first factors but also has quotient , contradicting their distinct composition factors and the Jordan–Hölder theorem. Therefore the kernel is , proving the assertion. Consequently, if , the map is onto and gives as left modules. The annihilators of these vectors need only be left ideals.
For a finite-dimensional module, it suffices that every maximal proper submodule have a submodule complement in order that every submodule have one. Let be the sum of all simple modules contained in the given module. If is proper, choose a maximal submodule containing it. A complement is isomorphic to the simple quotient and hence is itself simple. This forces , contradicting the complement. Thus . Greedily adding simple summands not already in the sum gives a direct sum in finitely many steps. Finally, given any , choose a maximal sum of these simple summands disjoint from . A missing simple summand has zero intersection with their sum plus , contradicting maximality unless their sum complements . This proves the semisimple module criterion, including the zero module.
If the left regular module of a unital ring is semisimple, then every left module is semisimple. Every module is a quotient of a direct sum of copies of the regular module, hence a quotient of a sum of simple modules. Their simple or zero images span the quotient. A maximal independent direct sum of simple submodules must span: otherwise one of these simple images has zero intersection with it and can be added. Thus the quotient is a direct sum of simples. For an infinite sum the maximality argument uses Zorn's lemma.
If is symmetric positive definite and symmetric negative semidefinite, the update is uniquely solvable for every positive step. Multiply its difference form by to obtain
For finite element heat flow, the mass norm is precisely the spatial norm, giving unconditional stability of the Crank-Nicolson method.
Counting semaphore 2026-10-31
A semaphore with a nonnegative number of available permits. Its contract must state initial availability and whether unmatched releases beyond an initial or configured bound are allowed.
Binary semaphore 2026-10-31
A semaphore with at most one available permit. Initially unavailable instances support event signalling; initially available instances can protect one-at-a-time access under a balanced acquisition-and-release discipline.
FIFO semaphore 2026-10-31
A semaphore that satisfies registered down requests in FIFO queue order. Direct handoff reserves a released permit for the oldest waiter rather than exposing it to competing newcomers. The ordering of truly concurrent registrations is determined by the registration mechanism.
A timelike equatorial Schwarzschild geodesic with specific energy and angular momentum obeys for . Substituting reduces it to , integrating to the two displayed branches. One lies outside and the other inside; each approaches the same unstable circular orbit exponentially in angle and only after infinite proper time. Linearization of about gives , confirming instability. These are separatrix approaches or departures, not stable oscillations around the circular orbit.
Mistura Scammonii Created 2026-10-31 Updated 2026-11-05
Mistura Scammonii is a scammony-containing mixture. A mixed liquid preparation differs from the isolated resin fraction.[ref]
The nonnegative scalar conservation law has a unit-mass source-type entropy solution with on and zero elsewhere. Mass conservation gives the scaling exponents , while flux balance gives , so , . The reduced ODE integrates to on the positive branch adjoining vacuum. The integral fixes the front. Its speed equals the Rankine-Hugoniot speed , between the two limiting characteristic speeds, so the front is compressive. The initial trace is a unit Dirac delta distribution, not a smooth finite-width density.
Suppose for positive times. The strictly increasing new time converts the scalar conservation law into , with . The chain rule proves the claim for classical solutions; a change of variables in the weak formulation proves it for weak solutions and preserves the time orientation of the Kruzhkov entropy inequality. An isolated zero of at the initial endpoint does not obstruct the positive-time transformation.
The Rankine-Hugoniot condition becomes , while characteristic curves obey . Thus a straight shock in the new time may accelerate in physical time. For , a constant-speed trajectory in is a parabola in . This separates genuine changes in wave structure from a common time-dependent speed factor.
Draw two distinct positions uniformly from a fixed population with . Let and . Each draw has expected value , while
Subtracting the product of the expected values proves the covariance formula and explains the finite population correction. If the sampled values are coin biases and the actual tosses are conditionally independent given those biases, the law of total covariance gives the same covariance for their head indicator random variables.
Sambucus nigra Created 2026-10-31 Updated 2026-11-05
The botanical source of fresh elder flowers, Sambuci flores in the 1867 standard.

There are unlisted articles, also show them or only show them.