Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

Multiplicity of a hypersurface equation at a rational point

Definition

Let k be any field, let n∈N, put P=k[X1,…,Xn], and let a=(a1,…,an)∈kn. Suppose 0≠f∈P and f(a)=0. Write the unique finite homogeneous decomposition

f(a1+t1,…,an+tn)=∑j≥0fj(t1,…,tn),

where fj is homogeneous of total degree j. The multiplicity of the hypersurface equation f at a, denoted mult⁡a(f), is the least j for which fj≠0.

Let ma=(X1−a1,…,Xn−an) and R=Pma=OAkn,a, with maximal ideal m=maR. For g∈R of finite order, write ord⁡m(g)=d when g∈md∖md+1. Then mult⁡a(f)=ord⁡m(f). In particular, replacing the local equation by uf for a unit u∈R× leaves its m-adic order unchanged.

This is multiplicity of the equation, unchanged under a local unit. It is not an invariant of the reduced support: for every integer r≥1, mult⁡a(fr)=rmult⁡a(f).

Facts & Assumptions

Given: A field k, a finite n∈N, a point a∈kn, and a nonzero polynomial f∈k[X1,…,Xn] with f(a)=0.

[F1]

Monomials, coefficients, degree in each variable and total degree in F[x1,…,xn]: a polynomial has a unique finite monomial expansion; grouping its monomials by total degree gives a unique finite sum of homogeneous parts.

[F2]

homogeneous polynomial and homogeneous ideal: a polynomial is homogeneous of degree d when each occurring monomial has total degree d.

[F3]

Localisation at a prime ideal: Rp=(R∖p)−1R: Pma consists of fractions g/s with s∉ma.

[F4]

R/M is a field if and only if M is a maximal ideal: P/ma is a field if and only if ma is maximal.

[F5]

Rp is local with unique maximal ideal pRp: Pma is a nonzero local ring with unique maximal ideal maPma.

[F6]

All initial forms define the tangent cone: at the rational origin of Spec⁡k[t1,…,tn], the canonical graded map from the polynomial ring to the associated graded local ring is an isomorphism; it sends each variable to its degree-one initial class.

[F7]

The associated graded ring and associated graded module of an ideal-adic filtration: multiplication in the associated graded ring is induced by multiplication in the local ring.

[F9]

A polynomial ring in finitely many indeterminates over an integral domain is an integral domain: a polynomial ring in finitely many variables over an integral domain is an integral domain.

[F10]

The stalk of the affine structure sheaf at a prime is A_p: on an affine scheme, the structure-sheaf stalk at a prime is canonically the corresponding ring localization.

[F11]

Every maximal ideal of a commutative ring is prime: every maximal ideal of a commutative ring is prime.

Proof

technique · direct
1.1F1F3F4F5F10F11givenalgebra

Translate coordinates by ti=Xi−ai: the substitution ti↦Xi−ai is a polynomial-ring isomorphism with inverse Xi↦ti+ai, and evaluation at a becomes evaluation at the origin. By [F1], the latter has kernel generated by the variables, since every monomial with zero constant term is divisible by some ti; hence its transported kernel is ma=(X1−a1,…,Xn−an). Thus P/ma≅k, so [F4] makes ma maximal and [F11] makes it prime; [F3] and [F5] identify R as a local ring with maximal ideal m. Evaluation extends to R because every denominator outside ma has nonzero value at a, and it identifies R/m with k. The affine stalk identification [F10] gives R=OAkn,a; translation identifies this filtered local ring with k[t1,…,tn](t1,…,tn).

2.1F1F2F6step 1.1givenalgebra

Write f(a+t)=∑jfj(t) as in [F1]–[F2], and let d be the least index with fd≠0; it exists because translation is an isomorphism and f≠0, and d≥1 because f(a)=0. Apply [F6] with I=0 at the rational origin: it identifies the associated graded local ring with k[t1,…,tn], taking the degree-j symbol of a polynomial to its degree-j homogeneous part. Hence f∈md and its class in md/md+1 is the nonzero polynomial fd, so f∉md+1 and its m-adic order is exactly the least degree d.

3.1F5F6F7F8F9step 2.1algebra

Let u∈R×. Its degree-zero initial class is its nonzero residue in R/m≅k, while the degree-d initial class of f is fd≠0 by step 2.1. By [F7], the initial class of uf is the product of these classes; [F8]–[F9] make the identified graded ring k[t1,…,tn] a domain, so the product is nonzero. Thus uf∈md∖md+1 and ord⁡m(uf)=d=mult⁡a(f). For r≥1, the initial class of fr is fdr, nonzero and homogeneous of degree rd in the same domain, so mult⁡a(fr)=rd.

4.1F1step 1.1step 2.1step 3.1givenalgebra∎

In one variable, f=(X−a)3+(X−a)4 has multiplicity 3, unchanged after multiplication by the local unit 1+(X−a) by step 3.1; X−a has multiplicity 1. Degree zero cannot occur for a nonzero polynomial vanishing at a, and the zero polynomial is excluded because it has no least nonzero homogeneous part. If n=0, every polynomial is constant, so no nonzero polynomial vanishes at the unique point of k0. The proof uses only the fixed coordinate translation, the unique finite polynomial expansion, and a fixed local unit; it makes no family selection and uses neither AC nor DC. There is no interval or endpoint parameter and no iff assertion in this definition.

Depends on

Used by

Dependency tree · two levels

56 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