Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Flatness descends along faithfully flat base change

Statement

Let R→S be a faithfully flat homomorphism of commutative rings, and let N be an R-module. Then N is flat over R if and only if N⊗RS is flat over S.

Facts & Assumptions

Given: A faithfully flat map R→S and an R-module N.

[L1]

Extension of scalars along a flat ring map preserves flatness (Extension of scalars carries flat modules to flat modules).

[L2]

Flatness is transitive under change of rings (Flatness is transitive under a flat change of rings).

Proof

technique · direct
1.1L1given

If N is flat over R, then N⊗RS is flat over S by [L1].

1.2L2givenalgebra

Conversely, assume N⊗RS is flat over S. Let A→B→C be an exact sequence of R-modules. Tensoring with N and then with S gives ((A⊗RN)⊗RS)→((B⊗RN)⊗RS)→((C⊗RN)⊗RS). Associativity of tensor product identifies this with A⊗R(N⊗RS)→B⊗R(N⊗RS)→C⊗R(N⊗RS), which is exact because N⊗RS is flat over S and [L2] transports that flatness back along R→S.

1.3L3

Since R→S is faithfully flat, [L3] reflects exactness. Therefore the sequence A⊗RN→B⊗RN→C⊗RN was already exact, so N is flat over R.

2.1algebra∎

Hence flatness descends and ascends along faithfully flat base change.

Depends on

Used by

Dependency tree · two levels

11 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