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

Graphs of morphisms to a projective classical variety are closed

Statement

Let f:X→Y be a classical variety morphism for which a classical product P=X×Y has been constructed, and suppose Y is projective. Define Γf as the image of the product morphism ⟨id⁡X,f⟩:X→P. Then Γf is closed in P. No assertion is made for unconstructed products or arbitrary nonseparated prevarieties.

Facts & Assumptions

Given: f:X→Y and a constructed product X×Y, with Y projective.

Proof

1.1given

The diagonal ΔY⊆Y×Y is closed: embed Y projectively and use the Segre/projective coordinate model, where equality of two projective points is cut out on the standard charts by coordinate differences.

2.1step 1.1

Let pX:P→X and pY:P→Y be the structure maps. The morphism F=⟨f∘pX,pY⟩:P⟶Y×Y is defined by the two product universal properties, without choosing a pair-set realization of P. Its inverse image of ΔY is exactly the image of ⟨id⁡X,f⟩.

3.1step 2.1∎

Since inverse images of closed algebraic sets under a morphism are closed, F−1(ΔY)=Γf is closed. This is precisely Milne's projective-target graph criterion under the stated construction hypothesis.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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