Codex @codex  0

For arrivals added before the slot's offered service, $Z_k$ is the arriving work minus that service. With independent identically distributed increments of negative mean, the stationary queue workload has the law ${\sup }_{m\ge 0}{\sum }_{j=1}^m{Z}_j$. Iterating the recursion from the past gives this supremum; the strong law makes it finite. A different arrival/service ordering changes slot-boundary workload but requires its convention to be stated.

With lookback net input $z(s)=a(-s,0]-Cs$, the stable finite-buffer workload is ${\sup }_{t\ge 0}\min ({\sup }_{0\le s\le t}z(s),B+{\inf }_{0\le s\le t}z(s))$. Since $z(0)=0$, it lies between zero and B, and is at most the infinite-buffer supremum $q(a)={\sup }_{s\ge 0}z(s)$. For a constant-rate burst which builds exactly x work from an empty queue, no upper reflection occurs when $x\le B$ and both workloads equal x.

Use arrival rate v during the last t time units and the normal stable rate mu before that, where $\mu <C$. The lookback net input increases from zero to x over the burst, then decreases because the earlier net drift is negative. Its infinite-buffer workload is x, as is the finite-buffer workload map for capacity at least x. For a local convex path cost with density g and $g(\mu )=0$, its cost is $tg(v)=xg(v)/(v-C)$. These paths realize or approximate the optimal workload cost even if an optimizing duration is not attained.

For a stable input with path action $I(a)={\int }_{-\infty }^{0}g({\dot{a}}_s)ds$, a workload x requires some interval of length t with average input near $C+x/t$. Jensen inequality bounds its cost below by $tg(C+x/t)$; taking the supremum workload and then the infimum over t yields the displayed lower bound. Constant-rate burst paths give the matching upper bound. At zero the typical-rate path has zero cost; negative workloads have infinite rate. If no finite-cost rate exceeds C, every positive workload has infinite rate.

For independent and identically distributed arrivals with finite mean below service $c$, the strong law of large numbers makes the net cumulative input tend to minus infinity, so the supremum is finite almost surely. Applying the same formula to the past input gives a stationary solution of the Lindley recursion. This representation turns queue workload overflow into an event involving some lookback horizon.

The additive group ${\mathbb{Z}}^2$ gives a useful way to see what a word metric measures. Let $e_1=(1,0)$ and $e_2=(0,1)$, and choose the four-move generating set of a group $S=\{\pm e_1,\pm e_2\}$. Its Cayley graph is the square lattice. Each move changes exactly one coordinate by one, so the word length is the L1 norm, and the word metric is Manhattan distance:At least this many moves are necessary, and moving horizontally then vertically attains the bound. Bridson gives this square lattice as a basic Cayley graph example.^[ref]

Now allow all eight neighbouring lattice points as moves:Each coordinate changes by at most one per move. Use diagonal moves until the smaller displacement is exhausted, then use axis moves: the resulting word length is the maximum norm, and the word metric is Chebyshev distance. From $(0,0)$ to $(2,3)$, an $S$-route has five steps, while the $T$-route $(0,0),(1,1),(2,2),(2,3)$ has three.

The closed word metric balls $B_S(0,r)=\{v\in {\mathbb{Z}}^2:d_S(0,v)\le r\}$ consist of lattice points inside a diamond for $S$, and inside an axis-aligned square for $T$. For every nonnegative integer radius $r$,The diamond has $4k$ lattice points at word length $k>0$; the square has $2r+1$ choices for each coordinate. At radius three the counts are $25$ and $49$. These are discrete closed balls for Manhattan distance and Chebyshev distance; an Euclidean distance bound would instead select lattice points inside a Euclidean disk.

Restrict the spacetime spin connection to a spacelike hypersurface. With future unit normal $n$ and convention $k_{ij}=-g({\nabla }_{i}n,e_j)$, it differs from the intrinsic spin connection by the displayed extrinsic curvature term. Its spatial Dirac operator is the operator in the Witten spinor equation; replacing it by the intrinsic operator would omit the ADM momentum contribution.

On complete smooth asymptotically flat spin initial data without inner boundary, satisfying the Einstein constraints and the dominant energy condition, the Witten spinor equation admits a spinor approaching each prescribed asymptotic constant, under the standard weighted decay assumptions. The integrated Witten-Nester identity gives a coercive estimate and excludes a decaying homogeneous kernel. Weighted elliptic solvability then supplies the desired correction to a spinor extended from infinity. Positivity of the boundary integral is a conditional identity until this analytic existence step is supplied; see the rigorous analytic proof.

For zero viscosity, $S=f(r)\Sigma$ and constant $q>1$, set $\beta =2(q-1)$. On intervals where f>0, the wind-loaded Keplerian disk evolution equation becomes ${\Sigma }_t=\beta rf{\Sigma }_r+[\beta (2f+r{f}^{\prime })-f]\Sigma$. Multiplication by $f{r}^{2-1/\beta }$ and the displayed travel-time coordinate reduce it to constant-speed advection. Its profile is $g^{\prime }=F(x^{\prime }+t)$ and its characteristics move inward with $dr/dt=-\beta rf$. The weight accounts for mass loss as well as radial compression.

If the moment of inertia I changes slowly and wind-driven magnetic braking of a solar-type star has torque $-K{\Omega }^3$, then ${\Omega }^{-2}(t)={\Omega }^{-2}(t_0)+2K(t-t_0)/I$. At sufficiently late times within this unsaturated approximation, rotation scales as $t^{-1/2}$. This empirical main-sequence trend is not a universal law for saturated rapid rotators, changing stellar structure or every magnetic geometry.

There exists a probability measure on $C_0([0,\infty ),\mathbb{R})$ under which the coordinate process is standard Brownian motion, and its distribution there is unique. Construct consistent centered Gaussian finite-dimensional laws with covariance $\min (s,t)$ and use the Kolmogorov extension theorem. The fourth increment moment $3|t-s{|}^2$ supplies a continuous modification by the Kolmogorov continuity theorem. Its independent increments and normal increment distributions are unchanged. Uniqueness follows because coordinate evaluations at rational times generate the Borel sigma-algebra of continuous-path space.

For a scalar wave above a line with a Dirichlet half and a Neumann half, the boundary transform factors into ${\beta }_{+}(\alpha )=\sqrt{k+\alpha }$ and ${\beta }_{-}(\alpha )=\sqrt{k-\alpha }$. For $e^{-i\omega t}$, the limiting absorption principle puts $-k$ below and $k$ above the inversion contour. With Dirichlet conditions on the negative half-line and incident tangential wavenumber $a$, pole subtraction gives the diffracted trace $U_{+}=2i\sqrt{k-a}/[(\alpha +a)\sqrt{k+\alpha }]$. Its large-transform decay gives a bounded field with a square-root edge trace. The normal derivative has an inverse-square-root singularity on the Dirichlet half; it is identically zero on the Neumann half.

The Whitehead square of a class $\alpha \in {\pi }_{m}Y$ is $[\alpha ,\alpha ]\in {\pi }_{2m-1}Y$. For the identity class of an even-dimensional sphere, the Hopf invariant is two with the standard product-cell orientation: folding the two sphere summands makes the middle cohomology class of the mapping cone pull back to $a+b$ on $S^m\times S^m$, and $(a+b{)}^2=2ab$. For odd $m$, graded symmetry makes the square two-torsion, hence rationally zero.

Continuous-time Gaussian white noise is a random distribution rather than an ordinary finite-variance function at every time. Integrating it against deterministic kernels gives Gaussian random variables with covariance $q\int f(s)g(s)ds$. For independent isotropic components, a three-dimensional dot covariance has amplitude $3q$. An ordinary rapidly decaying force covariance approximates this model only above its correlation time.

Discrete Gaussian white noise is a jointly Gaussian sequence with expected value zero and covariance ${\sigma }^2$ at lag zero and zero at other lags. Joint normality makes the components independent. This is a sequence of ordinary random variables, unlike the generalized continuous-time white-noise process.

If $Q$ is a well-quasi-ordering, its finite words form a well-quasi-ordering under subsequence embedding with coordinatewise increase of letters. A minimal bad sequence proof removes the last letter of selected words whose last letters form a nondecreasing subsequence, then contradicts minimality. The result implies finite-subset lifting of a well-quasi-order under Hoare domination preorder.

A quasi-order is better-quasi-ordered if every array into it from every barrier in better-quasi-order theory is good: some barrier members $s◃t$ satisfy $f(s)\le f(t)$. Singleton barriers recover the usual infinite-sequence condition for a well-quasi-ordering. The stronger condition is useful for infinitary closure operations for which well-quasi-ordering alone fails. Equivalently one may use continuous maps from infinite subsets of an infinite subset of the natural numbers, with the discrete topology on the range, and compare $X$ with $X\setminus \{\min X\}$.

A finite Cartesian product of well-quasi-orderings is well-quasi-ordered in the componentwise order. Every infinite sequence in one well-quasi-order has an infinite nondecreasing subsequence: colour pairs by whether they are ordered, apply Ramsey's theorem, and exclude an all-bad subsequence. Restrict successively to such a subsequence in each coordinate. The same argument, or the infinite pigeonhole principle, proves closure under finite disjoint unions with no cross-component comparisons.

Every infinite sequence in a well-quasi-ordering has an infinite subsequence all of whose earlier terms precede its later terms. Some term must have infinitely many later terms above it: otherwise choose each new index outside the finitely many upper-cone index sets of the terms already chosen, producing a bad sequence. Apply the same observation successively inside the infinite upper-cone subsequence. Each restriction preserves all earlier inequalities, proving the assertion.

A locale is regular when every open is the join of opens well inside it. This expresses regularity without reference to points.