Schinzel's hypothesis H

Schinzel's hypothesis H

In mathematics, Schinzel's hypothesis H is a very broad generalisation of conjectures such as the twin prime conjecture. It aims to define the maximum possible scope of a conjecture of the nature that a family

:"fi"("n")

of values of irreducible polynomials "f"("t") should be able to take on prime number values simultaneously, for an integer "n", that can be "as large as we please". Putting it another way, there should be infinitely many such "n", for which each of the

:"fi"("n")

are prime numbers.

Necessary limitations

Such a conjecture must be subject to some necessary conditions. For example if we take the two polynomials "x"+4 and "x"+7, there is no "n" > 0 for which "n"+4 and "n"+7 are both primes. That is because one will be an even number > 2, and the other an odd number. The main question in formulating the conjecture is to rule out this phenomenon.

Fixed divisors pinned down

This can be done by means of the concept of integer-valued polynomial. This allows us to say that an integer-valued polynomial "Q"("x") has a "fixed divisor m" if there is an integer "m" > 1 such that

:"Q"("x")/"m"

is also an integer-valued polynomial. For example, we can say that

:("x" + 4)("x" + 7)

has 2 as fixed divisor. Such fixed divisors must be ruled out of

:"Q"("x") = Π "fi"("x")

for any conjecture, since their presence is quickly seen to contradict the possibility that "fi"("n") can all be prime, with large values of "n".

Formulation of hypothesis H

Therefore the standard form of hypothesis H is that if "Q" defined as above has "no" fixed prime divisor, then all "fi"("n") will be simultaneously prime, infinitely often, for any choice of irreducible integral polynomials "fi"("x") with positive leading coefficients.

If the leading coefficients were negative, we could expect negative prime values; this is a harmless restriction, really. There is probably no real reason to restrict to integral polynomials, rather than integer-valued polynomials. The condition of having no fixed prime divisor is certainly effectively checkable in a given case, since there is an explicit basis for the integer-valued polynomials. As a simple example,

:"x2 + 1"

has no fixed prime divisor. We therefore expect that there are infinitely many primes

:"n2 + 1."

This has not been proved, though. It was one of Landau's conjectures.

Prospects and applications

The hypothesis is probably not accessible with current methods in analytic number theory, but is now quite often used to prove conditional results, for example in diophantine geometry. The conjectural result being so strong in nature, it is possible that it could be shown to be too much to expect.

Extension to include the Goldbach conjecture

The hypothesis doesn't cover Goldbach's conjecture, but a closely related version (hypothesis HN) does. That requires an extra polynomial "F"("x"), which in the Goldbach problem would just be "x", for which

:"N" − "F"("n")

is required to be a prime number, also. This is cited in Halberstam and Richert, "Sieve Methods". The conjecture here takes the form of a statement "when N is sufficiently large", and subject to the condition

:"Q"("n")("N" − "F"("n"))

has "no fixed divisor" > 1. Then we should be able to require the existence of "n" such that "N" − "F"("n") is both positive and a prime number; and with all the "fi"("n") prime numbers.

Not many cases of these conjectures are known; but there is a detailed quantitative theory (Bateman-Horn conjecture).

Local analysis

The condition of having no fixed prime divisor is purely local (depending just on primes, that is). In other words, a finite set of irreducible integer-valued polynomials with no "local obstruction" to taking infinitely many prime values is conjectured to take infinitely many prime values.

An analogue that fails

The analogous conjecture with the integers replaced by the one-variable polynomial ring over a finite field is "false". For example, Swan noted in 1962 (for reasons unrelated to Hypothesis H) thatthe polynomial

::x^8 + u^3,

over the ring F_2 [u] , is irreducible and has no fixed prime polynomial divisor (after all, its values at "x" = 0 and "x" = 1 are relatively prime polynomials) but allof its values as "x" runs over F_2 [u] , are composite. Similar examples canbe found with F_2, replaced by any finite field; the obstructions in a properformulation of Hypothesis H over "F" ["u"] , where "F" is a finite field, are nolonger just "local" but a new "global" obstruction occurs with no classical parallel.

External links

* [http://www.impan.gov.pl/User/schinzel/] for the publications of the Polish mathematician Andrzej Schinzel. The hypothesis derives from paper 25 on that list, from 1958, written with Sierpiński.


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Andrzej Schinzel — (born 1935 in Sandomierz, Poland) is a Polish mathematician, studying mainly number theory. His principal interest is the theory of polynomials. He is a professor at the Institute of Mathematics of the Polish Academy of Sciences (IM PAN). A… …   Wikipedia

  • Hypothèse H de Schinzel — En mathématiques, l hypothèse H de Schinzel est une très large généralisation de conjectures telles que la conjecture des nombres premiers jumeaux. Elle a pour objectif de donner une condition suffisante la plus faible possible sur la nature d… …   Wikipédia en Français

  • Hypothese H de Schinzel — Hypothèse H de Schinzel En mathématiques, l hypothèse H de Schinzel est une très large généralisation de conjectures telles que la conjecture des nombres premiers jumeaux. Elle a pour objectif de définir l envergure maximale possible d une… …   Wikipédia en Français

  • Hypothèse H De Schinzel — En mathématiques, l hypothèse H de Schinzel est une très large généralisation de conjectures telles que la conjecture des nombres premiers jumeaux. Elle a pour objectif de définir l envergure maximale possible d une conjecture sur la nature qu… …   Wikipédia en Français

  • Hypothèse h de schinzel — En mathématiques, l hypothèse H de Schinzel est une très large généralisation de conjectures telles que la conjecture des nombres premiers jumeaux. Elle a pour objectif de définir l envergure maximale possible d une conjecture sur la nature qu… …   Wikipédia en Français

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • List of conjectures — This is an incomplete list of mathematical conjectures. They are divided into four sections, according to their status in 2007. See also: * Erdős conjecture, which lists conjectures of Paul Erdős and his collaborators * Unsolved problems in… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Cunningham chain — In mathematics, a Cunningham chain is a certain sequence of prime numbers. Cunningham chains are named after mathematician A. J. C. Cunningham. They are also called chains of nearly doubled primes. A Cunningham chain of the first kind of length n …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”