For a closed vector subspace $Y$ of a Banach space $X$, the quotient vector space $X/Y$ is complete with its quotient norm. Closedness makes the quotient seminorm a norm. Completeness follows by choosing representatives of a rapidly Cauchy subsequence whose successive differences have summable norms in $X$.

An effective back-and-forth construction alternately extends a finite partial isomorphism of structures to include the least unused domain and range elements, searching computably for a compatible extension. If extension always exists and its finite compatibility conditions are decidable, the union is a computable isomorphism. Decidable presentations of a dense linear order without endpoints provide a basic example.

For distinct increasing knots, let ${\ell }_i(\cdot ,t)$ interpolate $(\cdot -t{)}_{+}^{k-1}$ on $t_i,\dots ,t_{i+k-1}$ and let ${\omega }_i(x)={\prod }_{r=1}^{k-1}(x-t_{i+r})$. Adjacent interpolants share $k-1$ values; their difference is a multiple of ${\omega }_i$. Its leading coefficient, by the divided difference recurrence, is the order-$k$ B-spline $N_i(t)$. Thus ${\ell }_{i+1}(x,t)-{\ell }_i(x,t)={\omega }_i(x)N_i(t)$. Telescoping proves the Marsden identity. Repeated knots require the well-defined confluent or limiting convention.

For partition-normalized B-splines $N_i$ and integral-normalized $M_i=k{N}_i/(t_{i+k}-t_i)$, let $H_{ij}=(N_i,N_j)$ and $D_{ii}=(t_{i+k}-t_i)/k$. The mixed matrix $G_{ij}=(M_i,N_j)$ equals $D^{-1}H$. It is invertible whenever the splines form a basis and their support widths are positive. It need not be symmetric, unlike the ordinary Gram matrix.

An order-$k$ B-spline is supported on $[t_i,t_{i+k}]$. Below this interval its truncated-power knot data agree with a degree-$k-1$ polynomial, annihilated by the order-$k$ divided difference; above it all data vanish. Therefore its ordinary or mixed Gram matrix has entries zero when $|i-j|\ge k$. The half-bandwidth is $k-1$, and for strictly increasing knots this bound is sharp.

With vanishing surface pressure/mass density and regular admissible displacements, integration by parts makes the axisymmetric adiabatic displacement operator symmetric in the mass density-weighted inner product. Completing the pressure square gives the displayed energy form. Nonnegative form for every admissible displacement excludes exponentially growing axisymmetric adiabatic modes in the Cowling approximation. A negative trial Rayleigh quotient proves negative spectrum by the Rayleigh-Ritz variational principle. Nonnegative stratification and epicyclic coefficients give a simple sufficient stability condition.

A centered model $X_t={\varphi }_{\nu }{X}_{t-1}+{\sigma }_{\nu }{\epsilon }_t$, with $\nu =t\mathrm{mod}S$, has season-dependent coefficients and white noise innovations. In the nondegenerate case, the causal stability condition is $|{\prod }_{\nu =1}^S{\varphi }_{\nu }|<1$. Individual coefficients can exceed one in modulus while the product remains stable. Its second-order law is a periodically correlated process.

An autoregressive polynomial with a root at one gives a unit-root model. The basic example $X_t=X_{t-1}+{\epsilon }_t$ is a random walk, whose variance grows with time when the increments have positive variance. Differencing removes this root and recovers its white noise increments.

A weakly stationary process satisfying an autoregressive model can depend on future driving white noise. For $X_t=\varphi X_{t-1}+{\epsilon }_t$ with $|\varphi |>1$, the convergent in the sense of mean-square convergence solution is $X_t=-{\sum }_{j\ge 1}{\varphi }^{-j}{\epsilon }_{t+j}$. Its autocovariance is ${\sigma }^2{\varphi }^{-|h|}/({\varphi }^2-1)$. This is different from a causal time series.

A causal time series satisfying $\Phi (B)X_t={\epsilon }_t$ with nondegenerate white noise has a square-summable present-and-past filter. The identity $\Phi (z)\Psi (z)=1$ excludes roots inside the unit disk; a pole of $1/\Phi$ on its boundary also prevents square summability. Thus all roots of $\Phi$ lie strictly outside the unit circle.

The autoregressive polynomial is $\Phi (z)=1-{\sum }_{j=1}^p{\varphi }_j{z}^j$. Substituting the backshift operator gives the autoregressive filter. Zeros outside the unit disk give the causality root criterion for an autoregressive model; zeros on the unit circle obstruct a nondegenerate stationary innovation-driven solution.

With two fixed initial states and iid N(0,1) errors, the parameter likelihood is the product of conditional transition densities. For $X_0=X_1=0$, it is proportional to $\exp [-\frac{1}{2}{\sum }_{t=0}^{n-2}(x_{t+2}-a{x}_{t+1}-b{x}_t{)}^2]$. The initial observation is a point mass and the first nonzero observation has a parameter-independent likelihood term.

Fixing a Krull-Schmidt decomposition embeds $L={\prod }_a{\mathrm{GL}}_{m_a}(k)$ by its actions on multiplicity spaces. This splits reduction modulo the Jacobson radical. Hence ${\mathrm{Aut}}_Q(X)=(1+J({\mathrm{End}}_Q(X)))⋊L$, with a closed normal unipotent first factor. The explicit section works in every characteristic.

A group multiplier automaton accepts exactly the padded convolutions of words $u\otimes v$ with $u,v\in L$ and $\overline{u}x=\overline{v}$. The case $x=\epsilon$ recognizes equality in the group, rather than equality of literal words over an alphabet.

A private-value auction gives each bidder its own value for receiving an item; the value is determined by its own type rather than by another bidder's information. An independent private values model also assumes independence between types.

For a risk-neutral single-parameter bidder with incentive-compatible type reports, interim utility satisfies $u^{\prime }(\theta )=G(\theta )$ wherever the winning probability is continuous. Consequently expected payment is determined by allocation probabilities and the utility of the lowest type. The common normalization $u(0)=0$ must be justified, not obtained from allocation alone.

Each bidder submits one private bid; the highest bidder wins and pays its own bid, while losers pay nothing. A multi-unit version can award one item to each of the highest bidders, each paying its own bid. In a monotone symmetric equilibrium, a bidder can imitate another type's bid when checking incentive constraints.

In a standard all-pay auction, every player pays its bid or effort cost, and the highest bid receives the prize. With a value $v_i$, unit effort cost, and winning probability $x_i(b)$, player $i$ has quasilinear utility $v_i{x}_i(b)-b_i$. Equal highest bids require an explicit tie rule.

With well strength $\lambda$ and spacing $a$, negative-energy Bloch states obey $\tanh y\le 2y/(\lambda a)\le \coth y$, where $y=\kappa a/2$. There is one negative band: it reaches zero when $\lambda a\le 2$ and is separated from zero when $\lambda a>2$.

Complexifying the directional transport equation yields spectral solutions analytic inside and outside the unit circle. An integrating factor built from known attenuation removes its multiplication term. The limiting Green kernels encode weighted line measurements and transverse Hilbert transforms. Their jump gives a Riemann-Hilbert problem; its solution recovers the source from an asymptotic coefficient. A general primary treatment of this spectral construction is www.stat.uchicago.edu/~guillaumebal/PAPERS/AttRadTh.pdf .