Hermite's problem

Last updated October 22, 2022

Hermite's problem is an open problem in mathematics posed by Charles Hermite in 1848. He asked for a way of expressing real numbers as sequences of natural numbers, such that the sequence is eventually periodic precisely when the original number is a cubic irrational.

Motivation

A standard way of writing real numbers is by their decimal representation, such as:

x=a_{0}.a_{1}a_{2}a_{3}\ldots \

where a₀ is an integer, the integer part of x, and a₁, a₂, a₃, … are integers between 0 and 9. Given this representation the number x is equal to

x=\sum _{n=0}^{\infty }{\frac {a_{n}}{10^{n}}}.

The real number x is a rational number only if its decimal expansion is eventually periodic, that is if there are natural numbers N and p such that for every n ≥ N it is the case that a_n+p = a_n.

Another way of expressing numbers is to write them as continued fractions, as in:

x=[a_{0};a_{1},a_{2},a_{3},\ldots ],\

where a₀ is an integer and a₁, a₂, a₃… are natural numbers. From this representation we can recover x since

x=a_{0}+{\cfrac {1}{a_{1}+{\cfrac {1}{a_{2}+{\cfrac {1}{a_{3}+\ddots }}}}}}.

If x is a rational number then the sequence (a_n) terminates after finitely many terms. On the other hand, Euler proved that irrational numbers require an infinite sequence to express them as continued fractions.^[1] Moreover, this sequence is eventually periodic (again, so that there are natural numbers N and p such that for every n ≥ N we have a_n+p = a_n), if and only if x is a quadratic irrational.

Hermite's question

Rational numbers are algebraic numbers that satisfy a polynomial of degree 1, while quadratic irrationals are algebraic numbers that satisfy a polynomial of degree 2. For both these sets of numbers we have a way to construct a sequence of natural numbers (a_n) with the property that each sequence gives a unique real number and such that this real number belongs to the corresponding set if and only if the sequence is eventually periodic.

In 1848, Charles Hermite wrote a letter to Carl Gustav Jacob Jacobi asking if this situation could be generalised, that is can one assign a sequence of natural numbers to each real number x such that the sequence is eventually periodic precisely when x is a cubic irrational, that is an algebraic number of degree 3?^[2]^[3] Or, more generally, for each natural number d is there a way of assigning a sequence of natural numbers to each real number x that can pick out when x is algebraic of degree d?

Approaches

Sequences that attempt to solve Hermite's problem are often called multidimensional continued fractions. Jacobi himself came up with an early example, finding a sequence corresponding to each pair of real numbers (x, y) that acted as a higher-dimensional analogue of continued fractions.^[4] He hoped to show that the sequence attached to (x, y) was eventually periodic if and only if both x and y belonged to a cubic number field, but was unable to do so and whether this is the case remains unsolved.

In 2015, for the first time, a periodic representation for any cubic irrational has been provided by means of ternary continued fractions, i.e., the problem of writing cubic irrationals as a periodic sequence of rational or integer numbers has been solved. However, the periodic representation does not derive from an algorithm defined over all real numbers and it is derived only starting from the knowledge of the minimal polynomial of the cubic irrational.^[5]

Rather than generalising continued fractions, another approach to the problem is to generalise Minkowski's question mark function. This function ? : [0, 1] → [0, 1] also picks out quadratic irrational numbers since ?(x) is rational if and only if x is either rational or a quadratic irrational number, and moreover x is rational if and only if ?(x) is a dyadic rational, thus x is a quadratic irrational precisely when ?(x) is a non-dyadic rational number. Various generalisations of this function to either the unit square [0, 1] × [0, 1] or the two-dimensional simplex have been made, though none has yet solved Hermite's problem.^[6]^[7]

In 2021 two subtractive algorithms for finding a periodic representative of cubic vectors were proposed by Oleg Karpenkov. ^[8]^[9] The first ( $\sin ^{2}$ algorithm) works for the totally real case only. The input for the algorithm is a triples of cubic vectors. A cubic vector is any vector generating a degree 3 extension of $\mathbb {Q}$ . In this case the cubic vectors are conjugate if and only if the output of the algorithm is periodic. The second (HAPD algorithm) is conjectured to work for all cases (including for complex cubic vectors) and all dimensions $d\geq 3$ .

Related Research Articles

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

<span class="mw-page-title-main">Number</span> Used to count, measure, and label

A number is a mathematical object used to count, measure, and label. The original examples are the natural numbers 1, 2, 3, 4, and so forth. Numbers can be represented in language with number words. More universally, individual numbers can be represented by symbols, called numerals; for example, "5" is a numeral that represents the number five. As only a relatively small number of symbols can be memorized, basic numerals are commonly organized in a numeral system, which is an organized way to represent any number. The most common numeral system is the Hindu–Arabic numeral system, which allows for the representation of any number using a combination of ten fundamental numeric symbols, called digits. In addition to their use in counting and measuring, numerals are often used for labels, for ordering, and for codes. In common usage, a numeral is not clearly distinguished from the number that it represents.

In mathematics, a square root of a number $x$ is a number $y$ such that $y 2 = x$ ; in other words, a number $y$ whose square (the result of multiplying the number by itself, or $y$  ⋅  $y$ ) is $x$ . For example, 4 and −4 are square roots of 16, because $42 = (-4) 2 = 16$ .

In mathematics, a transcendental number is a number that is not algebraic—that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are $π$ and $e$ .

In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction, the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression. In either case, all integers in the sequence, other than the first, must be positive. The integers $are called the coefficients or terms of the continued fraction.$

In mathematics, an nth root of a number x is a number r which, when raised to the power n, yields x:

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, a quadratic irrational number is an irrational number that is the solution to some quadratic equation with rational coefficients which is irreducible over the rational numbers. Since fractions in the coefficients of a quadratic equation can be cleared by multiplying both sides by their least common denominator, a quadratic irrational is an irrational root of some quadratic equation with integer coefficients. The quadratic irrational numbers, a subset of the complex numbers, are algebraic numbers of degree 2, and can therefore be expressed as

In mathematics, an algebraic equation or polynomial equation is an equation of the form

In mathematics, the Minkowski question-mark function, denoted $?(x)$ , is a function with unusual fractal properties, defined by Hermann Minkowski in 1904. It maps quadratic irrational numbers to rational numbers on the unit interval, via an expression relating the continued fraction expansions of the quadratics to the binary expansions of the rationals, given by Arnaud Denjoy in 1938. It also maps rational numbers to dyadic rationals, as can be seen by a recursive definition closely related to the Stern–Brocot tree.

In mathematics, Gelfond's constant, named after Aleksandr Gelfond, is $e π$ , that is, $e$ raised to the power $π$ . Like both $e$ and $π$ , this constant is a transcendental number. This was first established by Gelfond and may now be considered as an application of the Gelfond–Schneider theorem, noting that

In mathematics an even integer, that is, a number that is divisible by 2, is called evenly even or doubly even if it is a multiple of 4, and oddly even or singly even if it is not. The former names are traditional ones, derived from ancient Greek mathematics; the latter have become common in recent decades.

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

In mathematics, a quadratic equation is a polynomial equation of the second degree. The general form is

In mathematics, an infinite periodic continued fraction is a continued fraction that can be placed in the form

In mathematics, and more particularly in the analytic theory of regular continued fractions, an infinite regular continued fraction x is said to be restricted, or composed of restricted partial quotients, if the sequence of denominators of its partial quotients is bounded; that is

<span class="mw-page-title-main">Rational number</span> Quotient of two integers

In mathematics, a rational number is a number that can be expressed as the quotient or fraction $p / q$ of two integers, a numerator $p$ and a non-zero denominator $q$ . For example, $-3 / 7$ is a rational number, as is every integer. The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface $Q$ , or blackboard bold

In mathematics, a real number is a number that can be used to measure a continuous one-dimensional quantity such as a distance, duration or temperature. Here, continuous means that values can have arbitrarily small variations. Every real number can be almost uniquely represented by an infinite decimal expansion.

In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length, no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

References

↑ "E101 – Introductio in analysin infinitorum, volume 1" . Retrieved 2008-03-16.
↑ Émile Picard, L'œuvre scientifique de Charles Hermite, Ann. Sci. École Norm. Sup. 3 18 (1901), pp.9–34.
↑ Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres. (Continuation)., Journal für die reine und angewandte Mathematik 40 (1850), pp.279–315, doi : 10.1515/crll.1850.40.279
↑ C. G. J. Jacobi, Allgemeine Theorie der kettenbruchänlichen Algorithmen, in welche jede Zahl aus drei vorhergehenden gebildet wird (English: General theory of continued-fraction-like algorithms in which each number is formed from three previous ones), Journal für die reine und angewandte Mathematik 69 (1868), pp.29–64.
↑ Nadir Murru, On the periodic writing of cubic irrationals and a generalization of Rédei functions, Int. J. Number Theory 11 (2015), no. 3, pp. 779-799, doi: 10.1142/S1793042115500438
↑ L. Kollros, Un Algorithme pour l'approximation simultanée de Deux Granduers, Inaugural-Dissertation, Universität Zürich, 1905.
↑ Olga R. Beaver, Thomas Garrity, A two-dimensional Minkowski ?(x) function, J. Number Theory 107 (2004), no. 1, pp. 105–134.
↑ Karpenkov, Oleg (2021). "On Hermite's problem, Jacobi-Perron type algorithms, and Dirichlet groups". arXiv: 2101.12707 [math.NT].
↑ Karpenkov, Oleg (2021). "On a periodic Jacobi-Perron type algorithm". arXiv: 2101.12627 [math.NT].

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] "E101 – Introductio in analysin infinitorum, volume 1" . Retrieved 2008-03-16.

[2] Émile Picard, L'œuvre scientifique de Charles Hermite, Ann. Sci. École Norm. Sup. 3 18 (1901), pp.9–34.

[3] Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres. (Continuation)., Journal für die reine und angewandte Mathematik 40 (1850), pp.279–315, doi : 10.1515/crll.1850.40.279

[4] C. G. J. Jacobi, Allgemeine Theorie der kettenbruchänlichen Algorithmen, in welche jede Zahl aus drei vorhergehenden gebildet wird (English: General theory of continued-fraction-like algorithms in which each number is formed from three previous ones), Journal für die reine und angewandte Mathematik 69 (1868), pp.29–64.

[5] Nadir Murru, On the periodic writing of cubic irrationals and a generalization of Rédei functions, Int. J. Number Theory 11 (2015), no. 3, pp. 779-799, doi: 10.1142/S1793042115500438

[6] L. Kollros, Un Algorithme pour l'approximation simultanée de Deux Granduers, Inaugural-Dissertation, Universität Zürich, 1905.

[7] Olga R. Beaver, Thomas Garrity, A two-dimensional Minkowski ?(x) function, J. Number Theory 107 (2004), no. 1, pp. 105–134.

[8] Karpenkov, Oleg (2021). "On Hermite's problem, Jacobi-Perron type algorithms, and Dirichlet groups". arXiv: 2101.12707 [math.NT].

[9] Karpenkov, Oleg (2021). "On a periodic Jacobi-Perron type algorithm". arXiv: 2101.12627 [math.NT].

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]