Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Finite morphisms survive base change and composition

Statement

Assume the Axiom of Choice (AC) for the base-change assertion. For every finite morphism f:X→S and every morphism T→S, the projection X×ST→T is finite. Finite morphisms are closed under composition, and that composition assertion uses no AC.

Facts & Assumptions

Given: Schemes and morphisms as in the statement; AC is assumed only for the base-change assertion.

[F1]

A morphism f:X→S is finite when, for every affine open U=Spec⁡A⊆S, its inverse image is affine f−1(U)=Spec⁡B and B is a finite A-module (Finite morphisms of schemes).

[F2]

Assuming AC, a morphism is finite if there is an affine open cover of its target on which inverse images are affine and the coordinate ring maps are module-finite (Finite is affine and local on its target).

[F3]

Every point of a scheme has an affine open neighbourhood; this also applies to an open subscheme (Schemes).

[F4]

Every diagram of schemes X→S←T has a fibre product (Existence of all scheme fibre products).

[F5]

If A→B and A→A′ are ring maps, then Spec⁡B×Spec⁡ASpec⁡A′ is Spec⁡(B⊗AA′), with the projection induced by A′→B⊗AA′ (Affine fibre products are spectra of tensor products).

[F6]

The inverse image f−1(U) represents X×SU; restricting a fibre product to opens mapping into a common open base gives the corresponding fibre product over that open (Restricting fibre products to open subschemes).

[F7]

Module-finite means finitely generated as a module over the stated ring (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

[A1]

AC says every family of nonempty sets has a choice function. In this item it is used only to apply the converse local criterion [F2] (The Axiom of Choice).

Proof

technique · direct
1.1F3F4

Let f:X→S be finite and g:T→S any morphism; the fibre product P=X×ST exists by [F4]. Index a family by all pairs (U,W) where U=Spec⁡A⊆S is affine, W⊆T is affine open, and g(W)⊆U. These opens cover T: for each t∈T, an affine neighbourhood U of g(t) exists, and the open subscheme g−1(U) has an affine neighbourhood W of t by [F3]. Taking all such pairs makes no simultaneous pointwise choice.

1.2F1F7

Let X→fY→gS be finite, without assuming AC, and fix an arbitrary affine open U=Spec⁡A⊆S. By [F1], write g−1(U)=Spec⁡B with B finite over A. This is an affine open of Y, so [F1] applied to f gives f−1(g−1(U))=Spec⁡C with C finite over B. Fix finite module generating lists b1,…,bm for B/A and c1,…,cn for C/B. The products bicj generate C over A: for c=∑jdjcj, write each dj=∑iaijbi to obtain c=∑i,jaijbicj. Thus the inverse image of every affine U is affine and finite over A, so [F1] proves g∘f finite. Only two finite generating lists are fixed, with no choice from an arbitrary family.

2.1F1F5F6F7step 1.1

Fix one pair from step 1.1, with W=Spec⁡A′ and U=Spec⁡A. By [F1], write f−1(U)=Spec⁡B with B finite over A. The inverse image P×TW identifies with f−1(U)×UW by [F6], and hence with Spec⁡(B⊗AA′) by [F5]. If b1,…,bn generate B as an A-module, then b1⊗1,…,bn⊗1 generate B⊗AA′ as an A′-module, since if b=∑iaibi with ai∈A, then b⊗a′=∑i(bi⊗1) (1⊗ρ(ai)a′), where ρ:A→A′ is the base-change map, and every tensor is a finite sum of pure tensors. Thus the pullback over each W is affine and finite.

3.1A1F2step 1.1step 2.1

The affine opens from step 1.1 cover T, and step 2.1 verifies the affine and module-finite conditions on every member. Assuming AC, the converse in [F2] therefore shows that P→T is finite. This is the only choice-dependent step in the base-change assertion.

4.1

If T=∅, then P=∅ and the base-changed map is finite. On an empty affine chart or a chart whose pullback is empty, the coordinate ring is 0, generated as a module by the empty set; tensoring with the zero ring again gives zero. Identity maps are finite because their affine chart module is generated by 1, and the composition argument includes identity factors. There is no endpoint parameter or iff claim. The base-change conclusion carries AC exactly as stated, while the composition proof is choice-free. [F1, F5, step 1.2, step 2.1, step 3.1] □

Depends on

Dependency tree · 2 levels

Sources