Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

The PID Kunneth sequence admits a section after choices

Statement

Assume AC. Let R be a commutative PID and C,D nonnegative complexes of arbitrary-rank free R-modules, with direct-sum tensor totalization and Koszul differential. For every n0, the Tor quotient βn in the natural PID Kunneth sequence admits an R-linear section sn:p+q=n1Tor1R(HpC,HqD)Hn(CRD),βnsn=1. Specifically, chosen degreewise cycle retractions determine a retraction rn of the cross product αn, and a section satisfying snβn=1αnrn. This asserts existence after choices, with no claim of a natural choice of section.

Facts & Assumptions

Given: The ring, complexes and AC in the statement. All sums are on nonnegative finite diagonals and empty sums are zero.

[F1]

The natural sequence 0KnαnHn(CD)βnQn0 is exact, where Kn=p+q=nHpCHqD and Qn=p+q=n1Tor1(HpC,HqD): The natural PID Kunneth sequence is exact.

[F2]

Under AC, sections of CpBp1C give cycle retractions ccsp(dCc); the same holds for D: A free PID complex decomposes into two-term cycle-boundary pieces.

[F3]

Chain maps induce well-defined homology maps: A chain map induces a well-defined map on homology.

[F4]

AC permits the simultaneous degreewise choices: The Axiom of Choice.

Proof

1.1

Select the sections of [F2] for both complexes, using [F4], and denote the resulting cycle retractions by ap:CpZpC and bq:DqZqD. Define πC,p(c)=[ap(c)]HpC and πD,q(w)=[bq(w)]HqD. Since a boundary is a cycle, ap1(dCc)=dCc, whose homology class is zero. Thus πCdC=0; likewise πDdD=0. With zero differentials on H(C) and H(D), these are chain maps.

F2F4
2.1

Define Π:CDH(C)H(D) by cwπC(c)πD(w). This descends to tensors because the formula is bilinear and balanced: replacing rcw by crw gives the same tensor by linearity of πC,πD. On a homogeneous tensor, Πd(cw)=πC(dCc)πD(w)+(1)pπC(c)πD(dDw)=0. The target differential is zero, so Π is a chain map.

step 1.1F5
3.1

The target has zero differential, hence its degree-n homology is exactly Kn, even if its modules are not free. By [F3], Π induces rn:Hn(CD)Kn. For cycles z,w the retractions fix them, so rnαn([z][w])=[z][w]. Elementary tensors of homology classes generate Kn, proving rnαn=1Kn.

step 1.1step 2.1F1F3
4.1

Put L=kerrn. If xL and βnx=0, exactness gives x=αnk for some kKn. Applying rn gives 0=rnx=k, so x=0. Therefore βnL:LQn is injective.

F1step 3.1
5.1

Given qQn, surjectivity of βn supplies x with βnx=q. Set x=xαnrnx. Then rnx=rnxrnx=0 and βnx=q, since βnαn=0. Thus βnL is surjective. Its inverse sn:QnLHn(CD) is linear: sums and scalar multiples of inverse images are inverse images of the corresponding sums and scalar multiples, and uniqueness identifies them. This inverse needs no further selection of representatives.

F1step 3.1step 4.1
6.1

By definition βnsn(q)=q. For any xHn(CD), the element xαnrnx lies in L and maps to βnx, so uniqueness gives snβnx=xαnrnx. Hence both asserted composites hold. The maps (k,q)αnk+snq and x(rnx,βnx) are inverse: use these two identities, rnαn=1, rnsn=0, and βnαn=0.

step 3.1step 5.1F1
7.1

For n=0, Qn=0, the section is the unique zero-domain map, and αnrn=1 follows from step 6.1. The same proof handles a zero complex or a zero Kn or Qn, including degree one. The choice of ap,bq occurs in rn and therefore in sn; no compatibility of those choices with arbitrary chain maps was imposed. This proves the stated existence without asserting naturality of the chosen section.

step 1.1step 6.1F1

Depends on

Used by

Dependency tree · two levels

18 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