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.

The diagonal commutes with base change

Statement

For S′→S and X→S, there is a canonical isomorphism XS′×S′XS′≅(X×SX)×SS′. Under this identification ΔXS′/S′ is the base change of ΔX/S. More explicitly, the square with horizontal arrows the two diagonals and vertical arrows to X and X×SX is Cartesian.

Facts & Assumptions

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

[F1]

For X→S, the diagonal morphism is the unique ΔX/S:X→X×SX satisfying pr⁡1ΔX/S=id⁡X=pr⁡2ΔX/S. It exists by thm-fibre-products-of-schemes-exist. For any test scheme T, it takes an S-morphism a:T→X to the compatible pair (a,a). (The diagonal morphism)

[F2]

For S′′→kS′→hS and an S-scheme X, there is a canonical isomorphism (X×SS′)×S′S′′≅X×SS′′. It is functorial in X and compatible with the induced maps of S-schemes. (Iterated base change)

[F3]

For S-schemes X,Y,Z there are natural projection-compatible isomorphisms X×SY≅Y×SX,(X×SY)×SZ≅X×S(Y×SZ),X×SS≅X≅S×SX. Any coherence identity between these identifications holds whenever both sides induce the same ordered projections to the original factors. (Symmetry, associativity and units)

Proof

1.1givenF2F3

By F2 and F3, a map from any T to either displayed product is exactly a triple (a,b,c) with a,b:T→X, c:T→S′ and fa=fb=hc, where h:S′→S. Keeping these three projections constructs the isomorphism and its inverse.

2.1F1step 1.1∎

By F1 the new diagonal sends (a,c) to (a,a,c). In the pullback of the old diagonal a test triple (a,b,c) is accompanied by d:T→X satisfying (a,b)=(d,d). Thus it is exactly the same datum (d,c), with no additional choice. The projections give inverse morphisms, proving the Cartesian assertion. Empty schemes, identity base changes and nonreduced test schemes obey this same argument.

Depends on

Used by

Dependency tree · two levels

6 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