Manuscript IX-B-ST@1 · IX-B-ST.tex · theorem · f6af1523
Theorem: Equality of regularized parenthesizations
Regularized association and the missing sharp operation · lines 1293–1337 · proof included or linked
IX-B-ST@1#thm:regularassociation
For every positive cutoff allowed by the supported prescription, the field-independent order- coefficients of
are equal and have common value
After the single common subtraction their numerical limit is
The corresponding statement on arbitrary compact joint tests is the strong distributional limit in Assumption ass:VIID.
Proof. Use independent fields at the three vertices. The cross-contraction operators have field-independent coefficients and commute on the positive-cutoff old-domain expressions. Both parenthesizations consequently give the finite polynomial expansion of
followed by field identification. The old products in this calculation are defined under Assumption ass:tensor. Proposition prop:unique identifies their scalar order-three graph and multiplicity. The asserted limit is the parent input. Product-test density identifies the same joint numerical distribution; no independent graph is assigned to one parenthesization.
Displayed formulas in this passage
unlabeled · line 1297
unlabeled · line 1303
unlabeled · line 1308
unlabeled · line 1324
Nearby in this section
- section: Regularized association and the missing sharp operation
- remark: Remark: What numerical subtraction changes
- proposition: Proposition: The admitted partial coefficient
- section: Regularized association and the missing sharp operation
- proposition: Proposition: Missing sharp second multiplication
- section: Regularized association and the missing sharp operation