Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-30
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.

k-points of k[x_1, ..., x_n]/I are exactly k-algebra maps to k

Statement

Let k be a field, let Ik[x1,,xn] be an ideal, and put A=k[x1,,xn]/I. Then the k-algebra homomorphisms Ak are in natural bijection with the points a=(a1,,an)kn satisfying h(a)=0 for every hI.

Facts & Assumptions

Given: A field k, an ideal Ik[x1,,xn], and the quotient algebra A=k[x1,,xn]/I.

[L1]

A k-algebra map out of a polynomial ring is determined uniquely by the images of the variables (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

Proof

technique · direct
1.1

Let ψ:Ak be a k-algebra map, and let xˉi be the class of xi in A. Put ai=ψ(xˉi). The composite k[x1,,xn]Aψk is a k-algebra map sending xi to ai, so by [L1] it is evaluation at a=(a1,,an). Since every hI maps to 0 in A, we get h(a)=0.

L1given
1.2

Conversely, let akn satisfy h(a)=0 for every hI. By [L1], evaluation at a is a k-algebra map k[x1,,xn]k, and the hypothesis says that I lies in its kernel. Therefore it factors uniquely through a k-algebra map Ak.

L1given
2.1

The two constructions are inverse because both record the same coordinate images of the classes xˉ1,,xˉn. Hence k-points of k[x1,,xn]/I are exactly its k-algebra maps to k.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

6 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