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

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Flat dimension at most n is equivalent to the prescribed higher Tor vanishing

Statement

Assume the Axiom of Dependent Choice and supplied projective-resolution data. For a left R-module M and n0, fdRMn if and only if ToriR(N,M)=0 for every right module N and every i>n.

Proof

Given: the definition of flat dimension and arbitrary right modules N.

1.1

If F is flat, the Tor-one criterion gives Tor1R(N,F)=0 for every right N, and dimension shifting in a projective resolution of N gives ToriR(N,F)=0 for all i>0.

given
2.1

Suppose 0FnF0M0 is a flat resolution of length n. Break it into short exact sequences of successive kernels. The long exact Tor sequence and step 1.1 shift every Tori(N,M) with i>n to a positive Tor group of Fn, hence to zero.

step 1.1algebra
3.1

Conversely, take a projective resolution and put K0=M and Kj=ker(Pj1Pj2) for j1, with P1=M. Repeated dimension shifting identifies Tor1R(N,Kn) with Torn+1R(N,M); for n=0 this is the identity. The assumed vanishing makes Kn flat by the Tor-one criterion. Truncating at Kn gives a length-n flat resolution, including the case n=0.

step 2.1algebra

Depends on

Used by

Dependency tree · two levels

14 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