Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 is stable under composition

Statement

Let f:Y→S and g:X→Y be flat morphisms of schemes. Then the composite f∘g:X→S is flat. If f and g are flat at g(x) and x respectively, then f∘g is flat at x; the empty-source and identity cases are covered.

Facts & Assumptions

Given: The data and hypotheses displayed in the Statement, with the conventions fixed there.

[F1]

f is flat at x when the local ring map OS,f(x)→OX,x makes OX,x flat over OS,f(x), and flat when this holds everywhere (Flat morphism of schemes).

[F2]

Let f:X→S, U=Spec⁡B⊆X and V=Spec⁡A⊆S be affine with f(U)⊆V. Then f is flat at x∈U if and only if Bq is flat over Ap with q the prime of x and p=q∩A (Affine-local flatness).

[F3]

Let R→S be a flat ring map. If N is a flat S-module, then N, viewed as an R-module, is flat over R; consequently a composite of flat ring homomorphisms is flat (Flatness is transitive under a flat change of rings).

Proof

technique · direct
1.1F2

Fix x∈X and put y=g(x), s=f(y). Choose an affine open U=Spec⁡A⊆S containing s; then f−1(U) is an open neighbourhood of y, so choose an affine open V=Spec⁡B⊆f−1(U) containing y; then g−1(V) is an open neighbourhood of x, so choose an affine open W=Spec⁡C⊆g−1(V) containing x. The charts give ring maps A→B→C with f(W)⊆V⊆U.

2.1F2F3step 1.1

Let n be the prime of W defining x, m=n∩B the prime of V defining y, and p=m∩A the prime of U defining s. Since g is flat at x, [F2] gives Cn flat over Bm; since f is flat at y, [F2] gives Bm flat over Ap. The localisation Cn is also the localisation of the Bm-module C⊗BBm at n, so it is a flat Bm-module, and [F3] applied to the composite of flat ring maps Ap→Bm→Cn makes Cn flat over Ap.

3.1F1F2step 2.1

The affine charts W=Spec⁡C over U=Spec⁡A satisfy (f∘g)(W)⊆U, and step 2.1 exhibits flatness of Cn over Ap, so [F2] gives that f∘g is flat at the arbitrary point x. By [F1] the composite f∘g is flat.

4.1

Degenerate cases are consistent: if X is empty the composite has empty source and is flat vacuously; if f or g has empty source the pointwise hypotheses are vacuous; if both are identities the composite is the identity, and step 2.1 reads that Ap is flat over itself. The argument makes no choice principle available or necessary, fixing one point and one nested chain of charts at a time. [F1, F2, step 2.1] □

Depends on

Used by

Nothing in the library uses this result yet.

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