Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 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.

For an R-finite module over a local map, flatness on the closed fibre plus the multiplication-map condition implies flatness

Statement

Let R→S be a local homomorphism of Noetherian local rings with maximal ideal m⊂R, and let M be a finite S-module that is also finitely generated as an R-module. Assume:

  1. the closed fibre M/mM is flat over S/mS;
  2. the multiplication map m⊗RM→M is injective.

Then M is flat over R.

Facts & Assumptions

Given: A local map of Noetherian local rings R→S with maximal ideal m, and a finite S-module M that is finitely generated as an R-module and satisfies the two hypotheses.

[L1]

The ideal-form local criterion applies once one knows that M/mM is flat over R/m and that m⊗RM→M is injective (For an R-finite module over a local map, flatness modulo I and injectivity of I⊗M→M imply flatness).

Proof

technique · direct
1.1givenalgebra

The ring R/m is a field. Since M/mM is flat over the S/mS-algebra in hypothesis 1, it is in particular a vector space over R/m, hence flat over R/m.

1.2L1given

Hypothesis 2 is exactly the injectivity condition required in [L1] for the ideal I=m. Therefore [L1] applies and yields that M is flat over R.

2.1algebra∎

This is the claimed closed-fibre criterion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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