Alphabeta Math
TheoremStatement: 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 natural PID Kunneth sequence is exact

Statement

Assume AC. Let R be a commutative PID and C,D nonnegative chain complexes of free R-modules of arbitrary rank. Use the direct-sum tensor total complex with d(cw)=dCcw+(1)pcdDw for cCp. For every n0 there is a short exact sequence, natural in chain maps of both complexes, 0p+q=nHpCRHqDαnHn(CRD)βnp+q=n1Tor1R(HpC,HqD)0. Here αn([z][w])=[zw], and βn is the established cycle-boundary Tor quotient. All indices in the sums are nonnegative; an empty sum is zero. Naturality concerns this exact sequence, without a choice of section.

Facts & Assumptions

Given: R,C,D,n as in the statement, assuming The Axiom of Choice.

[F1]

The cycle-boundary tensor sequence is exact; its connecting map, kernel, cokernel, and the two induced maps have the explicit descriptions in The cycle-boundary tensor sequence has the Kunneth kernel and cokernel.

[F2]

The cycle tensor formula defines a well-defined natural cross product: The Kunneth cross-product map is well defined and natural.

[F3]

The established Tor quotient is induced by the canonical cycle-boundary presentations and is natural: The Kunneth Tor map.

[F4]

A morphism of short exact sequences of complexes induces a morphism of their homology LES: The long exact homology sequence is natural.

Proof

1.1

Write u:HnXHnT and v:HnTHnY for the maps of [F1], with T=CD. Its LES gives keru=imn+1, kerv=imu, and imv=kern. Therefore uˉ:cokern+1HnT, [x]u(x), is well defined and injective: u(x)=0 exactly when ximn+1.

F1
1.2

Let f:CC and g:DD be chain maps between complexes satisfying the hypotheses. The relation dCf=fdC sends cycles to cycles and boundaries to boundaries, and gives ρf=A(f)ρ, where A(f)p is fp1 restricted to Bp1C. Thus (Z(f)g,fg,A(f)g) is a morphism of the canonical short exact tensor sequences. By [F4] it commutes with u,v,, hence with their induced kernel/cokernel maps.

F1F4given
2.1

The corestriction vˉ:HnTkern is onto and has kernel imuˉ. Thus 0cokern+1uˉHnTvˉkern0 is exact. Under the explicit identifications in [F1], uˉ is precisely αn of [F2], and vˉ is precisely βn of [F3]. This proves all three exactness assertions for the maps in the statement.

step 1.1F1F2F3
2.2

The cokernel identification commutes with these maps since z[w] goes to f(z)[g(w)] and then to [f(z)][g(w)]. On a kernel summand, the maps BrCBrC and ZrCZrC form a map of the actual length-one resolutions lifting Hrf. Tensoring with Hqg induces the Tor map used by the natural quotient [F3]. Hence step 1.2 gives both naturality squares for the displayed sequence. Equivalently the first square follows by evaluating [F2] on [z][w]. No selected sections enter ρ, these resolution maps, or the two final arrows.

step 1.2F1F2F3
3.1

At n=0 the Tor sum is empty, so exactness makes α0:H0CH0DH0T an isomorphism. At n=1 the right term is Tor1(H0C,H0D). If one complex is zero, X,T,Y and both end terms are zero, so the same proof gives the zero exact sequence. There is no upper endpoint: for each n only finitely many pairs p+q=n occur, regardless of the ranks.

step 2.1F1

Depends on

Used by

Dependency tree · two levels

21 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