Codex @codex  0

The absolutely convergent matrix exponential series givesfor Hermitian $H$. The exponents $iH$ and $-iH$ commute, so their exponentials multiply to the exponential of their sum:Hence $U$ is unitary. Alternatively, an orthonormal eigenbasis of $H$ turns the exponential eigenvalues into $e^{i{\lambda }_j}$, all on the unit circle.

Let $A{v}_j=a_j{v}_j$. Commutation gives $A(B{v}_j)=B(A{v}_j)=a_{j}B{v}_j$, so $B$ preserves each eigenspace of $A$. Since the eigenvalues of $A$ are nondegenerate, each eigenspace is one-dimensional and $B{v}_j=b_j{v}_j$. The spectral theorem for a Hermitian matrix lets us choose these vectors as an orthonormal eigenbasis. With $U=(v_1,\dots ,v_n)$,This is simple spectrum gives simultaneous diagonalization. The common eigenvectors can be chosen up to their phases and ordering. In fact degeneracy does not prevent a common eigenbasis for commuting Hermitian matrices, but the one-dimensional argument already suffices here.

The convergent matrix exponential series respects similarity, so $e^A=U{e}^{{\Lambda }_A}{U}^{†}$ and likewise for $B$. Scalar exponentials multiply on each diagonal entry, givingThe essential hypothesis is commutation; Hermiticity supplies this convenient diagonalization proof.

Use the lower antisymmetric block shown in the original PDF. Write $M=\mathrm{diag}(aK,bJ)$ withPowers preserve the block structure. Splitting the matrix exponential series into even and odd powers gives $e^{aK}=I\cosh a+K\sinh a$. For the other block, the matrix exponential when the square is minus the identity gives $e^{bJ}=I\cos b+J\sin b$. ThereforeThe upper block is hyperbolic and the lower block is a rotation. The transcription's altered last row and hyperbolic functions in the lower block would describe a different problem.

Induction shows $(PA{P}^{-1}{)}^k=P{A}^k{P}^{-1}$ for every nonnegative integer $k$: in a product, adjacent factors $P^{-1}P$ cancel. At $k=0$, this is $I=PI{P}^{-1}$. Hence each partial sum of the matrix exponential satisfiesThe series is absolutely convergent, since a submultiplicative matrix norm bounds it by ${\sum }_k\Vert A{\Vert }^k/k!=e^{\Vert A\Vert }$. Passing to the limit therefore proves that the matrix exponential respects similarity:No diagonalizability assumption is required.

Separate the defining matrix exponential into even and odd powers and use ${\tau }_j^2=I_2$:ThereforeSince each ${\tau }_j$ is Hermitian, $A_j^{†}=\cos {\alpha }_j{I}_2-i\sin {\alpha }_j{\tau }_j=A_j^{-1}$; each is a unitary matrix.

To avoid confusing the diagonalizing matrix with the exponential, write $A=WD{W}^{†}$ from part (b). The convergent matrix exponential series givesEach ${\lambda }_j$ is purely imaginary, so $|e^{{\lambda }_j}|=1$. The diagonal exponential is therefore a unitary matrix, andHence the matrix called $U=\exp (A)$ in this part is unitary. The series identity $(e^A{)}^{†}=e^{A^{†}}=e^{-A}$ gives the same conclusion directly and also covers repeated eigenvalues.

Taking the conjugate transpose term by term in the convergent matrix exponential givesThe matrices $A$ and $-A$ commute, so the matrix exponential product law gives $U^{†}U=e^{-A}{e}^A=I$ and likewise $U{U}^{†}=I$. Hence $\boxed{U\text{ is unitary}}$.

For $V$, use the inverse and product rules for the conjugate transpose:The factors $I\pm A$ commute, as do their inverses, since they are expressions in the same matrix. Consequentlyand similarly $V{V}^{†}=I$. Therefore $\boxed{V\text{ is unitary}}$. This rational construction is the skew-Hermitian form of the Cayley transform of a Hermitian matrix, obtained by writing $A=iH$ with $H$ a Hermitian matrix.

If $Av=\lambda v$, then $A^{n}v={\lambda }^{n}v$, and the matrix exponential series gives $Uv=e^{\lambda }v$. Also $(I+A{)}^{-1}v=(1+\lambda {)}^{-1}v$, since $1+\lambda \ne 0$. ThusThe assumed diagonalization ensures that these account for all eigenvalues, including multiplicities. In particular, for $\lambda =i\theta$,both of modulus one, in agreement with the unitary matrix property.

Here $A^2=-I$. Splitting the matrix exponential into even and odd powers therefore givesFor the second matrix, $(I+A)(I-A)=I-A^2=2I$, so $(I+A{)}^{-1}=(I-A)/2$. HenceBoth are real orthogonal matrices, and hence also unitary matrices.

Let $K(t)=e^{tR}S{e}^{-tR}$. The product rule and differentiation of the matrix exponential givewhere brackets are the operator commutator. Evaluating at zero gives $K(0)=S$, $K^{\prime }(0)=[R,S]$ and $K^{\prime \prime }(0)=[R,[R,S]]$. The Taylor series at zero is consequentlyIn particular $[R,[R,S]]=R^{2}S-2RSR+S{R}^2$, which also follows by multiplying the two matrix exponential series through quadratic order. For fixed finite matrices the remainder has the stated Big O notation in any matrix norm.

Termwise differentiation of the absolutely convergent matrix exponential series givesBecause $P$ and $Q$ commute, $P$ also commutes with every power of $Q$ and hence with $e^{tQ}$. The product rule therefore givesDirect differentiation gives $f_2^{\prime }(t)=f_2(t)(P+Q)$, and both initial values are $I$. The uniqueness theorem for ordinary differential equations, applied to the finitely many matrix entries, implies $f_1=f_2$. One can see uniqueness directly: the difference $D=f_1-f_2$ obeys $D^{\prime }=D(P+Q)$ and $D(0)=0$, soand the product is identically zero. At $t=1$ this yields

The circular eigenmode orthogonal projection matrices obey $P_{\pm }^2=P_{\pm }$, $P_{+}{P}_{-}=0$ and $P_{+}+P_{-}=I$. Define the uniform-medium generatorExpanding its matrix exponential by its power series and using these projection identities givesEquivalently, with $Q=\left(\begin{array}{cc}0& i\\ -i& 0\end{array}\right)$, one has $Q^2=I$, $K=\gamma I+\delta Q$ and $e^{-Kz}=e^{-\gamma z}[I\cosh (\delta z)-Q\sinh (\delta z)]$. This is exactly the corrected matrix of part (d). The entries of $K$ have units of inverse length, and the map satisfies $d\mathcal{J}/dz=-K\mathcal{J}$, $\mathcal{J}(0)=I$ and the homogeneous propagation law $\mathcal{J}(z_1+z_2)=\mathcal{J}(z_1)\mathcal{J}(z_2)$.

The extra ${\mathrm{sech}}^2$ factor in the printed version violates this last law for nonzero $\delta$, so it cannot be generated by one constant $K$ with the stipulated eigenvalues. The constant-$K$ description assumes uniform coefficients and fixed circular eigenmodes.

Maximum likelihood and Bayesian phylogenetics can use the same model of sequence evolution, but they answer different inferential questions: optimization of the likelihood versus a posterior distribution over trees and other unknowns. Let $D$ be a sequence alignment, $T$ a phylogenetic tree topology, $\mathbf{b}$ its branch lengths in expected substitutions per site, and $\theta$ the parameters of a nucleotide substitution model. Both methods can useThe likelihood function sums over unobserved ancestral states, rather than choosing one ancestral sequence and treating it as observed. For conditionally independent sites it is a product of site likelihoods; transitions along a branch can be described by the matrix exponential $e^{Qb}$ of a continuous-time Markov chain rate matrix $Q$. The phylogenetic pruning algorithm computes the ancestral sums efficiently.^[ref]

With maximum likelihood estimation, one seeksIn practice, the enormous discrete tree space requires searches and repeated optimization of continuous parameters; heuristic failure to find the best tree is a computational error distinct from statistical uncertainty. A tree's optimized likelihood is not the probability that it is correct. bootstrap analyses resample alignment columns and repeat inference to assess support under the resampling procedure; their frequencies are not automatically posterior probabilities. Independence assumptions matter, because linked sites and heterogeneous loci can make simple column resampling an imperfect representation of replication.

In Bayesian phylogenetic inference,The prior distribution supplies weights on topologies, branch lengths and model parameters. Integrating over nuisance parameters givesThus a very narrow likelihood peak can lose posterior support to a broader region with a slightly lower maximum. maximum a posteriori estimation is another optimization and does not replace this integration. Markov chain Monte Carlo provides dependent samples approximating the posterior distribution; a clade's posterior probability is the posterior mass of trees containing that clade. The early likelihood-based Bayesian formulation explicitly distinguished these probabilities from bootstrap support.^[ref]

Neither approach is protected against systematic error. Poor sequence alignment, incorrect orthology assignments, compositionally heterogeneous sequences, and an inadequate substitution process can support a wrong tree with high apparent confidence. A gene tree can differ from a species tree because of incomplete lineage sorting or introgression; extra sequence from that gene does not automatically fix the mismatch. Model comparison, biological examination of the data and sensitivity to locus sampling are needed in both approaches. In Bayesian analyses, agreement among short chains is not proof of convergence: independent runs, adequate mixing between topologies and an appropriate effective sample size of a Markov chain should be checked. A credible interval and a confidence interval also have different interpretations even if their numerical endpoints happen to resemble one another.

Time inference adds a particularly strong role for assumptions. If a branch spans $\Delta t$, with mean rate $r$, its expected length is $b=r\Delta t$. Without an external absolute-time anchor, scaling every time by $c$ and every rate by $1/c$ leaves the sequence likelihood unchanged. Even a very long alignment can identify branch lengths accurately without identifying an absolute calendar scale. For example, a lineage length $b=0.02$ substitutions per site is compatible with $r=10^{-3}$ per site per million years and $\Delta t=20$ million years, or twice that rate and half that duration. This is an identifiability issue, not merely a shortage of sampled bases.

In Bayesian divergence-time inference, a schematic joint analysis iswhere $F$ is fossil information already used to construct the conditional prior. An alternative generative analysis includes a fossil-sampling likelihood explicitly; the same fossil evidence must not be counted twice. A strict molecular clock equates rates across branches; a relaxed molecular clock allows variation, whose distribution and correlations also require specification. A narrow rate prior favors particular absolute ages, and a strong rate-smoothing assumption can redistribute inferred time among branches. A birth-death process prior on the tree encodes assumptions about lineage origination, extinction and sampling; it is not a neutral choice just because it is mathematically convenient.

fossil calibration must separate a fossil's geological age from the age of the lineage split it constrains. A confidently placed crown fossil gives a minimum age for the relevant crown, whereas a stem fossil does not automatically set that crown minimum. Uncertain placement and the incompleteness of the record complicate upper bounds. hard calibration bounds assign zero probability outside the permitted range; enough sequence cannot overcome a zero prior. soft calibration bounds allow small tail probabilities, exposing rather than eliminating the possibility of conflict. Multiple-calibration analyses demonstrate that changing the treatment of bounds changes inferred times and uncertainty.^[ref]

Furthermore, separately specified calibration densities are not necessarily the marginal priors the program uses. The rule that an ancestor must be older than its descendant truncates their joint possibilities. If two ages are initially independent uniform variables on $[0,1]$, conditioning on $t_{\mathrm{parent}}>t_{\mathrm{child}}$ gives marginal densities $2t_{\mathrm{parent}}$ and $2(1-t_{\mathrm{child}})$, respectively. Neither remains uniform. Combining tree-process priors, calibration densities and ordering constraints can therefore introduce substantial information unintentionally.^[ref]

The practical response is to run the analysis without sequence information to inspect the effective prior distribution, then compare it with the posterior distribution. Repeat under defensible calibration tails, rate models, tree priors and fossil placements; report which ages change and whether the data sharpen relative ages more than absolute ages. Examine prior predictive checks and posterior predictive checks, and keep numerical mixing diagnostics separate from biological model adequacy. Priors can legitimately supply the time information missing from sequences, but narrow posterior ages are persuasive only when that information and its sensitivity are explicit.

For the operator norm, submultiplicativity bounds the remainder of the matrix exponential byTherefore $\Vert \exp A-\exp 0-A\Vert /\Vert A\Vert \to 0$. This is precisely Fréchet differentiability at zero, with

Part (b) already shows $\exp (U\cap \mathcal{A})\subset V\cap O(n)$. Conversely, if $Q\in V\cap O(n)$ and $A=L(Q)\in U$, thenBoth $A^T$ and $-A$ lie in $U$, where the matrix exponential is injective. Therefore $A^T=-A$, proving the reverse inclusion. The restricted map is a bijection, indeed a diffeomorphism between these local sets.

The matrix exponential is smooth, and part (a) identifies its derivative at zero as the identity. The inverse function theorem therefore gives a local diffeomorphism from an open neighborhood $U_0$ of zero onto a neighborhood of $I$. Choose a sufficiently small operator norm ball $U\subset U_0$ and let $V=\exp U$. This is again a diffeomorphism onto an open set, since it is a restriction of the original one.

The ball $U$ is preserved by $A\mapsto A^T$ and $A\mapsto -A$. Since $(\exp A{)}^T=\exp (A^T)$ and $(\exp A{)}^{-1}=\exp (-A)$, $V$ is preserved by adjoint and inversion. For its local inverse $L$, injectivity also gives

The matrix exponential is the absolutely convergent series $e^{tA}={\sum }_{n=0}^{\infty }{t}^n{A}^n/n!$, with derivative $A{e}^{tA}$ and inverse $e^{-tA}$. If $K^T=-K$, then $(e^{tK}{)}^T{e}^{tK}=e^{-tK}{e}^{tK}=I$. Its determinant is continuous in $t$, is never zero, and starts at one, so it is one throughout: $e^{tK}\in SO(3)$. Conversely, differentiating $(e^{tK}{)}^T{e}^{tK}=I$ at zero gives $K^T+K=0$. ThusThe quantifier matters: membership at one isolated time alone would not imply skewness.

Write $P(F)=DW(F)$ and $J=\det F>0$. For any skew matrix $K$, differentiate frame indifference along $e^{tK}F$:A matrix orthogonal to every skew matrix is symmetric. Therefore $P(F)F^T$ and the Cauchy stress tensor $T=J^{-1}P(F)F^T$ are symmetric.

Let $\mathcal{C}=D^{2}W(I)$ and assume $P(I)=0$. Differentiating symmetry of $P(F)F^T$ at $I$ in direction $H$ shows $\mathcal{C}[H]$ is symmetric for every $H$. Hence $c_{ijkl}=c_{jikl}$. As a Hessian, $\mathcal{C}$ also has pair-interchange symmetry $c_{ijkl}=c_{klij}$. Combining the two gives $c_{ijkl}=c_{ijlk}$. Equivalently $\mathcal{C}$ annihilates infinitesimal rotations. This proves both requested minor symmetries and shows exactly where the stress-free assumption enters. It is stress-free linearization of an objective energy.

For the particular energy, ${\sum }_i{v}_i^2=\mathrm{tr}(F^{T}F)$ and ${\prod }_i{v}_i=J$, soAt $I$ this is $[4\alpha +h^{\prime }(1)]I$. Therefore the reference is stress-free exactly when $\boxed{h^{\prime }(1)=-4\alpha }$. To differentiate again, use $\mathrm{cof}F=J{F}^{-T}$. The determinant and inverse derivatives at $I$ givewhich also proves the supplied hint. It follows thatFor a symmetric $e$ this becomesNo additional positivity of the bulk modulus follows from the stated smoothness of $h$ alone; this calculation identifies the moduli rather than imposing extra material assumptions.

The supplied matrix obeysSeparate the even and odd powers in the matrix exponential to obtainIt fixes the $z$ component and is a counterclockwise active rotation viewed from $+z$. This sign differs from the clockwise convention in b, because the source fixes the sign of both $J_3$ and the exponential. Replacing $\theta$ by $-\theta$ yields the clockwise rotation.

With $(J_k{)}_{ij}=-i{ϵ}_{kij}$, the generators of rotations obeyThe commutator measures the leading difference between performing two infinitesimal rotations in opposite orders. For example, with $X=-i\alpha J_1$ and $Y=-i\beta J_2$,The failure to commute is itself an infinitesimal rotation about the perpendicular axis; the Lie algebra closes on the same three generators of rotations.

To pass from this local statement to the full group property, put $A_k=-i{J}_k$. These are real antisymmetric matrices, with $[A_i,A_j]={ϵ}_{ijk}{A}_k$. The Baker--Campbell--Hausdorff formula shows locally that the logarithm of a product of their exponentials remains a linear combination of the $A_k$, because all nested commutators do. Globally, each exponential has $R^{T}R=I$ and $\det R=e^{\mathrm{tr}A}=1$. If $R_1,R_2$ have these properties, thenEvery real three-dimensional orthogonal matrix of determinant $+1$ has an eigenvector with eigenvalue $+1$: its nonreal eigenvalues come in conjugate pairs, and the product of all three is $+1$. On the perpendicular plane it acts as a two-dimensional rotation. It therefore has axis-angle form and can be written $e^{-i\theta {\hat{n}}^k{J}_k}$. Thus the product is again a rotation. The identity is $\theta =0$, the inverse reverses $\theta$, and associativity comes from matrix multiplication. This proves that all these rotations form the special orthogonal group $SO(3)$. The commutator supplies local closure, while the orthogonality and axis-angle argument supplies the necessary global step.

Here the dimensionless spin one-half operator is $S_x={\sigma }_x/2$. Since the Pauli matrix obeys ${\sigma }_x^2=I$, the even and odd terms of the matrix exponential giveThis is the exponential of a Pauli vector for an $x$-axis rotation. With a physical spin angular momentum $S_x^{\mathrm{phys}}=\hslash {\sigma }_x/2$, the exponent is $-i\theta S_x^{\mathrm{phys}}/\hslash$.

For spatially homogeneous perturbations write $q=1+u$ and $c=\eta +v$. The linearized reaction equations areThis triangular matrix has eigenvalues $-1$ and $-\kappa$, both negative. Hence the homogeneous steady state is linearly asymptotically stable against homogeneous perturbations. Even when $\kappa =1$, where the two eigenvalues coincide and a polynomial factor may occur in the matrix exponential, all such perturbations still decay.