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.
Bounded above flat tensor complexes preserve quasi isomorphisms
Statement
Let be a ring. Tensoring a bounded-above acyclic left -complex with a bounded-above complex of flat right -modules gives an acyclic total complex. The assertion also holds with the sides exchanged. Thus a bounded-above flat complex preserves quasi-isomorphisms between bounded-above complexes in the other variable. The common two-flat-replacement model gives the balancing isomorphism whenever the replacement maps are supplied.
Facts & Assumptions
Given: Let be a ring. Tensoring a bounded-above acyclic left -complex with a bounded-above complex of flat right -modules gives an acyclic total complex. The assertion also holds with the sides exchanged. Thus a bounded-above flat complex preserves quasi-isomorphisms between bounded-above complexes in the other variable. The common two-flat-replacement model gives the balancing isomorphism whenever the replacement maps are supplied.
The tensor total differential has the Koszul sign and uses the direct sum over each degree diagonal (The tensor product of a right and a left chain complex is totalized by direct sums with the Koszul differential).
Flatness means exactness of tensor on the appropriate module side (Left and right flat modules over an arbitrary ring).
A chain map is a quasi-isomorphism iff its cone is acyclic, reindexed here to cochains (A chain map is a quasi-isomorphism exactly when its cone is acyclic).
The column assembly lemma concerns exact augmented columns of a first-quadrant double cochain complex (Acyclic assembly by exact columns).
The row assembly lemma concerns exact augmented rows of a first-quadrant double cochain complex (Acyclic assembly by exact rows).
Proof
Use total differential for . If for and for , put . This is a first-quadrant double chain complex: both differentials lower their new index. Every total degree has a finite diagonal. Each vertical column is exact because is flat and is acyclic. Empty diagonals and zero terms contribute zero.
For a cycle of chain total degree , choose its largest horizontal index with a nonzero component. Its component at is a vertical cycle, since no component at horizontal index contributes. Exactness of that column supplies a lift in (absorbing the invertible sign ). Subtract its total boundary. This kills that component and can introduce only one at horizontal index . Descending through terminates; at zero the extra horizontal term is zero. The cycle is a boundary. The case has no terms.
This is the arrow-reversal of the finite-diagonal elimination in the published cochain column-assembly proof, with augmentation zero: reversing arrows in abelian groups interchanges kernels and cokernels, while finite products and sums agree. Interchanging the two indices gives the row version and proves the assertion for a flat left complex as well. The original assembly statements concern first-quadrant cochains; step 2.1 supplies the chain argument explicitly instead of applying those statements outside their domain.
For a quasi-isomorphism , its cone is acyclic and bounded above. Tensoring with a flat complex makes this cone acyclic by step 2.1 or step 3.1. Tensor of the cone identifies with the cone of the tensored map: on a shifted second-factor summand multiply by for first-factor degree ; a shifted first-factor summand requires no correction. Direct substitution in the differential verifies these signs. The cone criterion proves invariance. For replacements and , both arrows and are quasi-isomorphisms. Their localized zigzag is the natural balancing isomorphism.
Depends on
Used by
Dependency tree · two levels
13 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
- 10.6.1–10.6.4 and Exercise 10.6.1, p. 395; elementary finite-diagonal replacement for spectral sequence proof (standard reference, not scraped)