Manuscript XVI-M@1 · XVI-M.tex · proposition · 7346c909

Proposition: Numerator representation

M.2 Numerical-kernel relations and Gate S-bv · lines 523–538 · proof included or linked

XVI-M@1#prop:num

Back to manuscript

By Theorem thm:wpA-Sbv, Input (S-bv) holds. Then, using Lemma lem:bv(a),(b), on . Here and , so is homogeneous of degree . For of order , Lemma lem:bv(c) gives

Proof. By induction, by (b), and by (a); this gives the recursion. The product is the Hörmander product used for on (XVI-J: “the pointwise product of two copies of exists”), and (c) applies. kernel_relations.py computes from the same recursion, realised as , for all .

Displayed formulas in this passage

  • unlabeled · line 529

Nearby in this section