Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 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.

Zinger fixed-domain interior Gromov compactness

Statement

Let (X,J) be a compact almost-complex manifold and let g be any Riemannian metric on X. Fix a compact closed Riemann surface (Σ,j) and any smooth j-compatible metric h. For a smooth map u, set Eg(u)=12∫Σ∣du∣g,h2 dvolh; in real dimension two this energy is independent of the choice of h in the conformal class. Let ui:Σ→X be nonconstant J-holomorphic maps. If lim inf⁡iEg(ui)<∞, then a subsequence converges in the stable-map and Gromov-convergence sense defined above to a stable J-holomorphic map of arithmetic genus g(Σ). The smooth source complex structure is fixed throughout; all added components are interior sphere bubbles, and the component energies sum to the subsequential limit of Eg(ui).

Facts & Assumptions

Given: Exactly the compact almost-complex target, arbitrary target metric, fixed closed conformal source, nonconstant maps and finite lower-limit energy hypothesis in the Statement. Countable Choice is the background axiom used by the mathematical compactness supplier.

[F1]

Stable-map convergence means smooth component convergence away from matched nodes, the fixed-source sphere-tree description and no lost neck energy, followed by contraction of unstable constant components. For nonconstant components finite automorphism groups are part of the stated equivalent stability convention. Stable almost-complex maps and Gromov convergence

[F2]

For a fixed closed compact Riemann surface and compact Riemannian target, a uniformly energy-bounded sequence of solutions for smoothly convergent almost-complex coefficients has a subsequential smooth base limit and finitely many sphere trees, matching nodes, explicit rescalings, vanishing neck energy and diameter, and exact Dirichlet energy identity. Its local proof uses target-global epsilon regularity, finite-energy removability and soft rescaling, without a symplectic-area hypothesis. Every constant sphere in its forest has at least three nodes. Interior Gromov bubble-tree compactness under Countable Choice

[F3]

For the fixed source and target data, every nonconstant map has Dirichlet energy at least a positive ℏ. Positive energy gap for nonconstant curves on a fixed closed domain

[F4]

A connected compact Riemann surface homeomorphic to the sphere admits a biholomorphism to CP1, and affine complex transformations in that global coordinate are actual automorphisms. A compact Riemann surface homeomorphic to the sphere has a global complex coordinate

[A1]

Countable Choice is inherited from [F2] and [F3]. The Axiom of Countable Choice (ACω)

Proof

1.1F3A1givenalgebra

Finite lower limit gives a subsequence with uniformly bounded energy and a finite limiting value E∞. By [F3], E∞≥ℏ>0. The energy remains the same in every conformal chart of the fixed source, since in real dimension two the inverse conformal factor in the squared norm cancels the area-form factor.

2.1F2A1step 1.1

Apply [F2] with the constant coefficient sequence Ji(z,x)=J(x) and the chosen target metric g. All its hypotheses hold: the source is the one fixed closed surface, the target is compact, the coefficients converge smoothly, and step 1.1 gives the uniform energy bound. Obtain the base solution on Σ and the finite attached sphere forest, with matched nodal values, smooth local convergence, all relative rescalings and the exact energy identity. No tame symplectic form or comparison of area with energy is needed.

3.1F1F2F4step 1.1step 2.1constructalgebra

If the base in step 2.1 is a constant genus-zero component with fewer than three attachment points, use [F4] to identify the genus-zero source (Σ,j) biholomorphically with CP1. Here genus zero means the sphere homeomorphism type. In that global coordinate, choose an original concentration point as 0, choose gradient-maximizing points zi→0 and scales Mi−1→0 as in the normalized interior rescaling construction inside [F2], and set hi(z)=zi+z/Mi. These are GLOBAL Möbius automorphisms of the original source. The gradient-maximizing (or Hofer-selected) rescaling in [F2] gives ∣d(ui∘hi)(0)∣=1 and a constant C independent of i bounding ∣d(ui∘hi)∣ on a fixed disk about zero. Its local higher-regularity estimates therefore give smooth convergence on a smaller fixed disk, with derivative norm one retained at zero. Retain that subsequence and reapply [F2] to the full maps ui∘hi, whose energies are unchanged. The fixed-disk derivative bound excludes zero from the second extraction's concentration set, so its base has derivative norm one at zero and is nonconstant. No derivative bound on the whole global sphere is asserted. Thus the original base vertex in this second extraction is stable and survives stabilization. If the original base already was stable or nonconstant, use hi=id. A constant genus-one base must have an attached positive-energy tree by step 1.1, hence has at least one special point; a higher-genus constant base is already stable.

4.1F1F2step 1.1step 2.1step 3.1constructalgebra

Attach the forest to its specified points of the base. The connected dual graph is a tree attached to the original base vertex, so its arithmetic genus is g(Σ). Total component energy is E∞>0, hence at least one component map is nonconstant. Contract any unstable constant genus-zero vertex: a valence-one vertex is deleted with its edge, and a valence-two vertex is deleted by joining its two neighbors at their corresponding attachment points. Those values agree because the contracted map was constant. Each operation preserves connectedness, the arithmetic genus and all energy. There are finitely many vertices, so this process terminates; a valence-zero constant component cannot be the whole remaining curve because a nonconstant component with positive energy remains. A constant genus-one base has at least one attached tree, since otherwise all energy would be zero; it is therefore stable. Constant higher-genus components are already stable. Thus [F1] identifies the result as a stable map of precisely the original genus.

5.1F1F2step 2.1step 3.1step 4.1algebra∎

The base-preserving extraction in step 3.1 supplies actual global source automorphisms. The remaining component maps and their rescalings retain the smooth convergence from [F2]. Removing finitely many constant unstable vertices only concatenates adjacent vanishing necks; all their energy and image diameters tend to zero and the target node values remain matched. It removes no positive component energy. Consequently the convergence after stabilization has exactly the component, node and no-neck properties of [F1], and the sum of its component energies remains E∞. This proves the entire original fixed-source metric-energy Statement. No varying-domain, boundary, strip-breaking, gluing or virtual-cycle assertion is deduced.

Proof status

The fixed-source analytic implication is fully supplied by the exact local interior bubble-tree theorem and its proved epsilon-regularity/removability/rescaling prerequisites, together with the fixed-domain gap preventing a wholly unstable constant limit. The prerequisite is an existing root mathematics draft carrier with a complete local argument; neither its publication status nor independent acceptance is invented. Root must add its actual mathematical context before adopting this candidate. The public Statement is unchanged and its target metric remains arbitrary.

Depends on

Dependency tree · 2 levels

Sources