Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-11-04 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Stable almost-complex maps and Gromov convergence

Definition

Let (X,J) be a smooth almost-complex manifold. A nodal closed Riemann surface C is a connected compact complex curve whose only singularities are ordinary nodes; its normalization is a finite disjoint union of smooth compact Riemann surfaces, and each node identifies two distinct marked points on that normalization. If the normalization has components C1,…,CN and C has E nodes, its arithmetic genus is ga(C)=∑i=1Ng(Ci)+E−N+1. A stable J-holomorphic map is a continuous map u:C→X whose pullback to each normalized component is smooth and J-holomorphic, whose values agree at both branches of every node, and whose automorphism group preserving the map and nodes is finite. Equivalently, every constant genus-zero component has at least three nodal special points and every constant genus-one component has at least one; constant components of genus at least two already have finite automorphism group.

Fix a smooth Riemannian metric g on X. For a smooth map v:(S,jS)→X, set Eg(v)=12∫S∣dv∣g,h2 dvolh, where h is any metric in the conformal class of jS; in real source dimension two this is independent of h. For a nodal map, Eg(v) is the sum of these energies over its normalized components.

Let (Σ,j) be a fixed connected compact closed Riemann surface and let ui:(Σ,j)→X be smooth J-holomorphic maps. A candidate limit domain C∞ is obtained from (Σ,j) by attaching finitely many rooted trees of spheres at pairwise distinct points z1,…,zℓ; every edge is a node and ga(C∞)=g(Σ). Let u∞:C∞→X be a stable J-holomorphic map. The sequence Gromov-converges to u∞ exactly when the following rescaling and energy data exist.

  1. There are hi∈Aut⁡(Σ,j) such that ui∘hi converges in C∞ on every compact subset of Σ∖{z1,…,zℓ} to the base-component map u∞,0.

  2. For each root sphere attached at za, choose a coordinate disk Ua⊂Σ about za and increasing open sets Va,i⊂C with Va,i⊂Va,i+1 and ⋃iVa,i=C. There are biholomorphic embeddings ψa,i:Va,i→Ua whose images shrink to za, and ui∘hi∘ψa,i converges in C∞ on compact subsets away from node points to the root-sphere map, using P1=C∪{∞} with its parent node at ∞.

  3. For each child sphere attached at a node of a sphere component, choose analogous expanding coordinate domains and biholomorphic rescalings into a coordinate disk about that node in the parent sphere. Compose each child rescaling with all rescalings from its ancestors. The resulting maps converge in C∞ on compact subsets of each child sphere away from its nodes; this rule is repeated recursively through every finite sphere tree. At each node the two limiting component maps take the same value in X. These nested exhaustions specify every rescaling and every component of the limit.

  4. With μui∘hi=12∣d(ui∘hi)∣g,h2 dvolh, the reparametrized energy measures satisfy μui∘hi⇀μu∞,0+∑a=1ℓ(∑v∈TaEg(u∞,v))δza. In particular, Eg(ui)→∑vEg(u∞,v) over the base and every sphere vertex, so no energy is lost on any intervening neck. Unstable constant sphere components may be contracted after convergence; this preserves the arithmetic genus, component energies and matched values.

This is a definition of fixed-source closed-domain convergence, not a compactness theorem. It includes the rescaling and no-neck content of Zinger's Definition 1.1 and Theorem 1.2; it asserts no bordered-domain or varying-source result.

Component-tree convention

Each vertex below represents one normalized component with its map; an edge represents a node whose two target values agree. The drawing is schematic and is not a compactness argument.

§0u0S21u1S22u2nodenode

Depends on

Dependency tree · 2 levels

Sources