Hewitt–Savage zero–one law

From testwiki
Jump to navigation Jump to search

Template:Short description The Hewitt–Savage zero–one law is a theorem in probability theory, similar to Kolmogorov's zero–one law and the Borel–Cantelli lemma, that specifies that a certain type of event will either almost surely happen or almost surely not happen. It is sometimes known as the Savage-Hewitt law for symmetric events. It is named after Edwin Hewitt and Leonard Jimmie Savage.[1]

Statement of the Hewitt-Savage zero-one law

Let {Xn}n=1∞ be a sequence of independent and identically distributed random variables taking values in a set 𝕏. The Hewitt-Savage zero–one law says that any event whose occurrence or non-occurrence is determined by the values of these random variables and whose occurrence or non-occurrence is unchanged by finite permutations of the indices, has probability either 0 or 1 (a “finite” permutation is one that leaves all but finitely many of the indices fixed).

Somewhat more abstractly, define the exchangeable sigma algebra or sigma algebra of symmetric events ℰ to be the set of events (depending on the sequence of variables {Xn}n=1∞) which are invariant under finite permutations of the indices in the sequence {Xn}n=1∞. Then A∈ℰ⟹ℙ(A)∈{0,1}.

Since any finite permutation can be written as a product of transpositions, if we wish to check whether or not an event A is symmetric (lies in ℰ), it is enough to check if its occurrence is unchanged by an arbitrary transposition (i,j), i,j∈ℕ.

Example

Let the sequence {Xn}n=1∞ of independent and identically distributed random variables taking values in ℝ. Consider the random walk SN=∑n=1NXn. Then one of the following occurs with probability 1:

  • SN=0
  • SN→∞
  • SN→−∞
  • lim inf⁡SN=−∞ and lim sup⁡SN=∞.

Since SN are not independent the Kolmogorov's zero–one law is not directly applicable.

First consider the case when X1 is a.s. constant. Then with probability 1 we have that either (SN=0), (SN→∞) or (SN→−∞).

Now consider the case, when X1 is not a.s. constant. Then for any t∈[−∞,∞] the event {lim sup⁡SN≥t} is in the exchangeable sigma algebra. That is because limit supremum does not change with finite permutation of the indices. From Hewitt-Savage zero-one law we have that

ℙ(lim sup⁡SN≥t)∈{0,1}.

There has to exist t, where probability switches from 0 to 1 i.e. exists t∗∈[−∞,∞] such that lim sup⁡Sn=t∗ almost surely. Similarly exists t∗∈[−∞,∞] such that lim inf⁡Sn=t∗ almost surely.

Since almost surely

t∗=lim sup⁡SN=X1+lim sup⁡∑n=2NXn=X1+t∗

and X1 is not a.s. 0, then t∗ is not finite. Similarly t∗ in not finite.

Therefore, with probability 1 either (SN→∞), (SN→−∞) or (lim inf⁡SN=−∞ and lim sup⁡SN=∞).[2]

References

Template:Reflist

Template:Stochastic processes