Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Reduced preparation has nonzero discriminant

Statement

Let n≥1, let f∈OCn,p be a reduced nonzero nonunit germ that is regular in the last variable of order d after the page's translation convention, and let

f=uW

be its Weierstrass preparation, with u a unit and W a Weierstrass polynomial of degree d. Put K:=Frac⁡(On−1,0) for n≥2 and K:=C=Frac⁡(O0,0) for n=1. Then W is square-free in K[T]: no irreducible element of K[T] divides W twice. Consequently

DW(z′):=Disc⁡T(W)∈On−1,0

is a nonzero holomorphic base germ.

Facts & Assumptions

Given: A reduced nonzero nonunit germ f that is regular in the last variable of order d, its preparation f=uW, and K=Frac⁡(On−1,0) (with O0,0=C).

[F1]

Reducedness means that no irreducible element of OCn,p divides f twice (Reduced holomorphic germ for a hypersurface).

[F2]

The germ ring is a unique factorisation domain, so every nonzero nonunit has a factorisation into finitely many irreducibles, unique up to order and associates (The ring of holomorphic germs is a UFD, Unique factorisation domain).

[F3]

Weierstrass preparation: a germ regular in the last variable of order d is a unit times a Weierstrass polynomial W of degree d, and the Weierstrass polynomial of a preparation of a fixed regular germ is unique (Weierstrass preparation theorem, Uniqueness in Weierstrass preparation, Weierstrass polynomials in the last variable).

[F4]

Prepared factorisations: if f=gh and f=uW is the preparation of f, then g,h are regular in the last variable and W=GH for their preparations; conversely a factorisation of W into Weierstrass polynomials of positive degree gives a nontrivial factorisation of f. Consequently g is irreducible in On,0 exactly when its prepared Weierstrass polynomial is irreducible in On−1,0[T] (Prepared factorizations correspond to germ factorizations).

[F5]

Gauss's lemma: over a unique factorisation domain R with fraction field K, a primitive positive-degree polynomial is irreducible in R[x] if and only if it is irreducible in K[x], and a product of primitive polynomials is primitive (Gauss lemma over a UFD, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

[F6]

For every field F, the polynomial ring F[T] is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

[F7]

The discriminant of a monic polynomial is the coefficient expression Disc⁡(W)=Dd(−a1,a2,…,(−1)dad), and in a splitting field with W=∏i(T−αi) it equals ∏i<j(αi−αj)2; it vanishes exactly when W has a repeated root (The discriminant of a monic polynomial as the coefficient expression of Δn2, The discriminant is ∏i<j(αi−αj)2 and vanishes exactly when a monic polynomial has a repeated root).

[F8]

K is a field containing the constant germs, hence of characteristic 0, and a characteristic-zero field is perfect; over a perfect field every nonconstant irreducible polynomial is separable, that is, has no repeated root in any extension field (A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective, Perfect fields: every irreducible polynomial is separable, Repeated roots in extension fields and separable polynomials, Frac⁡(D) is a field and d↦d/1 embeds the integral domain D, The ring of holomorphic germs at 0 and its maximal ideal).

[F9]

Bézout for polynomials: for f,g∈F[x] not both zero with monic gcd d there are A,B with Af+Bg=d (Bézout identity and the Euclidean algorithm for polynomials over a field).

Proof technique: direct — factor f in the germ UFD, prepare each irreducible factor, and read square-freeness of W in K[T].

Proof

1.1givenF1F2

By [F1] and [F2] write f=u∏i=1rpi with r≥1, the pi irreducible and pairwise nonassociate, and no irreducible factor repeated.

2.1step 1.1F3F4

For each i factor f=pi hi with hi:=u∏j≠ipj. By [F4] both pi and hi are regular in the last variable, the preparation f=uW satisfies W=WiVi where pi=uiWi and hi=viVi are preparations, and pi is a nonunit, so its order di=deg⁡Wi is at least 1.

3.1step 2.1F3F4F5

Applying the consequence in [F4] to the irreducible pi shows that Wi is irreducible in On−1,0[T]. Each Wi is monic by [F3], hence primitive, so by Gauss's lemma [F5] Wi is irreducible in K[T].

4.1step 2.1step 3.1

The Wi are pairwise distinct: if Wi=Wj for i≠j, then pi=uiWi=uiuj−1pj makes pi and pj associates, contradicting step 1.1.

5.1step 1.1step 2.1step 4.1F3

The product ∏i=1rWi is a Weierstrass polynomial: it is monic of degree ∑idi with coefficients in On−1,0, and at z′=0 each factor equals Tdi by [F3], so the product equals T∑idi. Since step 2.1 gives f=(u∏iui)∏iWi and f=uW is a preparation, uniqueness of the prepared polynomial [F3] yields W=∏i=1rWi.

6.1step 4.1step 5.1F6

Hence W is square-free in K[T]: an irreducible P∈K[T] dividing W twice would, by uniqueness of factorisation in the UFD K[T] from [F6], be associate to two of the distinct monic irreducibles Wi; being monic it would equal both, contradicting step 4.1.

7.1step 3.1step 4.1step 6.1F7F9

For the discriminant, let E be a splitting field of W over K and write W=∏k=1d(T−αk) as in [F7]. The roots of W are the roots of the factors Wi. Two distinct factors Wi,Wj are coprime in K[T]: their monic gcd divides the irreducible Wi, so it is 1 or an associate of Wi, and in the second case it would also be an associate of Wj, forcing Wi=Wj; thus 1=AWi+BWj for some A,B∈K[T] by [F9], and a common root would give 1=0. A root of exactly one factor Wi that were repeated for W would be a repeated root of Wi, since the complementary product does not vanish there.

8.1step 7.1F7F8

Each Wi is separable by step 3.1 and [F8], so it has no repeated root in the extension E; combined with step 7.1, all roots α1,…,αd of W in E are pairwise distinct. The root formula in [F7] then gives Disc⁡T(W)=∏k<l(αk−αl)2≠0 in K.

9.1step 5.1step 8.1F3F7∎

Finally, Disc⁡T(W) is the coefficient expression Dd(−a1,…,(−1)dad) in the coefficients aj∈On−1,0 of W by [F7], hence is a holomorphic base germ DW∈On−1,0; since it is nonzero as an element of K=Frac⁡(On−1,0) by step 8.1, it is a nonzero germ.

Depends on

Used by

Dependency tree · two levels

59 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