Alphabeta Math
Pipeline-generated
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.

Kunneth Exactness and Splittings over Principal Ideal Domains

1 · Prerequisites

2 · Summary

Assuming the Axiom of Choice, this page proves the Kunneth short exact sequence for nonnegative complexes of arbitrary-rank free modules over a commutative PID. The tensor complex uses direct sums and the Koszul differential; every degree has a finite diagonal.

A local proof of submodule freeness supplies the cycle and boundary modules. The canonical cycle sequence then yields the tensor and Tor terms as the cokernel and kernel of an explicitly computed connecting map. The resulting arrows are the cycle cross product and the established Tor quotient, natural in both complexes. Chosen cycle retractions subsequently give a linear section of that quotient. Its existence carries no claim of a natural choice. The companion calculations exhibit a nonzero Tor class over a polynomial PID and the canonical cross-product isomorphism over a field.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Under Choice, a submodule of an arbitrary-rank free module over a PID is free

Statement

Assume the Axiom of Choice. If R is a commutative principal ideal domain, F is a free R-module on an arbitrary set, and NF is a submodule, then N is free.

Facts & Assumptions

Given: Such R,F,N, and AC.

[F1]

In a PID every ideal is principal, and the ring is a domain: Principal ideal domain.

[F2]

A free module has unique finite-support basis expansions, including the empty basis for zero: The free module on a set and its standard basis.

[F3]

AC selects an element of each nonempty set in a set-indexed family: The Axiom of Choice.

[F4]

Under AC every set can be well ordered: The well-ordering theorem.

[F5]

A property on a well-order follows if its truth below any element implies its truth at that element: Transfinite induction.

Proof

1.1

Fix a basis (ea)aI of F and well-order I. Put Fa=span{eb:ba}, F<a=span{eb:b<a}, and Na=NFa. The coordinate projection pa:FR is linear by uniqueness of basis expansions.

F2F4given
2.1

Its image Ja=pa(Na) is an ideal: pa(x)pa(y)=pa(xy) and rpa(x)=pa(rx) for x,yNa and rR. Write Ja=(ρa). For each a with Ja0, the set of pairs (ρ,u) with Ja=(ρ), uNa, and pa(u)=ρ is nonempty. AC selects such a pair (ρa,ua) simultaneously for these indices. In particular ρa0. Let S={a:Ja0}.

step 1.1F1F3
3.1

We verify the hypothesis of transfinite induction for the assertion that Na is spanned by the ub with bS, ba. Suppose the assertion holds at every b<a and take xNa. If pa(x)=0, put y=x. Otherwise aS, and pa(x)=rρa for some rR; put y=xrua. In both situations yNF<a. If y0, its finite support has a greatest element b<a, so the assertion at b expresses y in the required earlier generators. If y=0, its expression is the empty sum. Restoring rua when present proves the assertion at a.

step 1.1step 2.1F2
3.2

For a finite relation aEraua=0 with distinct aS, suppose some coefficient is nonzero and take the greatest such index a. Every ub with b<a has zero a coordinate. Applying pa gives raρa=0. Since R is a domain and ρa0, this forces ra=0, contrary to its selection. Thus all coefficients vanish.

step 1.1step 2.1F1
4.1

Transfinite induction now proves the assertion at every a. Each nonzero xN has a greatest support index and hence belongs to one Na; therefore the ua span N. This also covers a limit initial segment: every one of its finite supports lies in a smaller principal initial segment, so no additional generator is needed at a limit cut.

step 3.1F2F5
5.1

Spanning and independence make (ua)aS a basis. If N=0, every Ja=0 and this is the empty basis; if I=, also F=N=0. In rank one the same construction is simply the zero ideal or its single nonzero generator. These possibilities require no choice from an empty fiber.

step 4.1step 3.2F2
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

A free PID complex decomposes into two-term cycle-boundary pieces

Statement

Assume AC. Let R be a commutative PID and C a nonnegative chain complex of free R-modules of arbitrary rank. Set ZnC=kerdn, BnC=imdn+1, and B1C=0. Cycles and boundaries are free. There are sections sn:Bn1CCn of the differential corestricted to its image, giving CnZnCBn1C,c(csn(dnc),dnc). In these coordinates the differential is (z,b)(b,0), with b included in Zn1C. Consequently C is isomorphic to the direct sum of the two-term free complexes BpCZpC in degrees p+1,p.

Let Z(C)n=ZnC and A(C)n=Bn1C, both with zero differential. There is a canonical degreewise split short exact sequence of complexes 0Z(C)ιCρA(C)0,ρn=dn:CnBn1C. The same assertions apply to any such complex D. No splitting of BpCZpC is asserted.

Facts & Assumptions

Given: R,C and AC as in the statement; negative terms are zero.

[F1]

The cycle-boundary short exact sequences are 0ZnCCnBn1C0 and 0BnCZnCHnC0: The cycle-boundary short exact sequences for a free complex over a PID.

[F2]

Under AC, submodules of arbitrary free PID modules are free: Under Choice, a submodule of an arbitrary-rank free module over a PID is free.

[F3]

Under AC, free modules lift maps through surjections: Free modules are projective, with the exact choice boundary.

[F4]

Nonempty families of choices can be selected simultaneously under AC: The Axiom of Choice.

Proof

1.1

Both ZnC and BnC are submodules of the free module Cn, the latter lying in the former since dndn+1=0. Apply the local submodule lemma to get their freeness for every n. Thus the second sequence in [F1] is a length-one free presentation of HnC.

F1F2given
2.1

The surjection dn:CnBn1C admits a lift of the identity of its free target, hence a section sn. For each n the set of such sections is nonempty; AC selects one for every degree. At n=0, take the unique map s0:0C0.

step 1.1F1F3F4
3.1

Define un(z,b)=z+sn(b) and vn(c)=(csn(dnc),dnc). The first component of vn(c) is a cycle because its differential is dncdnsn(dnc)=0. Both maps are linear. Substitution gives unvn(c)=c and vnun(z,b)=(z,b), since dnz=0 and dnsn(b)=b. Thus they are inverse isomorphisms.

step 2.1F1
4.1

Compute dnun(z,b)=b. Since dn1b=0, its image under vn1 is (b,0). For each p let E(p) have BpC in degree p+1, ZpC in degree p, and differential the inclusion. In degree n, p0E(p) is ZnCBn1C with precisely the differential just computed. The maps un therefore form the claimed chain isomorphism. Only two summands occur in each degree.

step 3.1F1
5.1

Inclusion ι is a chain map because dn kills ZnC. The map ρ is a chain map to the zero-differential complex A(C) because ρn1dn=dn1dn=0. Its kernel and image in degree n are ZnC and Bn1C, respectively. This proves the canonical short exact sequence, and the selected sn prove degreewise splitting. Those sections need not be chain maps: dnsn(b)=b can be nonzero. All formulas hold for the zero complex and for degree zero; replacing C throughout by D proves the stated second application.

step 2.1step 4.1F1
LemmaStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-10Open item page →

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
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-10Open item page →

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
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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

5 · Examples, counterexamples and false statements

None yet.

Sources