Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Products of classical algebraic sets and their universal property

Definition

Fix the page's algebraically closed field k. Let C be the category whose objects are classical affine or projective algebraic sets over k (including empty and reducible ones), and whose arrows are regular k-maps. Objects isomorphic to such sets are understood with their transported algebraic structure. No existence of products for arbitrary mixed affine/projective factors is asserted.

For X,Y in C, a constructed product X×kY is an object of C with morphisms p:X×kYX and q:X×kYY such that, for every object T of C and morphisms f:TX, g:TY, there is a unique morphism f,g:TX×kY satisfying pf,g=f and qf,g=g. Thus it is the categorical product of Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations in C.

The underlying set is written as pairs when a construction supplies that identification. If either factor is empty, the product set is empty. A product with the one-point affine algebraic set has the evident projection isomorphism. When X,Y are varieties, this definition is used only after a construction shows that the resulting nonempty algebraic set is irreducible.

Depends on

Used by

Dependency tree · two levels

7 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