Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableverified 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 closure affine set

Definition

Fix an algebraically closed field k and n≥0, and write Akn=kn. The map ι(a)=[1:a1:⋯:an] identifies this set with the chart D+(x0)={[b]:b0≠0}; its inverse is [b]↦(b1/b0,…,bn/b0).

For any subset A⊆kn, its projective closure is A‾proj=⋂{Z⊆Pkn:Z is a projective algebraic set and ι(A)⊆Z}. Here projective algebraic sets are the homogeneous zero loci of projective algebraic set. Arbitrary intersections are zero loci of unions of the defining homogeneous equations. Finite unions are closed too: if Z=V+(S) and W=V+(T), then Z∪W=V+({FG:F∈S, G∈T}), since a point outside both sets has a nonzero factor from each. The empty set and whole space are such zero loci. Thus these sets form the closed sets of the projective Zariski topology, and the displayed intersection is its closure operation. In particular ∅‾proj=∅.

The complement of this affine chart is V+(x0), the hyperplane at infinity (empty when n=0). The construction applies in particular when A is an affine algebraic set, meaning a common zero locus of polynomials in k[x1,…,xn]. No choice principle is used in this definition or the closed-set verification.

Depends on

Used by

Dependency tree · two levels

4 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