Manuscript En02-A@1 · En02-A-v1.tex · proposition · bb1319d5
Proposition: Binary mesh values
Certified rational nets and a budgeted mesh theorem · lines 1213–1252 · proof included or linked
En02-A@1#prop:mesh-values
The fine-graining covering radii at capacities are
Including symmetry certificates gives
Proof. The binary fine-graining nets at capacities and are, respectively,
At capacity , the net is
These lists follow directly from (eq:fgcost); their largest gaps are .
For capacities , symmetry includes every grid point , so all gaps in the union are at most . The cost formula shows that fine-graining introduces no positive point below in these four cases. The initial gap is therefore exactly .
Displayed formulas in this passage
unlabeled · line 1216
unlabeled · line 1222
unlabeled · line 1233
unlabeled · line 1239
Nearby in this section
- definition: Definition: Certified nets
- section: Certified rational nets and a budgeted mesh theorem
- lemma: Lemma: Common probability modulus
- theorem: Theorem: C : anchoring and mesh control
- remark: Remark: No boundary cocycle estimate without residual control
- section: Certified rational nets and a budgeted mesh theorem