Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-09-01
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 module is flat if and only if all prime localizations are flat, equivalently all maximal localizations are flat

Statement

Let R be a commutative ring and let M be an R-module. The following are equivalent:

  1. M is flat over R.
  2. Mp is flat over Rp for every prime ideal pR.
  3. Mm is flat over Rm for every maximal ideal mR.

Facts & Assumptions

Given: A commutative ring R and an R-module M.

Proof

technique · direct
1.1

If M is flat, then every localization Mp is flat over Rp by [L1]. Therefore 1 implies 2, and 2 implies 3 trivially.

L1given
1.2

Assume 3. By [L2] it is enough to prove that for every finitely generated ideal IR, the map IRMM is injective. Let K be its kernel. If K0, then some maximal ideal m contains Ann(k) for a nonzero kK, so Km0.

L2givenalgebra
1.3

But localization commutes with tensor products, so localizing the map of algebra at m gives ImRmMmMm. By assumption 3 and criterion [L2], this map is injective. Hence its kernel Km is zero, contradicting algebra. Therefore K=0.

L2algebra
1.4

So the ideal-injection criterion [L2] holds globally, and therefore M is flat. Thus 3 implies 1.

L2
2.1

The three conditions are equivalent.

algebra

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