For repeated vertical collisions with a fixed plate and constant coefficient of restitution $0\le \gamma <1$, each collision multiplies the upward speed by $\gamma$, so successive peak heights form the displayed geometric sequence. The initial fall plus both legs of every rebound have total distance $h_0(1+{\gamma }^2)/(1-{\gamma }^2)$. The idealized impact times accumulate in finite time when $\gamma <1$; real contact mechanics replaces the limiting sequence by rest.

On a closed oriented Riemannian manifold, let $\alpha$ have degree $r-1$ and $\beta$ degree $r$. The graded Leibniz rule and Stokes theorem give $\int d\alpha \wedge \ast \beta =(-1{)}^r\int \alpha \wedge d\ast \beta$. The codifferential convention $\delta \beta =(-1{)}^{n(r+1)+1}\ast d\ast \beta$, combined with the square of the Hodge star, gives $\ast \delta \beta =(-1{)}^{r}d\ast \beta$. This proves that the codifferential is the formal adjoint of the exterior derivative. A boundary requires the corresponding boundary term or specified boundary conditions.

The asymptotic rate-distance function is ${\alpha }_q(\delta )={\mathrm{limsup}}_{n\to \infty }{n}^{-1}{\log }_q{A}_q(n,\max \{1,\lceil \delta n\rceil \})$. It is the best asymptotic code rate available at the specified relative minimum distance. A limsup is used because the definition does not assume an ordinary limit exists.

// Target: algebra.bigb

In characteristic $p>0$, the displayed map on the cocenter of a finite-dimensional algebra is additive and Frobenius-semilinear. Expand a $p$th power into words: nonconstant cyclic-word orbits have length $p$ and cancel modulo commutators. Also $(ab{)}^p$ and $(ba{)}^p$ have the same cocenter class, so the map kills additive commutators and is well defined.

Over a perfect field with split semisimple quotient, the stable image of this map has dimension equal to the number of simple modules of the algebra. Indeed, the kernel of $C(A)\to C(A/J(A))$ has representatives in the nilpotent Jacobson radical, so an iterate kills it. On the semisimple algebra quotient, each matrix-block coordinate is a field trace, and $\mathrm{tr}(a^p)=\mathrm{tr}(a{)}^p$. For a split semisimple quotient, Frobenius is bijective on every coordinate. In a group algebra over an algebraically closed field, the stable image has the p-regular element conjugacy classes as its basis, proving the simple-module counting theorem.

If a cobordism Morse function on a trivial cobordism has exactly two critical points, its relative Morse chain complex has two generators and must be acyclic. Their indices therefore differ by one. The only differential is multiplication by the signed intersection of the lower point's belt sphere with the higher point's attaching sphere in a common regular level. A two-term complex of copies of $\mathbb{Z}$ is acyclic exactly when that integer is a unit. Algebraic intersection is therefore a necessary condition; it is not by itself a geometric handle-cancellation statement.

A driven cylindrical conductor between two grounded coaxial conductors forms two coaxial cylindrical capacitors in parallel. For radii $a,\lambda a,2a$, the capacitance per unit length is the sum $C^{\prime }=2\pi {ϵ}_0[1/\log \lambda +1/\log (2/\lambda )]$. Writing $u=\log \lambda$ and $L=\log 2$, the function $1/u+1/(L-u)$ is strictly convex on $(0,L)$ and symmetric about $L/2$. Hence $C^{\prime }$ has its unique minimum at $\lambda =\sqrt{2}$, with value $8\pi {ϵ}_0/\log 2$. As $\lambda =1+\delta$ approaches the inner conductor, $C^{\prime }\sim 2\pi {ϵ}_0/\delta$, agreeing with the local parallel-plate capacitor approximation.

For conserved $w=-1/3$ scalar energy, ${\rho }_X=3M^2{H}_0^2{\Omega }_X/a^2$ and ${\varphi }^{\prime }=\sqrt{2}M{H}_0\sqrt{{\Omega }_X}$ on the increasing branch. With dust and radiation, define $b={\Omega }_m/(2{\Omega }_X)$ and $A=\sqrt{{\Omega }_m^2/4-{\Omega }_r{\Omega }_X}/{\Omega }_X$. When the discriminant is positive,and $V(\varphi )=2M^2{H}_0^2{\Omega }_X/a(\varphi {)}^2$. The formulas retain all density parameters without eliminating one by the flatness sum.

A Galerkin coarse-grid operator is obtained by composing interpolation, the fine operator and residual restriction. With $R=c{P}^T$, $c>0$, and positive-definite $A_h$, the exact coarse-grid correction $I-P(R{A}_{h}P{)}^{-1}R{A}_h$ is the energy-orthogonal projection onto the complement of the coarse space. Indeed it annihilates every vector $Pz$, and its corrected error $e^{\prime }$ satisfies $P^T{A}_h{e}^{\prime }=0$. These identities explain why compatible transfers remove representable smooth error rather than merely averaging an approximate solution.

An element of a coalgebra satisfying the displayed identities. A group-like element in a Hopf algebra is invertible with inverse its antipode image.

For unital algebras over a field $A,B$, a coalgebra $C$ measures $A$ into $B$ when a linear map $p:C\to {\mathrm{Hom}}_k(A,B)$ satisfies the displayed identity and $p(c)(1_A)=\epsilon (c)1_B$. Group-like elements therefore act by unital algebra homomorphisms over a field.

A linear subspace $I$ of a coalgebra satisfying the displayed conditions. These are exactly the conditions for the comultiplication and counit to descend to the quotient vector space $C/I$. An ideal that is also a coideal in a bialgebra gives a quotient bialgebra.

If proton–proton chain heating scales as $X_H^2\rho T^{{\nu }_{pp}}$ and CNO cycle heating as $X_H{Z}_{\mathrm{CNO}}\rho T^{{\nu }_{\mathrm{CNO}}}$, their ratio at fixed hydrogen abundance scales as $Z_{\mathrm{CNO}}{T}^{{\nu }_{\mathrm{CNO}}-{\nu }_{pp}}$. Equating the rates proves the displayed crossover-temperature relation. It applies to a local power-law approximation, with unchanged coefficient normalizations apart from the catalyst abundance.

For positive $\alpha ,\beta$, suppose $p^{\alpha }\le |A|\le p^{1-\alpha }$ and $|B|\ge p^{\beta }$. Repeatedly replace a scalar set $S$ by $3SS-3SS$. Quadratic growth of a sixfold product difference set reaches size at least $p/2$ in a number of steps depending only on $\beta$. The closure bounds for small skew-sumset scalars transfer a putative bound $|A+bA|\le K|A|$ to all these scalars with exponent depending only on the number of steps. Averaging collisions over the resulting large scalar set then forces $K^L\ge \frac{1}{4}\min (|A|,p/|A|)\ge p^{\alpha }/4$. This supplies a positive exponent depending only on $\alpha ,\beta$. The finitely many smaller primes are covered by the strict inequality $|A+bA|>|A|$ for every nonzero $b$ when $1<|A|<p$.

For segments with initial direction vectors $U,T$, initial endpoint displacement $D$, and translation velocities $V,W$, contact is feasibility of the displayed linear equation with $s,r\in [0,1]$ and $t\ge 0$. Minimizing $t$ is a small linear programming problem. A nonsingular three-column coefficient matrix gives at most one candidate; singular, parallel and degenerate cases require the constrained feasibility problem rather than division by a vanishing determinant.

A connected $n$-sheeted covering space of a closed orientable surface of genus $g$ has genus $1+n(g-1)$. Lifting a finite cell decomposition gives $n$ cells above every base cell, so its Euler characteristic is $n(2-2g)$. Equating this with $2-2g^{\prime }$ gives the formula. For $g\ge 1$, every positive $n$ occurs: send one handle generator of the fundamental group to $1$ in $\mathbb{Z}/n$ and all remaining generators to zero, then use the classification of connected covering spaces for the kernel of that surjection.

For metric spaces $X,Y$ with $X$ compact, the projection with a compact factor is closed: if $F\subset X\times Y$ is a closed set and $y_n\in {\pi }_Y(F)$ converges to $y$, choose $x_n$ with $(x_n,y_n)\in F$. Sequential compactness supplies $x_{n_k}\to x$, so $(x_{n_k},y_{n_k})\to (x,y)\in F$, proving $y\in {\pi }_Y(F)$. The projection map is also continuous for the sum metric. Without compactness, the closed set $\{(x,y)\in {\mathbb{R}}^2:xy=1\}$ projects to the nonclosed set $\mathbb{R}\setminus \{0\}$.

A densely defined closed operator is sectorial of angle $\theta$ if its spectrum lies in $\{z:|\arg z|\le \theta \}\cup \{0\}$ and, for every larger angle $\varphi <\pi$, its resolvent outside that larger sector satisfies $\Vert (z-A{)}^{-1}\Vert \le C_{\varphi }/|z|$. If $\theta <\pi /2$, then $-A$ generates an analytic semigroup. A real shift of the generator allows exponential growth without changing the short-time smoothing estimates.

For an everywhere-defined linear map $T:E\to F$ between Banach spaces, its separating space measures the possible limiting defect in continuity at zero. It is a closed linear subspace: linear combinations combine witnessing sequences, and diagonal choices with $\Vert x_j\Vert <1/j$ and $\Vert T{x}_j-y_j\Vert <1/j$ handle a convergent sequence $y_j$ of defects. The closed graph theorem gives $T$ continuous exactly when $S(T)=\{0\}$, since a limit $(x_n,T{x}_n)\to (x,y)$ has $y-Tx\in S(T)$.

A maximal clique is a clique not strictly contained in another clique. This is distinct from a maximum clique, whose size equals the clique number. In a triangulated probabilistic graphical model, maximal cliques are the natural nodes of a junction tree.

Maximality is a condition on set inclusion: no outside vertex is adjacent to every member of the current clique. In the five-vertex example, $\{c,d\}$ is maximal because $a,b$ are not adjacent to $d$, while $e$ is not adjacent to $c$. Yet $\{a,b,c\}$ is larger. Checking every possible one-vertex extension is enough: if a larger containing clique existed, any one of its new vertices could already be added.^[ref]

For fixed $k\ge 2$, a binomial random graph has no $k$-cliques with probability tending to one if ${\mu }_n\to 0$, and has at least one with probability tending to one if ${\mu }_n\to \infty$. The first assertion uses the first moment method. The second uses the overlap formula for the variance of a clique count: overlapping $k$-sets with $l\ge 2$ contribute $O(n^{-l}{p}^{-\left(\genfrac{}{}{0ex}{}{l}{2}\right)})$, and each contribution tends to zero above this threshold. The fixed-size qualification matters.