Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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 cycle-boundary tensor sequence has the Kunneth kernel and cokernel

Statement

Assume AC. Let R be a commutative PID and C,D nonnegative complexes of free R-modules of arbitrary rank. Tensor complexes use direct-sum totalization and d(cy)=dCcy+(1)pcdDy(cCp). Put Z(C)p=ZpC and A(C)p=Bp1C with zero differentials, where B1C=0. Set X=Z(C)RD, T=CRD, Y=A(C)RD. The canonical sequence 0XTρ1Y0 is exact.

Under the canonical identifications HnXp+q=nZpCRHqD,HnYp+q=nBp1CRHqD, the connecting map n:HnYHn1X is the sum of inclusion-induced maps Bp1CHqDZp1CHqD, with positive sign. Consequently kernr+q=n1Tor1R(HrC,HqD),cokern+1p+q=nHpCRHqD. The corestricted map Hn(ρ1) followed by this kernel identification is the established Tor quotient. The induced map from the displayed cokernel sends [z][w] to [zw]. All indices in sums are nonnegative; empty sums are zero.

Facts & Assumptions

Given: The ring, complexes, AC, and tensor convention in the statement.

[F1]

The canonical cycle sequence is degreewise split, and cycles and boundaries give free presentations of homology: A free PID complex decomposes into two-term cycle-boundary pieces.

[F3]

Tensor products commute with arbitrary direct sums over a commutative ring: Tensor products commute with arbitrary direct sums.

[F4]

Short exact sequences of complexes give exact homology sequences: The long exact sequence in homology.

[F5]

With DC and supplied projective resolutions, balanced Tor is computed by resolving either variable: The balanced Tor bifunctor.

[F6]

Tensoring over a commutative ring is right exact: Tensoring is right exact.

[F7]

The earlier Tor quotient uses the canonical cycle-boundary presentations: The Kunneth Tor map.

[F8]

AC supplies simultaneous choices: The Axiom of Choice.

[F9]

A self-map of a set can be iterated from any given initial element: The recursion theorem.

[F10]

DC requests such a sequence along any entire relation from a prescribed point: The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain.

[F11]

Under AC, free modules are projective: Free modules are projective, with the exact choice boundary.

Proof

1.1

AC implies the particular DC principle needed in [F5]. For an entire relation E on a nonempty set S, each successor set Ex={y:xEy} is nonempty. Choose f(x)Ex simultaneously. Recursion from any prescribed aS gives x0=a, xm+1=f(xm), hence xmExm+1 for every m. This is [F10]. For each HrC and HqD, [F1] supplies a length-one free resolution, and [F11] makes it projective. Thus [F5] applies to these actual supplied resolutions.

F8F9F10F1F11F5
1.2

Choose the degreewise sections from [F1]. In bidegree (p,q), tensoring CpZpCBp1C with Dq identifies the two maps with inclusion and projection of a direct sum. Their kernel and image therefore agree and projection is onto. Summing over the finite diagonal proves exactness of 0XTY0. Inclusion and ρ1 are chain maps: dC kills cycles and ρdC=0, while the terms (1)pdD agree on both sides.

F1F2F3
1.3

For a free module U=iIRei placed in degree p, [F3] identifies UDq with iDq by eiyy in coordinate i (the maps RDqDq, ryry, and y1y are inverse). Its differential is coordinatewise (1)pdD. A finite tuple is a cycle exactly when every coordinate is a cycle. Its image consists exactly of finite tuples of boundaries: for the reverse containment choose a preimage for each of the finitely many nonzero coordinates and multiply it by (1)p. Quotienting therefore gives UHqDHp+q(UD) by u[y][uy]. Although a basis proves bijectivity, this formula is independent of that basis.

F2F3F8
2.1

Apply this calculation to the free modules U=ZpC and U=Bp1C and sum in p. There is no differential between distinct p summands, so cycles, boundaries, and homology decompose over this finite diagonal. This gives both displayed homology identifications. The summand with p=0 in HnY is zero because B1C=0.

F1step 1.3
2.2

Fix r,q0. The resolution P1=BrCP0=ZrCHrC, with Pi=0 for i2, is projective by step 1.1. Tensoring it with HqD computes first homology as the kernel of jr1:BrCHqDZrCHqD, because the degree-two boundary is zero. By [F5] this kernel is Tor1R(HrC,HqD). Right exactness gives the cokernel as HrCHqD, using the augmentation z[z]. No injectivity of jr1 is assumed.

step 1.1F5F6
3.1

A class in a (p,q) summand of HnY is a finite sum of b[y] with dDy=0. Lift its representing cycle to the corresponding sum sp(b)y in Tn. Its differential is by+(1)psp(b)dDy=by, now in Xn1. The lift-and-boundary construction of the connecting map in [F4] therefore gives n(b[y])=b[y] with b included into Zp1C. The formula holds for sums, not just decomposable classes.

F1F2F4step 1.2step 2.1
4.1

In step 3.1 put r=p1 and discard the zero p=0 summand. A sum maps to zero exactly when each of its components does; its cokernel is the sum of the component cokernels, since each relation lies in its own summand. Step 2.2 thus gives the asserted kernel in degree n1 and cokernel in degree n. At n=0 the kernel is zero; at n=1 it is precisely Tor1(H0C,H0D). If HqD=0, both tensor modules are zero. If HrC=0, its presentation has BrC=ZrC and inclusion the identity, so tensoring gives an isomorphism with zero kernel and cokernel.

step 2.1step 3.1step 2.2
5.1

The homology LES makes the image of Hn(ρ1) exactly kern. Corestrict it and use the identification of step 2.2. This is the same canonical sequence, map ρ, positive connecting map, and free presentation used to construct the quotient in [F7], so it is that quotient, rather than merely some surjection onto an isomorphic module. On the other side, the cokernel class of z[w]ZpCHqD is [z][w]; its image under Hn(XT) is [zw] by step 1.3. This identifies the asserted injection formula at the level of the actual maps.

F4F7step 1.2step 1.3step 2.2step 4.1

Depends on

Used by

Dependency tree · two levels

47 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