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 , smooth -tame , , and with , use Pardon's implicit atlas on . The source's virtual orientation yields in its Čech-cohomology-dual theory; push it forward under the stabilization/evaluation map to define . The class is independent of . 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.
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.
Compact analytic stable-domain orbifold and actual universal plumbing supplies the actual domain stabilization; Full varying-domain compactness of stable tame holomorphic maps and Pardon Gromov topology on stable J-holomorphic map moduli supply graph convergence and continuity of marked evaluations.
Compact parameterized Pardon atlas with endpoint collars gives the actual compact oriented parameterized atlas with boundary and canonical endpoint comparison.
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.
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
The domain stabilization and original marked evaluations define a continuous map to : 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 , exactly the cohomological pullback convention of [F5].
Choose the compatible reference from [F4]. Its eigenspace decomposition is . The Hermitian form has signature , positive on and negative on . For any tame , its -eigenspace is positive: writing gives . Projection to is therefore injective and, by equal dimension, an isomorphism. Thus is the graph of a smooth bundle map with operator norm . Conversely any such graph is positive, its conjugate is negative and complementary, and the two eigenspaces define a smooth real tame .
Interpolate the graph maps of any two endpoints by . The open unit operator-norm ball is convex, and compactness of gives a uniform bound below one. Hence the graph construction of step 2.1 gives a smooth tame joining path. Composing 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.
Apply [F3] to this path. Its base is compact by the uniform varying-domain result [F2]; its boundary orientations give endpoint minus endpoint , and its endpoint atlas comparisons are the actual collar/common-refinement comparisons. Stabilization and evaluation give one continuous map on this entire bordism to the same target , restricting to the two maps.
For any closed degree- target cohomology class , the boundary connector in [F1] gives , because restriction followed by the coefficient-sequence connector is zero. The signed boundary in step 4.1 is exactly . 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
The Axiom of Choice
Pardon implicit atlas on stable pseudoholomorphic maps
Virtual cochains, rational Thom augmentation and bordism for an oriented implicit atlas
Compact analytic stable-domain orbifold and actual universal plumbing
Full varying-domain compactness of stable tame holomorphic maps
Compact parameterized Pardon atlas with endpoint collars
Every symplectic manifold admits a compatible almost-complex structure
Pardon Gromov topology on stable J-holomorphic map moduli
Pardon implicit atlases and virtual fundamental class package
Symplectic and almost-complex curve data