Related to Exponential-like distribution with support [0,1] I wondered just how close to memorylessness a continuous distribution with bounded support can get. For a continuous variable to be memoryless, it has to be exponential, just as a discrete memoryless distributions must be geometric, so this is a defining feature of the exponential distribution. If the support is bounded, the distribution cannot be exponential so cannot be memoryless, but we may still be able to define a sense in which it comes "close" to being memoryless.
We say a continuous distribution is memoryless if for all $s, t \geq 0$ we have $$\Pr(X>t+s \mid X>t)=\Pr(X>s)$$.
Let's say that we have got "close" to being memoryless if, for example, the absolute value of $$\Pr(X>t+s \mid X>t) - \Pr(X>s)$$ is very small for any choice of $s, t$ and we might want to restrict it so that $X, s, t, s+t$ all lie between 0 and 1. One metric for "closeness to memorylessness" might be the least upper bound for that absolute value of the difference, but if another metric has been proposed before that's fine too.
So whichever sensible way we measure it, just how close to memorylessness can we get?
I suspect the answer is we can get arbitrarily close by using a truncated exponential distribution with mean increasingly nearer to zero. But for a fixed mean of $X$, e.g. $\mathbb{E}(X) = 0.1$, it's no longer intuitive (at least to me) that a truncated exponential would be optimal... does anyone have any suggestions? Is it something that has been researched?