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(c⊗w)=dCc⊗w+(−1)pc⊗dDw for c∈Cp. For every n≥0 there is a short exact sequence, natural in chain maps of both complexes, 0⟶⨁p+q=nHpC⊗RHqD→αnHn(C⊗RD)→βn⨁p+q=n−1Tor⁡1R(HpC,HqD)⟶0. Here αn([z]⊗[w])=[z⊗w], 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.1F1

Write u:HnX→HnT and v:HnT→HnY for the maps of [F1], with T=C⊗D. Its LES gives ker⁡u=im⁡∂n+1, ker⁡v=im⁡u, and im⁡v=ker⁡∂n. Therefore uˉ:coker⁡∂n+1→HnT, [x]↦u(x), is well defined and injective: u(x)=0 exactly when x∈im⁡∂n+1.

1.2F1F4given

Let f:C→C′ and g:D→D′ be chain maps between complexes satisfying the hypotheses. The relation dC′f=fdC sends cycles to cycles and boundaries to boundaries, and gives ρ′f=A(f)ρ, where A(f)p is fp−1 restricted to Bp−1C. Thus (Z(f)⊗g,f⊗g,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.

2.1step 1.1F1F2F3

The corestriction vˉ:HnT→ker⁡∂n is onto and has kernel im⁡uˉ. Thus 0→coker⁡∂n+1→uˉHnT→vˉker⁡∂n→0 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.

2.2step 1.2F1F2F3

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 BrC→BrC′ and ZrC→ZrC′ 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.

3.1step 2.1F1∎

At n=0 the Tor sum is empty, so exactness makes α0:H0C⊗H0D→H0T an isomorphism. At n=1 the right term is Tor⁡1(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.

Depends on

Dependency tree · 2 levels

Sources