Manuscript Em01-E@2 · Em01-E-v2.tex · section · 54f8f8c2

The complete-sum calculation protocol

Localization and complete-sum verification › The complete-sum calculation protocol · lines 1260–1318

Back to manuscript

1: keep the full inventory. Retain

with both crossed terms. The row definitions are printed in Appendix app:kernels.

2: cover all sectors meeting the patch. Besides the rescaled core, account for the supported response incidence, the cone in , the and cone tips in the two placements, and the complementary sectors on each compact joint support. A core or annular calculation is not a complete estimate.

3: standardize conventions. Use one tensor pairing, derivative placement, density, relative-slot sign, and coefficient-distribution representation. For example,

does not mean differentiation of the whole incidence product.

4: calculate and collect before deciding. Produce exact local representations, extract candidate orders, transpose to one common test-jet convention, and sum all row–vertex contributions at each order. A nonzero branch coefficient is not a complete obstruction.

5: certify the complete remainder. State one finite derivative order on each fixed compact support. Include the tails and any partition derivatives. A leading algebraic zero without a vanishing complete remainder does not prove convergence.

OrderCoefficient deliverableEstimate deliverable
Negative power–logarithmAn evaluated sum in a common distributional conventionControlled error after all contributions are collected.
Degree-zero logarithmThe complete coefficient, with both crossed termsNo unaccounted finite or tail contribution.
Finite orderA continuous distribution , possibly singularA compact-uniform remainder tending to zero.

Displayed formulas in this passage

  • unlabeled · line 1264

  • unlabeled · line 1283