Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Heegaard invariance and well-definedness of the correction term

Statement

For every closed connected oriented rational homology three-sphere Y and Spinc structure t, the standard Heegaard Floer groups HF∞(Y,t) and HF+(Y,t) constructed from admissible pointed Heegaard diagrams are independent, up to grading-preserving isomorphism, of the diagram and regular auxiliary data. The image of HF∞→HF+ is a graded plus tower, isomorphic as an F2[U]-module to F2[U,U−1]/UF2[U] with an absolute rational grading shift and with U of degree −2. Its nonzero homogeneous elements have a least grading, and that least grading is independent of the diagram and auxiliary data. Every tower element is U-torsion and is divisible by every power of U. In the standard normalization the least grading for (S3,t0) is zero.

Facts & Assumptions

[F1]

Absolute rational Heegaard Floer grading and fixed-Spin-c cobordism maps constructs the absolute grading and its compatibility with pointed moves and the minus/infinity/plus sequence.

[F2]

Infinity standardness and fixed-Spin-c rational-cobordism isomorphisms proves that the infinity group of each rational-sphere Spinc structure is a single Laurent tower.

Proof

Given: A rational homology sphere Y, a Spinc structure t, and a finite admissible pointed diagram. Put R=F2[U,U−1] and choose a homogeneous Laurent generator ρ of HF∞(Y,t).

1.1F1F2

The minus chain complex is finite free over F2[U], with generators [x,−1] for the finitely many intersection points in t. Its homology is finitely generated and its localization is the infinity homology, since localization is exact and the localized differentials are identical. Thus the graded image L of HF−→Rρ is nonzero. Its degrees are bounded above by the largest degree of a minus-chain generator. The set of integers j with Ujρ∈L is consequently nonempty, bounded below, and closed under addition of nonnegative integers. If a is its minimum, that set is exactly {a,a+1,…}. Every homogeneous element of the Laurent tower is a monomial multiple of ρ, and the image is graded; hence L=UaF2[U]ρ.

2.1step 1.1

The long exact sequence of the actual short exact sequence CF−→CF∞→CF+ identifies the image in plus homology, with its grading, as Rρ/UaF2[U]ρ. Its nonzero homogeneous elements have exponents j<a, so their least degree is deg⁡ρ−2(a−1), attained at Ua−1ρ. Sending the standard tower element Uk to Uk+a−1ρ identifies the image with R/UF2[U] shifted by this least degree. Multiplying any individual element sufficiently many times by U kills it, while decreasing exponents supplies a preimage under any power of U. This proves all the tower assertions.

3.1F1step 1.1step 2.1∎

The pointed-move maps preserve absolute grading and the minus/infinity/plus exact sequence, so they carry L onto the corresponding image lattice and induce grading-preserving tower isomorphisms. Therefore the least degree is independent of the diagram and auxiliary data. Choosing Ubρ instead changes a to a−b and deg⁡ρ to deg⁡ρ−2b, leaving that degree unchanged. In the genus-zero diagram of S3 there is one generator [x0,0] of degree zero, no nonconstant disks, and minus lattice UF2[U][x0,0]. Here a=1, so the least grading is zero.

Depends on

Used by

Dependency tree · two levels

2 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources