Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Uniqueness of the fibre product

Statement

If (P,p,q) and (P′,p′,q′) are fibre products of the same pair X→S←Y, there is a unique isomorphism u:P→P′ with p′u=p and q′u=q.

Facts & Assumptions

Given: The objects, hypotheses and conventions in the statement above.

[F1]

Let f:X→S and g:Y→S be morphisms of schemes. A fibre product is a scheme P, with projections p:P→X and q:P→Y, such that fp=gq and, for every scheme T and morphisms a:T→X, b:T→Y with fa=gb, there is exactly one h:T→P satisfying ph=a and qh=b. Thus, naturally in every test scheme T, Hom⁡(T,P)≅Hom⁡(T,X)×Hom⁡(T,S)Hom⁡(T,Y). Write P=X×SY. The commutative square with edges p,q,f,g is Cartesian when it has this universal property. Morphisms here are morphisms of locally ringed spaces, as in def-morphism-of-schemes. No existence assertion is part of the definition. (Fibre product of schemes)

Proof

1.1givenF1

Apply the universal property of P′ to the compatible maps p,q. It supplies a unique map u:P→P′ with the required projections. This works also for P=∅.

2.1F1step 1.1

Apply the universal property of P to p′,q′ to obtain v:P′→P. Both vu and id⁡P have projections p,q, so uniqueness gives vu=id⁡P; likewise uv=id⁡P′.

3.1step 1.1step 2.1∎

Thus u is an isomorphism, and any projection-compatible isomorphism must equal the map already uniquely obtained. No condition on the number of points or on local nilpotents was used.

Depends on

Used by

Dependency tree · two levels

2 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