Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-08 (gpt-6-astra)
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.

projective variety cone irreducible

Statement

The affine cone over a classical projective variety is irreducible.

Proof

Given: A classical projective variety X.

1.1givenalgebra

By the irreducibility clause of projective irreducibility homogeneous prime, I+(X) is prime. This clause and its cone-ideal argument require no AC. Homogeneous defining equations show that C(X) consists exactly of zero and the nonzero representatives of points of X. Decomposing a polynomial vanishing on this cone into homogeneous components and evaluating on all scalar multiples shows, over the infinite field k, that each component vanishes on X. Hence I(C(X))=I+(X).

2.1step 1.1algebra

Suppose C(X)=A∪B for two proper relatively closed subsets. Choose a point of C(X)∖A and a polynomial f from defining equations of A that is nonzero there. Likewise choose a polynomial g vanishing on B but not on all of C(X). Then fg vanishes on the cone, so fg∈I(C(X))=I+(X), although neither factor belongs to that prime ideal. This is impossible.

3.1step 2.1given∎

The cone is nonempty since it contains zero, and step 2.1 excludes a union of two proper closed subsets. Thus it 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