Search arXiv⌕ Search

arXiv · 0705.2074

Gluing pseudoholomorphic curves along branched covered cylinders II

Abstract

This paper and its prequel ("Part I") prove a generalization of the usual gluing theorem for two index 1 pseudoholomorphic curves U_+ and U_- in the symplectization of a contact 3-manifold. We assume that for each embedded Reeb orbit gamma, the total multiplicity of the negative ends of U_+ at covers of gamma agrees with the total multiplicity of the positive ends of U_- at covers of gamma. However, unlike in the usual gluing story, here the individual multiplicities are allowed to differ. In this situation, one can often glue U_+ and U_- to an index 2 curve by inserting genus zero branched covers of R-invariant cylinders between them. This paper shows that the signed count of such gluings equals a signed count of zeroes of a certain section of an obstruction bundle over the moduli space of branched covers of the cylinder. Part I obtained a combinatorial formula for the latter count and, assuming the result of the present paper, deduced that the differential d in embedded contact homology satisfies d^2=0. The present paper completes all of the analysis that was needed in Part I. The gluing technique explained here is in principle applicable to more gluing problems. We also prove some lemmas concerning the generic behavior of pseudoholomorphic curves in symplectizations, which may be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Hutchings, Clifford Henry Taubes. 2008-12-23. Gluing pseudoholomorphic curves along branched covered cylinders II. https://arxiv.org/abs/0705.2074

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The shifted symplectic geometry of derived higher groupoids

The main goal of this work is to introduce derived Lie n-groupoids and their shifted symplectic structures. We further define shifted lagrangian structures and prove that their composition is well defined under suitable conditions. As an application, we show that our framework incorporates several reduction procedures at critical values, including: classical Hamiltonian reduction, group valued moment maps, Poisson Lie group valued moment maps and Mikami-Weinstein for proper symplectic groupoids.

math.SG↗

Rigidity, flexibility, and a sign error

The documents [OAI26a, OAI26b, OAI26c] claimed to prove cases of the Hodge conjecture via homological mirror symmetry, before being withdrawn by OpenAI. We discuss the source of the error (but do not analyse the rest of the argument).

math.SG↗

SympFormer: Inertial Attention Blocks from Damped Hamiltonian Dynamics on Spaces of Probability Measures

The attention mechanism underpins modern large language models, yet their dynamics remain only partially understood. Recent perspectives interpret attention blocks as interacting particle systems, whose mean-field limits correspond to gradient flows of energy functionals on spaces of probability densities on $\mathbb R^d$ equipped with Wasserstein-type metrics. We extend this viewpoint by deriving accelerated attention blocks from inertial, Nesterov-type damped Hamiltonian dynamics on these density spaces, developing the geometry and differential calculus needed to make the construction rigorous. In particular, we introduce a local-mobility geometry for the Otto-Wasserstein and softmax-Wasserstein settings, and a quotient Stein geometry that resolves the degeneracy of the linear-attention kernel to yield a well-defined metric and differential calculus. We provide rigorous foundations when softmax attention admits a gradient-flow formulation and when its inertial counterpart admits a damped Hamiltonian on explicitly characterized domains. For linear attention, we obtain a finite-dimensional solution theory with sharp conditions for global existence versus finite-time second-moment blow-up. We further prove a quantitative link between continuous moment blow-up and the discrete-layer depth at which token norms cross a prescribed threshold. Finally, motivated by the finite-token geometry, we propose geometric corrections to token and momentum updates. In decoder-only, nanoGPT-style experiments on TinyStories and OpenWebText, these corrections lower validation negative log-likelihood on next-token prediction relative to momentum-only controls.

math.SG↗