Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-09 (gpt-6-astra)
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 Tor balance isomorphism is natural and coherent under a change of resolutions

Statement

Assume Dependent Choice (DC), and supply projective resolutions of the modules under consideration. The balance isomorphisms for Tor commute with maps of modules and with replacement of either supplied projective resolution. The change-of-resolution identifications are independent of the comparison lifts, are the identity for an unchanged resolution, and compose coherently.

Proof

Given: module maps u:N→N′ and v:M→M′, projective resolutions Q,Q′ of the right modules and P,P′ of the left modules, and DC as in The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain.

1.1givenconstruct

Form Kp,q=Qp⊗RPq as in The first-quadrant tensor double complex of two projective resolutions. The augmentations define degreewise surjective chain maps a:Tot⁡K→N⊗RP and b:Tot⁡K→Q⊗RM.

1.2givenconstruct

Choose comparison maps g:Q→Q′ and f:P→P′ lifting u,v by Projective comparison maps exist. The map T=Tot⁡(g⊗f) commutes with both augmented edge maps: a′T=(u⊗f)a and b′T=(g⊗v)b. These identities hold on pure tensors because comparison maps preserve augmentations.

2.1step 1.1algebra

By The augmented fixed-q rows of the tensor double complex are exact, each fixed-q augmented horizontal complex is exact. If z∈ker⁡a is a total cycle, choose its largest nonzero q-component. The cycle equation there is a horizontal cycle equation, so horizontal exactness gives a preimage one horizontal degree higher. Subtracting its total boundary removes that component and introduces terms only at lower q. Finite diagonal support makes the iteration terminate, so ker⁡a is acyclic. The long exact homology sequence The long exact sequence in homology therefore makes H(a) an isomorphism.

2.2step 1.1algebra

By The augmented rows of the tensor double complex are exact, the same elimination with the largest nonzero p-component proves that ker⁡b is acyclic; the sign (−1)p on the vertical differential does not affect exactness. Hence H(b) is also an isomorphism. Thus the balance map is the specified ratio H(b)H(a)−1, agreeing with the natural isomorphism asserted in The left and right projective constructions of Tor are naturally isomorphic.

3.1step 1.2step 2.1step 2.2algebra

Taking homology in step 1.2 and using steps 2.1--2.2 gives H(g⊗v)H(b)H(a)−1=H(b′)H(a′)−1H(u⊗f). This is the naturality square.

4.1step 3.1algebra∎

Under DC, Projective comparison maps are unique up to chain homotopy makes any two lifts homotopic, and Each resolution-defined Tor construction is covariant in both variables makes their edge homology maps equal. Apply step 3.1 to identity module maps for replacement resolutions. Opposite comparison maps compose to a lift of the identity, so they induce inverse identifications; a direct and a composite comparison among three resolutions lift the same identity and therefore induce the same map. Identity comparisons induce identities. This proves independence and the cocycle laws.

Remarks

The commuting-square calculation for explicitly supplied comparison maps and edge quasi-isomorphisms is choice-free. DC here supplies comparisons and the homotopies needed for independence of arbitrary choices; no global choice of projective resolutions or comparison maps is asserted.

Depends on

Used by

Dependency tree · two levels

36 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