What does Conformal Intervals for Orders conclude, in numbers, about “The Correct Rank: Why "Plus One" Matters and Where the Finite-Sample Guarantee Comes From”?

Answer: Chapter 2 proves that the rank must be the calibration size plus one, times one minus alpha, rounded up; without the plus one, twenty calibration values cover only 0.9048.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice. Marked boxes separate published evidence, runnable Python calculations (23 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.9048

alpha = 0.05; exact coverage = k / (m + 1)
mklevel k/mcoveragebound 1-a+1/(m+1)naive cov
1011infinite interval (k > m)
19191.00000.95001.00000.9500
20201.00000.95240.99760.9048
30301.00000.96770.98230.9355
39380.97440.95000.97500.9500
50490.98000.96080.96960.9412
99950.95960.95000.96000.9500
100960.96000.95050.95990.9406
1991900.95480.95000.95500.9500
9999500.95100.95000.95100.9500
smallest m with a finite interval: 19
for alpha = 0.10: 9; for alpha = 0.01: 99
Show the full program
# Chapter 2. p21: the correct rank k = ceil((m + 1)(1 - alpha)).
# Model: m exchangeable calibration scores with no ties. The new
# score is equally likely to fall in any of the m + 1 gaps, so the
# interval built from the k-th smallest score covers with probability
# exactly k / (m + 1), computed here as a Fraction. The naive rank
# ceil(m (1 - alpha)) ignores the new point and can fall short.
import math
from fractions import Fraction


def rank(m, alpha):
    return math.ceil((m + 1) * (1 - alpha))


if __name__ == "__main__":
    alpha = Fraction(5, 100)
    print("alpha = 0.05; exact coverage = k / (m + 1)")
    print("   m    k   level k/m  coverage  bound 1-a+1/(m+1)  naive cov")
    for m in (10, 19, 20, 30, 39, 50, 99, 100, 199, 999):
        k = rank(m, alpha)
        k0 = math.ceil(m * (1 - alpha))
        if k > m:
            print("{:4d}  {:3d}   infinite interval (k > m)".format(m, k))
            continue
        cov = Fraction(k, m + 1)
        top = 1 - alpha + Fraction(1, m + 1)
        print("{:4d}  {:3d}   {:.4f}     {:.4f}    {:.4f}             {:.4f}"
              .format(m, k, k / m, float(cov), float(top),
                      k0 / (m + 1)))
    print("smallest m with a finite interval: {}".format(
        min(m for m in range(1, 200) if rank(m, alpha) <= m)))
    print("for alpha = 0.10: {}; for alpha = 0.01: {}".format(
        min(m for m in range(1, 999) if rank(m, Fraction(1, 10)) <= m),
        min(m for m in range(1, 999) if rank(m, Fraction(1, 100)) <= m)))

Single source and citation

Fan, Y. (2026). Conformal Prediction and Distribution-Free Intervals: Finite-Sample Coverage Guarantees for Order Counts and Order Values (Version 1.0.0), Chapter 2: The Correct Rank: Why "Plus One" Matters and Where the Finite-Sample Guarantee Comes From. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-306 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026306,
  author    = {Fan, Yafu},
  title     = {Conformal Prediction and Distribution-Free Intervals: Finite-Sample Coverage Guarantees for Order Counts and Order Values},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book