Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-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.

The Jacobian kernel computes the tangent space

Statement

Let k be any field, let n≥0 be finite, let I be an ideal of k[t1,…,tn], and put X=Spec⁡(k[t1,…,tn]/I). Let a=(a1,…,an)∈X(k), and let f1,…,fr be any finite generating list of the actual ideal I. Then the coordinate-velocity map gives a canonical k-linear isomorphism TaX≅ker⁡ ⁣(J(f1,…,fr)(a):kn⟶kr). The kernel is independent of the chosen finite generating list of I. No reducedness, perfectness, or characteristic hypothesis is needed. Finiteness of the list is available for every finite n by the finite-variable polynomial Noetherian result cited below.

Facts & Assumptions

Given: A field k, finite n≥0, an ideal I⊆k[t1,…,tn], the affine k-scheme X=Spec⁡(A) with A=k[t1,…,tn]/I, and a rational point a∈X(k), represented by its coordinate tuple (a1,…,an). Set D=k[ϵ]/(ϵ2).

[F1]

Equation rows and coordinate columns in an affine Jacobian: the equation-row Jacobian matrix uses formal monomial derivatives at a rational point and the actual scheme ideal.

[F2]

Tangent vectors at rational points are dual-number points: TaX is naturally isomorphic as a k-vector space to the fibre of based dual-number maps over a; equivalently, its vectors are the coefficient derivations of those maps.

[F3]

The affine scheme of dual numbers: D=k[ϵ]/(ϵ2), so every element is uniquely c+ϵd with c,d∈k and ϵ2=0.

[F4]

Schemes and morphisms over a base: a k-morphism commutes with the structure maps to Spec⁡k.

[F5]

Affine schemes are contravariantly equivalent to commutative rings: ring maps A→B correspond contravariantly to morphisms Spec⁡B→Spec⁡A; together with [F4], the maps over k are the k-algebra maps.

[F6]

Universal property of a polynomial ring on an arbitrary family of indeterminates: a coefficient map and assigned images of the variables determine a unique polynomial-ring homomorphism.

[F7]

A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring: a ring map from k[t1,…,tn] that kills I factors uniquely through k[t1,…,tn]/I.

[F8]

Finite-variable polynomial algebras over fields are Noetherian by finite generators: for every field and finite n, every ideal of k[t1,…,tn] has a finite generating list; the result is choice-free.

Proof

technique · direct
1.1F4F5F6F8givenalgebra

By [F8], fix a finite list f1,…,fr generating I. Since a is a k-rational point, the affine anti-equivalence [F5] and the base condition [F4] give a k-algebra map A→k. Its composite with the quotient map is evaluation at a: the polynomial universal property [F6] identifies the composite as the unique map sending tj to aj. It kills I, so fi(a)=0 for each i.

1.2F1F3F6givenalgebra

For any v=(v1,…,vn)∈kn, [F6] gives a unique k-algebra map ϕv:k[t1,…,tn]→D with tj↦aj+ϵvj. For a monomial te=∏jtjej, expansion and ϵ2=0 give te(a+ϵv)=ae+ϵ∑j:ej>0eja1e1⋯ajej−1⋯anenvj. Extending over its finitely many monomials yields p(a+ϵv)=p(a)+ϵ∑j=1n(∂p/∂tj)(a)vj; the integer ej is read in k, including in positive characteristic, and the empty sum and product conventions cover n=0.

2.1F2F3F4F5F6F7step 1.1step 1.2givenalgebra

The map ϕv kills I exactly when it kills every generator fi. By steps 1.1 and 1.2, ϕv(fi)=ϵ∑j=1n(∂fi/∂tj)(a)vj, which is zero exactly when row i of J(f1,…,fr)(a) annihilates v. Thus ϕv factors uniquely through A by [F7] exactly when J(a)v=0, and its reduction modulo ϵ is a. Conversely, any based k-morphism Spec⁡D→X corresponds by [F4, F5] to a k-algebra map A→D reducing to evaluation at a; the images of the coordinates have unique form aj+ϵvj. By [F6] its composite from the polynomial ring is ϕv, and the same calculation forces J(a)v=0. The two constructions are inverse. Their coefficient derivations depend k-linearly on v, and [F2] identifies them with TaX, proving the canonical linear isomorphism in the statement and both membership implications.

2.2F1step 1.1step 1.2algebra

Let g1,…,gs be another finite generating list of I, and write each gℓ=∑ihℓifi. The coefficient-of-ϵ formula in step 1.2 is a derivation because each ϕv is a ring homomorphism. Its product rule in each coordinate direction, together with fi(a)=0, gives dgℓ(a)=∑ihℓi(a)dfi(a), so each row of Jg(a) lies in the row span of Jf(a). Reversing the lists gives equality of row spans and hence equality of their annihilators, which are the kernels in kn. For n=0 all rows are empty and both row spans are zero.

3.1F2F3F8step 1.1step 1.2step 2.1step 2.2givenalgebra∎

The boundary cases are explicit. If X is empty there is no rational point, so the pointwise statement has no instance. If r=0, then I=(0), the matrix has no rows, and the result says TaAkn=kn. If n=0 and a rational point exists, its k-algebra map k/I→k composed with k→k/I is the identity, so I=(0); hence TaX=k0=0. In one coordinate, X=Spec⁡k[t]/(t2) at 0 has Jacobian row 2t∣0=0 (also in characteristic 2), so its tangent space is all of k, as the scheme-theoretic nilpotent structure requires. The zero vector corresponds to the constant based map tj↦aj. No AC or DC is used: the finite generating tuple is chosen for this single ideal, and no basis or family of choices is made. Steps 2.1 and 2.2 prove both directions of the kernel characterization and generator independence.

Depends on

Used by

Dependency tree · two levels

48 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