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 be a commutative PID and nonnegative complexes of free -modules of arbitrary rank. Tensor complexes use direct-sum totalization and Put and with zero differentials, where . Set , , . The canonical sequence is exact.
Under the canonical identifications the connecting map is the sum of inclusion-induced maps , with positive sign. Consequently The corestricted map followed by this kernel identification is the established Tor quotient. The induced map from the displayed cokernel sends to . All indices in sums are nonnegative; empty sums are zero.
Facts & Assumptions
Given: The ring, complexes, AC, and tensor convention in the statement.
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.
Tensor totalization uses the displayed Koszul differential, which is well defined and squares to zero: The tensor product of a right and a left chain complex is totalized by direct sums with the Koszul differential, The tensor-total differential is balanced, well defined, and squares to zero.
Tensor products commute with arbitrary direct sums over a commutative ring: Tensor products commute with arbitrary direct sums.
Short exact sequences of complexes give exact homology sequences: The long exact sequence in homology.
With DC and supplied projective resolutions, balanced Tor is computed by resolving either variable: The balanced Tor bifunctor.
Tensoring over a commutative ring is right exact: Tensoring is right exact.
The earlier Tor quotient uses the canonical cycle-boundary presentations: The Kunneth Tor map.
AC supplies simultaneous choices: The Axiom of Choice.
A self-map of a set can be iterated from any given initial element: The recursion theorem.
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 -indexed chain.
Under AC, free modules are projective: Free modules are projective, with the exact choice boundary.
Proof
AC implies the particular DC principle needed in [F5]. For an entire relation on a nonempty set , each successor set is nonempty. Choose simultaneously. Recursion from any prescribed gives , , hence for every . This is [F10]. For each and , [F1] supplies a length-one free resolution, and [F11] makes it projective. Thus [F5] applies to these actual supplied resolutions.
Choose the degreewise sections from [F1]. In bidegree , tensoring with 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 . Inclusion and are chain maps: kills cycles and , while the terms agree on both sides.
For a free module placed in degree , [F3] identifies with by in coordinate (the maps , , and are inverse). Its differential is coordinatewise . 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 . Quotienting therefore gives by . Although a basis proves bijectivity, this formula is independent of that basis.
Apply this calculation to the free modules and and sum in . There is no differential between distinct summands, so cycles, boundaries, and homology decompose over this finite diagonal. This gives both displayed homology identifications. The summand with in is zero because .
Fix . The resolution , with for , is projective by step 1.1. Tensoring it with computes first homology as the kernel of , because the degree-two boundary is zero. By [F5] this kernel is . Right exactness gives the cokernel as , using the augmentation . No injectivity of is assumed.
A class in a summand of is a finite sum of with . Lift its representing cycle to the corresponding sum in . Its differential is , now in . The lift-and-boundary construction of the connecting map in [F4] therefore gives with included into . The formula holds for sums, not just decomposable classes.
In step 3.1 put and discard the zero 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 and cokernel in degree . At the kernel is zero; at it is precisely . If , both tensor modules are zero. If , its presentation has and inclusion the identity, so tensoring gives an isomorphism with zero kernel and cokernel.
The homology LES makes the image of exactly . 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 is ; its image under is by step 1.3. This identifies the asserted injection formula at the level of the actual maps.
Depends on
- The Axiom of Choice
- A free PID complex decomposes into two-term cycle-boundary pieces
- The balanced Tor bifunctor
- The tensor product of a right and a left chain complex is totalized by direct sums with the Koszul differential
- The tensor-total differential is balanced, well defined, and squares to zero
- The Kunneth Tor map
- The long exact sequence in homology
- Tensoring is right exact
- Tensor products commute with arbitrary direct sums
- Free modules are projective, with the exact choice boundary
- The recursion theorem
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
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
- tom Dieck, Algebraic Topology, Theorem 11.10.1, kernel/cokernel proof, printed pp.298–299 (standard reference, not scraped)
- Friedman, Singular Intersection Homology, §6.4.5, (6.11)–(6.13), printed pp.315–317 (standard reference, not scraped)