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 graph of a polynomial map as a closed subscheme

Example

Let k be a field, let m,n≥0, and let g:Akm→Akn be given by polynomials g1,…,gn∈k[x1,…,xm]. Then the graph Γg:Akm→Akm×kAkn is a closed immersion, and after identifying Akm×kAkn=Spec⁡k[x1,…,xm,y1,…,yn] its ideal is (y1−g1(x),…,yn−gn(x)). Moreover the first projection restricts to an isomorphism Γg→Akm with inverse Γg, so the graph is a closed subscheme isomorphic to the source through pr⁡1.

Facts & Assumptions

Given: A field k, integers m,n≥0, the affine spaces Akm=Spec⁡k[x1,…,xm] and Akn=Spec⁡k[y1,…,yn] over Spec⁡k, and the morphism g with coordinate polynomials g1,…,gn.

[F1]

For an S-morphism u:X→Y the graph morphism is the S-morphism Γu=(id⁡X,u):X→X×SY; its composites with the two projections are id⁡X and u, and the definition alone does not assert that its image is closed. (The graph morphism over a base)

[F2]

If Y→S is separated and u:X→Y is an S-morphism, then Γu is a closed immersion. (Closed graphs over separated targets)

[F3]

Every affine morphism is separated. (Affine morphisms are separated)

[F4]

For ring maps k→B, k→C one has Spec⁡B×Spec⁡kSpec⁡C≅Spec⁡(B⊗kC), with projections b↦b⊗1 and c↦1⊗c. (Affine fibre products are spectra of tensor products)

[F5]

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)

Verification

1.1

The structure morphism Akn→Spec⁡k is affine, hence separated by [F3], so [F2] applies to the Spec⁡k-morphism g and the graph Γg is a closed immersion. By [F4] the product is Spec⁡(k[x]⊗kk[y])=Spec⁡k[x1,…,xm,y1,…,yn], with pr⁡1 acting as xi↦xi and pr⁡2 as yj↦yj.

F2F3F4
2.1

Under the identification of step 1.1 the morphism Γg=(id⁡,g) corresponds to the k-algebra map φ:k[x,y]→k[x] with φ(xi)=xi and φ(yj)=gj(x).

F1step 1.1
3.1

The map φ is surjective and its kernel is the ideal I=(y1−g1(x),…,yn−gn(x)): clearly I⊆ker⁡φ, and conversely if f∈ker⁡φ then writing f as a polynomial in the variables uj=yj−gj(x) with coefficients in k[x] gives f≡f(x,g(x))=0 modulo I, so f∈I.

step 2.1algebra
4.1

By [F5] the closed subscheme with ideal I is, up to unique isomorphism over the product, the image of φ, so the graph is the closed subscheme V(I) of Spec⁡k[x,y] with the displayed ideal.

F5step 3.1
4.2

By [F1] the composite pr⁡1∘Γg is the identity of Akm, so the first projection restricts to a morphism Γg→Akm with inverse Γg; hence pr⁡1∣Γg is an isomorphism. In coordinate rings this is the isomorphism k[x,y]/I→k[x] inverse to φ.

F1step 3.1
4.3

The degenerate cases are included: for n=0 the list of equations is empty, I=0, and the graph is the identity of Akm; for m=0 the source is a single k-rational point and the graph is the closed point (g1,…,gn)∈Akn cut out by yj−gj.

step 2.1step 3.1
5.1

Steps 1.1, 4.1 and 4.2 show that Γg is a closed subscheme of Akm×kAkn with ideal (y1−g1(x),…,yn−gn(x)) whose first projection is an isomorphism onto Akm, which is the assertion.

step 1.1step 4.1step 4.2∎

Remarks

The fibre-product page already records the calculation of this ideal, with the roles of the two factors exchanged, as The ideal of a polynomial graph. The present item adds the identification of the abstract graph morphism of The graph morphism over a base with that closed subscheme and the statement that the first projection restricts to an isomorphism; no separate computation is needed for the ideal itself.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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