Write each sphere as two disks, $S^2=D_{-}^2\cup D_{+}^2$. In their product, $D_{-}^2\times D_{-}^2$ is a zero-handle; $D_{+}^2\times D_{-}^2$ and $D_{-}^2\times D_{+}^2$ are two-handles. Their attaching circles are the core circles of the complementary solid tori in $\partial (D^2\times D^2)$, hence a Hopf link. Constant normal directions from the disk factors give both components the zero Seifert framing. The remaining $D_{+}^2\times D_{+}^2$ is a four-handle. This product construction establishes the actual diffeomorphism type, rather than relying on its intersection form alone. The resulting intersection matrix is $\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$.

In a critical level handle embedding, the handles occur at distinct heights in an ambient product with the real line. Between consecutive heights, the boundary of the already attached handles travels through a product collar neighbourhood. At a handle height the horizontal slice contains the handle, attached to the incoming boundary along its attaching region. This separates the local topology changes from the intervening product regions.

For a discrete random vector with $n$ coordinates, this is the average information entropy per coordinate over all subsets of size $k$. Independent coordinates give the same average for every $k$, even when their individual entropies differ. If all coordinates are copies of one random variable $Z$, the average is $h(Z)/k$.

For a stationary source of independent and identically distributed fair bits, with Hamming distortion and binary reconstruction alphabet,The binary entropy convention is $0{\log }_{2}0=0$. Once $D\ge 1/2$, always reconstructing zero meets the distortion constraint without sending any bits. The formula $1-h_2(D)$ must not be extended to $D>1/2$: a looser constraint cannot increase the required rate.^[ref]

The short argument identifies both sides of the optimum. For any feasible binary reconstruction, put $E=X\oplus \hat{X}$, using exclusive or. Knowing $\hat{X}$ makes $X$ and $E$ determine one another, so the conditional entropy obeyswhen $0\le D\le 1/2$. The last step uses the increase of binary entropy on that interval. Hence $I(X;\hat{X})=1-H(X\mid \hat{X})\ge 1-h_2(D)$. Conversely, choose $\hat{X}=X\oplus N$ with an independent Bernoulli random variable $N$ of parameter $D$. This binary symmetric channel has expected distortion $D$ and mutual information $1-h_2(D)$, attaining the bound.

Let $X_1,X_2,X_3$ be independent fair bits. The encoder sends their majority bit: zero when at least two inputs are zero, and one otherwise. The decoder reconstructs $000$ or $111$ by repeating that received bit three times. This is lossy compression: different original strings deliberately share a reconstruction.

There are eight equally likely inputs. The strings $000$ and $111$ have zero Hamming distance from their reconstructions; each of the other six has Hamming distance one. One transmitted bit represents three source symbols, soEvery input has average Hamming distortion at most $1/3$, whereas the population average is $1/4$. The actual block code therefore obeys $R\ge R(D)\approx 0.18872$, but does not reach the optimal long-block rate.

This construction uses the same reconstruction strings as the threefold binary repetition code, but the tasks differ. An error-correcting encoder expands one source bit into three transmitted bits; this lossy compression example compresses three source bits into one transmitted bit. The source distribution and the direction of the mapping matter.

This is the maximum Hamming distance between the characteristic vectors of members of a set family. In a down-set, one can replace a pair by disjoint subsets with the same union, so the maximum distance equals the largest size of a union of two members. A t-intersecting family has diameter at most $n-t$.

The Hamming space of length $n$ over a finite field ${\mathbb{F}}_q$ is the set ${\mathbb{F}}_q^n$ equipped with Hamming distance, the number of coordinates at which two words differ. The Hamming weight of a word is its distance from zero.

For $n=2^{\ell }-1$, a codeword in a Hamming code is a subset of the nonzero vectors of ${\mathbb{F}}_2^{\ell }$ whose sum is zero. Ordered weight-three supports of a vector are determined by two distinct nonzero vectors, giving $n(n-1)$ choices. For weight four, the third vector must avoid the three nonzero vectors in the linear span of the first two, giving $n(n-1)(n-3)$ choices. For weight five, the first three must be linearly independent, and the fourth must avoid all seven nonzero vectors in their linear span, giving $n(n-1)(n-3)(n-7)$ choices. The final vector is their sum. Dividing by $3!$, $4!$, and $5!$ counts unordered supports of a vector and proves the displayed weight enumerator coefficients.

Compactly supported Hamiltonian vector fields can attain any prescribed tangent vector at a point of a symplectic manifold: prescribe the derivative of a local Hamiltonian and multiply by a bump function. Composing flows for a tangent basis gives an open orbit by the inverse function theorem. Every orbit is open, so on a connected manifold the compactly supported Hamiltonian transformations act transitively.

The Morse potential models an anharmonic molecular bond with dissociation energy $D_e>0$, equilibrium separation $x_e$, and inverse length $a>0$. Unlike a quantum harmonic oscillator, it has finitely many bound levels and a dissociation continuum.

For a positive self-adjoint Hamiltonian operator, finite energy means that a normalized state lies in $D(H^{1/2})$, its form domain, and has expectation value $q_H(\psi )$. This domain can be larger than $D(H)$. With a complete orthonormal basis of energy eigenstates, $\psi ={\sum }_n{c}_n{e}_n$ and $H{e}_n=E_n{e}_n$ give $q_H(\psi )={\sum }_n{E}_n|c_n{|}^2$ by applying $H^{1/2}$ and taking its squared norm. Membership in $D(H)$ instead requires ${\sum }_n{E}_n^2|c_n{|}^2<\infty$. For a Dirichlet free-particle Hamiltonian operator on an interval, the energy form is ${\hslash }^2\int |{\psi }^{\prime }{|}^2/(2m)$ on functions with square-integrable weak derivative and zero endpoint values.

The Arctic cold halocline is a near-freezing layer in which salinity increases downward and produces stable density stratification, helping isolate sea ice from warmer water below. It can be maintained through shelf-water input, cooling and limited winter convection of inflowing waters, followed by freshwater capping and advection. Its formation cannot be inferred from shelf area alone: water-mass volumes, salt budgets and residence times matter.

For any prime set $\pi$, every finite soluble group has Hall $\pi$-subgroups, any two are conjugate, and every $\pi$-subgroup lies in one. Induction uses an elementary abelian minimal normal subgroup $N$ of characteristic $p$. If $p\in \pi$, the preimage of a quotient Hall subgroup is itself a Hall subgroup. If $p\notin \pi$, coprime splitting over an elementary abelian normal subgroup gives a conjugate class of complements in that preimage. The same complement conjugacy in the preimage of a smaller quotient subgroup gives the embedding assertion.

A finite normal subgroup whose order is coprime to its index has a group complement: if $N◃G$ is a Hall subgroup, then $G=NH$ and $N\cap H=1$ for some subgroup $H$. Complement conjugacy holds when either $N$ or $G/N$ is solvable; the existence assertion does not require that extra hypothesis.

A Hall obstruction is a left subset $S$ with fewer distinct neighbours than vertices. At most $|N(S)|$ members of $S$ can be matched, so at least $|S|-|N(S)|$ must remain unmatched. The pigeonhole principle proves failure without enumerating every proposed assignment.

For a stronger counterexample than an isolated vertex, take $L=\{a,b,c,d\}$ and $R=\{1,2,3,4\}$ withEvery vertex has positive degree of a vertex, the sides have equal cardinality, and $|N(L)|=|L|=4$. Every two-vertex left subset also passes the Hall condition. Nevertheless $S=\{a,b,c\}$ has only $N(S)=\{1,2\}$, so $2<3$ rules out matching saturation of $L$.

All sixteen left subsets can be checked by writing $k=|S\cap \{a,b,c\}|$ and $\epsilon =1$ if $d\in S$, otherwise $0$. ThenOnly $k=3,\epsilon =0$ violates the Hall condition. Every matching in a graph uses at most two edges incident to $\{a,b,c\}$ and at most one incident to $d$, so the matching number is three. There are exactly twelve size-three matchings in a graph: choose two of $a,b,c$ in three ways, assign them to $1,2$ in two ways, and choose $3$ or $4$ for $d$. Thus the obstruction identifies the bottleneck: adding availability only for $d$ cannot help; allowing $c$ to use slot $3$ permits $\{a1,b2,c3,d4\}$, a perfect matching.

If $X,Y$ are independent with density $2e^{-x^2}/\sqrt{\pi }$ on the positive axis, the Jacobian matrix of the inverse transformation has determinant $1/[2(1+v^2)]$. The joint density is $2e^{-u}/[\pi (1+v^2)]$ for $u,v>0$, factoring into an exponential distribution for $U$ and a unit-scale half-Cauchy distribution for $V$. The underlying radial symmetry makes radius and angle independent.

For an on-shell massless quark with incoming momentum $k$ and outgoing momentum $k+q$, average the initial spin and sum the final spin. The gamma matrix trace identities give $S^{\mu \nu }=\frac{1}{2}\mathrm{Tr}[/k{\gamma }^{\mu }(/k+/q){\gamma }^{\nu }]=2[k^{\mu }(k+q{)}^{\nu }+k^{\nu }(k+q{)}^{\mu }-g^{\mu \nu }k\cdot q]$. On shell $2k\cdot q=Q^2=-q^2$, and defining $T^{\mu \nu }=-g^{\mu \nu }+q^{\mu }{q}^{\nu }/q^2$ and $\tilde{k}=k-(k\cdot q/q^2)q$ yields the displayed transverse decomposition. With the hadronic-tensor prefactor $1/(4\pi )$, one-particle Lorentz-invariant phase space gives $w_f^{\mu \nu }=(Q_f^2/2){\delta }_{+}((k+q{)}^2)S^{\mu \nu }$. The antiquark has the same unpolarized tensor and squared electric charge.

For electromagnetic deep inelastic scattering with an unpolarized target, Lorentz invariance, parity and current conservation leave two independent deep-inelastic structure functions. With $T^{\mu \nu }=g^{\mu \nu }-q^{\mu }{q}^{\nu }/q^2$ and $\tilde{P}=P-(P\cdot q/q^2)q$, both tensor structures are transverse to $q$. Terms with a free $q$ index disappear on contraction with a conserved leptonic tensor, although such terms can still be necessary to make the full hadronic tensor transverse.

For an absorbed spacelike photon, use $q^2=-Q^2<0$, $\nu =P\cdot q>0$, $x=Q^2/(2\nu )$ and the physical momentum delta function ${\delta }^{(4)}(P+q-p_X)$. The displayed invariant final mass is compatible with deep inelastic scattering for $0<x<1$. Using $P-q$ with the same positive-$x$ definition instead gives $M^2-Q^2(1+1/x)$, which becomes negative in the Bjorken scaling limit and has no physical hadronic spectral support. Reversing the photon convention requires reversing the associated scalar-product and scaling-variable conventions too.

Use the full orthonormal Haar system, including the constant function. Dyadic partial sums are cell averages and converge uniformly for continuous $f$. On a cell of length $\ell$, a normalized detail has $|c_H|\le {\omega }_f(\ell )\sqrt{\ell }$ and pointwise size $|H|={\ell }^{-1/2}$. Fix a coarse level where the modulus is small. Above a level chosen by $\delta /\sqrt{\ell }$ reaching that small modulus, no detail can survive the threshold. Below it, omitted details along any one dyadic chain sum to a geometric bound. Thus the thresholded expansion differs from a sufficiently fine cell average by a uniformly small amount.