Brjuno number

Last updated

In mathematics, a Brjuno number (sometimes spelled Bruno or Bryuno) is a special type of irrational number named for Russian mathematician Alexander Bruno, who introduced them in Brjuno (1971).

Contents

Formal definition

An irrational number is called a Brjuno number when the infinite sum

converges to a finite number.

Here:

Examples

Consider the golden ratio 𝜙:

Then the nth convergent can be found via the recurrence relation: [1]

It is easy to see that for , as a result

and since it can be proven that for any irrational number, 𝜙 is a Brjuno number. Moreover, a similar method can be used to prove that any irrational number whose continued fraction expansion ends with a string of 1's is a Brjuno number. [2]

By contrast, consider the constant with defined as

Then , so we have by the ratio test that diverges. is therefore not a Brjuno number. [3]

Importance

The Brjuno numbers are important in the one–dimensional analytic small divisors problems. Bruno improved the diophantine condition in Siegel's Theorem, showed that germs of holomorphic functions with linear part are linearizable if is a Brjuno number. Jean-ChristopheYoccoz  ( 1995 ) showed in 1987 that this condition is also necessary, and for quadratic polynomials is necessary and sufficient.

Properties

Intuitively, these numbers do not have many large "jumps" in the sequence of convergents, in which the denominator of the (n + 1)th convergent is exponentially larger than that of the nth convergent. Thus, in contrast to the Liouville numbers, they do not have unusually accurate diophantine approximations by rational numbers.

Brjuno function

Brjuno sum

The Brjuno sum or Brjuno function is

where:

Real variant

Brjuno function Brjuno function.png
Brjuno function

The real Brjuno function is defined for irrational numbers [4]

and satisfies

for all irrational between 0 and 1.

Yoccoz's variant

Yoccoz's variant of the Brjuno sum defined as follows: [5]

where:

This sum converges if and only if the Brjuno sum does, and in fact their difference is bounded by a universal constant.

See also

Related Research Articles

<span class="mw-page-title-main">Algebraic number</span> Complex number that is a root of a non-zero polynomial in one variable with rational coefficients

An algebraic number is a number that is a root of a non-zero polynomial in one variable with integer coefficients. For example, the golden ratio, , is an algebraic number, because it is a root of the polynomial x2x − 1. That is, it is a value for x for which the polynomial evaluates to zero. As another example, the complex number is algebraic because it is a root of x4 + 4.

<span class="mw-page-title-main">Natural logarithm</span> Logarithm to the base of the mathematical constant e

The natural logarithm of a number is its logarithm to the base of the mathematical constant e, which is an irrational and transcendental number approximately equal to 2.718281828459. The natural logarithm of x is generally written as ln x, logex, or sometimes, if the base e is implicit, simply log x. Parentheses are sometimes added for clarity, giving ln(x), loge(x), or log(x). This is done particularly when the argument to the logarithm is not a single symbol, so as to prevent ambiguity.

A simple or regular continued fraction is a continued fraction with numerators all equal one, and denominators built from a sequence of integer numbers. The sequence can be finite or infinite, resulting in a finite continued fraction like

In number theory, a Liouville number is a real number with the property that, for every positive integer , there exists a pair of integers with such that

In mathematics, a power series is an infinite series of the form where an represents the coefficient of the nth term and c is a constant called the center of the series. Power series are useful in mathematical analysis, where they arise as Taylor series of infinitely differentiable functions. In fact, Borel's theorem implies that every power series is the Taylor series of some smooth function.

<span class="mw-page-title-main">Euler's constant</span> Constant value used in mathematics

Euler's constant is a mathematical constant, usually denoted by the lowercase Greek letter gamma, defined as the limiting difference between the harmonic series and the natural logarithm, denoted here by log:

<span class="mw-page-title-main">Diophantine approximation</span> Rational-number approximation of a real number

In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria.

In mathematics, smooth functions and analytic functions are two very important types of functions. One can easily prove that any analytic function of a real argument is smooth. The converse is not true, as demonstrated with the counterexample below.

The Basel problem is a problem in mathematical analysis with relevance to number theory, concerning an infinite sum of inverse squares. It was first posed by Pietro Mengoli in 1650 and solved by Leonhard Euler in 1734, and read on 5 December 1735 in The Saint Petersburg Academy of Sciences. Since the problem had withstood the attacks of the leading mathematicians of the day, Euler's solution brought him immediate fame when he was twenty-eight. Euler generalised the problem considerably, and his ideas were taken up more than a century later by Bernhard Riemann in his seminal 1859 paper "On the Number of Primes Less Than a Given Magnitude", in which he defined his zeta function and proved its basic properties. The problem is named after Basel, hometown of Euler as well as of the Bernoulli family who unsuccessfully attacked the problem.

A continued fraction is a mathematical expression that can be writen as a fraction with a denominator that is a sum that contains another simple or continued fraction. Depending on whether this iteration terminates with a simple fraction or not, the continued fraction is finite or infinite.

<span class="mw-page-title-main">Lambert series</span> Mathematical term

In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form

In information theory, the Rényi entropy is a quantity that generalizes various notions of entropy, including Hartley entropy, Shannon entropy, collision entropy, and min-entropy. The Rényi entropy is named after Alfréd Rényi, who looked for the most general way to quantify information while preserving additivity for independent events. In the context of fractal dimension estimation, the Rényi entropy forms the basis of the concept of generalized dimensions.

The Engel expansion of a positive real number x is the unique non-decreasing sequence of positive integers such that

<span class="mw-page-title-main">Thomae's function</span> Function that is discontinuous at rationals and continuous at irrationals

Thomae's function is a real-valued function of a real variable that can be defined as:

In mathematics, convergence tests are methods of testing for the convergence, conditional convergence, absolute convergence, interval of convergence or divergence of an infinite series .

<span class="mw-page-title-main">Irrationality measure</span> Function that quantifies how near a number is to being rational

In mathematics, an irrationality measure of a real number is a measure of how "closely" it can be approximated by rationals.

In the mathematical theory of special functions, the Pochhammer k-symbol and the k-gamma function, introduced by Rafael Díaz and Eddy Pariguan are generalizations of the Pochhammer symbol and gamma function. They differ from the Pochhammer symbol and gamma function in that they can be related to a general arithmetic progression in the same manner as those are related to the sequence of consecutive integers.

The square root of 5 is the positive real number that, when multiplied by itself, gives the prime number 5. It is more precisely called the principal square root of 5, to distinguish it from the negative number with the same property. This number appears in the fractional expression for the golden ratio. It can be denoted in surd form as:

In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby counts each distinct prime factor, whereas the related function counts the total number of prime factors of honoring their multiplicity. That is, if we have a prime factorization of of the form for distinct primes , then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.

In number theory, specifically in Diophantine approximation theory, the Markov constant of an irrational number is the factor for which Dirichlet's approximation theorem can be improved for .

References

Notes