In this article I want to argue that the Lottery paradox and the Penrose stairs paradox belong to the same category of paradoxes because they both have the same pattern:
- There is a set of points;
- there is a point s that is self-evidently P(s);
- there is a point e that is self-evidently ~P(e);
- there is an induction rule that transfers property P from one point to the other;
- in reality1 there is a point (guard) between (2) and (3) which is ~P and prevents (2) and (4) from proving P(e);
- because of (5) the contradiction P(e) and ~P(e) can’t be derived;
- there is a lossy compression of reality which moves the guard point from ~P to P.
- because of (7) the contradiction P(e) and ~P(e) can be derived.
Penrose Stairs
Let’s start with the Penrose stairs first. It is a paradox because after taking the last step you are both at the end and at the beginning. However, there is no paradox in the 3D version (see Figure 1) of the staircase — you just reach the end as expected. Only when we project 3D to 2D (see Figure 2) at a specific angle we get the paradox.


This situation can be depicted formally by first noting two self-evident truths about staircases:
A1: If step B is higher than step A, and step C is higher than step B, then step C is higher than step A: .
A2: No step is higher than itself, .
where step B is “higher” than step A can be defined as the bottom side of step B is higher than the top side of step A. Whilst your staircase model might be different than mine, it would nonetheless include the axioms above.
From Figure 1 we can tell that in the actual 3D structure, step 2 is above step 1, step 3 is above step 2, …, step is above step
, and step 1 is not above step
. Formally, this can be expressed as:
D3:
Because the first step in D3 is not above the last one, we cannot derive a contradiction for some
.
Meanwhile, the specific 2D configuration shown in Figure 2 can be described as:
D2:
The only difference between D3 and D2 is that has been projected to
. From this description, we can derive a contradiction:
Given the initial list that describes the general pattern and the specific case of the Penrose stairs paradox we can make the following table:
| General pattern | Penrose stairs |
| A set of points | Pairs of steps |
| P(x) | |
| S | |
| E | |
| Induction rule | |
| Guard point | |
| Lossy compression | |
| Contradiction in 2D |
Having outlined how the Penrose stairs embody this pattern, we can now turn to a paradox of belief that exhibits the same structure: the Lottery paradox.
Lottery Paradox
Given that it is highly likely that it will rain tomorrow, it seems rational to believe that it will. Similarly, if you have a lottery with 1000 tickets and only one winner, it appears rational to believe that some arbitrary ticket i will be a loser once the winner is announced. Here, “highly likely” means that the probability of an event is (acceptance rule), where
is a threshold close to 1. We can state the latter formally as:
where
“ticket
is a loser”, and
“I rationally believe that”.
Additionally, if you happened to rationally believe that it will be cloudy tomorrow, and rationally believe that it will rain tomorrow, then it seems rational to believe that tomorrow it will be both cloudy and rainy. Generally, it sounds rational that if one rationally believes A and rationally believes B, one also rationally believes A and B:
P.AGGR:
However, there is a problem. If we were to accept the ideas above, then this would lead to paradoxical situations. For example, let’s say that for us it is rational to believe in the events with probability . It then would be rational to believe in every proposition
in the lottery case we saw above or
(S1). It would also be rational to believe that
(S2) since it is certain there will be a winner. Using P.AGGR and S1, we would then conclude
(S3), producing a contradiction. Thus, rational belief in highly likely events, combined with P.AGGR, leads to a contradiction known as the Lottery paradox.
Just as there is a 3D model of Penrose stairs there is also a 3D model equivalent for the Lottery paradox, namely the multiverse model. We can treat propositions about the future as being true in their own separate universes. For example, given a 1000-ticket-1-winner lottery, there would be a universe, say #10, in which the 10th ticket is a winner, the rest are losers. Generally, we could just say that in the ith universe it is true that: .
In each future universe, everything is certain since it already happened. Therefore, if you rationally believe A and rationally believe B in some universe , then it is also rational to believe A and B in the universe
. Additionally, in the multiverse model of the lottery there will be no universe in which all of the tickets are losers. All of this can be formally stated as follows:
A1 (or P.AGGR):
A2: .
For simplicity of further analysis, let’s change the number of tickets from 1000 to 3.
By using the multiverse model, we can describe a 3-ticket-1-winner lottery as follows:
M1:
M2:
M3:
where stands for some universe
.
In each universe there is a proposition
that prevents the rule A1 to derive
. Therefore, a contradiction
can’t be derived either.
A good candidate for a 2D version of the multiverse model is a universe model. Just like we can project 3D onto 2D, we can project multiverse onto universe. One way to do it is by using the acceptance rule:
where stands for count of formulas of form
.
Because of the acceptance rule, we get the following description of the 3-ticket-1-winner lottery in the universe:
S1:
Guards that existed in M1, M2 and M3 respectively and prevented the contradiction got compressed to
. This in turn allows derivation of a rational belief in a conjunction of all
propositions from S1 and A1. Therefore, in the universe model we get a contradiction
.
Based on this analysis we can fit the Lottery paradox to the general pattern:
| General pattern | Penrose stairs |
| A set of points | |
| P(x) | |
| S | |
| E | |
| Induction rule | |
| Guard points | |
| Lossy compression | |
| Contradiction in 2D |
- reality here means some bigger space. ↩︎























































