Source: Mathematics release, bundle
Part A 2007 11-1.pdf, pages 65–70. The six-page paper is shared by Mathematics and Mathematics & Statistics Part A, dated 17 June 2008. Its three printed sections are Algebra, Analysis and Differential equations.Bounded exact-paper checks found no matching advertisement of worked answers. All nine questions, their printed parts, and their unnumbered tasks are answered. Full source statements remain in the private archive transcription.
Proceed by induction on . The zero-dimensional case is immediate. Over , the fundamental theorem of algebra supplies a root of the characteristic polynomial. Since , there is a nonzero vector with . The line is invariant, so induces a linear map on . By induction, choose an upper triangular basis for that quotient and lift its vectors to . Then for every . Thus is the required basis and .
The same conclusion holds over when the characteristic polynomial splits over . Indeed an eigenvalue then lies in , and the block matrix arising from the invariant line gives . The quotient characteristic polynomial therefore also splits, so the induction works over without requiring algebraic closure.
Write . Cayley-Hamilton theorem gives . Its minimal polynomial is therefore for exactly one , so the possibilities for that of areLet , which is the dimension of the only eigenspace. If , then and .
If , rank-nullity theorem gives . The restriction of the nilpotent map to this invariant line is zero, so . Choose with , and choose independent of . Then , so these three vectors form a basis; its matrix for is the printed .
If , then has dimension two, so cannot vanish: otherwise . Choose with and set , . Applying and then to a putative linear relation proves these three vectors independent. The matrix is the printed .
These cases exhaust the possible eigenspace dimensions. They are pairwise dissimilar because similarity preserves the eigenspace dimension, equivalently the three different minimal polynomials. Hence every matrix is similar to exactly one of the three displayed forms.
The functional is linear and nonzero because . It therefore has rank one, and rank-nullity theorem givesNo Gram–Schmidt argument is needed. Every vector decomposes uniquely as , where and . Substitution gives . Thus the eigenspace for is , and that for is . The latter is an actual eigenvalue when ; when its eigenspace is zero and only occurs. In the plane the map is reflection in the line perpendicular to .
For equal-length crystallographic root configurations in a plane, taking in the closure condition gives , so every vector occurs with its negative. For fixed , a vector has , because both vectors are unit vectors. Thus its angle relative to belongs to the finite list .
If an orthogonal vector occurs, closure supplies . A unit vector making an angle of or with would have inner product with , contradicting integrality of twice that inner product. Thus these four points are the whole set: the vertices of a square.
In the remaining case a noncollinear pair makes an angle of or . Changing a sign, take their angles as . Reflecting the second in the line perpendicular to the first supplies the angle , and negation supplies the other three hexagon vertices. No perpendicular vector can occur, by the preceding inner-product obstruction. The initial finite list now leaves only these six points. Conversely the opposite pair, square and regular hexagon each satisfy both reflection closure and the integrality condition. Hence
For the polynomial ring, use the Euclidean function on nonzero polynomials. If and , subtract the multiple of that cancels the leading term of . The leading coefficient of is invertible in the field, and every subtraction strictly lowers the degree of the remainder. This process terminates with and either or . Thus .
For the Gauss lemma for polynomials, call an integer polynomial primitive when its coefficient gcd is one. If two primitive polynomials had a nonprimitive product, a prime would divide every product coefficient. Reducing modulo would give a zero product of two nonzero polynomials in the integral domain , a contradiction. Therefore the product of primitive integer polynomials is primitive.
To transfer a rational factorization, write each nonzero rational factor as a rational scalar times a primitive integer polynomial by clearing denominators and removing the coefficient gcd. Thus with primitive and . Their product is primitive by the lemma. If in lowest terms, integrality of every coefficient of forces to divide every coefficient of , so . Hence ; absorbing into either factor produces the required integer factorization with the same positive factor degrees. In particular irreducibility of a primitive polynomial over and over is equivalent.
Finally, let in lowest terms, , be a rational root of a monic degree- integer polynomial. Multiplying the equation by shows . Coprimality forces . Thus .
An integral domain is a commutative ring with identity and no zero divisors: implies or . Equivalently nonzero elements admit cancellation in multiplication.
A Euclidean domain is an integral domain equipped with a function such that for every and nonzero there are with and either or . One may additionally require for nonzero ; degree on a polynomial ring also satisfies this convention.
Let , and . Continuity of gives as , and injectivity gives when . ThereforeThe assumed nonvanishing derivative makes this limit well defined. It exists at every , so is holomorphic, with .
Squaring maps the first quadrant bijectively onto the upper half-plane. For in that half-plane, , and the Cayley transform maps it bijectively onto the unit disc. Their composition isThe inverse is the unique first-quadrant square root of , and is holomorphic by the first argument. Hence is holomorphic throughout the disc. Its Taylor series at zero converges for , locally uniformly there. Substituting gives the stated expansion, with , convergent at every point of the quadrant and locally uniformly on it.
If a holomorphic bijection existed, its inverse would be an entire function taking values in the unit disc. Liouville theorem would make that inverse constant, contradicting bijectivity. Thus no holomorphic bijection exists.
A continuous bijection does exist, even a homeomorphism:Both maps preserve the argument and change the radius by the mutually inverse strictly increasing functions and . The displayed formulas also prove continuity at zero and everywhere else.
An isolated singularity at means that the function is holomorphic throughout some punctured disc . Its residue is the Laurent coefficient , equivalently . The singularity is removable if all negative Laurent coefficients vanish, a pole of order if only finitely many are nonzero and the lowest power is , and essential if infinitely many negative coefficients are nonzero.
For the final contour integral, expand . On the circle these exponential series converge absolutely and uniformly for in every bounded set, so their product can be integrated term by term. Inonly contributes. Set , . ThusThe resulting power series converges for every complex by the ratio test. The coefficients are independent of the positive radius .
Both numerator and denominator have simple zeros at zero, and . Their quotient tends to one and extends holomorphically with that value. Hence the singularity is removable, and because its Laurent series has no negative powers.
The denominator vanishes at for every nonzero integer . These points approach zero, the denominator has a simple zero at each, and because a nonzero purely imaginary number is not a zero of sine. Hence there are poles arbitrarily close to zero. The origin is a nonisolated singularity, so it has no residue defined by a Laurent series on a punctured disc. In particular it must not be classified as an isolated essential singularity merely because has one.
The identity theorem for holomorphic functions says that a holomorphic function on a connected open set which has distinct zeros accumulating at a point of the set is identically zero. Equivalently, two holomorphic functions agreeing on such a set of points agree everywhere in that connected open set.
To prove it, expand at an accumulation point . If the first nonzero Taylor coefficient had index , the function would factor as with . Continuity would make nonzero near , so no other zeros could approach , a contradiction. Thus all coefficients vanish and the function vanishes on a neighborhood of . Let be the set of points having such a zero neighborhood. It is nonempty and open. If a point in the domain is a limit point of , it is either already in or is an accumulation point of distinct zeros, and the same Taylor argument puts it in . Thus is relatively closed as well. Connectedness forces to be the whole domain. Apply this result to the difference of two functions for the equivalent formulation.
The given distinct zeros converge to , which lies inside the connected upper half-plane. The identity theorem for holomorphic functions forces the function to vanish identically. Thus .
Here the zeros accumulate only at the boundary point zero. An explicit holomorphic, nonzero example on the upper half-plane isAt its argument is , so it vanishes. It is holomorphic because the only excluded point of its formula is zero; it is not identically zero, for instance at . Thus the answer is yes.
The domain has two connected components. The zeros force the function to vanish on the upper half-plane but impose nothing on the lower one. DefineThis function is locally constant and hence holomorphic on the stated open set, and is not identically zero on that whole set. Thus the answer is yes. Connectedness is exactly the missing hypothesis for a global identity conclusion.
Differentiate the Wronskian:It is therefore constant. Linear dependence plainly makes it zero. Conversely, if it is zero, the two initial-data vectors and are linearly dependent. Some constants , not both zero, make and its derivative zero at zero. Uniqueness for a linear second-order equation with continuous coefficients then makes identically zero. Thus .
For the prescribed integral put . Then , , and . Differentiation under the integral, using continuity of the coefficients and forcing, givesThis proves the required inhomogeneous equation, with the sign of the forcing as printed.
For the explicit forcing take , , so and . Since , the integral isIndeed expand and integrate and . Adding the entire homogeneous solution givesFinally multiply the other equation by and integrate from zero to . Integration by parts givesThus is necessary. It is also sufficient: the solution with is , and the integral condition gives its value zero at .
Use the characteristic parameter and writeDirect differentiation givesA characteristic beginning at therefore satisfies and . Eliminating givesIts discriminant as a quadratic in is . Requiring the root to be zero when selectsThe selected branch is differentiable in each of the two regions where the radical is strictly positive, and substitution into the differentiated quadratic identity verifies the partial differential equation there. On the initial line away from the origin the characteristic vector has nonzero component , so these are the locally unique branches determined by that line.
The maximal real-valued continuation of these branches has the printed domainAt the continuous limiting value is . The two bounding lines are and , and the included sectors are the one above the sloping line on the right and the one below it on the left.
As in the fold boundary of a characteristic graph, the closed-domain statement concerns the formula's real values. A classical solution requires first derivatives on an open set. Along the nonzero boundary points , the radical's transverse derivative is singular, so the formula is generally not a classical solution there; its two classical domains are the interiors of the shaded sectors. The origin is characteristic for the initial data and does not supply a differentiable neighborhood solution. This qualification preserves the source's stated closed set while distinguishing it from the domain of a classical solution.
A critical point is an equilibrium: . Put , . The Jacobian matrix gives the first-order linearized equation . The following eigenvalue tests classify that linearized system. For a continuously differentiable nonlinear system, the cases with nonzero real parts persist as the usual local node, saddle or spiral classifications. The purely imaginary case needs extra nonlinear information, as explained in (iv).
Both eigenvalues are real and negative: , with distinctness as assumed. The two independent real eigendirections carry exponentially decaying factors , giving a stable node.
Both eigenvalues are real and positive: . The real eigendirections carry exponentially growing factors, giving an unstable node.
The eigenvalues are real and have opposite signs: . One eigendirection contracts and the other expands, giving a saddle.
For the linearized system a centre occurs when . Its real solutions are periodic ellipses after an invertible linear coordinate change.
As explained by a centre in the linearization need not be a nonlinear centre, for a nonlinear system these eigenvalues alone do not guarantee a centre. For example , has eigenvalues at zero but polar equations , , so trajectories spiral inward. Removing the cubic terms gives a genuine centre with the same Jacobian. Thus there is no eigenvalue-only sufficient condition for a nonlinear centre in the stated generality.
The eigenvalues are a nonreal conjugate pair . The factor contracts while the imaginary part produces rotation, giving a stable spiral.
The eigenvalues are a nonreal conjugate pair . The exponential factor expands while the imaginary part produces rotation, giving an unstable spiral.
The equilibrium equations are and . If , the second equation gives . Otherwise either , giving , or , giving . Thus there are exactly three equilibria. The Jacobian isAt it is : a saddle. At it is , with eigenvalues : a stable node. At it is , with characteristic polynomial and eigenvalues : an unstable spiral. All three are hyperbolic, so the nonlinear local classifications follow from linearization.
Suppose a nonconstant periodic orbit exists for the continuously differentiable planar vector field. Uniqueness implies that its image over a minimal period is a simple closed curve, enclosing a region of positive area. Along the orbit, the differential form vanishes because and . Green's theorem, with positive orientation, therefore givesa contradiction. This is the Bendixson-Dulac criterion in the whole plane; the fact that the enclosed region also lies in the domain is essential.
For the second-order equation set . The equivalent system is , . Its divergence is throughout the plane. Hence there are no nonconstant periodic solutions.
The nonconstant qualification is necessary: the equilibrium solutions , , do exist and are periodic in the literal sense of satisfying every positive period. The source's usual dynamical interpretation of “periodic solution” here is a nonconstant periodic orbit.
Articles by others on the same topic
There are currently no matching articles.
