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

Correction terms vanish on extending Spin-c structures over rational homology balls

Statement

Let B be a smooth compact connected oriented four-manifold with H∗(B;Q)≅H∗(point;Q) and oriented boundary the rational homology sphere Y, where H∗(Y;Q)≅H∗(S3;Q). If a boundary Spinc structure t extends over B, then its Heegaard Floer correction term vanishes: d(Y,t)=0. The extension hypothesis is essential; no vanishing is asserted for Spinc structures that do not extend.

Facts & Assumptions

Given: A smooth rational homology four-ball B, its oriented rational homology sphere boundary Y, and an extending boundary Spinc structure t.

[F1]

For this extending structure, puncturing the ball yields both inequalities d(Y,t)≥0 and d(Y,t)≤0 (Correction-term inequality from a rational-ball cobordism map).

Proof

technique · combine the two orientation-sensitive inequalities

Given: The data above.

1.1F1given

The forward punctured-cobordism map gives d(Y,t)≥0 by [F1].

2.1F1step 1.1algebra∎

The reversed punctured cobordism gives d(Y,t)≤0 by [F1]. A rational number satisfying both inequalities is zero, so d(Y,t)=0. The argument applies only to the Spinc structure that extends.

Depends on

Used by

Dependency tree · two levels

4 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