0% found this document useful (0 votes)
76 views7 pages

F15 Solutions

The document contains 9 math problems with solutions. The high-level information is: 1) The problems cover a range of math topics including series convergence, functions, groups, and complex analysis. 2) The solutions provide detailed step-by-step working to justify the answers in a clear and logical manner. 3) Common approaches used in the solutions include proofs by contradiction, applying definitions, and using prior results like the Mean Value Theorem.

Uploaded by

shraban das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
76 views7 pages

F15 Solutions

The document contains 9 math problems with solutions. The high-level information is: 1) The problems cover a range of math topics including series convergence, functions, groups, and complex analysis. 2) The solutions provide detailed step-by-step working to justify the answers in a clear and logical manner. 3) Common approaches used in the solutions include proofs by contradiction, applying definitions, and using prior results like the Mean Value Theorem.

Uploaded by

shraban das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Problem 1A.

Score:

Find the real values of x for which



X (1/2)(3/2) · · · ((2n − 1)/2) 2x 2n 1 2x 2 1 3 2x 4
= 1 + + + ···
n=0
n! 1 + x2 2 1 + x2 2 4 1 + x2

converges and sum it for these numbers. Caution: there is something unusual about the sum
of this series.

6 1. The sum is (1 + x2 )/|(1 − x2 )|.


Solution: The series converges for |x| =

Problem 2A. Score:

Show that there is a real-valued function on the real plane that is not continuous, but is
continuous when restricted to any straight line.

Solution: Take the function to be 0 if y ≤ 0 or y ≥ 2x2 , and 1 if y = x2 6= 0, and extend it


to be continuous on the plane except at the origin.

Problem 3A. Score:

Let f (x) be differentiable on an interval (a, b).


(a) Prove that if X is the range of (f (u) − f (v))/(u − v) for a < u < v < b and Y is the
range of f 0 (x) on (a, b) then X ⊆ Y ⊆ X.
(b) Prove that the range of f 0 (x) on (a, b) is an interval (possibly unbounded). Do not
assume that f 0 (x) is continuous.

Solution: Let m(u, v) = (f (u) − f (v))/(u − v). The definition of derivative implies that
f 0 (x) = limv→x+ m(x, v), and hence that the range Y of f 0 (x) is contained in the closure
X of the range X of m. The Mean Value Theorem implies that X is contained in Y . For
part (b), since f (x) is differentiable, it is continuous, so m is continuous in both variables.
The set of pairs (u, v) such that a < u < v < b is connected, hence the range X of m is
connected, i.e., an interval. Then X ⊆ Y ⊆ X implies that Y is also an interval.

Problem 4A. Score:


Let S = C ∪ {∞} be the Riemann sphere. Let φ : C2 \ {(0, 0)} → S be the map defined by
φ(w, z) = w/z for z 6= 0, φ(w, 0) = ∞.
(a) Prove that there is a unique map τ : S → S with the following property: τ (φ(w, z)) =
φ(w0 , z 0 ) if and only if the one-dimensional subspaces C · (w, z) and C · (w0 , z 0 ) are orthogonal
under the standard Hermitian inner product on C2 in which the unit vectors (1, 0) and (0, 1)
are orthonormal.
(b) Prove that τ is continuous and bijective.
(c) Determine, with proof, whether τ is holomorphic or not.

Solution: Extending 1/z as usual to a holomorphic map on S, the inner product ww0 + zz 0
vanishes if and only if φ(w, z) = −1/φ(w0 , z 0 ). Hence the unique function with the property
in (a) is τ (z) = −1/z. For (b) and (c), it is clear from the formula that τ is continuous,
bijective, and not holomorphic.

Problem 5A. Score:

(a) Suppose z, c1 , . . . , cn are distinct complex numbers, and


1 1
+ ··· + = 0.
z − c1 z − cn
Show that z lies in the convex hull of c1 , . . . , cn .
(b) Let p(z) be a non-constant polynomial. Show that every zero of p0 (z) lies in the convex
hull of the zeroes of p(z).

Solution: For (a), suppose the contrary. Adding a constant to z and the ci and multiplying
by another constant, we can assume that z = 0 and all the ci lie in the half-plane Re(w) > 0.
But then all the numbers 1/(z − ci ) also lie in this half-plane, so their sum cannot be zero.
For (b), let c1 , . . . , cn be the zeroes of p(z). We can assume that p(z) = (z−c1 ) · · · (z−cn ).
Then p0 (z) = p(z)(1/(z − c1 ) + · · · + 1/(z − cn )). When p0 (z) = 0, this implies z is in the
convex hull of the ci , by part (a).

Problem 6A. Score:

In the Euclidean space R4 , consider the “hyper-ellipsoid” 2x2 + 3y 2 + 4z 2 + 5u2 = 1. Does


there exist a 3-dimensional subspace passing through the origin which intersects the ellipsoid
in a sphere?

Solution: The answer is “no”: A 3-dimensional subspace will intersect the plane x = y =
0 in a subspace of dimension ≥ 1, and therefore it will contain a point from the ellipse
4z 2 + 5u2 = 1, all of whose points lie ≤ 1/2 away from the origin. Likewise, the same
3-dimensional section will contain another point, from ellipse 2x2 + 3y 3 = 1 (in the plane
z = u = 0), all of whose points lie > 1/2 away from the origin. Thus, the section is not a
sphere.

Problem 7A. Score:

It is a corollary to the Jordan canonical form theorem that n×n matrices in Jordan canonical
form, all of whose eigenvalues are zeroes, are similar if and only if the sizes of their Jordan
blocks coincide (up to permutations). Prove this directly, without using the Jordan canonical
form theorem.

Solution: A permutation of coordinates is a similarity transformation, so in one direction


the statement is obvious. In the other direction, record the sizes n1 ≥ n2 ≥ · · · ≥ nk of the
Jordan blocks of a given nilpotent Jordan matrix N in decreasing order, and express the
resulting partition of n = n1 + n2 + · · · + nk by the Young diagram with k rows of lengths
n1 , n2 , . . . , nk . Then the sizes m1 ≥ m2 ≥ · · · ≥ ml of columns of this diagram are determined
by mi = dim Ker N i −dim Ker N i−1 . Thus, the partition n = m1 +m2 +· · ·+ml is determined
by the similarity class of the operator N , and so is the partition n = n1 + n2 + · · · + nk dual
to it.

Problem 8A. Score:

Find all the subgroups of the dihedral group of order 12 (the group of symmetries of a regular
hexagon).

Solution: There is 1 subgroup of order 1, 7 of order 2 (1 generated by a rotation, 6 by


reflections), 1 of order 3, 3 of order 4, 3 of order 6, 1 of order 12.

Problem 9A. Score:

Show that x3 −2x is an injective function from the rational numbers to the rational numbers.

Solution: We have to show that if x3 − 2x = y 3 − 2y then x = y. Factoring out x − y we


have to show that x2 + xy + y 2 = 2 has no solutions in rational numbers, or equivalently that
there is no nonzero solution of x2 + xy + y 2 = 2z 2 in integers. However looking at this mod
2 shows that x and y must be even, so z must also be even. A smallest nonzero solution
must have at least one of them odd otherwise we could divide by 2. So there is no nonzero
solution (mod 3 also works).

Problem 1B. Score:


For a real, find a 2-dimensional space of real-valued solutions of y 00 = ay/x2 for x > 0. When
a = −1/4 find the solution with y = 0, y 0 = 1 at x = 1.

Solution: If a > −1/4, two independent solutions


p are y = xλ for (λ − 1/2)2 = a + 1/4. If
a < −1/4, since λ = 1/2 ± iτ , where τ = −1/4 − a, the solutions y = xλ are complex.
Two independent real solutions in this case are y = x1/2 cos(τ log x) and y = x1/2 sin(τ log x).
If a = −1/4, y = xλ = x1/2 is one solution. A second solution is y = x1/2 log x (which
solves the given initial conditions).

Problem 2B. Score:

Let f : [0, ∞) → R be a function, and assume that:

• f is continuous on [0, ∞);

• f is differentiable on (0, ∞);

• f 0 (x) ≤ 0 for all x > 0 such that f (x) > 1; and

• f (0) = 1.

Prove that f (x) ≤ 1 for all x ≥ 0.

Solution: The set {x ∈ [0, ∞) : f (x) > 1} is an open subset of [0, ∞), and does not contain
0, so it is an open subset of R. Assume that this set is nonempty. Since it is open, it is
a disjoint union of open intervals. Let (a, b) be one such interval; note that a ≥ 0. By
continuity, f (a) = 1. The third assumption implies that f (x) is non-increasing on [a, b),
which contradicts the fact that f (c) > 1 for c ∈ (a, b). Thus the given set is empty, and so
the conclusion follows.

Problem 3B. Score:

The unit cube in the space C[0, 1] of continuous real-valued functions on the interval is
defined as the subset
{f ∈ C[0, 1] | kf k := sup |f (t)| ≤ 1}.
0≤t≤1

Prove that there exists a 2-dimensional linear subspace in C[0, 1] whose intersection with
the unit cube is a circular disk.

Solution: Take the plane spanned by cos 2πt, sin 2πt.


Problem 4B. Score:

A Schur function is a non-constant holomorphic function defined in the open unit disk whose
values have absolute value at most 1. Show that if f is a Schur function then

f (0) − f (z)
(1 − f (0)f (z))z

is also a Schur function.

Solution: We must have f (0) < 1, as f would be constant otherwise. If |a| < 1, then
(a − b)/(1 − ab) has absolute value at most 1 for |b| < 1 by the maximum principle, because
f (0)−f (z)
it has absolute value 1 for |b| = 1. The function (1−f (0)f (z))
has absolute value at most 1 in
the open unit disk and vanishes at z = 0, so we can divide it by z and the quotient still has
absolute value at most 1 by the maximum principle (applied to circles approaching the unit
circle).

Correction: As some students noticed, the problem as stated is incorrect, because the
non-constant function f (z) = z leads to a constant function

f (0) − f (z)
g(z) = = −1.
(1 − f (0)f (z))z

One cannot drop the “non-constant” hypothesis, since g(z) is undefined if f (z) is constant
with absolute value 1. The problem should have been formulated as follows.
A Schur function is a holomorphic function defined in the open unit disk whose values have
absolute value at most 1. Show that if f is a non-constant Schur function then

f (0) − f (z)
(1 − f (0)f (z))z

is also a Schur function.


To be fair, answers were only graded on whether the student showed that g(z) is well-defined
and holomorphic with |g(z)| ≤ 1 on the disk. No marks were deducted for failing to show
that g(z) is non-constant.

Problem 5B. Score:

Find all entire functions f (z) such that Re(f (x + iy)) = x3 y − x y 3 . Express your answer
directly in terms of z, not in terms of x and y.

Solution: f (z) = −iz 4 /4 + Ci, where C is a real number.


Problem 6B. Score:

Given a positive integer n, let . . . c−1 , c0 , c1 , . . . be a sequence of real numbers with period
n, that is, ck+n = ck for all k ∈ Z. Let C be the n × n-matrix defined by cij = cj−i . Prove
that all matrices of this form (for n fixed) have a common Hermitian-orthonormal basis of
complex eigenvectors, find these eigenvectors, and the corresponding eigenvalues.

Solution: Let T denote the cyclic shift operator T (x1 , x2 , . . . , xn ) = (x2 , . . . , xn , x1 ) on Rn .


Then C is the matrix of the operator c0 + c1 T + c2 T 2 + · · · + cn−1 T n . Since T is orthogonal,
it commutes with its adjoint T ∗ = T −1 , and hence T is normal. By the Spectral Theorem
for normal operators, T has an Hermitian-orthonormal basis of complex eigenvectors. Ex-
plicitly, the eigenvectors of T have the form (1, λ, λ2 , . . . , λn−1 ), where λ is the corresponding
eigenvalue, satisfying λn = 1. The eigenvalues are √ all distinct, and hence the eigenvectors
are pairwise Hermitian-orthogonal. Dividing by n makes them unit. The corresponding
eigenvalues of C are c0 + c1 λ + · · · + cn−1 λn−1 where λ runs through the nth roots of unity:
λ = exp(2πik/n), k = 0, 1, . . . , n − 1.

Problem 7B. Score:

Find the number of surjective linear maps from an n-dimensional vector space over the field
with 2 elements to itself.

Solution: (2n − 1)(2n − 21 ) · · · (2n − 2n−1 )

Problem 8B. Score:

If A is the ring of n × n matrices with entries in a field K, show that the only two-sided
ideals of A are A itself and 0.

Solution: Let J be the two-sided ideal generated by a non-zero matrix M ∈ A. Let v ∈ K n


be a vector such that w = M v 6= 0. Let Y be the matrix such that Y e1 = v and Y ej = 0 for
j > 1, where ej is the j-th unit vector. Let X be a matrix such that Xw = e1 . Then XM Y
is the unit matrix E1,1 with entry 1 in position (1, 1) and all other entries zero, so E1,1 ∈ J.
Similarly, every unit matrix Ei,j belongs to J, hence J = A.

Problem 9B. Score:


How many ways are there to arrange 8 rooks on an 8 by 8 chessboard so that no two attack
each other (in other words, each row and column contains exactly one rook), where two
ways are counted as the same if they are equivalent under one of the 8 symmetries of the
chessboard? You may assume the Polya–Burnside theorem that the number of orbits of a
finite group on a finite set is the average number of fixed points of elements of the group.

Solution: Use Polya–Burnside formula. Count the number of fixed points for each of the
8 symmetries acting on the 8! arrangements of non-attacking rooks, as follows. Identity:
8! = 40320. Two reflections in a vertical or horizontal line: 0. Two reflections in a diagonal
line: 1 + 8 · 7/2 + 8 · 7 · 6 · 5/22 · 2 + 8 · 7 · 6 · 5 · 4 · 3/23 · 3! + 8 · 7 · 6 · 5 · 4 · 3 · 2 · 1/24 · 4! = 774.
Two 90-degree rotations: 6 · 2 = 12. One 180-degree rotation: 8 · 6 · 4 · 2 = 384. Total
(40320 + 2 · 0 + 2 · 774 + 2 · 12 + 1 · 384)/8 = 5282.

You might also like