Set of Gelfond Cutters

from Wikipedia, the free encyclopedia

With the help of Gelfond-Schneider's theorem , it was possible for the first time to generate an extensive class of transcendent numbers. It was first proven in 1934 by the Russian mathematician Alexander Gelfond and independently a year later by Theodor Schneider . The sentence answers Hilbert's seventh problem .

Statement of the sentence

Let and algebraic numbers (with ). beyond that, don't be rational .

Then the sentence of Gelfond-Schneider says:

is transcendent .

For and also can complex numbers be used. Then applies . The complex logarithm is only uniquely determined up to a multiple of . The theorem is correct for any choice of the branch of the logarithm.

It can also be formulated in such a way that for logarithms of two algebraic numbers, the linear independence over the rational numbers follows from the linear independence over the algebraic numbers. In this formulation, the Gelfond-Schneider theorem was expanded considerably by Alan Baker in the 1960s .

Baker's Theorem: If the are algebraic numbers that are linearly independent over the rational numbers, then are linearly independent over the algebraic numbers.

Applications

The transcendence of the following numbers follows directly from Gelfond-Schneider's theorem:

  • The Gelfond-Schneider constant as well
  • The Gelfond constant , there . Note that is not a rational number .
  • The number that is a real number because of .
  • is transcendent, because otherwise one gets a contradiction by inserting , (where b is irrational)

See also

Literature and Links

  • Alexander Gelfond: On Hilbert's seventh problem. In: Doklady Akademii Nauk SSSR. Izvestija Akedemii Nauk, Moscow 2.1934, pp. 177-182. ISSN  0002-3264
  • Th. Schneider: Transcendence studies of periodic functions. Vol. I. Transcendence of potencies. In: Journal for pure and applied mathematics. de Gruyter, Berlin 172.1934, pp. 177-182. ISSN  0075-4102
  • Proof (in English) (PDF file; 89 kB)