Weierstrass preparation and division

Human source and reuse terms. The preparation, division and local parametrization treatment below is adapted from Jean-Pierre Demailly, Complex Analytic and Differential Geometry, version of 21 June 2012. Demailly remains the author of that treatment. His publication page describes the book as OpenContent and expressly permits printing, spreading and modifying it on the web, except claiming authorship. This is the author's custom grant; no Creative Commons licence is substituted for it. This adapted lesson is distributed under that grant and is excluded from the course's CC0 dedication.

Adaptation. GPT-6.1 Sol (OpenAI), Ultra, October 2026, reorganized and transcribed the selected arguments into this course's notation, supplied elementary algebra details and a Cauchy extension argument, expanded the passage from germs to global components and constant rank, and wrote the exercises and solutions. These additions are identified below. Demailly attributes the Cauchy division method to C. L. Siegel. This is an adaptation with added explanations, not an independently authored replacement of Demailly's treatment. The additions are self-checked by the writing AI; not every result they depend on, directly or through earlier results, is proved in these lessons.

This selection retains the existing preparation and Cauchy division proofs. Demailly’s authorship and custom terms remain in force. The algebraic consequences and unrelated exercises are outside this selected component.

The supplied contour foundation, §§16.1–16.6, gives power series, isolated zeros, jointly holomorphic integrals, winding, finite-pole residues and the maximum principle. Polynomial roots, §9, supplies all multiplicities. The finite symmetric-coefficient identity is proved in the receiving note below.

Preparation by the zeros in one fibre

This section adapts Demailly's preparation argument. Let and suppose , with , has a zero of finite order at zero. Choose a small vertical circle without zeros and then a small base polydisc so that on an annulus about that circle. The argument principle gives

Each is holomorphic in . The integer is continuous and hence constant, equal to . For , is the power sum of the fibre zeros, counted with multiplicity. Newton's identities express their elementary symmetric functions as holomorphic functions. Thus the monic polynomial

has exactly the zeros of inside the circle, with the same multiplicities. On each fibre both and have removable singularities. Their Cauchy integrals over the fixed circle make these extensions jointly holomorphic. They remain inverse to one another by the identity theorem. Consequently , where is a holomorphic unit. Uniqueness follows from the zeros and the monic normalization.

Division, finite generation and elementary algebra

Demailly's division proof uses the following Cauchy formula. For as in (3) and a holomorphic , shrink so that is holomorphic on a neighbourhood of the closed adapted polydisc. Define

The Cauchy formula gives ; the difference quotient makes a polynomial in of degree less than , with holomorphic coefficients in . Uniqueness follows on each fibre: if a polynomial of degree less than is divisible by as a holomorphic function, it has all zeros with multiplicity and is zero. The quotient is then zero as well.

The division can be performed on a common smaller polydisc for all bounded holomorphic . On the boundary annulus, has a fixed positive lower bound. Formula (4) bounds by a constant times the supremum of . Then has the same kind of boundary bound, which extends to the interior by the maximum principle on each vertical disc. The constant depends on and the polydiscs, not on .

Receiving details and finite symmetric coefficients

AN-01 receiving note, GPT-6 Astra (OpenAI), Ultra, October 2026; CC0 additions. The two preceding adapted arguments retain Demailly's terms.

The zero-free annulus and compactness put only finitely many isolated zeros in each fibre disk. Factoring their local power series gives the residue of at a zero of order as , with for . The supplied residue theorem therefore proves the integer count and every moment in (2), without presuming continuously labelled roots. The dominated product-circle argument proves joint holomorphy of every parameter integral. At a common zero, cancel the same power of in the two local series; their remaining constant coefficients are nonzero. This proves both fibrewise removable quotients used above.

For uniqueness as germs, choose a common small product on which both proposed units are nonzero. The coefficients of either monic polynomial vanish at the base mark. For any fixed small , shrink the base so that

For , the lower terms then have total modulus strictly below ; hence every root of either polynomial lies in . Their roots with multiplicities equal those of the original function there. Full complex factorization and monicity make the polynomials equal; cancellation off their zeros and continuity make the units equal. This also proves the fibrewise multiplicity argument for uniqueness of division. On a common smaller polydisc, fixed-contour denominators are uniformly bounded away from zero, proving the asserted bounds for bounded dividends. Dividing the polynomial quotient by the original unit gives division by the original function.

The following finite identity is the unchanged AN-01 symmetric-coefficient proof. It does not use preparation or root continuity.

A finite identity that does not distinguish repeated roots

For any list , repetitions allowed, define

The indices in the definition of select occurrences in the list, even when their values coincide. Set for . The finite Newton identities are

Proof. Work first in the polynomial ring , treating the as indeterminates. Introduce a formal variable and the finite polynomial

Each factor has constant coefficient one, so it is invertible in , with formal inverse . Formal differentiation of the finite product gives

Equality of the coefficients of is exactly (N2). There is no analytic convergence or division by a root. To make the argument entirely finite, truncate each geometric inverse after degree and work modulo ; its product with is one modulo . This determines all the coefficients used in (N2). Finally specialize the indeterminates to the given complex numbers. Polynomial identities remain valid when values coincide or vanish.

Since division by the positive integer is allowed in , (N2) recursively expresses every , , as a polynomial with rational coefficients in . For indices not exceeding ,

For the descending coefficients of

we have and . Thus the equivalent coefficient recursion is

For example, where the indices do not exceed , , , and . These signs correspond to the factors .