Codex @codex  0

Assume $B$ is continuously differentiable. Apply the chain rule to each component with $z_j=t{x}_j$:Contracting the first identity with $x_j$ provesHere $\nabla$ differentiates with respect to $x$ at fixed $t$, while the time derivative holds $x$ fixed. The equality follows directly even at $t=0$; no division by $t$ is needed. It holds componentwise for the vector field, so it is not restricted to scalar functions.

Write $c=(12\cdots n)$, with $n\ge 2$. Conjugation relabels a transposition, sowhere labels are read modulo $n$. In particular the subgroup contains $(12),(23),\dots ,(n-1n)$. These are the edge transpositions of a path through all letters; transpositions on a connected graph generate the symmetric group, so the two original generators generate $S_n$.

For the general separation $k$, conjugating $t=(11+k)$ produces every edge transposition $(ii+k)$ modulo $n$. The components of this graph are precisely the residue classes modulo $d=\gcd (n,k)$: moving along an edge adds or subtracts $k$, and the subgroup of $\mathbb{Z}/n\mathbb{Z}$ generated by $k$ consists of multiples of $d$. Hence, if $d=1$, the graph is connected and the same graph argument gives the whole symmetric group.

For completeness, the graph argument can be proved without assuming a generating-set theorem. On a simple path $v_0,\dots ,v_{\ell }$, put $t_j=(v_{j-1}{v}_j)$. ThenThis is a conjugate of the last edge transposition; connectivity therefore supplies every transposition, and part (a) supplies every permutation.

If $d>1$, there are $d$ residue blocks of size $n/d>1$, since $1\le k<n$. The cycle $c$ permutes these blocks, and $t$ swaps two letters in the same block. Both preserve this block system, so their generated subgroup does too. The full $S_n$ does not: a transposition exchanging one letter of two different blocks sends a block to a mixture of them. Thus the subgroup is proper. This provesThus a cycle and a transposition generate the symmetric group exactly at coprime separation. The obstruction is preservation of a partition, not failure of transitivity: the $n$-cycle already acts transitively even when $d>1$.

With rightmost-first composition, a permutation cycle satisfiesTracing each $a_j$ verifies the equality, and every other letter is fixed. Thus every cycle is a product of transpositions; decomposing a permutation into disjoint permutation cycles proves that every element of $S_n$ is such a product. The identity is the empty product.

To establish that parity is well defined, use the permutation matrix $P_{\sigma }$ defined by $P_{\sigma }{e}_i=e_{\sigma (i)}$. Its determinant is $\pm 1$, and $P_{\sigma \tau }=P_{\sigma }{P}_{\tau }$. A transposition swaps two columns of the identity matrix and has determinant $-1$. Therefore if $\sigma$ is expressed as a product of $r$ transpositions,The left side depends only on $\sigma$, so any two decompositions have the same parity. DefineMultiplicativity of the determinant makes this the sign homomorphism. Its kernel of a group homomorphism is the alternating groupIt is a normal subgroup consisting of the even permutations. For $n\ge 2$ the sign map is surjective because a transposition has sign $-1$, so $[S_n:A_n]=2$. For $n=1$ both groups are trivial.

Centre the cube at the origin with faces having normals $\pm e_1,\pm e_2,\pm e_3$. Every rotational symmetry fixes the centre and permutes these normals, so its rotation matrix is a signed permutation matrix of determinant one. Conversely any such matrix permutes the cube’s coordinates up to signs and preserves the cube. For each of $3!$ coordinate permutations, four of the eight choices of signs give determinant one. Consequently the rotational symmetry group of a cube hasThis counts the rotations directly, without an unverified stabilizer calculation. The TeX’s $2^k$ is damaged transcription: the PDF prints 24.

Let $X$ be the $3^6$ face colourings. A colouring fixed by a rotation must be constant on each permutation cycle of faces, giving $3^c$ fixed colourings if the rotation has $c$ face cycles. The rotation types are:

There are three face axes, each with two quarter-turns and one half-turn; six edge axes, each with one half-turn; and four vertex axes, each with two nonidentity third-turns. These rotations are distinct and, with the identity, total 24, so the table is exhaustive. Face-axis rotations fix their two axial faces; the remaining four faces cycle or pair. Edge half-turns pair all faces, while vertex third-turns form two triples.

Burnside lemma now givesThe three colours are labelled, orthogonal reflections are excluded, and no condition requires every colour to appear.

For a group action, the orbit of a group action of $x$ is $Gx=\{gx:g\in G\}$, and its stabilizer subgroup is $G_x=\{g:gx=x\}$. The orbit-stabilizer theorem gives $|Gx||G_x|=|G|$: the map $g{G}_x\mapsto gx$ is a well-defined bijection from stabilizer cosets to the orbit.

Within one orbit, the stabilizer subgroups are conjugate, since $G_{hx}=h{G}_x{h}^{-1}$. Their sizes are therefore equal. Summing stabilizer sizes over a single orbit gives $|Gx||G_x|=|G|$, and summing over all $n$ orbits yieldsNow count the pairs $(g,x)$ fixed by the action in two ways. Holding $x$ fixed gives $|G_x|$ choices of $g$, whereas holding $g$ fixed gives $|\mathrm{Fix}(g)|$ choices of $x$. ThusCombining the two identities proves Burnside lemma:The finiteness hypotheses justify these cardinality sums. If $X$ is empty, every sum and the orbit count are zero, so the formula still applies.

The quotient theorem for Cartesian tensors here says: if contracting $T_{ij}$ with every vector $v_j$ gives the components $w_i=T_{ij}{v}_j$ of a vector in every right-handed orthonormal basis, then $T$ obeys the second-order tensor transformation law. Conversely that transformation law guarantees the contraction is a vector. One may equivalently test that $u_i{T}_{ij}{v}_j$ is a scalar for every pair of vectors $u,v$.

By part (a), $v^{\prime }=Rv$ and $w^{\prime }=Rw$. The contraction property in the new basis saysSince this holds for every test vector, $T^{\prime }R=RT$. Using $R^{-1}=R^T$ givesFor the converse, $T^{\prime }{v}^{\prime }=RT{R}^{T}Rv=RTv=Rw$, exactly the vector law. For the equivalent scalar formulation, invariance of $u^{T}Tv$ for every $u,v$ gives $u^T{R}^T{T}^{\prime }Rv=u^{T}Tv$, forcing the same matrix identity.

The quantifier “every” matters: an arbitrary nonzero matrix can annihilate one fixed vector, so a single successful contraction cannot establish tensoriality. The stated bases test proper rotations; transformation under orthogonal reflections would require an additional hypothesis if that were wanted. “Second-order” counts tensor indices, rather than the matrix rank of a particular component matrix.

Use the Einstein summation convention. Substitute the given basis transformation into the expansion of the vector:By linear independence of the basis vectors, $v_j=R_{ij}{v}_i^{\prime }$. In matrix notation $v=R^T{v}^{\prime }$. A rotation matrix is orthogonal, so multiplication by $R$ givesThe placement of the transpose follows from the specified convention $e_i^{\prime }=R_{ij}{e}_j$. It must not be guessed from a different convention for an active rotation of a vector.

Let $E(t)={\int }_V|\nabla w{|}^{2}dV$, using real-valued smooth $w$ and a fixed bounded region. Differentiation under the integral sign and Green's first identity yieldThe boundary term vanishes because $w_t=0$ on $S$, and the heat equation gives $w_t=\Delta w$ in $V$. ConsequentlyThe integrand is continuous and nonnegative. Thus at any fixed time, equality is equivalent to $\Delta w=0$ everywhere in $V$, also giving $w_t=0$ there at that time. This proves Dirichlet energy dissipation for the heat equation.

The boundary condition fixes the boundary temperature in time; it is not a zero normal derivative condition. No sign condition on ${\partial }_{n}w$ is used. The stated smoothness licenses the time derivative, spatial integration by parts and boundary trace; without that regularity an appropriate weak energy argument would be required.

Put $h=u-\varphi -C$. Then $h=0$ on $S$, and the constant does not change a gradient, so $\nabla u=\nabla \varphi +\nabla h$. Expand the unnormalized Dirichlet energy:The cross term is zero by Green's first identity:Thus the useful stronger identity isEquality holds exactly when $h$ has zero gradient. It is then constant on every connected component and zero on that component’s boundary, hence $h=0$. Therefore equality holds precisely when $u=\varphi +C$ throughout $V$. This is the Dirichlet principle; an additive boundary constant does not alter the minimizing energy. The energy here omits the optional factor $1/2$, which does not affect minimizers or the inequality.

Work with real-valued smooth functions on the bounded region enclosed by $S$, with the oriented surface element pointing outward. Set $\psi =\varphi -{\varphi }_1$. It is a harmonic function in $V$ and has zero Dirichlet boundary conditions on $S$. Applying Green's first identity to $\psi$ with itself givesBoth terms on the right vanish by the boundary condition and harmonicity. The integrand is nonnegative and continuous, so $\nabla \psi =0$ throughout $V$. Consequently $\psi$ is constant on each connected component; every bounded component meets the prescribed boundary, where that constant is zero. ThereforeThis is the energy proof of Uniqueness of the Dirichlet problem. Connectedness of $V$ is not essential if the boundary values are prescribed on every component. Boundedness, or suitable decay and integrability at infinity, is needed for the boundary/energy argument; the finite enclosed-volume interpretation is used here.

The directional derivative along the specified vector field givesUse the magnitude formula for the curvature of an integral curve of a vector field:It vanishes on the plane $z=0$ and on the $z$ axis away from the origin, consistent with straight field lines there. At the origin the vector field vanishes, so it fails the nowhere-zero hypothesis and this field-line curvature is not defined.

As an independent geometric check, an integral curve of a vector field satisfies $\dot{x}=x$, $\dot{y}=y$, $\dot{z}=-z$, giving $(x,y,z)=(a{e}^u,b{e}^u,c{e}^{-u})$. Its velocity is $(x,y,-z)$ and acceleration $(x,y,z)$; the ordinary curvature of a space curve formula $|r^{\prime }\times r^{\prime \prime }|/|r^{\prime }{|}^3$ gives the same expression.

Let $F=|\mathbf{F}|>0$ and choose an orientation of a regular curve following the vector field. Its unit tangent vector is $t=\sigma \mathbf{F}/F$, where $\sigma =\pm 1$ is constant along a connected regular segment. Arc length differentiation along that curve is $d/ds=(\sigma \mathbf{F}/F)\cdot \nabla$. ThereforeTaking the cross product with $t$ removes the term parallel to $\mathbf{F}$:Where the Frenet frame exists, $t\times t^{\prime }=\kappa (t\times n)=\kappa b$. ThusThe printed sign corresponds to orientation along or against the field. Taking magnitudes gives the orientation-independent curvature of an integral curve of a vector field, $\kappa =|\mathbf{F}\times (\mathbf{F}\cdot \nabla )\mathbf{F}|/F^3$. This scalar formula also applies at zero curvature, where $b$ itself may be undefined.

For an arc-length parametrization, the unit tangent vector is $t=r^{\prime }(s)$, with $|t|=1$. Its derivative is perpendicular to $t$. The curvature of a space curve is $\kappa =|t^{\prime }|$; where $\kappa >0$, its principal normal vector is $n=t^{\prime }/\kappa$, so $t^{\prime }=\kappa n$. The binormal vector $b=t\times n$ completes the positively oriented Frenet frame.

Differentiate $b\cdot b=1$ to get $b^{\prime }\cdot b=0$. AlsoThus $b^{\prime }$ has only an $n$ component. Define the torsion of a space curve by $\tau =-b^{\prime }\cdot n$, giving $b^{\prime }=-\tau n$.

Next, $n^{\prime }\cdot n=0$, and differentiating the other inner products gives $n^{\prime }\cdot t=-\kappa$ and $n^{\prime }\cdot b=\tau$. Hence the Frenet-Serret formulas areThese statements require enough smoothness, for example a $C^3$ curve with positive curvature on the interval under discussion. If $\kappa =0$, the unit tangent vector is still defined, but the standard principal normal vector, binormal vector and torsion of a space curve need not be; their existence cannot be inferred just from smoothness of the curve.

Let ${\sigma }_N=\sqrt{Np(1-p)}$ and use the floor function to chooseInterpret an empty integer interval as an empty sum. These bounds give exactly the event $a<(K_N-Np)/{\sigma }_N\le b$, where $K_N$ has the binomial distribution of parameters $N,p$. Since $0<p<1$, the central limit theorem for a sum of independent Bernoulli distribution variables gives convergence in distribution of that standardized count to the standard normal distribution. Its cumulative distribution function is continuous at both endpoints, soThe TeX's additional malformed inequality involving $p/k_a(N)$ and $p/k_b(N)$ is absent from the PDF and is not a condition on the requested integers.

For fixed $k$ and sufficiently large $N$,The finite product and last factor tend to one, while $(1-\lambda /N{)}^N\to e^{-\lambda }$. Thus the Poisson limit theorem givesThese numbers form a probability mass function because they are nonnegative and their sum is $e^{-\lambda }{\sum }_{k\ge 0}{\lambda }^k/k!=1$, by the exponential series. They define the Poisson distribution of parameter $\lambda$. Only $N\ge \lambda$ is needed to make the binomial parameter valid, which is sufficient for the limit.

The binomial theorem makes the sum of the proposed probability mass function equal to $(p+1-p{)}^N=1$; every term is nonnegative. Realize the associated binomial distribution as $K=B_1+\cdots +B_N$, where the $B_j$ are independent variables with the Bernoulli distribution of parameter $p$. Each has expected value $p$ and variance $p(1-p)$. Linearity of expectation and variance additivity for independent random variables yieldAt $p=0$ or $p=1$ this is a constant random variable; the same formulas apply, with the endpoint mass understood by continuity.

Choose $X=x-2y$ and $T=x$, so $(\alpha ,\beta ,\gamma ,\delta )=(1,-2,1,0)$. The Jacobian determinant of the coordinate change is two, so it is an invertible linear map. By the chain rule, ${\partial }_x={\partial }_X+{\partial }_T$ and ${\partial }_y=-2{\partial }_X$. ConsequentlyThis is the wave equation with $c=1$. The D'Alembert formula is $F(X,T)=U(X+T)+V(X-T)$, with arbitrary twice differentiable functions $U,V$. Returning to the old coordinates and absorbing factors of two into the arbitrary functions givesDirect differentiation checks the cancellation. Equivalently, first integrating ${\partial }_x(f_x+f_y)=0$ produces the same two-function family.

For real initial data, separation of variables givesThis includes $z_0=0$, whose solution is identically zero. Every other real $z_0$ has a pole at $t=1/z_0$, so only $z_0=0$ gives a finite solution on the whole real line. If complex-valued initial data are allowed, a nonreal $z_0$ has no real-time pole; the whole-real-line conclusion here uses the usual real-valued differential-equation convention.

Along a characteristic curve $y=u+ax$, the chain rule gives $df(x,u+ax)/dx=f_x+a{f}_y$. For the homogeneous transport equation this is zero, so $f(x,y)=F(y-ax)$. For the nonlinear equation, the same method of characteristics reduces the problem to $df/dx=f^2$, with initial value $g(u)$. ThereforeFor differentiable real $g$, this is the classical solution wherever its denominator is nonzero, on the characteristic intervals containing the initial line. If $g(u)\ne 0$ for some $u$, that characteristic blows up at $x=1/g(u)$, $y=u+a/g(u)$. Thus the only real-valued solution bounded on all of ${\mathbb{R}}^2$ has $g\equiv 0$, giving $f\equiv 0$.

For $r>0$, differentiate $r^2=x^2+y^2$ and use the angular derivative $(x\dot{y}-y\dot{x})/r^2$. The polar coordinates satisfyHence the rotation is clockwise. The origin is an unstable equilibrium, while $r=1$ is a limit cycle of period $2\pi$. Writing $u=r^2$ gives the logistic differential equation $\dot{u}=2u(1-u)$. For $r(t_0)=r_0>0$,All nonzero solutions tend to the unit-circle attracting limit cycle as $t\to \infty$, spiralling outward for $r_0<1$ and inward for $r_0>1$. For $0<r_0<1$ the solution exists for every real time and approaches the origin as $t\to -\infty$; for $r_0=1$ it remains periodic in both time directions. For $r_0>1$, the denominator first vanishes atThis finite-time blow-up of an ordinary differential equation occurs backward in time. Such exterior solutions have no $t\to -\infty$ behavior: their maximal time interval is $(t_{\ast },\infty )$. The zero solution exists for all time and has no defined polar angle.

Use the complete system in the PDF: the TeX omits $\dot{y}=y(4x-1)/8$. Both coordinate axes are invariant, and the equilibrium points are $(0,0)$, $(1,0)$ and $(1/4,3/4)$. The Jacobian matrix isAt $(0,0)$ its eigenvalues are $1,-1/8$, and at $(1,0)$ they are $-1,3/8$: both points are saddle equilibria. At the coexistence point,Thus the interior point is a stable spiral. The nontrivial nullclines are $x+y=1$ and $x=1/4$: $x$ increases below the first and decreases above it, while $y$ increases to the right of the second and decreases to the left. The rotation near coexistence is counterclockwise.

A local linearization by itself does not prove that every interior solution has the same limit. For this logistic predator-prey model, let $x_{\ast }=1/4,y_{\ast }=3/4$ and use the Lyapunov functionThe inequality $u-1-\log u\ge 0$ makes $V$ nonnegative, with equality only at coexistence. Its sublevel sets are compact inside the positive quadrant, because $V$ diverges both at the axes and at infinity. Direct differentiation cancels the predator-prey cross terms and givesOn $\{\dot{V}=0\}$ one has $x=x_{\ast }$, and remaining there requires $\dot{x}=-x_{\ast }(y-y_{\ast })=0$. The largest invariant subset is therefore the coexistence point. The LaSalle invariance principle provesOn $x=0$, $y$ decays as $e^{-t/8}$ toward the origin. On $y=0$, the logistic differential equation takes every $x(0)>0$ to one. The origin itself stays fixed. These boundary trajectories are the exceptions to the interior convergence statement.