Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-05 (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.

Compact parameterized Pardon atlas with endpoint collars

Statement

Let (X,ω) be smooth closed symplectic, 2g−2+n>0, β∈H2(X;Z), and Jt, 0≤t≤1, a smooth ω-tame path constant in endpoint collars. The full parameterized stable-map moduli has a compact Hausdorff base and an actual oriented Pardon implicit atlas with boundary, of virtual dimension d+1 where d=6g−6+2n+2m(1−g)+2c1(β) and dim⁡RX=2m. Its boundary is the endpoint-1 atlas minus the endpoint-0 atlas. The restrictions compare to the full named endpoint atlases through the explicit collar extensions and their common tuple refinements. Relative extra-section projection and freeness hold exactly over the lower regular loci. No transversality of all obstruction sections is imposed.

Facts & Assumptions

Given: Full AC and exactly the data and hypotheses of the Statement.

[F1]

Pardon implicit atlas on stable pseudoholomorphic maps supplies the full fixed-structure tuple atlas and its actual relative identities; its proof describes the local datums.

[F2]

C denotes Full varying-domain compactness of stable tame holomorphic maps, including compactness uniform over the path.

[F3]

G denotes Actual weighted nodal CR gluing and continuous linear kernels, used at a fixed target structure. Its closed-branch weighted spaces, fixed core-coordinate complement, residual, right inverse, quadratic and inverse-gluing estimates are the starting data for the target-parameter perturbation proved in steps 1.1–3.1 below; target-parameter uniformity is not part of its stated interface. This application has closed stable-map domains throughout the path and uses the retained closed branch with its original graph topology. No boundary-corner asymptote or spectral-cut parameter is added.

[F4]

S denotes Stabilizing slices and supported obstruction spaces for a nodal stable map, used at each parameter point and smoothly extended with a core-supported time cutoff. Pardon implicit atlases and virtual fundamental class package fixes the boundary/orientation convention.

Proof

technique · direct, using the explicit local constructions below
1.1F1F3F4givenconstructalgebra

Fix a parameter t0 and one regular finite thickening tuple over a nodal solution. Write b=(q,y) for its specified domain parameters, and use the closed weighted section and equation spaces Bb,Yb of G with k≥6, a fixed 0<δ<1 below its decay exponent, and the same core incidences and obstruction space E. Keep its preglued map ub and fixed source-dependent exponential charts, and extend the core-supported forcing smoothly in t by the pointwise projection to (0,1)-forms. Identify the varying equation bundles with the t0 bundle by the restriction of their (0,1) projections; these restrictions are invertible and have uniformly bounded coefficient derivatives for t near t0. Let Fb,t be the resulting equation, Db,t=DξFb,t(0), and τ=t−t0. On the compact target, the fundamental theorem in t bounds each required coefficient difference and its derivatives by C∣τ∣. The exact change in the untransported Cauchy–Riemann term is 12(Jt−Jt0)(u)du jb. Differentiating in the section variable gives a bounded coefficient times ∇ξ, and coefficients of size C∣τ∣ times dub ξ; the forcing changes only on fixed cores. On each cylindrical unit patch the weight varies by a fixed factor. G's weighted product estimate (G, proof paragraphs fourteen and fifteen) therefore bounds these terms after summing squared patch norms. A section's shared constant is counted once in Bb; every undifferentiated constant term is multiplied by dub, whose end derivatives decay as Ce−s and vanish in the constant middle region. Thus its weighted integral is bounded uniformly in neck length, since δ<1. The finite core and incidence terms have ordinary uniform bounds. Consequently ∥Fb,t(0)∥≤C(∣y∣+∣τ∣+∑ee−(1−δ)Se), ∥Db,t−Db,t0∥Bb→Yb≤C∣τ∣, and ∥DξFb,t(ξ)−DξFb,t(η)∥≤C∥ξ−η∥ on one small fixed ball. Here ∣qe∣=e−6Se, with the term zero for a persistent node. The constants are independent of every Se and of the partial nodal stratum. No norm differentiation in q is asserted.

2.1F3step 1.1constructalgebra

G gives an exact fixed-t0 right inverse Qb:Yb→ker⁡Lb⊂Bb with uniform norm M, where Lb consists of its fixed core evaluations and obstruction projections. Its image has obstruction component in the prescribed subspace E′. Choose ∣τ∣ so that CM∣τ∣<1/2. Then Db,tQb=1+(Db,t−Db,t0)Qb has inverse given by its norm-convergent Neumann series. Put Qb,t=Qb(Db,tQb)−1. It has norm at most 2M, image exactly ker⁡Lb, and the same E′ restriction. Preglue the fixed central kernel K0 as in G. Its coordinate map satisfies Lbκb=L0κ exactly, and step 1.1 together with G's kernel estimate bounds ∥Db,tκb∥ by C(∣y∣+∣τ∣+∑ee−(1−δ)Se)∥κ∥. Choose one small radius on which the quadratic bound times 2M is below 1/2. The residual is small after shrinking (q,y,τ,κ). Contraction on κb+ker⁡Lb then gives one solution with coordinate Lbξ=L0κ. This proves actual existence and uniqueness over the domain AND target parameter. Because corrections have obstruction component in E′, the projection to E/E′ is still the original surjective linear projection of K0. Its coordinate identity proves the required relative extra-obstruction projection model.

3.1F1F2F3F4step 1.1step 2.1constructalgebra

These solutions give the actual graph topology. On every fixed core the coefficient bounds in G's graph-Caccioppoli, interior ϵ and bootstrap argument (G, proof paragraph eighteen) remain uniform for Jt near Jt0: the compact smooth tame family has one lower taming bound and bounded derivatives of each required order. The small-image neck action and derivative-decay argument (G, proof paragraphs seventeen through nineteen) likewise has uniform constants; Jt is independent of the source coordinate on each neck. It therefore sends every graph-convergent solution sequence with t→t0 into the same small weighted correction ball. The fixed-core coordinates then recover that solution by the uniqueness in step 2.1. Comparing the contraction equations gives continuous dependence on t and the other coordinates, including partial nodal limits, as in G's proof paragraph twenty-one; uniform tail bounds and convergence on each fixed core justify that comparison when the source changes. Thus regularity is open and the charts are products with the real t coordinate. At endpoints choose all data independent of t in the constant collars and restrict these products to the interval, obtaining half-space charts of dimension d+1+dim⁡EI. The tuple-forgetting identities and relative group freeness of [F1] use the same auxiliary labels and are unchanged at each t; no new group acts on t. Full AC and compactness [F2] select finitely many covering datums, with these charts verifying regular coverage; arbitrary finite enlargements use the same local argument. The fixed-atlas determinant orientation transports continuously under the operator perturbation, using the kernel complement just constructed and G's determinant cancellation. Place the positively oriented interval factor first. Outward-normal-first boundary orientation is then endpoint 1 minus endpoint 0.

4.1F1F2F3F4givenconstructalgebrastep 1.1step 2.1step 3.1∎

The endpoint atlas is compatible with the full canonical endpoint AGW, not a new unrelated VFC. Every endpoint datum extends into its constant collar by a time cutoff equal to one there, with its domain charts and transverse slices unchanged. Include all such collar extensions and the interior covering datums in the parameterized index set. At either boundary its restriction contains the full endpoint construction, and the combined finite thickenings are the literal union tuple system in the fixed-atlas construction [F1]. Thus restriction, finite-subatlas and shrinking/refinement compatibility of the virtual package applied in [F1] identify the endpoint functionals with the original named-atlas functionals. This specifies the necessary comparison and does not claim invariance for arbitrary unrelated implicit atlases.

Remarks

This is the actually constructed bordism atlas needed by the GW consumer. Existence of a tame joining path is proved in that consumer separately; the present lemma takes the specified smooth path.

Depends on

Dependency tree · 2 levels

Sources