Given i.i.d., the sequence is exchangeable. The rank of in the combined set is a discrete uniform random variable:

We want to solve for such that:

(Where denotes the -th order statistic of the combined set
.)
Since each slot is worth , if you include slots, your total coverage probability is exactly:

To satisfy your safety constraint, you set up the inequality:

Solve for :

We then take the ceiling as must be an integer giving us:

The issue is that it is not computable from the first n points.

Our goal is to now show: which will make things computable.

If , then as we only accounted for the case.
The smallest is out of bounds in thus define which gives us coverage.

To compute this, the -th historical order statistic is formally defined via the empirical quantile function of the training sample which has has not been proved yet.


If we also assume there are no ties, we obtain:


Current Status: Verified that for all .
Next Objective: Derive the mechanics of the empirical distribution function (ECDF) to prove that this specific quantile formulation maps bijectively back to the sorted index .