Misplaced Pages

Bernstein–Sato polynomial

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from B-function) Polynomial related to differential operators
This article includes inline citations, but they are not properly formatted. Please improve this article by correcting them. Parenthetical referencing has been deprecated; convert to shortened footnotes. (May 2024) (Learn how and when to remove this message)

In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990). It is also known as the b-function, the b-polynomial, and the Bernstein polynomial, though it is not related to the Bernstein polynomials used in approximation theory. It has applications to singularity theory, monodromy theory, and quantum field theory.

Severino Coutinho (1995) gives an elementary introduction, while Armand Borel (1987) and Masaki Kashiwara (2003) give more advanced accounts.

Definition and properties

If f ( x ) {\displaystyle f(x)} is a polynomial in several variables, then there is a non-zero polynomial b ( s ) {\displaystyle b(s)} and a differential operator P ( s ) {\displaystyle P(s)} with polynomial coefficients such that

P ( s ) f ( x ) s + 1 = b ( s ) f ( x ) s . {\displaystyle P(s)f(x)^{s+1}=b(s)f(x)^{s}.}

The Bernstein–Sato polynomial is the monic polynomial of smallest degree amongst such polynomials b ( s ) {\displaystyle b(s)} . Its existence can be shown using the notion of holonomic D-modules.

Kashiwara (1976) proved that all roots of the Bernstein–Sato polynomial are negative rational numbers.

The Bernstein–Sato polynomial can also be defined for products of powers of several polynomials (Sabbah 1987). In this case it is a product of linear factors with rational coefficients.

Nero Budur, Mircea Mustață, and Morihiko Saito (2006) generalized the Bernstein–Sato polynomial to arbitrary varieties.

Note, that the Bernstein–Sato polynomial can be computed algorithmically. However, such computations are hard in general. There are implementations of related algorithms in computer algebra systems RISA/Asir, Macaulay2, and SINGULAR.

Daniel Andres, Viktor Levandovskyy, and Jorge Martín-Morales (2009) presented algorithms to compute the Bernstein–Sato polynomial of an affine variety together with an implementation in the computer algebra system SINGULAR.

Christine Berkesch and Anton Leykin (2010) described some of the algorithms for computing Bernstein–Sato polynomials by computer.

Examples

  • If f ( x ) = x 1 2 + ⋯ + x n 2 {\displaystyle f(x)=x_{1}^{2}+\cdots +x_{n}^{2}\,} then
∑ i = 1 n ∂ i 2 f ( x ) s + 1 = 4 ( s + 1 ) ( s + n 2 ) f ( x ) s {\displaystyle \sum _{i=1}^{n}\partial _{i}^{2}f(x)^{s+1}=4(s+1)\left(s+{\frac {n}{2}}\right)f(x)^{s}}
so the Bernstein–Sato polynomial is
b ( s ) = ( s + 1 ) ( s + n 2 ) . {\displaystyle b(s)=(s+1)\left(s+{\frac {n}{2}}\right).}
  • If f ( x ) = x 1 n 1 x 2 n 2 ⋯ x r n r {\displaystyle f(x)=x_{1}^{n_{1}}x_{2}^{n_{2}}\cdots x_{r}^{n_{r}}} then
∏ j = 1 r ∂ x j n j f ( x ) s + 1 = ∏ j = 1 r ∏ i = 1 n j ( n j s + i ) f ( x ) s {\displaystyle \prod _{j=1}^{r}\partial _{x_{j}}^{n_{j}}\quad f(x)^{s+1}=\prod _{j=1}^{r}\prod _{i=1}^{n_{j}}(n_{j}s+i)\quad f(x)^{s}}
so
b ( s ) = ∏ j = 1 r ∏ i = 1 n j ( s + i n j ) . {\displaystyle b(s)=\prod _{j=1}^{r}\prod _{i=1}^{n_{j}}\left(s+{\frac {i}{n_{j}}}\right).}
  • The Bernstein–Sato polynomial of x + y is
( s + 1 ) ( s + 5 6 ) ( s + 7 6 ) . {\displaystyle (s+1)\left(s+{\frac {5}{6}}\right)\left(s+{\frac {7}{6}}\right).}
  • If tij are n variables, then the Bernstein–Sato polynomial of det(tij) is given by
( s + 1 ) ( s + 2 ) ⋯ ( s + n ) {\displaystyle (s+1)(s+2)\cdots (s+n)}
which follows from
Ω ( det ( t i j ) s ) = s ( s + 1 ) ⋯ ( s + n − 1 ) det ( t i j ) s − 1 {\displaystyle \Omega (\det(t_{ij})^{s})=s(s+1)\cdots (s+n-1)\det(t_{ij})^{s-1}}
where Ω is Cayley's omega process, which in turn follows from the Capelli identity.

Applications

f ( x ) s = 1 b ( s ) P ( s ) f ( x ) s + 1 . {\displaystyle f(x)^{s}={1 \over b(s)}P(s)f(x)^{s+1}.}
It may have poles whenever b(s + n) is zero for a non-negative integer n.
  • If f(x) is a polynomial, not identically zero, then it has an inverse g that is a distribution; in other words, f g = 1 as distributions. If f(x) is non-negative the inverse can be constructed using the Bernstein–Sato polynomial by taking the constant term of the Laurent expansion of f(x) at s = −1. For arbitrary f(x) just take f ¯ ( x ) {\displaystyle {\bar {f}}(x)} times the inverse of f ¯ ( x ) f ( x ) . {\displaystyle {\bar {f}}(x)f(x).}
  • The Malgrange–Ehrenpreis theorem states that every differential operator with constant coefficients has a Green's function. By taking Fourier transforms this follows from the fact that every polynomial has a distributional inverse, which is proved in the paragraph above.
  • Pavel Etingof (1999) showed how to use the Bernstein polynomial to define dimensional regularization rigorously, in the massive Euclidean case.
  • The Bernstein-Sato functional equation is used in computations of some of the more complex kinds of singular integrals occurring in quantum field theory Fyodor Tkachov (1997). Such computations are needed for precision measurements in elementary particle physics as practiced for instance at CERN (see the papers citing (Tkachov 1997)). However, the most interesting cases require a simple generalization of the Bernstein-Sato functional equation to the product of two polynomials ( f 1 ( x ) ) s 1 ( f 2 ( x ) ) s 2 {\displaystyle (f_{1}(x))^{s_{1}}(f_{2}(x))^{s_{2}}} , with x having 2-6 scalar components, and the pair of polynomials having orders 2 and 3. Unfortunately, a brute force determination of the corresponding differential operators P ( s 1 , s 2 ) {\displaystyle P(s_{1},s_{2})} and b ( s 1 , s 2 ) {\displaystyle b(s_{1},s_{2})} for such cases has so far proved prohibitively cumbersome. Devising ways to bypass the combinatorial explosion of the brute force algorithm would be of great value in such applications.

Notes

  1. Warning: The inverse is not unique in general, because if f has zeros then there are distributions whose product with f is zero, and adding one of these to an inverse of f is another inverse of f.

References

Categories: