Bounds for the degrees and heights in the division problem (Q1330165): Difference between revisions

The following result is proved: Theorem. Let \(P_ 1, \dots, P_ m \in \mathbb{Z} [z_ 1, \dots, z_ n]\) of degrees \(D_ 1 \geq D_ 2 \geq \cdots \geq D_ m\) and logarithmic heights less than \(h\), which define a complete intersection in \(\mathbb{C}^ n\). Let also \(Q \in \mathbb{Z} [z_ 1, \dots, z_ n]\) be of degree \(D_ Q\) and logarithmic height \(h_ Q\) belonging to the ideal generated by \((P_ 1, \dots, P_ m)\) in \(\mathbb{Q} [z_ 1, \dots, z_ n]\). Then there exists \(A_ 1, \dots, A_ m \in \mathbb{Z} [z_ 1, \dots, z_ n]\) and \(\delta \in \mathbb{N}^*\) such that: \(\delta Q = A_ 1P_ 1 + \cdots + A_ mP_ m\) with the estimates: \[ \deg A_ i \leq 2D_ Q + k(n) \prod D_ i, \] \[ \log \delta \leq k(n) D^ a(\prod D_ i)^ b (D_ Q + \prod D_ i)^ c (h + D \log D), \] \[ h(A_ i) \leq k(n) \Bigl \{ D^ a (\prod D_ i)^ b (D_ Q + \prod D_ i)^ c (h + D \log D) + h_ Q \Bigr\}. \] Here \(k(n)\) is a constant effectively computable and depending only on \(n\) while \(a,b,c\) do not depend on \(n\). Recall that for \(P = \sum c_ \alpha z^ \alpha\) the logarithmic height is \(\log (\max_ \alpha \{ | c_ \alpha |\}\). The proof of the theorem relies on analytic methods (the Cauchy-Weil formula and Grothendieck's theory of multidimensional residues).