Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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 Veronese map is a well-defined closed immersion

Statement

For d≥1, νn,d is a well-defined closed immersion of projective varieties.

Proof

Given: d≥1 and homogeneous coordinates [x0:⋯:xn].

1.1givenalgebra

Scaling x by λ scales every degree-d monomial by λd; not all monomials vanish because some xi≠0. Thus the homogeneous-coordinate criterion makes νn,d a morphism.

2.1step 1.1algebra

On the open where xid≠0, the ratios xjxid−1/xid=xj/xi recover the usual affine coordinates. These chart inverses show injectivity and regular local inverse maps.

3.1step 2.1algebra∎

The relations ZαZβ−ZγZδ whenever α+β=γ+δ vanish on monomial coordinates. Repeatedly exchanging one variable between two degree-d multi-indices gives Zαd=∏jZdejαj. Thus every point satisfying the relations has some Zdei≠0: otherwise every Zα would vanish. On this chart the same exchanges give Zα/Zdei=∏j(Z(d−1)ei+ej/Zdei)αj. The chart is therefore precisely the image of the affine chart xi≠0, with inverse coordinates xj/xi=Z(d−1)ei+ej/Zdei. The common zero locus of the homogeneous relations is exactly the image, so the image is closed and these chart inverses make the map a closed immersion.

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