Traverse the whole original list once for each of its elements:The outer structural recursion runs $n$ times, and each scan whole visits $n$ constructors. In the ordinary source-evaluation cost model, the time complexity is $\Theta (n^2)$. This example counts executed traversals, without assuming an optimizing compiler that removes deliberately unused computations.

Use merge sort on a list of integers:Here mergeSort denotes the standard merge sort implementation: split into two almost equal lists, recursively sort them, and combine them using the merge algorithm. Splitting and merging take linear time, and each recursion level has total input length $n$. There are $\Theta (\log n)$ levels, so the worst-case time complexity is $\Theta (n\log n)$. Equivalently, $T(n)=T(\lfloor n/2\rfloor )+T(\lceil n/2\rceil )+\Theta (n)$.

A Standard ML length function visits each list constructor once:Writing $T(n)$ for its time complexity, $T(n)=T(n-1)+\Theta (1)$ and $T(0)=\Theta (1)$. Thus $T(n)=\Theta (n)$. Arithmetic is treated as unit cost; the example concerns list traversal rather than arbitrary-precision arithmetic.

Use the usual unit-cost model for Standard ML list constructors and fixed-size arithmetic. The input size $n$ in the list examples is the number of list elements, rather than the size of the integer entries. Inspecting only the first constructor has constant time complexity:No tail is traversed. The running time is $\Theta (1)$.

Condition (iv) says in particular that $T$ is an equivalence relation, so it is symmetric and transitive. It therefore implies (i) and (ii), closing the chain of implications.

Uniqueness is literal: if two equivalence relations both contain $R,S$ and are each contained in every such relation, each is contained in the other, so they are equal. Combining the preceding proofs givesTheir common relation is the equivalence relation generated by $R\cup S$, and under these conditions it is already obtained by the two-step composite $R\circ S$.

The inverse argument in part (i) proves that the one-sided inclusion in (iii) already implies equality:Parts (i) and (ii) then make $T$ both symmetric and transitive; it is reflexive from the root solution. Therefore $T$ is an equivalence relation containing $R$ and $S$.

If $U$ is any other equivalence relation containing both, a witness $xRy,ySz$ gives $xUy,yUz$, and transitivity gives $xUz$. Hence $T\subseteq U$. Thus (iii) implies the unique-smallest assertion in (iv).

A binary relation $T$ is transitive exactly when $T\circ T\subseteq T$. If condition (iii) holds, associativity and monotonicity of composition of relations giveHence (iii) implies (ii). Conversely, the inclusions $R,S\subseteq T$ implyIf $T$ is a transitive relation, the right side lies in $T$, which is condition (iii). Thus (ii) and (iii) are equivalent.

By the inverse identity established in the root solution, the composite $T$ is a symmetric relation precisely whenThus condition (i) implies condition (iii). Conversely, if $S\circ R\subseteq R\circ S$, take inverse relations. Since $R,S$ are symmetric, this gives the reverse inclusion $R\circ S\subseteq S\circ R$. The two composites are equal, making $T$ symmetric. Therefore (i) and (iii) are equivalent, and either one forces commutation.

For the anticlockwise arc use $x=\cos \theta$, $y=\sin \theta$, $0\le \theta \le \pi /2$. Since $dx=-\sin \theta d\theta$ and $dy=\cos \theta d\theta$, the line integral becomesThe two integrals multiplying $-\alpha$ each equal $1/3$, by substituting $\cos \theta$ and $\sin \theta$ respectively. The remaining integral equals one. Thus

On the first leg $y=0$ and $x$ decreases from one to zero; on the second $x=0$ and $y$ increases from zero to one. Adding their line integrals givesThe negative sign in the first term follows from the direction of traversal.

Parametrize the straight segment by $x=1-t$, $y=t$, $0\le t\le 1$. Then $dx=-dt$, $dy=dt$, and $x^2+xy=1-t$. The line integral is

False; in fact no matrix with this spectrum is diagonalizable over $\mathbb{R}$. If a real invertible $P$ gave $P^{-1}AP=D$ with $D$ a real diagonal matrix, all eigenvalues of $A$ would be the real diagonal entries of $D$. But two of the required eigenvalues have nonzero imaginary parts. This contradiction provesThe real block form in the initial example is consistent with this: a two-dimensional rotation block is not a real diagonalization.

False. Consider the real matrixIt is block upper triangular, so its characteristic polynomial is the same as that of $A_0$ and it has the required eigenvalues. Its second column, however, has squared Euclidean norm $1+c^2+c^2=2$, whereas every column of an orthogonal matrix has norm one. ThusUnit-modulus eigenvalues alone do not imply orthogonality; they do not control the geometry of the eigenvectors.

True. All three eigenvalues are distinct in $\mathbb{C}$, so their nonzero eigenvectors are linearly independent. Here is a direct proof of that assertion. If $a_1{v}_1+a_2{v}_2+a_3{v}_3=0$, apply $(A-{\lambda }_{2}I)(A-{\lambda }_{3}I)$ to obtainDistinctness makes both scalar factors nonzero, hence $a_1=0$. Applying the analogous products gives $a_2=a_3=0$. The three eigenvectors therefore form a basis of ${\mathbb{C}}^3$. Taking them as the columns of $P$ givesThis proves that every such matrix is a diagonalizable matrix over $\mathbb{C}$, rather than merely showing it for the example.

Decompose the electric field into its orthogonal parts $\mathbf{E}={\mathbf{E}}_{\perp }+{\mathbf{E}}_{\parallel }$, where ${\mathbf{E}}_{\parallel }=n(n\cdot \mathbf{E})$. The uniaxial conductivity tensor acts on them asIf $\mathbf{J}=0$, its perpendicular and parallel components each vanish. Since $\alpha \ne 0$ and $\alpha +\gamma \ne 0$, this forces both field components to be zero. The contrapositive givesEquivalently, the tensor has nonzero eigenvalues $\alpha ,\alpha ,\alpha +\gamma$ and determinant ${\alpha }^2(\alpha +\gamma )\ne 0$.

Writing the uniaxial conductivity tensor in vector form gives the electric current densityChoose the plane through the origin perpendicular to $n$:For an electric field in this plane, the anisotropic term vanishes and $\mathbf{J}=\alpha \mathbf{E}$. Thus every nonzero such field is parallel or antiparallel to its current according to the sign of the nonzero $\alpha$. The zero field gives zero current. This establishes collinearity throughout the plane without assuming that the tensor is isotropic.

Under the moving-coordinate transformation, the forcing is $H(y)$. Choose a stationary solution $U(s,y)=w(y)$, which requires precisely $w^{\prime \prime }+H=0$. The left spatial limit of $Ay+B$ is zero only if $A=B=0$. Therefore one solution is the transported step forcing in an advection-diffusion equation profileIt has $u_t=(x-t{)}_{+}$ and $u_x=-(x-t{)}_{+}$, so their sum vanishes; almost everywhere $u_{xx}=-H(x-t)$, canceling the source. The first derivatives are continuous on the moving interface. For each fixed $t$, the profile is zero far to the left and tends to minus infinity to the right, as required. The PDE holds pointwise off that interface and weakly across it, consistently with the requested continuously differentiable regularity.

For $y<0$, the Heaviside function vanishes, so $w=Ay+B$. For $y>0$, $w^{\prime \prime }=-1$, giving $w=-y^2/2+Cy+D$. Continuity of $w$ and $w^{\prime }$ at zero requires $D=B$ and $C=A$. Consequently the general continuously differentiable profile isIts second derivative jumps from zero to minus one. The equation is satisfied classically away from zero and in the weak, or distributional, sense across it; no globally twice-differentiable function can have the prescribed step as its second derivative. There is no Dirac delta contribution because $w^{\prime }$ is continuous. The value assigned to the Heaviside function at a single point does not change this weak solution.

Apply the chain rule to $U(s,y)=u(s,y+s)$. Holding $y$ fixed while differentiating in $s$ gives $U_s=u_t+u_x$, while $U_y=u_x$ and $U_{yy}=u_{xx}$. Thus the advection-diffusion equation becomesThe moving coordinate follows the unit-speed advection, leaving the heat equation with a transformed source.

For the given Möbius transformation, the fixed point equation is $z(z+3)=3z+1$, hence

For the general Möbius transformation, its finite fixed points satisfyWith $c\ne 0$ and nonzero discriminant, the quadratic formula gives the two distinct fixed points of a Möbius transformation:The fixed-point equation for $\alpha$ also gives $b-d\alpha =-\alpha (a-c\alpha )$. ThereforeDividing yields the conjugation of a Möbius transformation with two distinct fixed points:Neither factor in this quotient vanishes, since $(a-c\alpha )(a-c\beta )=ad-bc\ne 0$. The formula extends over the Riemann sphere, including the transformation's pole. For the special transformation and the ordering $\alpha =1,\beta =-1$, $k=1/2$.