Manuscript Hawk04-D@1 · Hawk04-D-v1.tex · corollary · 39b16f67

Corollary: Uniform whole-code certification requirement

Stage 2: controlled comparison, fixed codes, and growing codes › Growing input dimensions require a separate contract · lines 953–967 · proof included or linked

Hawk04-D@1#cor:growing

Back to manuscript

For whole-code finite-proxy certificates,

ε_{rec} (N_{n}) \leq min {a_{d_{n}}, 2 d_{n} e_{n} + b_{n}} .

Thus $b_{n} \to 0$ and $d_{n} e_{n} \to 0$ are sufficient for these upper certificates to vanish. The assertion $e_{n} \to 0$ alone is insufficient to make this particular certificate vanish.

Proof. Apply Theorem thm:certificate for each $n$ .

Displayed formulas in this passage

unlabeled · line 956
$ε_{rec} (N_{n}) \leq min {a_{d_{n}}, 2 d_{n} e_{n} + b_{n}} .$

Nearby in this section

definition: Definition: Two legitimate growing-code comparisons
section: Growing input dimensions require a separate contract