Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pendingjudge pass (gpt-6-luna)
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.

Local relations among Weierstrass polynomials reduce to bounded degree

Statement

Let n,q,d≥1 be integers, let U′⊆Cn−1 and D⊆C be polydiscs centered at 0, and let w denote the last coordinate. For 1≤j≤q, write Pj(x′,w)=wej+∑k=0ej−1ajk(x′)wk, where 1≤ej≤d, ajk∈O(U′), and ajk(0)=0. For every x=(x′,w0)∈U′×D, each germ in the relation sheaf of (P1,…,Pq) at x is an OU′×D,x-linear combination of relation germs whose components are polynomials in w−w0 of degree at most d with coefficients in OU′,x′.

Facts & Assumptions

Given: The product polydisc, the monic Weierstrass polynomials Pj, and a point x=(x′,w0).

[F1]

Coherent module sheaves on complex manifolds: a relation germ of (P1,…,Pq) is a tuple g=(g1,…,gq) of holomorphic germs satisfying ∑j=1qgjPj=0.

[F2]

Weierstrass polynomials in the last variable: each Pj has the stated monic polynomial form, with positive finite degree and lower coefficients vanishing at the common center 0.

[F3]

Weierstrass preparation theorem: a germ regular in w of order r is a unit times a monic Weierstrass polynomial of degree r.

[F4]

Weierstrass division theorem: division by a monic Weierstrass polynomial has a unique holomorphic quotient and a unique polynomial remainder of smaller degree.

[F5]

A continuous separately holomorphic function is the sum of an absolutely convergent power series with Cauchy-integral coefficients on every smaller polydisc and The coefficients of a convergent multi-indexed power series are its derivative coefficients, hence unique: a holomorphic germ has a convergent power series with uniquely determined coefficients; the product of two nonzero germs is nonzero because the product of their first nonzero homogeneous terms is a nonzero polynomial.

[F6]

Regular holomorphic germs in the last variable: regularity in w−w0 of order r means the restriction to the w-line has a zero of exact finite order r.

Proof

1.1F1F2F5givenalgebra

If q=1, a relation germ g satisfies gP1=0 by [F1]. The polynomial P1 is nonzero by [F2], and [F5] makes the ring of holomorphic germs an integral domain, so g=0, which is already a polynomial relation of bounded degree.

1.2F1F2givenconstructalgebra

Suppose q≥2. If Pq(x)≠0, then Pq is a unit germ. For every relation g=(g1,…,gq), [F1] gives gq=−∑j<qgjPj/Pq, hence g=∑j<q(gj/Pq)(Pqej−Pjeq). Each vector Pqej−Pjeq is a relation whose component degrees are at most d.

1.3F2F3F4F6givenconstruct

Suppose Pq(x)=0, and set e=deg⁡wPq≤d. Let r≥1 be its order of vanishing in w−w0; this is finite and at most e≤d by [F2, F6]. By [F3], after shrinking near x write Pq=up, where u is a holomorphic unit and p is a monic Weierstrass polynomial of degree r in w−w0. Ordinary polynomial division of Pq by the monic polynomial p gives a polynomial quotient and a remainder of degree below r. The division pair (u,0) also represents Pq as a holomorphic germ divided by p; uniqueness in [F4] makes the polynomial remainder zero and identifies the polynomial quotient with u. Since Pq and p are monic of degrees e and r, respectively, this polynomial u has degree e−r≤d−r and remains a unit near x.

2.1F1F2F4step 1.3algebra∎

Let g=(g1,…,gq) be a relation germ at x. For j<q, divide by p using [F4] to write gj=tjp+rj, where tj is holomorphic and rj is a polynomial in w−w0 of degree below r. Set αj=tj/u and vj=Pqej−Pjeq. Then δ=g−∑j<qαjvj is a relation whose first q−1 components are rj. Its last component satisfies p(uδq)=−∑j<qrjPj, whose right-hand side is a polynomial of degree at most d+r−1. Dividing this polynomial by p and using uniqueness [F4] shows that uδq is a polynomial of degree at most d−1. Each urj also has degree at most d−1, since deg⁡u=e−r≤d−r and deg⁡rj<r. Thus uδ is a polynomial relation with all component degrees at most d, and g=∑j<qαjvj+u−1(uδ) is generated by polynomial relation germs of the required bound.

Remarks

The unit u is retained throughout the relation reduction. Dividing by p produces gj=tjp+rj, while the elementary relation uses Pq=up; therefore its coefficient is tj/u. This explicit normalization is needed for the remaining components to be polynomial.

Depends on

Dependency tree · 2 levels

Sources