The guaranteed radius is the largest integer $t$ for which all unknown-location Pauli operators of weight at most $t$ can be corrected together. Pairwise products have weight at most $2t$, so $2t<d$ suffices by the Knill--Laflamme condition. Conversely, split a minimum-weight undetectable Pauli operator between two subsets of its support. If $d\le 2t$, this gives two errors of weight at most $t$ whose pairwise product violates that condition. Consequently $d$ is either $2t+1$ or $2t+2$; parity cannot be recovered from $t$ alone.

Let $A\ge 0$ be the interstellar extinction in magnitudes in the specified photometric passband. Compared with the same unobscured source at the same distance, its radiative flux is multiplied by $10^{-0.4A}$, so its apparent magnitude increases by $A$. Consequently,Here ${\mu }_0$ is the extinction-corrected distance modulus. The correction subtracts $A$ before using the distance formula. Caltech's NED distance-method documentation explicitly distinguishes an apparent distance modulus from an extinction-corrected distance modulus. ^[ref].

Ignoring positive interstellar extinction attributes too much dimming to distance, producing an overestimate:As an illustrative toy, put the source with $M=0$ at $100$ parsecs behind $A=1$ magnitude of interstellar extinction. The measured apparent magnitude is $m=6$. Setting $A=0$ incorrectly gives $d_{\mathrm{inferred}}=10\mathrm{pc}\times 10^{6/5}\simeq 158.489\mathrm{pc}$, a factor $1.584893$ too large. Subtracting the known $A=1$ recovers $100$ parsecs. The diagram's fixed $A=1$ offset is a controlled illustration, not a model of how actual interstellar extinction grows with distance, and none of its values are star catalogue measurements.

Two independent point-source pure plumes with $\psi =B_1/B_2<1$ remove lower-layer volume $Q=C(B_1^{1/3}+B_2^{1/3})h_1^{5/3}$. If plume 1 feeds the middle layer, its reduced gravity is $g_1^{\prime }=B_1/[C{B}_1^{1/3}{h}_1^{5/3}]$. The upper outflow carries both sources, so $g_2^{\prime }=(B_1+B_2)/Q$, yielding the displayed ratio. Opening flow is driven by the integrated hydrostatic head $g_1^{\prime }(h_2-h_1)+g_2^{\prime }(H-h_2)$. A plume crossing the lower interface has altered buoyancy relative to its new ambient and must be continued with nonzero incoming mass and momentum fluxes rather than reset as a zero-flux pure plume.

For a pure plume with $g_p^{\prime }=\gamma B^{2/3}{z}^{-5/3}$, a steady sharp interface at $z_i$ has $Q_p=B^{1/3}{z}_i^{5/3}/\gamma$ and warm-layer reduced gravity $g^{\prime }=B/Q_p$. A freely discharging upper doorway of height $D$ and width $W$ has available head $D-z_i$. Equating plume supply to the broad-crested weir flux gives the displayed implicit height relation, with $0<z_i<D$. Warm air above the doorway stores heat but adds no available head at its crest in this uniform-layer model.

Here $G$ is the complex internal horizontal torque, $P$ the vertically integrated pressure, and ${\omega }_1,{\omega }_2$ the approximate nodal precession and apsidal precession rates. In the exactly Keplerian case, local plane waves obey ${\omega }^2=k^{2}P/(4\Sigma )=k^2{c}_s^2/4$, so tilt disturbances propagate at $c_s/2$. The secular thin-disk approximation requires wavelengths large relative to the height while the local approximation requires them small relative to the orbital radius.

A subset of a topological space is discrete when its subspace topology is a discrete topology: every point has an ambient neighbourhood meeting the subset only in that point. A discrete subset need not be closed; for example $\{1/n:n\ge 1\}$ in the real line accumulates at zero. The group structure makes a discrete subgroup of a Hausdorff topological group closed, an additional property used in discontinuity arguments.

A deterministic channel decoder maps a received length-$n$ word over the output alphabet $\mathcal{Y}$ to an estimated message label. Given message $m$, successful decoding means $g(Y^n)=m$, where $Y^n$ is the random received word after the communication channel acts on the channel encoder's word $f(m)$. The channel decoder can recover a message despite changed symbols because it uses the relationships among complete codewords. The Shannon second coding theorem concerns choosing both maps so that the decoding-error probability becomes small at a specified rate.

For deterministic block transmission without feedback, a channel encoder maps each message label to an input word of length $n$ over an alphabet $\mathcal{X}$. These words are the codewords of a block code. Distinct messages should have distinct codewords: if two labels give the same word, even a noiseless communication channel cannot tell them apart. The channel encoder may add redundancy, so the transmitted word can be longer than the message representation.

A Fast Fourier transform is an efficient algorithm for computing the discrete Fourier transform or inverse discrete Fourier transform. The discrete Fourier transform specifies the mathematical result; a Fast Fourier transform specifies how to compute it. Different Fast Fourier transform algorithms reorganize the same finite sums, with the selected sign and normalization. The Cooley-Tukey FFT algorithm is one important family of Fast Fourier transforms, using factorization of the record length.^[ref]

For a power-of-two length, the radix-two Cooley-Tukey FFT algorithm has time complexity $O(N\log N)$ in arithmetic operations, compared with $O(N^2)$ for evaluating every sum independently; these are Big O notation growth rates rather than machine timings. It returns the same eight coefficients $(8,4,-2i,0,0,0,2i,4)$ in the example. In exact arithmetic this reorganization introduces no approximation; actual implementations still incur roundoff error.

With normalization ${\hat{U}}_k=N^{-1/2}{\sum }_m{U}_m{e}^{-2\pi imk/N}$, the discrete Fourier transform is a unitary matrix. Orthogonality of the roots-of-unity vectors gives the displayed identity. Multiplying both sides by the grid spacing gives the corresponding discrete L2 norm. Modal contraction therefore proves grid-norm contraction without a mesh-dependent change-of-basis constant.

If $\omega$ is a primitive $n$th root in a finite field and the field characteristic does not divide $n$, the inverse transform is $c_j=n^{-1}{\sum }_{\ell =0}^{n-1}{\hat{c}}_{\ell }{\omega }^{-j\ell }$. The identity ${\sum }_{j=0}^{n-1}{\omega }^{jm}=0$ unless $n\mid m$, when the sum is $n$, proves inversion. For a primitive cyclic Reed-Solomon code, encoding assigns the $k$ unconstrained transform values and makes the remaining values zero; received transform values at those zeros are syndromes.

For a prime $p$, distinct row and column residues and $\zeta =e^{2\pi i/p}$, every square discrete Fourier transform submatrix is nonsingular. Sort the selected column exponents decreasingly as $b_i$ and write $b_i={\lambda }_i+N-i$. Its determinant factors by the bialternant formula into a nonzero Vandermonde determinant and $s_{\lambda }({\zeta }^{r_1},\dots ,{\zeta }^{r_N})$. Modulo $1-\zeta$, this Schur factor is $s_{\lambda }(1^N)$ in ${\mathbb{F}}_p$. The Schur evaluation at all ones product has numerator and denominator differences strictly between zero and $p$, so its residue is nonzero. The Schur factor, and hence the minor, cannot vanish.

For integers $m,q,n$, adding $qN$ to a frequency index changes the complex exponential by $e^{2\pi iqn}=1$. Thus different continuous Fourier modes become identical discrete Fourier modes on the sampling grid. This is aliasing, caused by sampling before any discrete Fourier transform is computed.

For $N=8$, compare the continuous functions $\cos (2\pi mt)$ and $\sin (2\pi mt)$ with $m=1$ and $m=9$, sampled at $t=n/8$, $n=0,\dots ,7$. With $a=\sqrt{2}/2$, both cosines give exactly the first row and both sines give exactly the second:The nine-cycle sine agrees in sign as well as magnitude with the one-cycle sine: the frequency indices differ by $8$, rather than by a sign reversal. Consequently, either cosine produces the same discrete Fourier transform, $X_1=X_7=4$ with all other coefficients zero; either sine produces $X_1=-4i$, $X_7=4i$, with all other coefficients zero.

An observed low frequency therefore does not establish that physical high frequencies are absent. To exclude such alternatives, the Nyquist–Shannon sampling theorem requires a specified class of bandlimited functions. For arbitrary pure sinusoids with frequencies at most $B$, choose sampling rate $f_s>2B$; equality needs care because $\sin (2\pi (f_s/2)t)$ vanishes at every $t=n/f_s$. The finite-energy L2 space version of the Nyquist–Shannon sampling theorem permits equality under its own hypotheses. In either case, exact continuous reconstruction generally requires the entire infinite sample sequence; eight observed samples alone do not supply it. Demanet derives the grid aliasing condition as a difference by an integer multiple of the sampling angular frequency.^[ref]

A block $x_0,\dots ,x_{N-1}$ determines a repeating sequence by setting $x_n=x_{n\mathrm{mod}N}$ for every integer $n$. The inverse discrete Fourier transform gives this extension because each discrete Fourier mode satisfies $e^{2\pi ik(n+N)/N}=e^{2\pi ikn/N}$. The extension explains why circular convolution wraps indices around the block. It specifies values at discrete indices; a continuous curve between samples requires an additional choice of interpolation.

For real samples, taking the complex conjugate of the forward discrete Fourier transform changes the exponent's sign and proves the displayed symmetry. Hence $X_0$ is real; for even $N$, $X_{N/2}$ is also real. In the eight-sample example, $X_7=\overline{X_1}=4$ and $X_6=\overline{X_2}=2i$. This is the finite counterpart of conjugate symmetry of trigonometric polynomial coefficients. It reduces storage for real signals and provides a quick consistency check on a computed discrete Fourier transform.

Perron's formula recovers coefficient partial sums from a Dirichlet series by the Mellin inversion formula. Suppose $F(s)={\sum }_{n\ge 1}{a}_n{n}^{-s}$ is absolutely convergent at a fixed real $c>0$. For $x>0$,The prime on the sum means that the term with $n=x$ receives weight $1/2$ if $x$ is an integer; for noninteger $x$ it is the ordinary sum over $n<x$. The integral is taken as a symmetric vertical limit, not asserted absolutely convergent on the infinite line.

The scalar truncated Perron kernel estimate tends to $1$ when $x/n>1$, to $0$ when $x/n<1$, and to $1/2$ when $x/n=1$. Absolute convergence on the line allows the coefficient sum to be interchanged with the finite integral and justifies passing to this limit. In analytic number theory, one then shifts the contour through poles and past controlled singularities: their residues supply main terms and error terms in the summatory function. The truncated Perron formula makes the finite-height error explicit.

Writing $B(x)={\sum }_{n\le x}{b}_n$, the Abel summation formula gives $\sum b_n{n}^{-s}=s{\int }_1^{\infty }B(x)x^{-s-1}dx$. If $B$ is bounded, the integral and its differentiated integrands converge uniformly on compact subsets of $\mathrm{Re}s>0$, giving a holomorphic function. A nonprincipal Dirichlet character has bounded partial sums because it is periodic and its sum over a period is zero.

// Target: algebra.bigb

Write $u=\zeta \prod {\epsilon }_i^{b_i}$ in a fixed fundamental-unit basis. The logarithmic embedding is injective on the exponent lattice and lands in the weighted sum-zero hyperplane. Norm equivalence gives a logarithmic coordinate of size at least a constant times $\Vert b{\Vert }_{\infty }$; the weighted sum-zero relation then forces a negative coordinate of comparable size. There are only finitely many torsion choices. This exponential smallness, together with $\alpha u+\beta v=1$ and a linear form in logarithms of algebraic numbers for the nearby value $\beta v$, bounds the unit exponents effectively.

For fixed coprime integers $a,q$, the Prime number theorem in the arithmetic progression gives $\pi (x;q,a)\sim x/(\phi (q)\log x)$. Partial summation expresses the reciprocal-prime sum as $\pi (x;q,a)/x+{\int }_2^x\pi (t;q,a)t^{-2}dt$. The integral of the relative error is $o(\log \log x)$: fix a threshold beyond which that error is at most $\epsilon$, bound its remaining integral by $\epsilon \log \log x$, and then let $\epsilon$ decrease to zero. The modulus is fixed in this statement.

For $g(1)=1$ and finite displayed energy, the angular mode $g(r)\cos \theta$ has Dirichlet energy equal to $\pi$ times that integral. The harmonic function $r\cos \theta$ minimizes the energy with the same boundary data by the Dirichlet principle, giving the bound. Finite energy forces $g(r)\to 0$ as $r\to 0$: Cauchy–Schwarz bounds changes of $g^2$ by twice the product of the two energy tails, so $g^2$ has a limit, and a nonzero limit would make $\int g^2/r$ divergent. Consequently completing the square gives the exact identity ${\int }_0^1[r{g}^{\prime 2}+g^2/r]=1+{\int }_0^{1}r(g^{\prime }-g/r{)}^2$. Equality occurs exactly for $g(r)=r$. This identity also covers finite-energy functions whose polar expression is not classically smooth at the centre.