Manuscript Em01-E@2 · Em01-E-v2.tex · proposition · 54f8f8c2
Proposition: Globalization with a common finite inventory
Localization and complete-sum verification › Local assembly and global compatibility · lines 1341–1363 · proof included or linked
Em01-E@2#prop:global
Let an open cover of carry verified expansions of the restricted actual family. Suppose all local expansions use one common finite power–logarithm inventory, allowing zero coefficients, and have compact-local bounds of the form (eq:remainder).
Then the local coefficients and finite parts agree on overlaps, define distributions on , and give Assumption ass:expansion globally.
Proof. On an overlap, uniqueness in Theorem thm:decision, applied to compact tests there, identifies the coefficient restrictions. The distributions therefore glue.
For any compact , select a finite subordinate localization near . Lemma lem:assembly gives the local remainder bound for the glued expansion. The common inventory is already finite and independent of .