Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Positive energy gap for nonconstant curves on a fixed closed domain

Statement

Assume Countable Choice. Fix a compact smooth almost-complex manifold (X,J), a Riemannian target metric g, and a connected compact closed Riemann surface (Σ,j) with a compatible source metric h. There exists ℏ>0, depending only on these fixed data, such that every nonconstant smooth J-holomorphic map u:Σ→X satisfies Eg(u)=12∫Σ∣du∣g,h2 dvolh≥ℏ. No symplectic form or area identity is assumed.

Facts & Assumptions

Given: The fixed compact source and target data and Countable Choice.

[F1]

The local interior epsilon-regularity theorem supplies uniform constants r0,ε0 and the pointwise gradient bound in terms of the Dirichlet energy on a coordinate disk, for any smooth almost-complex structure with bounded derivatives on a compact target. Its proof uses no boundary condition. Interior small-energy gradient control for almost complex maps

[A1]

Countable Choice is assumed only through [F1]. The Axiom of Countable Choice (ACω)

Proof

1.1F1A1givenconstructalgebra

If the target is empty or zero-dimensional, no nonconstant map from the connected source exists and any positive gap suffices. Otherwise cover the fixed compact source by finitely many conformal coordinate disks and smaller concentric disks, using a radius no larger than the r0 in [F1]. On their compact closures the fixed conformal metric factors have positive finite upper and lower bounds. Energy is conformally invariant in two source dimensions. Consequently there are ε>0 and C>0 such that Eg(u)<ε implies the global estimate sup⁡Σ∣du∣g,h≤CEg(u): apply [F1] at each point on a disk of a fixed smaller radius in one of the finitely many charts, and use the finite metric comparison constants.

1.2givenconstructalgebra

In target coordinates the autonomous equation is ux+J(u)uy=0. Differentiating in x and y and using J2=−I gives uxx+uyy=−(dJ(u)ux)uy+J(u)(dJ(u)uy)uy. Thus on a relatively compact target chart ∣Δu∣≤C0∣du∣2 with a uniform coefficient constant. For a coordinate center a the function f=∣u−a∣2 therefore satisfies Δf≥(2−2C0∣u−a∣)∣du∣2. Choose a smaller coordinate ball so 2C0∣u−a∣≤1. A finite cover of compact X, with smaller chart neighborhoods inside the original ones, gives one target metric radius δ>0 such that every metric ball Bg(p,δ) is contained in such a coordinate ball centered at the coordinates of p, with this inequality. If a closed-source map has image in that ball, integrate the inequality against its conformal source metric: the integral of its Laplacian is zero on the closed surface, by integration by parts in finitely many charts with a finite smooth partition of unity (the partition-derivative terms cancel), whereas the nonnegative right side vanishes only if du=0. Such a map is constant.

2.1step 1.1step 1.2constructalgebra∎

Let D be a finite upper bound for lengths of source paths joining any two points of the connected compact Riemannian surface. To construct such a bound without a completeness theorem, choose finitely many smaller coordinate balls covering the source and larger relatively compact coordinate balls containing their closures. Their intersection graph is connected, since otherwise their two disjoint unions would disconnect the source. Choose one joining point for each edge of a finite spanning tree. Straight coordinate segments within a larger coordinate ball have a uniform finite length bound; concatenating them along the finite tree joins arbitrary source points with one uniform bound D. If Eg(u)<ε, step 1.1 bounds the diameter of its image by CDEg(u). Choose ℏ=min⁡{ε2,δ24C2max⁡{D,1}2}>0. Energy less than ℏ puts the image inside Bg(u(z0),δ) for any fixed z0, so step 1.2 makes the map constant. The contrapositive proves the claimed gap. This is a fixed-domain gap and is not asserted uniform over degenerating source structures.

Depends on

Dependency tree · 2 levels

Sources