Quantcast
Viewing all articles
Browse latest Browse all 34

Triple Century Post


Does continuous mathematics impact discrete complexity?

Image may be NSFW.
Clik here to view.

Godfrey Harold Hardy was an avid fan of cricket, besides being one of the 20th Century’s most influential mathematicians. During cricket season at Oxford and Cambridge, he would work on mathematics in the morning, and then spend a long afternoon watching a match at the university cricket ground.

Today is this blog’s 300th post. In cricket terms this means we have scored a triple century and are still not out. Until recently a score in the 300′s was the highest by any individual batsman in a Test Match. Brian Lara, however, scored 400 not out for the West Indies against England in 2004. This gives us our next objective.

Cricket was invented in England but has gone global. For instance, cricket is the true national sport of India’s 1.2 billion inhabitants, and of the surrounding 355 million in Pakistan, Bangladesh, and Sri Lanka besides. This puts baseball, the subject of our last post, in some perspective.

Test Matches run for five days, with three two-hour sessions per day. Whereas baseball games have nine discrete innings of three outs apiece, and last only a few hours, Test Matches have two innings of ten outs apiece, and thus feel continuous. Drawing on some of Hardy’s work, we discuss whether continuous mathematics may have any vital impact on Image may be NSFW.
Clik here to view.
{\mathsf{P} = \mathsf{NP}}
, even though that question belongs to discrete mathematics.

I (Ken) have more material on baseball (handout used for a new-graduates welcoming outing), cricket, and how they compare (humorous) on my personal webpages.

Hardy and Cricket

Hardy himself was a good cricket batsman in his youth, and played various sports actively until a heart problem in 1939 at age 62. He also needed to be outdoors for sunshine, especially in winter. In his late forties he ranked the accomplishments he most desired to achieve in this order:

  1. Prove the Riemann Hypothesis.
  2. Make a match-winning score of 211 not-out in the last innings at The (Kennington) Oval, which traditionally hosts the last Test of a major series in England.
  3. Find an argument for the non-existence of God that would convince the general public.
  4. Be the first to climb Mount Everest.
  5. Lead a communist unified Britain and Germany.
  6. Assassinate Benito Mussolini.

Note that he did not ask for a triple century. At the time no one had scored one. The record then was 287 at the Sydney Cricket Ground by England’s Tip Foster in 1904, while the previous record had been 211 by Australia’s Billy Murdoch at The Oval in 1884. The number 211 is the first prime after 200, while being not-out (written 211*) would still make it better than Murdoch’s score.

Image may be NSFW.
Clik here to view.
*

Later the man billed as the “Babe Ruth of cricket,” Sir Donald Bradman, would hold the individual Test batting record by scoring 334 for Australia against England at Leeds in 1930. Hardy’s own reaction to Bradman’s feats, compared to England’s “Master” Sir John Hobbs, was:

Bradman is a whole class above any batsman who has ever lived: if Archimedes, Newton and Gauss remain in the Hobbs class, I have to admit the possibility of a class above them, which I find difficult to imagine. They had better be moved from now on into the Bradman class.

Bradman remained active in cricket administration and promotion and commentating well into the 1990′s. I (Ken) remember this version of a story that has become subject to Internet “phone tag”: In 1992 or 1993 as a guest on a Test telecast he was asked how much he thought he would score on a wicket that looked benign but had batsmen getting themselves out cheaply. He replied, “about 50.” Commentator: “Only 50?” Bradman: “Well, I am eighty-four years old!”

Hardy-Littlewood and Image may be NSFW.
Clik here to view.
{O,\Omega}
Notation

The computer science Donald in the Bradman class is of course Donald Knuth. Knuth credited Hardy and his longtime collaborator John E. Littlewood with introducing the “Big-Image may be NSFW.
Clik here to view.
{\Omega}
” asymptotic notation, though with the different meaning Image may be NSFW.
Clik here to view.
{f = \Omega(g) \iff f \neq o(g)}
. The difference from the currently accepted meaning

Image may be NSFW.
Clik here to view.
\displaystyle  f = \Omega(g) \iff (\exists C > 0)(\exists x_0 > 0)(\forall x \geq x_0) Cf(x) \geq g(x)

is that Image may be NSFW.
Clik here to view.
{f}
could oscillate. For instance, if Image may be NSFW.
Clik here to view.
{f(x) = g(x)\sin(x)}
, then Image may be NSFW.
Clik here to view.
{f}
would meet Hardy-Littlewood’s definition of being Image may be NSFW.
Clik here to view.
{\Omega(g)}
but not Knuth’s now-standard one.

One can similarly use trigonometric functions to define Image may be NSFW.
Clik here to view.
{f(x)}
and Image may be NSFW.
Clik here to view.
{g(x)}
for which none of Image may be NSFW.
Clik here to view.
{f = o(g)}
, Image may be NSFW.
Clik here to view.
{g = o(f)}
, and Image may be NSFW.
Clik here to view.
{f = \Theta(g)}
hold, indeed neither Image may be NSFW.
Clik here to view.
{f = O(g)}
nor Image may be NSFW.
Clik here to view.
{f = \Omega(g)}
. This is summarized by saying that “trichotomy fails” for asymptotic comparisons. However, Hardy and Littlewood proved that if one limits attention to real functions defined by arithmetic, exponentiation, and logarithms, then trichotomy does hold. Here is a “modern computer science-y” way of stating their result:

Theorem 1
Let Image may be NSFW.
Clik here to view.
{f}
and Image may be NSFW.
Clik here to view.
{g}
be defined recursively from Image may be NSFW.
Clik here to view.
{ \mathsf{Fn} }
in the grammar:

Image may be NSFW.
Clik here to view.
\displaystyle  \mathsf{Fn} ::= const | x | \mathsf{Fn}+\mathsf{Fn} | \mathsf{Fn} - \mathsf{Fn} | \mathsf{Fn}*\mathsf{Fn} | \mathsf{Fn}/\mathsf{Fn} | \mathsf{Fn}^{\mathsf{Fn}} | \log(\mathsf{Fn}).

Then either Image may be NSFW.
Clik here to view.
{f = o(g)}
, Image may be NSFW.
Clik here to view.
{f = \Theta(g)}
, or Image may be NSFW.
Clik here to view.
{g = o(f)}
.

This says that almost all of the functions we use to define complexity classes fall into a nice total linear ordering. Thus for these so-called “log-exp functions” or “Hardy-Littlewood” functions, there is no difference between their Image may be NSFW.
Clik here to view.
{\Omega}
definition and Knuth’s.

We would like to find a nice, accessible proof of this theorem. An aside, Dick used this theorem with his co-author Rich DeMillo once in a paper on independence issues surrounding the Image may be NSFW.
Clik here to view.
{\mathsf{P}=\mathsf{NP}}
question.

From Analysis to Primes

The Riemann Hypothesis itself is stated for continuous functions but has major implications for prime numbers, which are discrete. The Prime Number Theorem (PNT) was first proved via continuous analysis, before an “elementary” proof was found. The PNT states that the number Image may be NSFW.
Clik here to view.
{\pi(x)}
of prime natural numbers below the real number Image may be NSFW.
Clik here to view.
{x}
satisfies Image may be NSFW.
Clik here to view.
{\lim_{x\rightarrow\infty} (\pi(x)\ln x)/x = 1}
.

Hardy and Littlewood themselves made two notable conjectures about the distribution of prime numbers. For the first, call a set Image may be NSFW.
Clik here to view.
{H}
of Image may be NSFW.
Clik here to view.
{k}
distinct natural numbers “nice” if for every prime number Image may be NSFW.
Clik here to view.
{p}
, the number Image may be NSFW.
Clik here to view.
{v_H(p)}
of distinct values of Image may be NSFW.
Clik here to view.
{h}
mod Image may be NSFW.
Clik here to view.
{p}
for Image may be NSFW.
Clik here to view.
{h \in H}
is at most Image may be NSFW.
Clik here to view.
{p-1}
. Define

Image may be NSFW.
Clik here to view.
\displaystyle  \pi_H(x) = |\{n \leq x: (\forall h \in H)[n + h \textrm{ is prime}]\}|.

Then when Image may be NSFW.
Clik here to view.
{H = \{0\}}
, Image may be NSFW.
Clik here to view.
{\pi_H(x)}
is just Image may be NSFW.
Clik here to view.
{\pi(x)}
. Thus the following conjecture generalizes the PNT:

Conjecture 1
For every nice Image may be NSFW.
Clik here to view.
{H}
of size Image may be NSFW.
Clik here to view.
{k}
,

Image may be NSFW.
Clik here to view.
\displaystyle  \lim_{x \rightarrow\infty}\frac{\pi_H(x)(\ln x)^k}{x S_H(x)} = 1,

where

Image may be NSFW.
Clik here to view.
\displaystyle  S_H(x) = \prod_{\textrm{primes }p}\left(1 - \frac{v_H(p)}{p}\right)\left(\frac{p}{p-1}\right)^k.

The second conjecture is simpler: it is just that for any real numbers Image may be NSFW.
Clik here to view.
{x}
and Image may be NSFW.
Clik here to view.
{y}
, there are always no more primes from Image may be NSFW.
Clik here to view.
{x+1}
to Image may be NSFW.
Clik here to view.
{x+y}
than from Image may be NSFW.
Clik here to view.
{1_{\,}}
to Image may be NSFW.
Clik here to view.
{y}
. In symbols, this says

Conjecture 2
For all natural numbers Image may be NSFW.
Clik here to view.
{x}
and Image may be NSFW.
Clik here to view.
{y}
, Image may be NSFW.
Clik here to view.
{\pi(x+y) - \pi(x) \leq \pi(y)}
.

This seems obvious, since the sequence of prime numbers thins out. However, it contradicts certain cases of the first conjecture. It seems odd that Hardy-Littlewood would have advanced two mutually contradictory conjectures, but perhaps one came from Hardy while the other came from Littlewood.

From Primes to Complexity

Further versions of the Riemann Hypothesis have even more direct implications in computational complexity. The generalized Riemann hypothesis (GRH) states that for any group character Image may be NSFW.
Clik here to view.
{\chi}
on Image may be NSFW.
Clik here to view.
{\mathbb{Z}_k}
the corresponding complex L-function

Image may be NSFW.
Clik here to view.
\displaystyle  L(\chi,s) = \sum_{n = 1}^{\infty} \frac{\chi(n)}{n^2}

has all of its nontrivial zeroes on the line Image may be NSFW.
Clik here to view.
{\mathsf{Re}(s) = 1/2}
. Here Image may be NSFW.
Clik here to view.
{\chi(a)\chi(b) = \chi(ab)}
, Image may be NSFW.
Clik here to view.
{\chi(n) = \chi(n \text{ mod } k)}
, and Image may be NSFW.
Clik here to view.
{\mathsf{gcd}(n,k) > 1 \implies \chi(n) = 0}
. (We have talked about group characters on this blog before. GRH is different from the extended Riemann hypothesis (ERH) which involves zeta functions over number fields.)

Pascal Koiran proved (note erratum) that GRH places the problem of whether a set of polynomial equations has a solution over the complex numbers into the second level of the polynomial hierarchy, indeed into the Arthur-Merlin class Image may be NSFW.
Clik here to view.
{\mathsf{AM}}
.

Koiran’s main GRH-dependent technique intuitively transfers solvability over Image may be NSFW.
Clik here to view.
{\mathbb{C}}
into statements about solvability modulo many primes Image may be NSFW.
Clik here to view.
{p}
. Let Image may be NSFW.
Clik here to view.
{L}
bound the binary length of coefficients in the finite set Image may be NSFW.
Clik here to view.
{S}
of Image may be NSFW.
Clik here to view.
{s}
-many polynomial equations in Image may be NSFW.
Clik here to view.
{n}
-many variables, and let Image may be NSFW.
Clik here to view.
{d}
bound their degree. Set

Image may be NSFW.
Clik here to view.
\displaystyle  A(c) = d^{cn}s(\lceil\log_2 s\rceil + L),\qquad X(b,e) = L^b 2^{(n\log_2(nd))^e}.

Theorem 2 For any finite set Image may be NSFW.
Clik here to view.
{S}
of polynomial equations there exist Image may be NSFW.
Clik here to view.
{b,c,e > 0}
such that:

  • if the equations are not solvable over Image may be NSFW.
    Clik here to view.
    {\mathbb{C}}
    , then the number of primes Image may be NSFW.
    Clik here to view.
    {p}
    such that they are solvable over Image may be NSFW.
    Clik here to view.
    {\mathbb{Z}_p}
    is at most Image may be NSFW.
    Clik here to view.
    {A}
    ;
  • if they are solvable over Image may be NSFW.
    Clik here to view.
    {\mathbb{C}}
    , then the number of primes Image may be NSFW.
    Clik here to view.
    {p \leq X(b,e)}
    such that they are solvable over Image may be NSFW.
    Clik here to view.
    {\mathbb{Z}_p}
    is at least Image may be NSFW.
    Clik here to view.
    {8A(3 + \log_2 A)}
    .

From Continuous to Discrete

We view Koiran’s theorem as a way of translating properties of continuous mathematics into discrete domains. The theory of poles and winding numbers that is basic to complex analysis is one of the ways to connect the discrete and the continuous, while Knuth himself co-authored the book Concrete Mathematics which marries them. Three other avenues by which people are applying tools from continuous mathematics to do research on computational complexity are:

We would be interested to know of other such avenues and opinions about them. There is also some relation to the subject of “Algebrization”.

Open Problems

Is it cricket to try to get discrete-complexity consequences out of continuous mathematics?

Are there other striking applications of Koiran’s density-gap phenomenon?

What would Hardy have accomplished in computational complexity?

[fixed typo in L-function, clarified Braverman-Cook refc. and added BSS paper]


Image may be NSFW.
Clik here to view.
Image may be NSFW.
Clik here to view.

Viewing all articles
Browse latest Browse all 34

Trending Articles