Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)verified 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 balanced Tor bifunctor

Definition

Assume Dependent Choice (DC), as in The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, and work with supplied projective resolutions of the modules under consideration. For a right R-module N, a left R-module M, and i≥0, define Tor⁡iR(N,M) to be either Hi(N⊗RP∙) for a projective resolution of M or Hi(Q∙⊗RM) for a projective resolution of N, identified by The left and right projective constructions of Tor are naturally isomorphic. On module maps use the well-defined homology maps from Each resolution-defined Tor construction is covariant in both variables. The natural coherent identifications of The Tor balance isomorphism is natural and coherent under a change of resolutions make this a covariant bifunctor up to canonical change-of-resolution isomorphism, not literal equality between different resolution complexes.

DC licenses the comparison maps and homotopies in those suppliers. Existence of projective resolutions for arbitrary modules is a separate prerequisite, not a consequence asserted here of DC. When such existence and a system of resolutions have separately been supplied, this gives the usual Tor bifunctor on the corresponding module categories. Without DC, homology of a specified tensor-resolution complex is still defined; claiming the balanced bifunctor then requires explicit comparison and coherence data instead of silently invoking the DC-bearing theorems.

Depends on

Used by

Dependency tree · two levels

23 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