Analysis IV, Assignment 1
January 20, 2014
 (1) Proof. Clearly, the function as dened takes values in R (indeed, it takes values in [0, ]). First
of all, for all x, y X , d(x, y ) = |f (x) f (y )| 0. Now, using the fact that arctan is inj
(1 ) is the condence coe
The half-interval length is the precision
of the interval.
Sample Size. To estimate by x with a
specied error e with 100(1 )% condence
we need to have
e= p .
Solve for n (the necessary sample size) t
For > 0,
x 1e xdx.
This gives (1) = 1. Use integration by parts
() = (
Therefore if is integer we have
() = (
> 0 and use the change of variable
x = y to write
Denition: Considering all unbiased estimators for , the one with the smallest variance
is the mininum variance unbiased estimator
and is called the most e cient estimator of
Example: Let X1, ., Xn be a random sample
from a distribution with mean
Denition: If X1, ., Xn is a random sample
from a distribution F which depends on an
unknown parameter , any statistic
= h(X1, ., Xn)
used to estimate is called a point estimator
of . After the sample has been selected, the
observed values x1, ., xn are u
204) = P
= P (Z
1.6) = 0.0548.
Example. An electronic company manufactures resistors that have a mean resistance
of 100 and a standard deviation of 10 .
Find the probability that a random sample of
n = 25 resistors will
Sampling distribution and Statistical inference
Denition: If X1, ., Xn are independent and
identically distributed with common distribution F , we call (X1, ., Xn) a random sample
from the distribution F . The sample size is
n. After the data is
SOLUTIONS TO ASSIGNMENT 2 - MATH 355
Bn = cfw_ [0, 1] : |Sn ()| > n n ,
N = cfw_ [0, 1] : lim
We want to show that m(N c ) = 0.
Let > 0. We can pick 4 = n with c >
Analysis IV, Assignment 4
Prof. John Toth
Let f C 0 (R) and periodic with f (x+2) = f (x). Let an =
f (t)eint dt
an einx . If f is continuously dierentiable at xo [, ],
and (SN f )(x) =
then f (x0 ) = lim (SN f )(x0 ).
Analysis IV : Assignment 3 Solutions
John Toth, Winter 2013
is a complete and separable Hilbert space.
Proof Let cfw_u(n) nN be a Cauchy sequence. Say u(n) = (., u2 , u1 , u0 , u1 , u2 , .). In particular for ev
Analysis IV, Assignment 5
March 7, 2014
First, we will prove that if (V ) = supcfw_(f ) : f < V , then
(bn an ).
( V ) =
Given any f
V , since f (x) 1 for x V and f (x) = 0 for x V we have
(f ) =
f (x)dx =
f (x)dx +
Analysis 4, Assignment 4
March 7, 2014
 (1) Proof. First of all, we claim that either there exists x0 such that |f (x0 )| = supx[a,b] |f (x)| or
there exists y0 such that limxy0 f (x) = supx[a,b] |f (x)|, where y0 is one of the (nitely ma
Analysis IV, Assignment 3
March 7, 2014
 (1) Proof. Let fn = n=1 |fk | and let f = limn fn = |fn |. Then fn fn+1 for all n and
fn 0. By Lebesgue Monotone Convergence Theorem and the linearity of the integral, we have
|fn |d = li
Analysis IV, Assignment 2
January 28, 2014
 (a) Proof. Let x cl(L), and let (xk ) be a sequence in L converging to x. Without loss of
generality, we may assume that d(xk , x) < 21 for each k (as B (x, 21 ) L = for all k N).
FACULTY OF SCIENCE
MATHEMATICS MATH 355
Examiner: Professor S. W. Drury
Date: Wednesday, April 18, 2007
Associate Examiner: Professor K. N. GowriSankaran
Time: 2: 00 pm. 5: 00 pm.
Attempt six questions for full cr