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

Pardon GW pushforward and J-independence

Statement

For smooth closed symplectic (X,ω), smooth ω-tame J, β∈H2(X;Z), and g,n≥0 with 2g−2+n>0, use Pardon's implicit atlas on M‾g,nβ(X,J). The source's virtual orientation yields [M‾g,nβ(X,J)]vir in its Čech-cohomology-dual theory; push it forward under the stabilization/evaluation map to define GWg,n,βP(X,J). The class is independent of J. This does not assert descendants, localization, degeneration, or all Kontsevich–Manin axioms.

Facts & Assumptions

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

[F1]

Pardon implicit atlas on stable pseudoholomorphic maps supplies the actual oriented endpoint atlas and Virtual cochains, rational Thom augmentation and bordism for an oriented implicit atlas its constructed rational cohomology-dual virtual functional, pushforward and bordism connector.

[F3]

Compact parameterized Pardon atlas with endpoint collars gives the actual compact oriented parameterized atlas with boundary and canonical endpoint comparison.

[F4]

Every symplectic manifold admits a compatible almost-complex structure gives a smooth compatible reference structure by its proved polar construction. The positive-graph tame-path argument is proved below, for all tame endpoint structures.

[F5]

Pardon implicit atlases and virtual fundamental class package fixes the virtual orientation and covariant functional convention; Symplectic and almost-complex curve data fixes smooth closed symplectic and tame hypotheses.

Proof

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

The domain stabilization and original marked evaluations define a continuous map τ to M‾g,n×Xn: forgetting/stabilizing is the actual domain morphism in [F2], while the marked values converge in its graph topology, including labels migrating to bubbles or transferred through a contracted ghost. By [F1] the constructed virtual functional exists. Define its pushforward by GWP(J)(a)=[M‾(X,J)]vir(τ∗a), exactly the cohomological pullback convention of [F5].

2.1F1F2F3F4F5givenconstructalgebrastep 1.1

Choose the compatible reference J∗ from [F4]. Its eigenspace decomposition is TCX=E∗+⊕E∗−. The Hermitian form H(u,v)=−iω(u,vˉ) has signature (m,m), positive on E∗+ and negative on E∗−. For any tame J, its i-eigenspace EJ+ is positive: writing u=v−iJv gives H(u,u)=2ω(v,Jv)>0. Projection to E∗+ is therefore injective and, by equal dimension, an isomorphism. Thus EJ+ is the graph of a smooth bundle map A:E∗+→E∗− with operator norm ∥A∥<1. Conversely any such graph is positive, its conjugate is negative and complementary, and the two eigenspaces define a smooth real tame J.

3.1F1F2F3F4F5givenconstructalgebrastep 2.1

Interpolate the graph maps of any two endpoints by At=(1−t)A0+tA1. The open unit operator-norm ball is convex, and compactness of X gives a uniform bound below one. Hence the graph construction of step 2.1 gives a smooth tame joining path. Composing t with a smooth cutoff constant near zero and one makes it constant in both endpoint collars, without altering the endpoints. This proves the required tame-path input rather than assuming compatible endpoints.

4.1F1F2F3F4F5givenconstructalgebrastep 3.1

Apply [F3] to this path. Its base is compact by the uniform varying-domain result [F2]; its boundary orientations give endpoint 1 minus endpoint 0, and its endpoint atlas comparisons are the actual collar/common-refinement comparisons. Stabilization and evaluation give one continuous map F on this entire bordism to the same target M‾g,n×Xn, restricting to the two τ maps.

5.1F1F2F3F4F5givenconstructalgebrastep 4.1∎

For any closed degree-d target cohomology class a, the boundary connector in [F1] gives [∂W]vir(F∣∂W∗a)=[W]vir(δF∣∂W∗a)=0, because restriction followed by the coefficient-sequence connector is zero. The signed boundary in step 4.1 is exactly GWP(J1)(a)−GWP(J0)(a). This proves equality as rational Čech-cohomology-dual functionals for all inputs of the original Statement. The atlas and virtual cochains were constructed before this bordism argument; no additional descendant or degeneration formula is inferred.

Remarks

The original Statement is retained exactly. The former path, parameterized-atlas and virtual-bordism assumptions are all discharged by the actual constructions.

Depends on

Dependency tree · 2 levels

Sources