A tail event is an event , where is the tail sigma-algebra of the chosen sequence of random variables. It concerns information available arbitrarily far along the sequence. In the measurable coordinate models described in finite-prefix invariance of tail events, any finite edit preserves whether it occurs.
This is stronger than merely needing a long waiting time. On , with denoting heads, let , taking if there is no head. The event
is not a tail event: changing only from zero to one changes membership. Under fair independent Bernoulli trials its probability is . Even the event , of probability one in this model, is not a tail event as a literal set: the all-zero sequence and the sequence with just one initial head differ in one coordinate. A probability of zero or one does not characterize tail events.
On , the event of infinitely many heads is
It says that after every index there is another head. For each , the same intersection can start at , so ; therefore is a tail event. This verifies measurability directly using countable unions and intersections.
Figure 1.
A finite prefix admits both infinitely many heads and only finitely many heads
. The two illustrated extensions have the same initial observations. An alternating continuation belongs to the tail event of infinitely many heads; an all-tails continuation does not. Changing the highlighted finite prefix cannot change that infinite property, but it can change the exact first-head time. Details.
Assume now that the coordinates are fair independent Bernoulli trials. For fixed , let be the event of at least one head among . Its complement requires tails, so
The last equality follows from continuity of probability. Now , a countable intersection of almost sure events, and hence . This determines which of the two possibilities in Kolmogorov's zero–one law occurs. Equivalently, the Borel-Cantelli second lemma applies to the independent events .
Nevertheless, no finite prefix certifies membership in : every finite record can be extended by all tails or by alternating heads and tails. Under the fair independent model, conditioning on any exact finite prefix leaves , since is independent of the initial sigma-algebra. The excluded all-tails continuation has probability zero, but remains a possible member of the sample space. Logical determination by a finite record and a conclusion holding almost surely are different statements.

Ancestors (7)

  1. Tail sigma-algebra
  2. Independent sigma-algebras
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.