z-logo
Premium
Ultrafunctions, Projective Function Geometry, and Polynomial Functional Equations
Author(s) -
McCarthy Patrick J.
Publication year - 1986
Publication title -
proceedings of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.899
H-Index - 65
eISSN - 1460-244X
pISSN - 0024-6115
DOI - 10.1112/plms/s3-53.2.321
Subject(s) - mathematics , iterated function , polynomial , projective space , linear form , pure mathematics , affine transformation , function (biology) , functional equation , projective test , discrete mathematics , mathematical analysis , differential equation , evolutionary biology , biology
Some non‐linear functional equations involving iterates have fascinating properties. In this paper, the polynomial functional equations (P)f N ( x ) = ∑ n = 0 N ‐ 1A f n ( x )are studied, where the A n are real constants, and the powers denote the iterates of f : R → R. Each such equation can be interpreted as a linear invariance condition for a graph Γ ⊂ R × R N −1 associated with f . The attempt to express this condition in simple canonical form leads to the idea that functions (or, rather, graphs) can be interpreted as projective objects. This motivates the introduction of the space of ultrafunctions , a ‘projective function space’ obtained by adjoining suitable ‘functions at infinity’ to the affine space of ordinary functions. This enables (P) to be reduced, by a projective transformation, to a purely linear ultrafunctional equation which is easily solved. Explicit formulae, involving ultrafunctions from an explicitly described family, are given for the general continuous (ordinary function) solution in representative generic cases. The relationship between these solutions and known ‘explicit functions’ is discussed. Further applications are briefly described; in particular, ‘functional continued fractions’ are introduced, and their convergence is examined.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here