Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06
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.

A right module is flat exactly when Tor one against every left module vanishes

Statement

Assume the Axiom of Dependent Choice and supplied projective-resolution data. A right R-module N is flat if and only if Tor⁡1R(N,M)=0 for every left R-module M.

Proof

Given: a right module N and an arbitrary left module M.

1.1given

If N is flat, tensor a full projective resolution of M with N. Exactness of N⊗R− preserves the augmented resolution, so its positive homology, and in particular Tor⁡1(N,M) by The balanced Tor bifunctor, vanishes.

1.2givenalgebra

If A→B→C→0 is exact in left modules, Universal property of the tensor product for balanced maps into abelian groups identifies N⊗RC with (N⊗RB)/im⁡(N⊗RA): balanced maps annihilating the image are precisely those that descend to N×C. Thus N⊗R− is right exact over the arbitrary ring R. Applied to a resolution P1→P0→X→0, this gives H0(N⊗RP∙)≅N⊗RX. This is natural under comparison maps because augmentations commute with them. By The balanced Tor bifunctor, it is the natural identification Tor⁡0R(N,X)≅N⊗RX.

2.1step 1.2algebra

Conversely, for an inclusion K↪P of left modules, apply The long exact Tor sequence in the left-module variable to 0→K→P→P/K→0. Exactness identifies the kernel of N⊗K→N⊗P with the image of Tor⁡1(N,P/K).

3.1step 2.1algebra∎

Universal vanishing gives injectivity for every such inclusion, and right exactness supplies the rest; thus N⊗R− is exact.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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