User Tools

Site Tools


math121b:final

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
math121b:final [2020/05/05 09:26]
pzhou
math121b:final [2020/05/06 11:26] (current)
pzhou [3. Probability and Statistics (20 pts)]
Line 1: Line 1:
 ===== Final ===== ===== Final =====
 \gdef\E{\mathbb E} \gdef\E{\mathbb E}
------- +** Due Date **: May 10th (Sunday) 11:59PM. Submit online to gradescope. 
-Due Date: May 10th (Sunday) 11:59PM. Submit online to gradescope. +
  
 ** Policy **: You can use textbook and your notes. There should be no discussion or collaborations, since this is suppose to be a exam on your own understanding. If you found some question that is unclear, please let me know via email.  ** Policy **: You can use textbook and your notes. There should be no discussion or collaborations, since this is suppose to be a exam on your own understanding. If you found some question that is unclear, please let me know via email. 
Line 23: Line 22:
  
  
-2. (10 pt) Let VnV_n be the vector space of polynomials whose degree is at most nn. Let f(x)f(x) be any smooth function on [1,1][-1,1]. Show that there is a unique element fnVnf_n \in V_n, such that for any gVng \in V_n, we have+2. (10 pt) Let VnV_n be the vector space of polynomials whose degree is at most nn. Let f(x)f(x) be any smooth function on [1,1][-1,1]. We fix f(x)f(x) once and for all. Show that there is a unique element fnVnf_n \in V_n (depending on our choice of ff), such that for any gVng \in V_n, we have
  \int_{-1}^1 f_n(x) g(x) dx =   \int_{-1}^1 f(x) g(x) dx.    \int_{-1}^1 f_n(x) g(x) dx =   \int_{-1}^1 f(x) g(x) dx.  
-Hint: (1) Equip VnV_n with an inner product $\la g_1, g_2 \ra = \int_{-1}^1 g_1(x) g_2(x) dx$. (2) Show that f(x)f(x) induces an element in VnV_n^*: g11f(x)g(x)dxg \mapsto \int_{-1}^1 f(x) g(x) dx. (3) use inner product to identify VnV_n and VnV_n^*+ 
 +//Hint: // 
 +  * (1) Equip VnV_n with an inner product $\la g_1, g_2 \ra = \int_{-1}^1 g_1(x) g_2(x) dx$.  
 +  * (2) Show that f(x)f(x) induces an element in VnV_n^*: g11f(x)g(x)dxg \mapsto \int_{-1}^1 f(x) g(x) dx 
 +  * (3) use inner product to identify VnV_n and VnV_n^*.  
 + 
 +A remark: if f(x)f(x) were a polynomial of degree less than nn, then you could just take fn(x)=f(x)f_n(x) = f(x). But, we have limited our choices of fnf_n to be just degree n \leq n polynomial, so we are looking for a 'best approximation' of f(x)f(x) in VnV_n in a sense. Try solve the example case of n=1n=1, f(x)=sin(x)f(x) = \sin(x) if you need some intuition
  
 3. (10 pt) Let R3\R^3 be equipped with curvilinear coordinate (u,v,w)(u,v,w) where  3. (10 pt) Let R3\R^3 be equipped with curvilinear coordinate (u,v,w)(u,v,w) where 
Line 78: Line 83:
 4. (5 pt) Consider a random walk on the real line: at t=0t=0, one start at x=0x=0. Let SnS_n denote the position at t=nt=n, then Sn=Sn1+XnS_n = S_{n-1} + X_n, where Xn=±1X_n = \pm 1 with equal probability.  4. (5 pt) Consider a random walk on the real line: at t=0t=0, one start at x=0x=0. Let SnS_n denote the position at t=nt=n, then Sn=Sn1+XnS_n = S_{n-1} + X_n, where Xn=±1X_n = \pm 1 with equal probability. 
   * (3pt) What is the variance of SnS_n   * (3pt) What is the variance of SnS_n
-  * (2pt) Use Markov inequality, prove that  +  * (2pt) Use Markov inequality, prove that for any c>1c > 1, we have
    P(Sn>cn)1/c2 \P(|S_n| > c \sqrt{n}) \leq 1/c^2     P(Sn>cn)1/c2 \P(|S_n| > c \sqrt{n}) \leq 1/c^2
  
  
  
math121b/final.1588695996.txt.gz · Last modified: 2020/05/05 09:26 by pzhou