Manuscript Oai265-B@2 · Oai265-B-v2.tex · proposition · 94b6f42f
Proposition: No 0.1 acceptance at the reported sample count
Supplied script execution report and its interpretation › Why zero invalid acceptances is non-informative here · lines 1375–1402 · proof included or linked
Oai265-B@2#prop:noaccept
For , , and , no dataset can be accepted at by the three-setting binomial procedure. This remains true with outward conservative numerical brackets.
Proof. The binomial lower endpoint is nondecreasing in the pass count: the upper-tail probability decreases with , so its inverse endpoint increases with . Thus all-pass counts maximize .
For exact all-pass endpoints, let . The maximal lower fidelity is
Acceptance would require . But Bernoulli's inequality gives
hence , excluding acceptance. Outward lower brackets cannot increase , and outward upper square-root brackets cannot decrease the error upper endpoint.
Displayed formulas in this passage
unlabeled · line 1391
unlabeled · line 1396