Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16
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.

Vanishing sets and vanishing ideals form a contravariant Galois connection

Example

Let k be a field and A=k[x1,…,xn]. For S⊆A and X⊆kn, define

V(S):={a∈kn:f(a)=0 for every f∈S},

I(X):={f∈A:f(a)=0 for every a∈X}.

Then V and I reverse inclusion and satisfy

X⊆V(S)⟺S⊆I(X).

They therefore form a contravariant Galois connection. Moreover VIV=V and IVI=I.

Facts & Assumptions

Given: A field k, a natural number n, a subset S⊆k[x1,…,xn], and a subset X⊆kn.

[F1]

Multivariate polynomial rings are defined recursively by R[x1,…,x0]=R and R[x1,…,xn+1]=R[x1,…,xn][xn+1], with commuting indeterminates (Polynomial rings in finitely many commuting indeterminates by iteration).

[F2]

For f=∑iaixi and a unital homomorphism φ:R→S, evaluation is fφ(s)=∑iφ(ai)si, and a root is an s at which this value is zero (Evaluation and roots of a polynomial in a commutative target ring).

[F3]

For commutative rings R,S, a unital ring homomorphism φ ⁣:R→S, and s∈S, there is a unique unital ring homomorphism ev⁡φ,s ⁣:R[x]→S extending φ on constant polynomials and sending x to s (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F4]

In a commutative ring, an ideal is an additive subgroup closed under multiplication by arbitrary ring elements (Left, right and two-sided ideals).

[F5]

A nonempty subset is an ideal exactly when it is closed under differences and multiplication by ring elements (Ideal criteria and intersections of ideals).

[F6]

Mutually left and right adjoint contravariant functors are characterized by a natural correspondence of arrows with both variances reversed (Mutually left and mutually right adjoint contravariant functors).

Verification

technique · direct
1.1F1F2F3inductionconstruct

Simultaneous evaluation. For a=(a1,…,an)∈kn define ev⁡a ⁣:A→k by induction on n. For n=0, [F1] gives A=k and ev⁡a=1k. For the step, [F1] gives k[x1,…,xn]=k[x1,…,xn−1][xn], so [F3] applied with φ=ev⁡(a1,…,an−1) and s=an yields a unital ring homomorphism ev⁡a ⁣:A→k fixing k and sending each xi to ai; on a single indeterminate its formula is that of [F2]. Write f(a):=ev⁡a(f). Being a ring homomorphism, ev⁡a satisfies (f−g)(a)=f(a)−g(a) and (rf)(a)=r(a)f(a).

2.1step 1.1F4F5algebra

The zero polynomial lies in I(X). If f,g∈I(X) and r∈A, then step 1.1 gives (f−g)(a)=0−0=0 and (rf)(a)=r(a)⋅0=0 for every a∈X, so [F5] makes I(X) an ideal.

2.2step 1.1given

If S⊆T, every common zero of T is a common zero of S, so V(T)⊆V(S). If X⊆Y, every polynomial vanishing on Y vanishes on X, so I(Y)⊆I(X).

2.3step 1.1given

By the two displayed definitions, X⊆V(S) means exactly that f(a)=0 for every a∈X and f∈S, which means exactly that S⊆I(X).

3.1step 2.2step 2.3F6

Regard subsets and ideals as inclusion preorders. Steps 2.2 and 2.3 give the contravariant arrow correspondence required by [F6], hence V and I form the claimed Galois connection.

3.2step 2.2step 2.3

Applying step 2.3 to S and V(S) gives S⊆I(V(S)), hence V(I(V(S)))⊆V(S) by step 2.2; the reverse inclusion holds because every polynomial in I(V(S)) vanishes on V(S). Thus VIV=V.

4.1step 2.2step 2.3∎

Dually, X⊆V(I(X)) and inclusion reversal give I(V(I(X)))⊆I(X), while the opposite inclusion follows from the definition of V(I(X)). Thus IVI=I.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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