Math 2.0

Difference and functional equations Iteration theory and iterative equations Theorem

Kneser's construction of real analytic tetration

Builds on Exponential functionAnalytic functionTetrationFunctional square rootAbel equation

Statement

Let exp⁡\exp be the exponential function. There is a real-analytic, strictly increasing function F ⁣:(−2,∞)→ℝF \colon (-2, \infty) \to \R such that F(0)=1andF(x+1)=exp⁡(F(x))for all x>−2.F(0) = 1 \quad \text{and} \quad F(x + 1) = \exp(F(x)) \quad \text{for all } x > -2. So FF extends tetration to base ee from integer heights to real heights: F(n)=neF(n) = {}^{n}e for all integers n≥1n \ge 1.

Remarks

Kneser's construction starts at a non-real fixed point LL of exp⁡\exp in ℂ\C, with L≈0.318+1.337iL \approx 0.318 + 1.337i. There exp⁡′(L)=L\exp'(L) = L has modulus greater than 11, so exp⁡\exp has a holomorphic Schröder function near LL, and this gives a complex solution of the Abel equation. This solution is not real on the real axis, and Kneser corrects it by a conformal change of variables, built with the Riemann mapping theorem, to obtain a real-analytic one. From FF one gets a real-analytic functional square root of exp⁡\exp on ℝ\R: g(x)=F(F−1(x)+12)g(x) = F\big(F^{-1}(x) + \tfrac12\big) satisfies g(g(x))=exp⁡(x)g(g(x)) = \exp(x). The values at integers are forced: F(−1)=log⁡F(0)=0F(-1) = \log F(0) = 0, F(1)=eF(1) = e, F(2)=eeF(2) = e^e, and F(x)→−∞F(x) \to -\infty as x→−2x \to -2 from the right. The equation F(x+1)=exp⁡(F(x))F(x + 1) = \exp(F(x)) with F(0)=1F(0) = 1 has many solutions, even smooth ones, so extra conditions are needed to single out Kneser's solution.

Going deeper

For a student

The equation F(x+1)=exp⁡(F(x))F(x + 1) = \exp(F(x)) is an Abel-type equation for the inverse of FF, and its solutions are easy to build piece by piece on intervals of length 11. Such solutions are usually not analytic, and the difficulty is to find a solution that is analytic everywhere. Kneser's method combines the theory of linearization near a repelling fixed point, the Schröder and Koenigs theory, with the Riemann mapping theorem. It is the standard reference point for later work on tetration to other bases and on uniqueness of analytic solutions.

Reading path

To understand this page from the ground up, read these 9 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Abel equation concept
  2. Analytic function concept
  3. Exponential function concept
  4. Fractional iteration concept
  5. Functional square root concept
  6. Iterated function concept
  7. Real exponentiation concept
  8. Tetration example
  9. Kneser's construction of real analytic tetration statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Tetration
About this page
TagAH3G1HDB0D
URIm2://AH3G1HDB0D
Kindstatement, theorem
WritingW0 stub
MSC39B12, 30D05, 26A18
StatusThis copy of the site has no build data. Run m2 status AH3G1HDB0D.
AboutTetration, Functional square root
UsesExponential function, Analytic function, Tetration, Functional square root, Abel equation

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.