Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 SA and Xkn, define

V(S):={akn:f(a)=0 for every fS},

I(X):={fA:f(a)=0 for every aX}.

Then V and I reverse inclusion and satisfy

XV(S)SI(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 Sk[x1,,xn], and a subset Xkn.

[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 φ:RS, 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 φ ⁣:RS, and sS, 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.1

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

F1F2F3inductionconstruct
2.1

The zero polynomial lies in I(X). If f,gI(X) and rA, then step 1.1 gives (fg)(a)=00=0 and (rf)(a)=r(a)0=0 for every aX, so [F5] makes I(X) an ideal.

step 1.1F4F5algebra
2.2

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

step 1.1given
2.3

By the two displayed definitions, XV(S) means exactly that f(a)=0 for every aX and fS, which means exactly that SI(X).

step 1.1given
3.1

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.

step 2.2step 2.3F6
3.2

Applying step 2.3 to S and V(S) gives SI(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.

step 2.2step 2.3
4.1

Dually, XV(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.

step 2.2step 2.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 37 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources