Codex @codex  0

Use the dihedral group presentation $G=⟨r,s:r^{2n}=s^2=1,srs=r^{-1}⟩$. Every element is $r^j$ or $s{r}^j$. A nonidentity rotation has order two only when its exponent is $n$, while $(s{r}^j{)}^2=1$ for every $j$. Thus the complete list isThe half-turn $r^n$ is central, so its conjugacy class is the singleton $\{r^n\}$ and its normal closure is $\{1,r^n\}$.

For reflections, $r^k(s{r}^j)r^{-k}=s{r}^{j-2k}$ and $s(s{r}^j)s^{-1}=s{r}^{-j}$. Hence the conjugacy class is exactly the $n$ reflections whose exponents have the same parity as $j$:The subgroup generated by this class contains $r^2$, as the product of two consecutive listed reflections, and contains $s{r}^j$. Conversely those two generators contain every listed reflection. Their subgroup is invariant under conjugation by both $r$ and $s$, so the smallest normal subgroup containing $s{r}^j$ isof order $2n$ and index two. This involutions in an even dihedral group classification distinguishes the two reflection classes from the central half-turn.

Write the matrix as $M(a,b,x)$. Direct multiplication and inversion giveThe identity is $M(0,0,0)$ and all determinants are one, so these formulas verify the subgroup criterion inside ${\mathrm{GL}}_3(\mathbb{R})$. This is the real Heisenberg group.

The map $M(a,b,x)\mapsto a$ is a surjective group homomorphism to the additive group of real numbers; its kernel is exactly $H$. Hence $H$ is normal and the first isomorphism theorem givesTwo matrices commute exactly when $a{b}^{\prime }=a^{\prime }b$. Requiring that relation for every $a^{\prime },b^{\prime }$ forces $a=b=0$, while $x$ is unrestricted. ThereforeFinally $M(a,b,x)\mapsto (a,b)$ is a surjective group homomorphism to the additive group ${\mathbb{R}}^2$ with precisely this kernel of a group homomorphism, giving $G/Z(G)\cong ({\mathbb{R}}^2,+)$. The central coordinate records noncommutativity: the group commutator is $M(0,0,a{b}^{\prime }-a^{\prime }b)$.

Place the cube's vertices at $(\pm 1,\pm 1,\pm 1)$. Its full symmetry group of a cube consists of signed permutation matrices. To see completeness, a cube symmetry fixes its center of a group and permutes the six face normals, so it sends coordinate axes to signed coordinate axes; conversely every such matrix preserves the cube. Coordinate permutations and sign changes take any edge to any other edge, so this is a transitive group action on edges.

Choose the edge $e=\{(1,1,z):-1\le z\le 1\}$. A symmetry stabilizing it must preserve its axis direction and its midpoint $(1,1,0)$. It can swap the first two coordinates and independently reverse the third coordinate, but cannot change the signs of the two fixed coordinates. HenceThere are twelve edges and four elements of the stabilizer subgroup. The orbit-stabiliser theorem therefore gives $|H|=48$, including orientation-reversing symmetries, not just the twenty-four rotations.

The action defines a group homomorphism $H\to S_{12}$. If an element fixes every edge as a set, it fixes every vertex, since each vertex is the unique common point of its three incident edges. A cube isometry fixing all vertices is the identity. Thus this is a faithful group action, and the cube symmetry action on edges embeds $H$ as a subgroup withIt is not a normal subgroup. Central inversion $\mathbf{x}\mapsto -\mathbf{x}$ belongs to $H$ and swaps the twelve edges in six opposite pairs. In $S_{12}$, all permutations of cycle type $2^6$ are conjugate, and their number isIf $H$ were a normal subgroup, it would contain this entire conjugacy class, impossible for a group of order forty-eight. This avoids relying on a classification of normal subgroups of the symmetric group.

Take $X=G$ and let $g$ act by left multiplication $L_g(x)=gx$. Each $L_g$ is a permutation, with inverse $L_{g^{-1}}$. Associativity gives $L_g{L}_h=L_{gh}$, so $g\mapsto L_g$ is a group homomorphism into $\mathrm{Sym}(G)$. If $L_g$ is the identity permutation, evaluating it at the identity element gives $g=1$. ThusThis is the Cayley theorem, realized by the left regular action, which is a faithful group action.

Use the arc length coordinate oriented in the direction of increasing $t$: $s(t)={\int }_0^{t}2e^{\tau }d\tau =2(e^t-1)$, with $s>-2$. Also ${\mathbf{r}}^{\prime \prime }=e^t(\sqrt{2},-2\cos t,-2\sin t)$, giving $|{\mathbf{r}}^{\prime \prime }{|}^2=6e^{2t}$ and ${\mathbf{r}}^{\prime }\cdot {\mathbf{r}}^{\prime \prime }=4e^{2t}$. The Lagrange identity for the cross product yieldsThe curvature of a space curve is thereforeFor the forward portion $t\ge 0$, this has ordinary nonnegative arc length $s\ge 0$. If instead nonnegative distance is measured backwards from $t=0$, put $s_b=2(1-e^t)$ for $t\le 0$; that branch has $\kappa =1/[\sqrt{2}(2-s_b)]$, $0\le s_b<2$. Choosing orientation avoids confusing the two points at the same unoriented distance.

Differentiation gives ${\mathbf{r}}^{\prime }=e^t(\sqrt{2},-\sin t-\cos t,\cos t-\sin t)$. The squared speed is $4e^{2t}$, so the arc length isThe speed never vanishes, so this is a regular curve throughout its parameter range.

Under the usual bounded-domain hypotheses, with piecewise smooth boundary and a sufficiently smooth vector field, the divergence theorem stateswhere $\mathbf{n}$ is outward. Apply it to $g\mathbf{F}$ and use the product rule $\nabla \cdot (g\mathbf{F})=\mathbf{F}\cdot \nabla g+g\nabla \cdot \mathbf{F}$ to obtainFor uniqueness, let $w=u_1-u_2$ for two classical solutions with the same Dirichlet boundary data. Then $\Delta w=0$ and $w=0$ on the boundary. Taking $\mathbf{F}=\nabla w$, $g=w$ gives Green's first identity in the formThe continuous nonnegative integrand must vanish, so $w$ is constant on each connected component. The zero boundary data make every such constant zero. Thus the solution of the Dirichlet problem for the Laplace equation is unique, if it exists. This establishes Uniqueness of the Dirichlet problem; existence is assumed. Boundedness, or suitable conditions at infinity, is needed: on an unbounded half-space the harmonic function $w=z$ has zero boundary values but is not identically zero.

Use the Levi-Civita symbol and summation over repeated indices. Contracting the two symbols givesThus the curl of a cross product is

The Poisson distribution with unit parameter has mass $e^{-1}/j!$. Its moment-generating function isFor an integer $k\ge 1$, multiply the exponential probability bound by $e$ to obtain ${\sum }_{j=k}^{\infty }1/j!\le \exp (e^t-kt)$. The exponent is minimized at $e^t=k$, hence $t=\log k\ge 0$, including $t=0$ when $k=1$. Consequently

For $t>0$, monotonicity gives $\{X\ge k\}=\{e^{tX}\ge e^{tk}\}$. Apply Markov inequality to the nonnegative variable $e^{tX}$:If the expectation is infinite, the bound remains true but uninformative. At $t=0$ the right side is one, so that endpoint follows directly. Minimizing over $t\ge 0$ gives the Chernoff bound.

For a finite stopping time $n$ with target $k\ge 1$, necessarily $n\ge k$. The last toss must be a head and the preceding $n-1$ tosses must contain $k-1$ heads. The negative binomial stopping argument therefore gives likelihood $\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)p^k(1-p{)}^{n-k}$ for the biased coin, and $\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)2^{-n}$ for the fair coin. Applying Bayes' theorem again yieldsThe two experiments have different combinatorial coefficients, but each coefficient is independent of the coin parameter. Thus posterior equality for proportional likelihoods explains their identical posterior formula. If $p=0$, a finite positive-head stopping observation has zero likelihood under the biased coin, consistently giving posterior zero. If the target is $k=0$, the experiment stops at $n=0$ without a toss and the posterior remains $1/2$; a positive stopping time would then be impossible.

Let $B$ mean that the selected coin is biased and $F$ that it is fair. Both have prior probability $1/2$. Conditional on either coin, tosses are independent. For the observed head count, the two binomial distribution likelihoods are $\left(\genfrac{}{}{0ex}{}{n}{k}\right)p^k(1-p{)}^{n-k}$ and $\left(\genfrac{}{}{0ex}{}{n}{k}\right)2^{-n}$. Bayes' theorem cancels the common coefficient and equal prior weights, givingThis applies for $0\le k\le n$, including endpoint coin biases with zero-power factors interpreted by the corresponding likelihood. The fair-coin likelihood is positive, so the denominator cannot vanish.

The Taylor theorem with Lagrange remainder says that, if $f$ has $N+1$ continuous derivatives on the interval joining $0$ and $x$, then for some $\xi$ strictly between them,More generally the expansion is about any base point, replacing $x$ by its displacement. The displayed regularity is a sufficient hypothesis for the theorem.

For $f(t)=(1+t{)}^{1/2}$ and $t>-1$, repeated differentiation givesTherefore the requested coefficients are $c_n=f^{(n)}(0)/n!$. For a fixed $0<x<1$, the remainder hasNow $|c_1|=1/2$ and $|c_{n+1}/c_n|=(n-1/2)/(n+1)<1$ for $n\ge 1$, so $|c_{N+1}|\le 1/2$. Hence $|R_N(x)|\le x^{N+1}/2\to 0$. Passing to the limit proves, rather than merely formally suggests, the binomial seriesThe restriction $x>0$ makes the remainder bound especially direct, since $1+\xi \ge 1$.

For a nonzero $x$, the absolute successive-term ratio in the exponential series is $|x|/(n+1)\to 0$, so the first series converges for every $x$. For the factorial series the ratio is $(n+1)|x|\to \infty$, so its terms fail to tend to zero for every $x\ne 0$.

The third series is sparse: its exponent is $n^2$, as in the PDF. If $t_n=(n!{)}^2|x{|}^{n^2}$, thenFor $|x|>1$, the terms grow without bound; at $|x|=1$ their moduli are $(n!{)}^2$, so they again fail the term test. Equivalently, the Cauchy-Hadamard theorem for the sparse coefficients uses $(n!{)}^{2/n^2}\to 1$, not $(n!{)}^{2/n}\to \infty$. Thus the three radii of convergence areZeros at non-square coefficient indices do not change the relevant limsup in the last root test. This illustrates the radius of convergence of a sparse power series.

Use the orthonormal right-handed basisDirect multiplication gives $B(r)u=u$, $B(r)v=rv+w/\sqrt{2}$ and $B(r)w=-v/\sqrt{2}+rw$. Thus the matrix in this basis isThe last two columns are orthogonal and both have squared norm $r^2+1/2$. Therefore $B(r)$ is an orthogonal matrix precisely when $r^2+1/2=1$, giving the unique positive valueIts determinant is $r_0^2+1/2=1$, so it is a proper rotation matrix, not a reflection. The transverse block has cosine and sine both $1/\sqrt{2}$. ConsequentlyWith the oriented axis $u$, the angle is positive by the right-hand rule, since $u\times v=w$. The axis also follows from the unit-eigenvalue eigenspace. As a check, $\mathrm{tr}B(r_0)=1+\sqrt{2}=1+2\cos (\pi /4)$.

Let the repeated eigenvalue be $a$, and choose an eigenvector $v_1\ne 0$. Complete it to a basis $(v_1,v_2)$ of ${\mathbb{C}}^2$. In this basis the matrix is an upper triangular matrix, with first column $(a,0{)}^T$, say $T=\left(\begin{array}{cc}a& c\\ 0& d\end{array}\right)$. Its characteristic polynomial is $(t-a)(t-d)$. By part (a)(ii), this must equal $(t-a{)}^2$, so $d=a$.

If $c=0$, the matrix is already $aI$. If $c\ne 0$, rescale the first basis vector by $k=c$ and apply part (a)(iii); the upper-right entry becomes one. ThusThe second possibility is a size-two Jordan block. It has only one independent eigenvector, whereas $aI$ has a two-dimensional eigenspace, so the two types cannot be related by matrix similarity. This repeated-eigenvalue classification in dimension two proves the required result without assuming the general Jordan normal form theorem.