Processing math: 100%

Thursday, November 14, 2013

Record some Problems

In this post I want to record 3 problems:

The following is a problem in GRE math subject test:
Problem 1. Let Fp be a finite field of order p, show that the number of noninvertible 2×2 matrices over Fp is p4p3p2+p.
Can we generalize to n×n matrices?

The following is a problem found somewhere by someone in Taiwan's forum, actually I also find this in mainland textbook on real functions:
Problem 2. Let E,E1,E2R be such that E=E1E2. If E is measurable such that m(E)=m(E1)+m(E2)<, show that E1 and E2 are measurable.
HINT: Approximate E1,E2 from outside by measurable set.
The following is a problem in the midterm exam of Math4061 (fall 2013), which I want to record a simple proof here.
Problem 3. Let X,Y be metric spaces. Suppose that f:XY is a function such that
  • f is 1-1.
  • K compact in X f(k) compact in Y.
Prove that f is continuous.
Dr Li's original solution proves by contradiction, I want to give a direct proof using the sequential criterion of continuity for metric spaces.

Solution to Problem 3. Suppose that xnx in X, let's prove that f(xn)f(x) in Y. First we observe that L:={xn:n1}{x} is compact. Second we define g:=f|L:Lf(L) and show that g1:f(L)L is continuous. Indeed, let KL be any closed set, since L is compact, so is K, and thus f(K)=g(K)=(g1)1(K) is a compact set, hence closed set, in Y by hypothesis. Therefore any closed set in L is pulled back to a closed set in f(L), g1 is continuous. Since f(L) is compact and L is Hausdorff (as it is a metric space), a standard training in topology enables us to show g1 is a homeomorphism, so g is continuous.

Finally we check that f(xn)f(x). Since xnx in X, we have xnx in L, so g(xn)g(x) in f(L), but then f(xn)=g(xn)g(x)=f(x) in Y, so we are done.

No comments:

Post a Comment