Alphabeta Math
LemmaStatement: 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.

Boundary homology cokernels under bordism gluing

Statement

Let R be a commutative unital ring. Let W and X be compact manifolds with supplied boundary collars and decompositions ∂W=A⊔D and ∂X=A⊔B, where each summand is a union of boundary components. Glue the two copies of A by a supplied homeomorphism, obtaining Y=W∪AX with ∂Y=D⊔B. All homology below has constant coefficients R. Suppose H1(A;R)⟶H1(X;R) is injective,H2(B;R)⟶H2(X;R) is surjective. Then inclusion of W induces a well-defined surjection H2(W;R)im⁡H2(∂W;R)↠H2(Y;R)im⁡H2(∂Y;R). In particular, if R is a field and the first quotient is finite dimensional, the dimension of the second quotient is at most that of the first. No injectivity assumption on H2(A;R)→H2(X;R), orientability, or choice principle is needed.

Facts & Assumptions

Given: The manifolds, collars, gluing and coefficient ring in the Statement, and the two homology hypotheses.

[F1]

Constant R coefficients are a local system, and an excisive cover gives its homology Mayer–Vietoris sequence. The actual small-chain construction uses only least subdivision integers and finite chain operations. Excision and Mayer–Vietoris with local coefficients

Proof

1.1F1givenconstructalgebra

The supplied collars give an open cover of Y by a neighborhood of W and a neighborhood of X, retracting onto W,X, with intersection retracting onto A. In collar coordinates this is obtained by adding a short collar segment across the seam to each side; shrinking its height linearly gives the three retractions. Hence [F1] gives the exact window H2(A;R)→(iW,−iX)H2(W;R)⊕H2(X;R)→jW+jXH2(Y;R)→δH1(A;R)→(iW,−iX)H1(W;R)⊕H1(X;R). The last arrow is injective, since its X coordinate is injective by hypothesis. Exactness therefore says that jW+jX is surjective. This statement is elementwise and does not choose a simultaneous family of preimages.

2.1givenstep 1.1constructalgebra

Write QY=H2(Y;R)/im⁡H2(D⊔B;R) and let π be its quotient map. Every x∈H2(X;R) is the image of a class in H2(B;R), by hypothesis. Its image in H2(Y;R) therefore lies in the boundary image, so πjX=0. For any y∈H2(Y;R) choose, for this one y, a preimage (w,x) under the surjection of step 1.1. Then π(y)=πjW(w). Thus πjW:H2(W;R)→QY is surjective.

3.1step 1.1step 2.1algebra

A class from H2(D;R) maps to zero under πjW because D is a component union of ∂Y. A class a∈H2(A;R) has jWiW(a)=jXiX(a) by the zero composite of the first two Mayer–Vietoris arrows. step 2.1 makes the latter class zero in QY. Since ∂W=A⊔D, every boundary class of W is a sum of these two kinds, so πjW vanishes on the full boundary image. It therefore factors uniquely through the displayed source quotient, and the factored map is surjective by step 2.1. This proves the claimed canonical map, without any assumption on H2(A;R)→H2(X;R).

4.1step 2.1step 3.1constructalgebra∎

If the source quotient is a vector space with a finite basis of size r, its r images span the target. Finite elimination deletes linearly dependent images until a basis remains, so the target has dimension at most r. Only finitely many operations and selections occur. The proof also covers an empty seam or empty outer boundary, zero homology groups and the zero coefficient ring. No step selects representatives for infinitely many classes; surjectivity is used for a single class at a time. Thus the result and the finite-dimensional consequence require no choice principle.

Depends on

Used by

Dependency tree · two levels

8 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