Alphabeta Math
TheoremStatement: 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.

ideal projective closure saturation

Statement

If A=V(I)⊆Akn and I=I(A), write Ih=(fh:f∈I) for the homogeneous ideal generated by the homogenizations of elements of I. Then I+(A‾proj)=Ih:x0∞.

Proof

Given: A=V(I) with I=I(A), Ih=(fh:f∈I), and a homogeneous polynomial G.

1.1givenalgebra

Dehomogenization on D+(x0) identifies V+(Ih) there with A.

2.1step 1.1algebra

Let G be homogeneous of degree d. It vanishes on the embedded A exactly when g=G(1,x)∈I(A)=I. If g is nonzero of degree e, homogenization gives G=x0d−egh∈Ih. If g=0, the same homogenization identity gives G=0. Conversely, if x0rG∈Ih, dehomogenizing an ideal expression gives g∈I, because every generator fh dehomogenizes to f in I. Thus the homogeneous elements vanishing on A are exactly the homogeneous elements of Ih:x0∞.

3.1step 2.1givenalgebra∎

A homogeneous equation vanishes on A exactly when its projective closed zero locus contains the projective closure of A. Both the homogeneous vanishing ideal of that closure and Ih:x0∞ are homogeneous ideals; agreement in every homogeneous degree therefore proves equality for all polynomials. If A is empty, I is the unit ideal, as are both ideals in the formula. No Nullstellensatz or choice principle is needed because I=I(A) is given.

Depends on

Used by

Dependency tree · two levels

5 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