Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Principal opens form a basis and multiply under intersection

Statement

The principal opens DX(f) form an open basis on every affine algebraic set X, and DX(f)DX(g)=DX(fg).

Facts & Assumptions

Given: An affine algebraic set Xkn over algebraically closed k, elements f,gk[X], and an open UX.

[F1]

A closed subset of X is given by simultaneous polynomial equations (Classical affine zero loci form the Zariski closed sets).

[F2]

D(f) is the set where f is nonzero (A principal open subset of a classical affine variety).

Proof

technique · direct
1.1

For f,gk[X], f(x)g(x)0 in the field k exactly when both factors are nonzero. This proves the intersection identity, including f=0 or g=0 and f=1.

F2givenalgebra
2.1

If U=X(XV(S)) is open, then xU exactly when some sS does not vanish at x. Hence U=sSDX(sˉ). Each member is open and contained in U. This gives a principal neighbourhood of each point of U, and the empty S gives the empty union.

F1F2given

Sources

Source comparison: Milne, Algebraic Geometry, v6.10, Proposition 2.37, p. 49. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.

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