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

On the affine line, the classical Zariski topology is cofinite

Statement

Let k be an algebraically closed field. A subset of Ak1 is Zariski-closed if and only if it is either all of Ak1 or a finite subset. Equivalently, the Zariski topology on Ak1 is the cofinite topology.

Facts & Assumptions

Given: An algebraically closed field k.

[L1]

Closed subsets of Ak1 are exactly zero loci of subsets of k[t] (Zero loci in affine space are the closed sets of the classical Zariski topology).

[L2]

A nonzero polynomial of degree n over an integral domain has at most n distinct roots (A nonzero polynomial of degree n over an integral domain has at most n distinct roots).

Proof

technique · direct
1.1

Let CAk1 be Zariski-closed and proper. By [L1], C=V(S) for some Sk[t]. Because CAk1, some polynomial fS is nonzero. Then CV(f), and [L2] says V(f) is finite. Hence every proper closed subset is finite.

L1L2givenchoose
1.2

Conversely, if F={a1,,ar}k is finite, then F=V ⁣((ta1)(tar)). Also =V(1) and Ak1=V() by the definition of zero locus. So every finite subset and the whole line are Zariski-closed.

L1algebra
2.1

Steps 1.1 and 1.2 are exactly the statement that the closed sets are the finite subsets together with the whole space, that is, the Zariski topology on Ak1 is cofinite.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

8 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