Source: Mathematics release, supplied bundle Part A 2007 11-1.pdf, pages 265–272. The eight-page paper is dated 28 June 2011 and covers Mathematics and Mathematics & Statistics Part A.
The department's answer-release policy excludes ordinary odd years. Bounded exact-paper searches found no matching full or selected answer advertisement, so no parts are skipped. All printed parts and their surrounding unnumbered requests are answered below.
Choose a basis and let represent . Define the characteristic polynomial by
Under a change of basis with invertible change matrix , the new matrix is . Hence
Thus the polynomial is independent of the chosen coordinates. It is monic of degree .
To prove the sum is direct, suppose with . Fix and apply the polynomial in the linear operator
Every with is killed by one factor. On , each factor is multiplication by , giving
The scalar coefficient is nonzero because the eigenvalues are distinct. Thus for every , proving
In particular, choosing a basis in each eigenspace yields a linearly independent combined list.
If , then , so is singular. By the rank-nullity theorem it has a nonzero kernel vector . Thus
This is exactly the definition of an eigenvalue. Here lies in the scalar field: for the stated real vector space it is real. A nonreal root instead gives an eigenvalue of the complexified operator, by the same argument over .
Expanding the determinant along the second column gives
If , there are three distinct real eigenvalues. Part (b)(ii) gives a nonzero eigenvector for each, and part (b)(i) makes them independent. They form a basis, so the matrix is diagonalisable.
When ,
has rank one for every : the third row is nonzero, and the second row is times the third. Therefore the eigenspace for has dimension two. The eigenvalue provides at least one further independent eigenvector by part (b), so again there is an eigenbasis.
When ,
Its rank is one if and two otherwise. Thus the eigenspace for has dimension two exactly when . For it has dimension one, while the eigenspace for also has dimension one, since then has rank two. There are no other eigenvalues by the characteristic polynomial. A diagonal matrix in an eigenbasis would need three independent eigenvectors, whereas these two eigenspaces supply only two; diagonalisation is impossible. Conversely, at their dimensions add to three and part (b) makes their sum direct. Therefore
The argument uses only the determinant, rank-nullity, the established direct-sum result, and the definition of diagonalisation.
Use the convention that the inner product is linear in its first argument, as required by the displayed representation of a linear functional. Choose an orthonormal basis , for instance by Gram-Schmidt orthogonalization. Define
For , conjugate linearity in the second argument gives
Thus
The representation is unique as well: if two vectors represent the same functional, their difference is orthogonal to every vector and therefore to itself, so it is zero.
The adjoint operator is characterized by
For each fixed , the map is a linear functional. Part (i) gives a representing vector, which we define to be . Hence such a map exists on every vector of . Part (b) proves that this constructed map is linear.
For scalars and vectors , use the adjoint identity and conjugate linearity in the second argument:
The difference of the two second-argument vectors is orthogonal to every . Choosing to be that difference shows its squared norm is zero. Therefore
The two conjugations are why the adjoint is a linear map, despite the conjugate-linear dependence of the representing functional on its second argument.
The finite-dimensional spectral theorem says that a self-adjoint operator on a complex inner-product space has an orthonormal basis of eigenvectors and all its eigenvalues are real. Equivalently, its matrix is unitarily diagonalisable with real diagonal entries.
For , the matrix is equal to its conjugate transpose:
Thus it represents a self-adjoint operator for the standard inner product on . The theorem applies directly, proving
Set . Direct multiplication gives
with . If were diagonalisable, then subtracting the identity in the same basis would diagonalise . A diagonal matrix whose cube is zero has every diagonal entry zero and is itself zero. Similarity would then imply , a contradiction. Hence
This proves failure directly; merely observing that it is not self-adjoint would not suffice, because non-self-adjoint matrices can still be diagonalisable.
An ideal of a commutative ring is an additive subgroup such that for every and . A prime ideal is a proper ideal such that implies or .
If in the quotient ring, then . Primality implies or . Therefore there are no two nonzero cosets whose product is zero:
Properness also ensures its identity coset is not zero, so this quotient is an integral domain.
The set contains zero. If , then , giving closure under additive inverses; also for every .
To prove closure under addition, let . Expand by the binomial theorem. In every monomial , either or . Thus each term contains a factor or and belongs to . Hence , so . The additive subgroup and absorption properties are proved, giving
This ideal is the radical of an ideal. The finite exponent for a sum uses commutativity of the ring.
A coset is a nilpotent element of the quotient exactly when some positive power is zero:
If , this forces every nilpotent coset to equal zero. Conversely, if there is no nonzero nilpotent coset, every has , hence . Since always, equality follows. Therefore
In standard terms, an ideal is radical exactly when its quotient is a reduced ring.
Certainly , by taking exponent one. If , choose with . Primality applied to gives or . In the latter case repeat; induction reduces to . Thus as well, proving
Every prime ideal is therefore a radical ideal.
For the preliminary definition, put . The series converges uniformly to on when, for every , some satisfies for all and all . Equivalently, .
Let be the finite length of the piecewise-smooth path. Finite linearity of the contour integral and the integral bound give
The uniform limit is continuous by the stated allowed result, so its integral is defined. Consequently
Cauchy's integral theorem states that if a function is holomorphic on a simply connected open set, its integral around every closed piecewise-smooth path in that set is zero. A local form sufficient here is: if a function is holomorphic on an open set containing a triangle together with its interior, then
For a general domain with holes, an arbitrary closed path need not have zero integral; the triangle or simple-connectedness hypothesis supplies the required interior.
Morera's theorem states that if is continuous on an open set and its integral around every triangle whose interior and boundary lie in is zero, then is holomorphic on .
For a proof, choose a disk and a base point . Define along the straight segment. Convexity keeps every triangle with vertices inside . Its zero boundary integral implies
By continuity, the last integral tends to as , so . Thus is holomorphic on . The allowed result that the derivative of a holomorphic function is holomorphic now gives that is holomorphic there. Such disks cover , proving
For each triangle compactly contained in , part (i) permits the interchange of the series and its boundary integral. Cauchy's integral theorem makes every term zero. The uniform limit is continuous, so Morera's theorem yields that is holomorphic on .
For the final application, each function is holomorphic away from its pole. Fix a positive integer . For and ,
The numerical series converges, so the Weierstrass M-test gives uniform convergence of the tail on . Adding the finitely many initial terms preserves uniform convergence. Those initial terms need not be bounded near their excluded poles; only the tail needs the uniform bound. By the first conclusion, the full sum is holomorphic on each . Their union is , hence
The residue at is the coefficient of in the Laurent series. A simple pole means near , with and holomorphic across .
For the specified positively oriented arc, direct parametrization gives . The remaining integral is bounded by , which tends to zero because is bounded near . Therefore
The simple-pole hypothesis matters. For , with , , the residue is zero but
For the particular function, expanding the exponential gives
Thus , and the pole is simple. On the large upper semicircle, , giving
Close the real-axis path from to and to by this upper arc and a clockwise upper indentation at zero. The function is holomorphic in the indented region, so the sum of all four integrals is zero. The clockwise indentation tends to . For real ,
The real part is odd and cancels on the symmetric real pieces; the imaginary part is even. Its integral converges since at zero and is at infinity. Letting and therefore yields , where is the requested real integral. Hence
A conformal map preserves angles between intersecting regular curves, including their orientation. If is holomorphic with , the image tangent vectors are times the original tangent vectors. Multiplication by this nonzero complex number gives a common positive scaling and rotation, so their oriented angle is unchanged. This proves conformality throughout the stated domain.
At a zero derivative this can fail: at zero sends rays of arguments and to rays of arguments and . The angle is doubled, so this holomorphic function is not conformal there.
For the disk map , compute
Its inverse is ; for , the inequality puts this inverse in the unit disk. Both rational maps are holomorphic on their respective domains. Thus
For the final region, writing gives and . Hence its exponential image is exactly the upper half of the unit disk,
The exponential is injective on this strip, since two equal exponential values differ by times an integer while the imaginary parts here differ by less than . Its derivative never vanishes and its inverse on is the logarithm with argument in .
Now maps conformally onto the first quadrant. Indeed
and the inverse has modulus below one and positive imaginary part for every first-quadrant . Squaring maps that quadrant bijectively onto , with nonzero derivative. Therefore a required composition is
Every component is a conformal bijection between the stated domains, so the composition is one as well.
First prove the general uniqueness claim. The bound prevents a solution from leaving the dependent-variable interval before : up to any first exit, . Let be two solutions with the same initial value. Their integral equations and the Lipschitz condition give, for ,
Since their difference is bounded by , repeated substitution into this inequality proves, for every integer ,
The same argument with reversed limits works for . Letting forces the difference to zero on the whole interval. This proves at most one solution without assuming that .
For case (i), choose a rectangle around that stays in . There is bounded, giving a uniform Lipschitz constant by the mean value theorem. For example works: and . Separate variables using , obtaining . The initial condition gives , hence
It remains positive for all real , so the same local uniqueness argument continues along this solution.
No rectangle of positive width around has a uniform Lipschitz constant in . For any nonzero in such a rectangle,
The vanishing factor at the single initial point does not control neighbouring -values. The failure of the hypothesis is accompanied by actual nonuniqueness: both
satisfy the equation and have value zero at . Direct differentiation gives , including the zero point by continuity.
The same quotient is unbounded near , so the uniform Lipschitz hypothesis again fails. Two explicit solutions through the initial point are
For the second, put . Then , and . The real power here means the square of the real cube root, so the identity also holds when is negative. Both functions are differentiable through their zeros. Thus uniqueness fails in this case as well.
For a nonzero second-order principal part, the discriminant is : positive gives a hyperbolic partial differential equation, negative an elliptic partial differential equation, and zero the parabolic type when the principal part has rank one. If all three coefficients vanish, the equation is instead degenerate to lower order.
Here , , , so for . The characteristic equation is
Thus choose
Their Jacobian determinant with respect to is , so they are valid coordinates on the specified half-plane. The level sets are horizontal lines and the right-hand halves of parabolas .
Figure 1.
The two characteristic families for the hyperbolic equation
. Details.
Writing , the chain rule gives
The original equation reduces to , hence the canonical form is . Integrating once in each characteristic variable gives
or
On , differentiation gives . The specified derivative therefore forces for every argument, so is a constant. The specified value then gives . Consequently
Its derivatives are , and , which verify both the equation and the data directly.
The Laplace transform is
A sufficient condition is that be piecewise continuous on each bounded interval and of exponential order , meaning for all sufficiently large . Then the integral is absolutely convergent for , by comparison with .
For the constant function, direct integration gives
Combine the exponentials and integrate:
The parameter makes this convergence half-plane larger than the one for the constant function.
Integration by parts, where the transform boundary term at infinity vanishes, gives
For a sufficiently regular function with the required exponential growth bounds, apply this again to to deduce
These identities hold in a right half-plane where the displayed transforms converge; the regular solutions obtained below satisfy those requirements.
Differentiating the transform with respect to gives
Applying this to also gives for .
Now put , and . Transforming each term of the differential equation, and using the derivative identities, gives
The initial-value terms cancel, leaving
Integrating once yields . Partial fractions give
The transform pairs therefore imply, on writing ,
For the final parameter count, the differential equation is the derivative of : it says . Integrating gives . A regular solution at has finite and , forcing . Thus is first order and leaves only one constant. Equivalently, the original equation at zero requires , so the two usual initial values cannot be chosen independently. The displayed solution satisfies this constraint and verifies the original equation directly.

Articles by others on the same topic (0)

There are currently no matching articles.