4
$\begingroup$

Let me preface my question by saying that I am not a formally trained mathematician, so please forgive my informal statement of my problem.

I have the following 'theorem' of an idea that I believe to be pretty evident in probability.

Given an event E Given the Set of all real positive integers R and Given the set of all possible outcomes of a random Event N Given the number of favorable outcomes n where E occurs.

p(E) = n/N

for 0 < p(E) <= 1 the probability that E will occur in R trials is 1.

I have three questions:

  1. Is there something logically incorrect about my theorem?
  2. Is this a well known theorem, and if so what is it called?
  3. How can I write this theorem, more succinctly using symbolic or mathematical notation?
$\endgroup$
5
  • 1
    $\begingroup$ You are essentially right. If an experiment is repeated independently at times $1,2,3,\dots$, and on each trial the probablity of success is $p\gt 0$, then the probability there will be at least one success in the infinitely many trials is $1$. $\endgroup$ Commented Apr 1, 2013 at 17:26
  • $\begingroup$ @AndréNicolas thank you for your response. How would I formalize this theorem? Surely this theorem has been shown before do you know of any examples? $\endgroup$
    – Thomas
    Commented Apr 1, 2013 at 17:33
  • 1
    $\begingroup$ Full formalization is unpleasant, and is avoided in first university courses in probability. Here is a partial formalization. Let $Q(n)$ be the probability that the event has not happened in the first $n$ trials. Then the limit of $Q(n)$, as $n\to\infty$, is $0$. $\endgroup$ Commented Apr 1, 2013 at 17:51
  • $\begingroup$ @AndréNicolas thank you. I would like to see the Full Formalization, but I understand if it is too cumbersome for this forum, you have basically answered the first and 3rd part of my question, now I just need number two. $\endgroup$
    – Thomas
    Commented Apr 1, 2013 at 18:54
  • $\begingroup$ There is no name that I know of for the result. It is well-known. $\endgroup$ Commented Apr 1, 2013 at 18:56

2 Answers 2

2
$\begingroup$

This is called the Infinite monkey theorem. The statement is that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type a given text, such as the complete works of William Shakespeare. One sometimes states the theorem with an infinite amount of monkeys but this is a mistake since one monkey (living forever) is enough. What is infinite in the theorem is the amount of time during which the keys are hit at random.

$\endgroup$
1
-1
$\begingroup$

Like it's stated above, the theorem resembles that of the infinite monkey theorem.

The theorem is purely a proposition than an unlimited number of monkeys can “almost surely” produce a specific text such as Macbeth or even the entire works of Shakespeare, provided that they are given sufficient typewriters and time.

The probability of a complete universe full of monkeys typing an entire complete work of Shakespeare such as Macbeth/Hamlet is so tiny that the chance of it happening is extremely low (time taken to perform the feat should be longer than the age of the universe). But do remember that the mention is “extremely low” which technically, isn’t a zero.

There is a direct and straightforward proof of this theorem. Remember that if two events are independent, the probability of occurrence of both the events is equal to the product of the probabilities of each event happening independently. A simple example:

Chance of rain in place A on a specific day= 0.5.

Chance of rain in place B on a specific day= 0.4

Chances of rain happening on the same day in BOTH places= 0.5 x 0.4= 0.20.

Hope you get the point. Now let’s get back to the theorem.

Imagine that a typewriter has 50 keys. The word that you have to type is “SLEEPY.” According to this theorem, we’ll have to press the typewriter keys randomly and at the same time, generate the required word. We have ample time and resources on our hand. So the only limitation is patience, but that’s not the point. Our point is to prove that it CAN be done. If the typewriter keys are pressed independently and randomly, each key has an equal chance of being pressed.

So, the chance of the first letter “S” getting typed= 1/50.

Chance of the 2nd letter “L” getting typed= 1/50.

The same is true for other letters in a word SLEEPY. Therefore, the chance of getting the word right is-

(1/50) × (1/50) × (1/50) × (1/50) × (1/50) × (1/50) = (1/50)6 = 1/15 625 000 000.

Very very very small but it is NOT zero. Therefore it is very possible.

This is basically just a theorem IMO. It's almost impossible to implement test this concept in the real world and expect a correct result.

Source- The Infinite Monkey Theorem

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .