Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Polynomial functions on an affine algebraic set are exactly its coordinate ring

Statement

Let k be an algebraically closed field and let X⊆Akn be an affine algebraic set. Evaluation induces a bijection k[X]⟶{ φ:X→k:φ is the restriction of a polynomial on Akn }. Equivalently, two polynomials define the same polynomial function on X if and only if their difference lies in I(X).

Facts & Assumptions

Given: An algebraically closed field k and an affine algebraic set X⊆Akn.

[L1]

The coordinate ring of X is the quotient k[x1,…,xn]/I(X) (The coordinate ring of an affine algebraic set).

[L2]

A polynomial lies in I(X) exactly when it vanishes at every point of X (The vanishing ideal of a subset of affine space).

Proof

technique · direct
1.1L1L2given

Let f‾∈k[X], represented by a polynomial f. Define Φ(f‾):X→k by Φ(f‾)(x)=f(x). If f‾=g‾ in k[X], then f−g∈I(X) by [L1], so [L2] says f(x)=g(x) for every x∈X. Thus Φ is well defined.

1.2L1L2

If Φ(f‾)=Φ(g‾), then f(x)=g(x) for every x∈X, so f−g∈I(X) by [L2]. Hence f‾=g‾ by [L1]. Therefore Φ is injective.

1.3given

Every polynomial function on X is, by definition, the restriction of some polynomial f∈k[x1,…,xn], and that function is exactly Φ(f‾). Hence Φ is surjective.

2.1step 1.1step 1.2step 1.3∎

Steps 1.1, 1.2, and 1.3 give the stated bijection, and step 1.2 is precisely the criterion that two polynomials define the same function on X if and only if their difference lies in I(X).

Depends on

Used by

Nothing in the library uses this result yet.

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