Let be a -supermartingale. Ville’s inequality is a time-uniform version of Markov’s inequality (basic inequalities:Markov’s inequality), stating that, for any ,

for all . Note this bound is uniform over all time. If we take , then this says that the probability that will ever exceed is at most .

Ville’s inequality can also be written as

where represents a stopping-time. This is what enables statistical inference procedures based on Ville’s inequality to be valid at arbitrary stopping times (which are data dependent).

Ville’s inequality also holds for an e-process, since they are upper bounded by a test-martingale. The composite generalization of Ville’s inequality actually requires the notion of an e-process, and reads

if is an e-process for . Ville’s inequality has also been extended to nonintegrable processes.

Ville’s inequality also implies the classical result that a nonnegative supermartingale will reach infinity with probability 0. Let be a nonnegative supermartingale and define the event . By Ville, . Since the events are monotonically decreasing, i.e., for all , we have

Much of game-theoretic statistics, and sequential hypothesis testing in particular, relies on Ville’s inequality, where we often construct some test-martingale or e-process under the null. Ville’s implies that this process is unlikely to ever become large. Thus, if it does became large, this is evidence against the null.

Reverse Ville

There is also a reverse-time Ville’s inequality which holds for nonnegative reverse submartingales. If is a reverse submartingale with respect to a reverse filtration, then for all ,

Proof of Ville

Define the stopping-time . The optional stopping theorem (which says that ) gives

since by construction. Noting that concludes the proof.