A connected space is nilpotent when its fundamental group is nilpotent and its action on each higher homotopy group is nilpotent: the module has a finite filtration whose successive quotients have trivial group action. Simply connected spaces satisfy these conditions automatically. They are the natural setting for localization and rationalization, since fibrewise coefficient localization is compatible with the successive untwisted stages of such a filtration.

For $M={⨁}_j(F_q[t]/(f^j){)}^{m_j}$ with $f$ irreducible of degree d and partition $\lambda =(j^{m_j})$, its automorphism group has order $q^{d{\sum }_i({\lambda }_i^{\prime }{)}^2}{\prod }_j{\prod }_{r=1}^{m_j}(1-q^{-dr})$. The endomorphism algebra has dimension $d{\sum }_{a,b}\min (a,b)m_a{m}_b=d{\sum }_i({\lambda }_i^{\prime }{)}^2$; its semisimple quotient is ${\prod }_j{M}_{m_j}(F_{q^d})$, and units are precisely lifts of units in that quotient.

A finite bounding rectangle exists when $\sqrt{h(x)}$ and $x\sqrt{h(x)}$ are bounded. This is not automatic for every probability density function: tails proportional to $(1+|x|{)}^{-3/2}$ give an unbounded second coordinate. In principle any finite-area measurable region has an open envelope of finite area, decomposable up to null boundaries into disjoint dyadic rectangles. Select a rectangle with probability proportional to its area, then sample its two coordinates uniformly and reject outside the target region. The accepted point is uniform on the region, with acceptance equal to the ratio of their areas. Constructing an effective envelope remains a density-specific computational step.

For the unnormalized normal density $h(x)=e^{-x^2/(2{\sigma }^2)}$, the smallest axis-aligned envelope is $0<u<1$ and $|v|\le \sigma \sqrt{2/e}$. The boundary reaches that width at $u=e^{-1/2}$. Region area is $\sigma \sqrt{\pi /2}$, so the acceptance rate is $\sqrt{\pi e}/4$, independently of $\sigma$. Multiplying $h$ by a positive constant rescales both coordinates and their areas consistently.

For the unnormalized Laplace distribution probability density function $h(x)=e^{-|x-1|/2}$, the ratio-of-uniforms method uses $0<u\le \sqrt{h(v/u)}$. The maximum of $h$ is one. On $x\le 0$, the maximum of $x^{2}h(x)$ occurs at $x=-4$ and equals $16e^{-5/2}$. On $x\ge 0$, it occurs at $x=4$ and equals $16e^{-3/2}$. Thus the displayed rectangle contains the region. Its area is $4(e^{-3/4}+e^{-5/4})$, while the target region has area $\frac{1}{2}\int h=2$. Uniform proposals in the rectangle, accepted when $u^2\le h(v/u)$, therefore return the correct Laplace distribution with acceptance probability $[2(e^{-3/4}+e^{-5/4}){]}^{-1}$.

Set $G_n=U_n-\theta V_n$, and define the estimator on zero-denominator events as part of the model. On $V_n>\delta >0$, its error is at most $|G_n|/\delta$. Centering $G_n$ and applying the Cauchy-Schwarz inequality gives the displayed bound, where $r_n$ is the expected error on $V_n\le \delta$. This controls a ratio estimator without falsely assuming that its numerator and denominator are independent.

For the finite alphabets considered here, the zero-rate distortion threshold is the smallest expected distortion obtainable by always outputting one fixed reconstruction. Such a reconstruction is independent of the source, so its mutual information is zero. A randomized output that is independent of the source averages the costs of fixed reconstructions and cannot improve their minimum. Thus $R(D)=0$ exactly when $D\ge D_{\mathrm{zero}}$. For a fair bit under Hamming distortion, $D_{\mathrm{zero}}=1/2$; for a Bernoulli random variable of parameter $p$, it is $\min \{p,1-p\}$. The threshold depends on the source probability distribution, rather than only the alphabet.

For a finite alphabet source with independent and identically distributed symbols, a finite reconstruction alphabet, and a bounded nonnegative separable distortion, the rate-distortion function is the asymptotic limit for fixed-length lossy codes. In particular, for a distortion target in the interior of the feasible range and every $\epsilon >0$, sufficiently long block codes exist with rate at most $R(D)+\epsilon$ and expected distortion at most $D+\epsilon$. Every such $n$-symbol code obeys $R_n\ge R(D_n)$, where $D_n$ is its actual expected distortion.^[ref]

The outline is instructive. The data processing inequality bounds the mutual information in a reconstruction by the information entropy of the transmitted message, which is at most ${\log }_2{M}_n$. Independence and the convexity of the rate-distortion function then give the per-symbol lower bound. For achievability, choose many reconstruction blocks using a suitable probability distribution, so that the source's typical blocks are likely to have an acceptable nearby reconstruction. This is a covering argument; it does not require recovering the original block exactly.

A fixed-length lossy code maps a block of $n$ source symbols to one of $M_n$ messages, then maps that message to a reconstruction block. The encoder and decoder together define the reconstruction. Its rate is ${\log }_2{M}_n/n$ bits per source symbol; an implementation using a fixed binary message needs $\lceil {\log }_2{M}_n\rceil$ transmitted bits per block. Its performance also depends on expected distortion, block length, and the chosen distortion measure.

A test channel is a proposed conditional distribution of a reconstruction given the source symbol. It describes a candidate joint probability distribution for evaluating mutual information and expected distortion. It need not be a physical transmission channel, or an implementable one-symbol encoder; the Shannon rate-distortion theorem relates this optimization to long block codes.

A distortion measure assigns a nonnegative cost to replacing a source symbol $x$ by a reconstruction $\hat{x}$. It need not be a metric: the two alphabets may differ, and neither symmetry nor the triangle inequality is required. Choosing the cost is part of the model. For numerical symbols, $d(x,\hat{x})=(x-\hat{x}{)}^2$ gives mean squared error after averaging; for exact symbol agreement, use Hamming distortion.

In free molecular flow, gas–gas collisions are negligible over the trajectories relevant to the observable. Molecules still encounter walls, whose scattering of momentum and energy must be modeled. In a long narrow tube, ${\ell }_{\mathrm{mfp}}$ exceeding the diameter does not by itself prove that every complete transmission path is collision-free: repeated wall reflections can create much longer paths. The approximation must be checked against those paths as well as the width. ^[ref]

A Knudsen layer is the gas region adjoining a boundary where the molecular distribution departs from the bulk near-equilibrium description over distances of order a few mean free paths. Continuum slip and jump conditions describe an effective boundary for the outer solution; they do not resolve this layer. ^[ref]

For endomorphisms $S,T$ of a finite-dimensional space of dimension $d$, $r(S+T)\le r(S)+r(T)$ and $n(ST)\le n(S)+n(T)$. If both equalities hold, the first gives $r(S)+r(T)\le d$, while the second gives $2d-r(S)-r(T)\le d$. Thus the rank sum is $d$, $S+T$ is an isomorphism, and $ST=0$. Conversely, $ST=0$ implies $\mathrm{im}T\subseteq \ker S$ and hence rank sum at most $d$, whereas invertibility of $S+T$ gives rank sum at least $d$. This proves both equalities.

Divide participants into strata defined by prespecified baseline prognostic variables and randomize independently within each stratum. Permuted blocks can keep treatment counts close throughout recruitment. This supports balance of the stratification variable between arms by design, while allocation concealment keeps upcoming assignments hidden. Analyses should account for important design strata where appropriate.

For each new eligible participant, compare the imbalance that would result from each treatment assignment across prespecified baseline covariate margins. Assign with a probability favoring the less imbalanced choice, while retaining a random component and allocation concealment. This targets marginal balance when a large number of joint strata makes stratified randomization with blocks inefficient. It is a sequential allocation rule, and inference should respect its design.

For discrete random variables $X,Y$, their joint probability mass function assigns a probability to each possible ordered pair. Its entries are nonnegative and sum to one. Marginalization gives the probability mass functions $p_X(x)={\sum }_y{p}_{X,Y}(x,y)$ and $p_Y(y)={\sum }_x{p}_{X,Y}(x,y)$. In a table with rows indexed by $x$ and columns by $y$, these are the row and column totals. The joint probability distribution records how the coordinates occur together, while the marginal distributions describe each separately.

For independent and identically distributed random variables $X_j$ independent of a nonnegative integer count $N$, set $S={\sum }_{j=1}^N{X}_j$, including $S=0$ when $N=0$. Conditioning on the count gives $\mathbb{E}[e^{tS}\mid N=k]=M_X(t{)}^k$, hence the displayed composition of the moment-generating function with the probability generating function. For positive summands the identity holds for all $t\le 0$; positive $t$ requires convergence of the composed series. This permits Laplace transforms of nonnegative random variables to identify the law even when positive exponential moments do not exist.

Let $n$ be a positive integer, let $0<p<1$, and put $q=1-p$ and let the original independent count have negative binomial distribution with probability mass function $\left(\genfrac{}{}{0ex}{}{n+k-1}{k}\right)p^n{q}^k$ on $k\ge 0$. With unit-rate exponential distribution severities, its moment-generating function is $[p+qp/(p-t){]}^n$ for $t<p$. Thus it also has a random sum of independent claims representation with independent binomial distribution count $B$ and rate-$p$ exponential distribution steps. For $n=2$ the law is $p^2{\delta }_0+2pq\mathrm{Exp}(p)+q^2\mathrm{Erlang}(2,p)$. The hurdle decomposition of a positive random sum therefore has zero mass $p^2$ and positive density $p^2{e}^{-px}(2q+q^{2}x)/(1-p^2)$.

The positive-integer restriction on $n$ is essential for the finite binomial distribution representation. A negative binomial distribution also permits noninteger positive shape through its generalized probability mass function, but that broader model cannot be represented by a binomial distribution with a noninteger number of trials.

Take an independent geometric distribution count with $\mathbb{P}(N=k)=p(1-p{)}^k$, $k\ge 0$, and sum its independent positive claims. Its moment-generating function is the displayed composition wherever finite. With $q=1-p$ and severity moments $m_j$, the third cumulant is $(q/p)m_3+3(q/p{)}^2{m}_1{m}_2+2(q/p{)}^3{m}_1^3$, which is strictly positive for nonzero positive claims and $0<p<1$. The law has an atom of mass $p$ at zero. Its positive-count convention would instead add a factor $M_X(t)$ to the numerator, as in the geometric-sum moment-generating function.