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 Segre-Veronese map is a closed embedding
Statement
For and , the map from taking to all monomials of bidegree is a closed embedding.
Facts & Assumptions
Given: Integers , positive integers , and the page's algebraically closed field .
Proof
Apply and to the two factors. Their target coordinates are respectively all degree- and degree- monomials.
Applying Segre to those two images produces exactly the products , in the fixed product ordering. It is therefore the fixed-bidegree map of the statement.
Let and be the two Veronese images. The Veronese lemma makes them closed projective subvarieties with regular inverse maps. The construction in cor-projective-variety-product-exists, applied to , realizes their Segre image as a closed subset of the target projective space, with regular projections recovering its two factors. Compose these projections with the Veronese inverses. By the product universal property they give a regular map from this closed image to , inverse to the map in step 2.1. That forward map is a morphism by the multihomogeneous theorem, since a nonzero coordinate and a nonzero coordinate give the nonzero monomial . Thus the displayed map is an isomorphism onto a closed subvariety, as asserted. The argument includes a degree equal to one and a factor .
Depends on
Used by
Dependency tree · two levels
11 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
- J. S. Milne, Algebraic Geometry, 6.23 and 6.26 (standard reference, not scraped)