Manuscript XVIII-A@2 · XVIII-A-v2.tex · theorem · 0f4336ec
Theorem: Compact balanced-forest composition
Microlocal operations and their boundaries › Balanced forests · lines 714–766 · proof included or linked
XVIII-A@2#thm:forest, XVIII-A@2#eq:Zn
Let a finite forest have vertex set and edge set . Give every edge a balanced bidistribution and pull it back to by its endpoint projection. Multiply by a compact smooth joint weight. Then:
the finite edge product is defined;
its pushforward over any set of internal vertices is defined by proper support;
for external slots, the output wavefront is contained in
Finite differentiations and smooth multiplications preserve this bound. It excludes an all-future or all-past nonzero causal tuple, and therefore implies the corresponding microcausal kernel condition. With no external slots, the compact pushforward is a scalar.
Proof. Endpoint projections are submersions, so their pullbacks exist. A forbidden product cancellation would assign nonzero edge covectors, with opposite signs at their endpoints, whose sum at every vertex is zero.
The participating edges form a subforest. A leaf of that subforest has one participating incident edge, so its vertex equation forces that edge covector to vanish. Removing the edge and repeating forces every participating covector to vanish, a contradiction. The product criterion therefore applies.
The compact smooth weight makes the product compactly supported. Projection is then proper on its support. For a pushforward wavefront point, the internal covectors are zero. Summing the vertex covectors cancels each edge pair, leaving zero total external covector. This proves eq:Zn. Differentiation and smooth multiplication do not enlarge that bound.
Finally, future and past causal cones are pointed. A tuple contained entirely in either cone with zero sum must have every covector zero, which is excluded.
Displayed formulas in this passage
XVIII-A@2#eq:Zn · line 726