Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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 of the affine line

Example

Let A be a commutative unital ring and S=Spec⁡A, and let AS1=Spec⁡A[x] with structure morphism A→A[x]. Then the diagonal Δ:Spec⁡A[x]→Spec⁡A[x]×SSpec⁡A[x] is a closed immersion into Spec⁡A[x,y]≅Spec⁡A[x]×SSpec⁡A[x] whose ideal is (x−y). Consequently AS1→S is separated, and for A=Z this is the diagonal of Spec⁡Z[x]. If instead S is an arbitrary scheme and AS1=Spec⁡Z[x]×Spec⁡ZS, then on each affine open Spec⁡A⊆S the same equation x−y cuts out the diagonal, so the formula glues over an arbitrary base.

Facts & Assumptions

Given: A commutative unital ring A, the affine scheme S=Spec⁡A, the affine line X=Spec⁡A[x] over S with structure morphism A→A[x], and the diagonal Δ=ΔX/S.

[F1]

For every morphism X→S the diagonal is the unique morphism ΔX/S:X→X×SX with pr⁡1ΔX/S=id⁡X=pr⁡2ΔX/S. (The diagonal morphism)

[F2]

For ring maps A→B and A→C there is an isomorphism Spec⁡B×Spec⁡ASpec⁡C≅Spec⁡(B⊗AC), with the projections corresponding to b↦b⊗1 and c↦1⊗c. (Affine fibre products are spectra of tensor products)

[F3]

For a ring A, closed immersions Z→Spec⁡A are, up to unique isomorphism over Spec⁡A, precisely the morphisms Spec⁡(A/I)→Spec⁡A for ideals I⊆A. (Closed immersions into affine schemes are quotient spectra)

[F4]

A morphism is a closed immersion if and only if its restriction to every member of an open cover of the target is a closed immersion. (Closed immersions are local on the target)

[F5]

For a base change S′→S of X→S, the diagonal of X×SS′→S′ is the base change of ΔX/S along X×SX→S; in particular it is determined on each open of the target by ΔX/S. (The diagonal commutes with base change)

[F6]

For any two schemes with morphisms to a common scheme the fibre product exists, so AS1=Spec⁡Z[x]×Spec⁡ZS is a scheme over S; over S=Spec⁡A it is Spec⁡A[x] by [F2]. (Existence of all scheme fibre products)

Verification

1.1

By [F2] applied to A→A[x] twice, Spec⁡A[x]×SSpec⁡A[x]≅Spec⁡(A[x]⊗AA[x]), and the latter is Spec⁡A[x,y] with pr⁡1 corresponding to x↦x⊗1=x and pr⁡2 to x↦1⊗x=y.

F2given
2.1

By [F1] the diagonal corresponds, under the identification of step 1.1, to a ring map μ:A[x,y]→A[x] with μ(x)=x and μ(y)=x, namely the multiplication x⊗1↦x, 1⊗x↦x.

F1step 1.1given
3.1

The map μ is surjective, and its kernel is (x−y): writing A[x,y]=A[x][u] with u=y−x, the map μ is the A[x]-algebra map sending u to 0, whose kernel is the principal ideal (u)=(x−y).

step 2.1algebra
4.1

By [F3] the closed subscheme of Spec⁡A[x,y] with ideal (x−y) is presentable as Spec⁡(A[x,y]/(x−y)), and A[x,y]/(x−y)→A[x], x↦x, y↦x, is an isomorphism of A-algebras; hence the diagonal is exactly the closed subscheme V(x−y) and in particular a closed immersion.

F3step 3.1
5.1

Now let S be arbitrary and AS1=Spec⁡Z[x]×Spec⁡ZS as in [F6], and let Spec⁡A⊆S be an affine open. Base changing along Spec⁡A↪S produces the affine line Spec⁡A[x] over Spec⁡A, whose diagonal is cut out by x−y as computed in step 4.1, and by [F5] these local diagonal conditions are the restrictions to the open subscheme Spec⁡A×SSpec⁡A of the product. Since these products over an affine open cover of S cover AS1×SAS1, [F4] shows that the diagonal of AS1→S is a closed immersion cut out by x−y on each such piece, and by [F1] and [F3] its ideal in the chart ring A[x,y] is (x−y).

F1F3F4F5F6step 4.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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