Lecture 32 the Prediction Interval Formulas for the Next Observation from a Normal Distribution When Σ Is Unknown

Lecture 32 the Prediction Interval Formulas for the Next Observation from a Normal Distribution When Σ Is Unknown

Lecture 32 The prediction interval formulas for the next observation from a normal distribution when σ is unknown 1 Introduction In this lecture we will derive the formulas for the symmetric two-sided prediction interval for the n + 1-st observation and the upper-tailed prediction interval for the n+1-st observation from a normal distribution when the variance σ2 is unknown.We will need the following theorem from probability theory that gives the distribution of the statistic X − Xn +1. Suppose that X1,X2,...,Xn,Xn+1 is a random sample from a normal distribution with mean µ and variance σ2. − q n+1 Theorem 1. The random variable T =(X Xn+1)/( n S) has t distribution with n − 1 degrees of freedom. 2 The two-sided prediction interval formula Now we can prove the theorem from statistics giving the required prediction interval for the next observation xn+1 in terms of n observations x1,x2, ··· ,xn. Note that it is symmetric around X. This is one of the basic theorems that you have to learn how to prove. There are also asymmetric two-sided prediction intervals. − q n+1 q n+1 Theorem 2. The random interval (X tα/2,n−1 n S,X + tα/2,n−1 n S) is a 100(1 − α)%-prediction interval for xn+1. 1 Proof. We are required to prove rn +1 rn +1 P (X ∈ (X − t S,X + t S)) = 1 − α. n+1 α/2,n−1 n α/2,n−1 n We have rn +1 rn +1 LHS = P (X − t S<X ,X < X + t S)=P (X − X <t α/2,n−1 n n+1 n+1 α/2,n−1 n n+1 α/2,n− rn +1 rn +1 = P (X − X <t S,X − X > −t S) n+1 α/2,n−1 n n+1 α/2,n−1 n rn +1 rn +1 = P ((X − X )/ S<t , (X − X )/ S>−t ) n+1 n α/2,n−1 n+1 n α/2,n−1 =P (T<tα/2,n−1 ,T>−tα/2,n−1)=P (−tα/2,n−1 <T<tα/2,n−1)=1− α To prove the last equality draw a picture. Once we have an actual sample x1,x2,...,xn we obtain the the observed value − q n+1 qn+1 − (x tα/2,n−1 n s, x + tα/2,n−1 n s) for the prediction (random) interval (X q n+1 qn+1 tα/2,n−1 n S,X + tα/2,n−1 n S) The observed value of the prediction (random) interval is also called the two-sided 100(1 − α)% prediction interval for xn+1. 3 The upper-tailed prediction interval In this section we will give the formula for the upper-tailed prediction interval for the next observation xn+1. − q n+1 ∞ − Theorem 3. The random interval (X tα,n−1 n S, ) is a 100(1 α)%-prediction interval for the next observation xn+1. Proof. We are required to prove rn +1 P (X ∈ (X − t − S,∞)) = 1 − α. n+1 α,n 1 n We have rn +1 LHS = P (X − t S<X ) α,n−1 n n+1 rn +1 = P (X − X <t − S) n+1 α,n 1 n rn +1 = P ((X − X )/ S<t − ) n+1 n α,n 1 = P (T<tα,n−1) =1− α To prove the last equality draw a picture - I want you to draw the picture on tests and the final. Once we have an actual sample x1,x2,...,xn we obtain the observed value (x − qn+1 ∞ − q n+1 ∞ tα,n−1 n s, ) of the upper-tailed prediction (random) interval (X tα,n−1 n S, ) The observed value of the upper-tailed prediction (random) interval is also called the upper-tailed 100(1 − α)% prediction interval for xn+1. − q n+1 − qn+1 The number random variable X tα,n−1 n S or its observed value x tα,n−1 n s is often called a prediction lower bound for xn+1 because rn +1 P (X − t S<X )=1− α. α,n−1 n n+1.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    3 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us