Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-12
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 for the Zariski topology on an affine variety

Statement

Let X be a classical affine variety over an algebraically closed field k. Then the principal opens DX(f‾) form a basis for the Zariski topology on X. In particular, DX(f‾)∩DX(g‾)=DX(f‾ g‾) for all f‾,g‾∈k[X].

Facts & Assumptions

Given: A classical affine variety X over an algebraically closed field k.

[L1]

For f‾∈k[X], the principal open is DX(f‾)={x∈X:f‾(x)≠0} (A principal open subset of a classical affine variety).

[L2]

Closed subsets of affine space are zero loci of sets of polynomials (Zero loci in affine space are the closed sets of the classical Zariski topology).

Proof

technique · direct
1.1L1givenalgebra

For any f‾∈k[X], the set DX(f‾) is open because it is the complement in X of the closed subset where f‾ vanishes. Also a point lies in DX(f‾)∩DX(g‾) exactly when both f‾ and g‾ are nonzero there, equivalently when f‾ g‾ is nonzero there. Thus DX(f‾)∩DX(g‾)=DX(f‾ g‾).

1.2L1L2choose

Let U⊆X be Zariski-open and x∈U. Then X∖U is closed in X, so there is a set S of polynomials on the ambient affine space with X∖U=X∩V(S) by [L2]. Since x∉V(S), choose f∈S with f(x)≠0. Then x∈DX(f‾)⊆U. Hence every open set is a union of principal opens.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 are exactly the basis criterion.

Depends on

Dependency tree · 2 levels

Sources