Connections ${\nabla }^1,{\nabla }^2$ on $T{M}_1,T{M}_2$ give a connection onby taking the direct sum of their pullback connections. In product coordinates its Christoffel symbols have the two factor blocks and zero mixed blocks. On arbitrary fields, the ordinary derivatives of their coefficients are still taken in both factors. On fields lifted separately from the factors it satisfies ${\nabla }_{Y_1+Y_2}(X_1+X_2)={\nabla }_{Y_1}^1{X}_1+{\nabla }_{Y_2}^2{X}_2$.

A SU(2) representation descends to the SO(3) group exactly when $-I$ acts trivially. In ${\mathrm{Sym}}^n({\mathbb{C}}^2)$ it acts by $(-1{)}^n$, so descent holds precisely for even $n$, or integer spin $j=n/2$. This is the inflation of a group representation criterion for the kernel $\{\pm I\}$. Half-integer-spin representations instead remain representations of the covering group.

Substitution of the adiabatic superbubble similarity solution into spherical mass conservation gives

If the similarity profiles account for all kinetic and internal energy inside an adiabatic strong shock, letThe injected energy $\dot{E}t$ equals $4\pi {\rho }_1{\dot{R}}^2{R}^{3}I$. Consequently conservation of energy fixesAn interior region not included in the profiles must have its energy added separately; a radiatively cooled shell changes this energy budget.

For point injection of constant power, the outward energy flux through a sphere tending to the source must tend to $\dot{E}$. In the adiabatic superbubble similarity solution, this requiresImposing finite regular central pressure and density with $h=O(\eta )$ would instead give zero flux and fail to supply the prescribed power. A resolved source region or an inner contact-boundary model can replace the point-source condition.

If $\Vert P{\Vert }_{L_0^2(\mu )}\le r<1$, a stationary reversible Markov chain satisfiesConsequently the variance of a sum of $N$ consecutive values is at most $N(1+r)/(1-r)$ times the stationary variance of one value. This bounds the Markov chain Monte Carlo asymptotic variance uniformly over square-integrable functions.

Interchanging two Abelian Higgs vortices replaces $q=z_1-z_2$ by $-q$. Thus $w=q^2$ is a single-valued relative coordinate on the unordered Abelian Higgs vortex moduli space. Coincidence is smooth in $w$; a geodesic crossing from positive real $w$ to negative real $w$ changes the line of separation by $\pi /2$, explaining right-angle scattering of Abelian Higgs vortices. The asymptotic cone in the $q$ coordinate has angular period $\pi$ and must not be treated as a singularity of the actual coincidence metric.

Fix a positive integer $e$. A partition of an integer is uniquely specified by its core of a partition for modulus $e$ and its ordered quotient of a partition for that modulus. More precisely, for every $e$-core $\gamma$ and ordered tuple $({\nu }_0,\dots ,{\nu }_{e-1})$ of partitions, there is a unique partition $\lambda$ such thatThe ordered runners use the usual abacus of a partition convention with a number of beads divisible by $e$. Adding $e$ beads preserves both the tuple and its runner labels. The core fixes the relative runner offsets, and each component partition fixes the displacement of the beads on that runner, giving existence and uniqueness.

For each real $c$, some maximizer of $e(G)-c{k}_3(G)$ among graphs on $n$ vertices is complete multipartite graph. Among maximizers maximize ${\sum }_{v}d(v{)}^2$. Cloning either of two nonadjacent vertices preserves the objective, since maximality forces their local contributions $d(v)-ce(G[N(v)])$ to agree. If their vertex neighbourhoods differ, the sum of the two changes in the squared-degree of a vertex objective is twice the size of their symmetric difference, a contradiction. Nonadjacency therefore partitions the vertices into classes with identical vertex neighbourhoods.

For $r=n+1/2$, $n\ge 0$, the convergent frequency zeta function, expressed through the Riemann zeta function, is ${\sum }_r{r}^{-s}=(2^s-1){\zeta }_R(s)$ when $\mathrm{Re}s>1$. Its analytic continuation at $s=-1$ gives $(1/2-1)(-1/12)=1/24$. A common exponential frequency cutoff gives ${\sum }_{r}r{e}^{-\epsilon r}={\epsilon }^{-2}+1/24+O({\epsilon }^2)$, so the same finite part follows by subtracting the leading divergence. In contrast, integer frequencies have regulated sum $-1/12$.

In a pointed category, the zero morphism $0_{A,B}:A\to B$ is the composite through its zero object. Composition on either side by any morphism remains zero. In a commutative-monoid enrichment on a pointed category, the additive zero must coincide with this zero morphism: morphisms to and from the zero object belong to singleton hom-sets.

For known size $r$ and ${\lambda }_i=e^{x_i^T\beta }$, the expectation-maximization algorithm gives structural-zero responsibility $t_i=0$ for positive counts and $t_i=\pi /[\pi +(1-\pi )(r/(r+{\lambda }_i){)}^r]$ for zero counts. This is Bayes' theorem. Maximizing the expected complete-data log-likelihood gives ${\pi }_{\mathrm{new}}=n^{-1}{\sum }_i{t}_i$ and a weighted negative binomial regression with weights $1-t_i$. The objective separates into a Bernoulli mixing term and a weighted count term, which proves the update.

ConsiderIts row sums vanish, so $(1,1,1{)}^T$ is an eigenvector for the zero eigenvalue. Its characteristic polynomial iswith sum of principal minors of order twoThe other eigenvalues are $(-S\pm \sqrt{S^2-4T})/2$. No symmetry is required for this formula; positive diagonal symmetrization of a matrix is a sufficient condition for real roots.

A semistandard Young tableau fills a Young diagram with positive integers, permitting repeated entries, so that entries weakly increase along rows and strictly increase down columns. Its content records the number of occurrences of each entry. The Kostka number $K_{\lambda \mu }$ counts such fillings of shape $\lambda$ and content $\mu$.

A standard Young tableau of shape $\lambda ⊢n$ is a Young tableau that uses $1,\dots ,n$ exactly once and strictly increases left to right along every row and top to bottom down every column. Formally, a bijection $T:Y(\lambda )\to \{1,\dots ,n\}$ is standard whenwhenever the indicated cells belong to the Young diagram. We write $\mathrm{SYT}(\lambda )$ for the set of such fillings and $f^{\lambda }=|\mathrm{SYT}(\lambda )|$ for its cardinality.

For $(3,2)$, the five standard Young tableaux are listed below, with each pair giving the top row followed by the bottom row:There are no others: the upper-left entry must be $1$, and choosing the two bottom-row entries fixes both increasing row orders. Of the six choices of two entries from $\{2,3,4,5\}$, only bottom row $(2,3)$ fails, because its $3$ would lie below $4$. Hence $f^{(3,2)}=5$ by direct enumeration, independently of the hook-length formula.

The cells occupied by $1,\dots ,r$ form a Young diagram: every cell above or to the left of an occupied cell has a smaller label. Consequently a standard Young tableau is equivalently a path from the empty shape to $\lambda$ in the Young branching graph, adjoining one addable node of a Young diagram at each step. For $T_2$, the successive shapes areConversely, number the cell added at step $r$ by $r$ to recover the standard Young tableau. This path interpretation also makes a standard Young tableau a linear extension of a partially ordered set defined by the row and column requirements; see Stanley's Algebraic Combinatorics, Chapter 8, on tableaux and paths in Young's lattice.

The usefulness goes beyond counting: the standard polytabloid basis of a Specht module $S^{\lambda }$ over the complex numbers is indexed by $\mathrm{SYT}(\lambda )$, so ${\dim }_{\mathbb{C}}{S}^{\lambda }=f^{\lambda }$. Each of the five pictured standard Young tableaux therefore labels one basis element of the irreducible representation $S^{(3,2)}$ of the symmetric group $S_5$, whose dimension over the complex numbers is five. The filled diagrams index the basis; the actual vectors are polytabloids. The hook-length formula computes this dimension without listing all the standard Young tableaux.

For the standard inclusion $S_{n-1}\subset S_n$, over the complex numbers,Here $X_n$ is a Young–Jucys–Murphy element. One way to see generation is to use multiplicity-free restriction: a central idempotent of $S_{n-1}$ selects a preceding shape, and the distinct contents of its addable nodes of a Young diagram distinguish all possible succeeding shapes. Polynomial interpolation in $X_n$ supplies every diagonal projection in the centralizer of a subalgebra.

For the joint spectrum of the Young–Jucys–Murphy elements, adjacent coordinates $a_i,a_{i+1}$ are distinct. If $a_{i+1}-a_i=\pm 1$, the adjacent transposition $s_i$ acts on that line by $\pm 1$. Otherwise interchanging the coordinates gives a spectral vector in the same irreducible representation. These rules follow from $s_i{X}_i{s}_i+s_i=X_{i+1}$ and its two-dimensional eigenspace calculation. Together with the braid relation in a Coxeter group, they exclude the consecutive patterns $(a,a\pm 1,a)$.

In the group algebra of $S_n$, the product of the Young–Jucys–Murphy elements $X_2,\dots ,X_n$ is the sum of all $n$-cycles, each with coefficient one. To prove it, multiply the sum of all $m$-cycles by $X_{m+1}$. Right multiplication by $(jm+1)$ inserts $m+1$ immediately after $j$ in the cycle. Every $(m+1)$-cycle has a unique predecessor of $m+1$, so deletion inverts this insertion bijectively. Induction starts at $X_2=(12)$. The identity turns a product of cell contents into a central character value of a conjugacy-class sum.

An addable node is a cell outside a Young diagram whose insertion leaves a Young diagram. Its left and upper predecessors, when present in the positive-coordinate grid, must already belong to the diagram. Different addable nodes have distinct Young-diagram cell contents.

A hook partition has shape $(n-k,1^k)$, $0\le k\le n-1$. Equivalently its Young diagram has no cell $(2,2)$, so its only cell of content zero is $(1,1)$. Its standard Young tableaux are counted by $\left(\genfrac{}{}{0ex}{}{n-1}{k}\right)$: choose the $k$ entries below the initial $1$, then the column and remaining row orders are forced.