ScalingStacks

Proof. [04HG]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

The decomposition can continue as long as there exists a real number cc, such that the Lagrangian components can be partitioned into two types, with Lagrangian potential strictly smaller than cc (resp. greater than cc). As long as infLifLi>supLjfLj\inf_{L_{i}}f_{L_{i}}>\sup_{L_{j}}f_{L_{j}} whenever i>ji>j, the Novikov positivity condition on the Lagrangian intersection points would imply that the entries bi​j∈C​F1​(Li,Lj)b_{ij}\in CF^{1}(L_{i},L_{j}) of bb can only go in the direction i>ji>j and not vice versa, so the immersed Lagrangian LL is necessarily of the twisted complex form. This algorithm stops in finitely many steps since there are only finitely many components involved. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.