Proving the memoryless property of the exponential distribution

AI Thread Summary
To prove the memoryless property of the exponential distribution, start with the equation P(X ≤ a + b | X > a) = P(X ≤ b). Rewriting the left side as P((X ≤ a + b) ∩ (X > a)) / P(X > a) is a valid approach. From there, P((X ≤ a + b) ∩ (X > a)) can be expressed as P[X ≤ a + b] - P[X ≤ a]. This breakdown clarifies the relationship between the ranges of X, confirming the memoryless property holds true. The discussion emphasizes the importance of understanding the disjoint ranges of the exponential distribution to validate the proof.
DanielJackins
Messages
39
Reaction score
0
Given that a random variable X follows an Exponential Distribution with paramater β, how would you prove the memoryless property?

That is, that P(X ≤ a + b|X > a) = P(X ≤ b)

The only step I can really think of doing is rewriting the left side as [P((X ≤ a + b) ^ (X > a))]/P(X > a). Where can I go from there?
 
Physics news on Phys.org
P[(X ≤ a + b) ^ (X > a)] = P[X ≤ a + b] - P[X ≤ a] , right?
 
Thanks. Using that I was able to prove it. But why is what you said true?
 
X has three disjoint ranges, <a, (a,a+b), >a+b.
P[(X ≤ a + b) ^ (X > a)] is the probability X is in the middle range.
P[(X ≤ a + b)] is the probability X is in the first or middle range.
P[X ≤ a] is the probability X is in the first range.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top