Continuous solutions of a system of composite functional equations

In this paper we introduce the concept of translation invariant functions: considering an arbitrary set ∅≠S⊂Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\emptyset \ne S \subset {\mathbb {R}}^n$$\end{document}, the function F:S⟶R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F : S \longrightarrow {\mathbb {R}}$$\end{document} is translation invariant if F(x)=F(y)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F(x) = F(y)$$\end{document} implies F(x+t)=F(y+t)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F(x+t)=F(y+t)$$\end{document} for any vectors x,y,t∈Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x,y,t \in {\mathbb {R}}^n$$\end{document} such that x,y,x+t,y+t∈S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x ,y , x+t ,y+t \in S$$\end{document}. In our main results we shall consider an open, connected set ∅≠D⊂Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\emptyset \ne D \subset {\mathbb {R}}^n$$\end{document}. We prove that if F:D⟶R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F : D \longrightarrow {\mathbb {R}}$$\end{document} is a translation invariant, continuous function, then there exists a vector a=(a1,⋯,an)∈Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a = (a_1, \dots , a_n) \in {\mathbb {R}}^n$$\end{document} and a strictly monotone, continuous function f such that F(x1,⋯,xn)=f(a1x1+⋯+anxn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} F(x_1, \dots , x_n) = f (a_1 x_1 + \dots + a_n x_n) \end{aligned}$$\end{document}holds for all (x1,⋯,xn)∈D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(x_1, \dots , x_n) \in D \,$$\end{document}. Using this result we also show that continuous solutions F:D⟶R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ F : D \longrightarrow {\mathbb {R}}$$\end{document} of the system of functional equations F(x1,⋯,xj+tj,⋯,xn)=Ψj(F(x1,⋯,xj,⋯,xn),tj)(j=1,⋯,n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} F(x_1 , \dots , x_j + t_j , \dots , x_n) = \Psi _j (F (x_1 , \dots , x_j , \dots , x_n), t_j) \ \ (j=1,\dots ,n) \end{aligned}$$\end{document}can be represented as the composition of a strictly monotone, continuous function and a linear functional as well. Applying the latter theorem, we give a characterization of Cobb–Douglas type utility functions.


Introduction
In the paper [1] Z. Boros proved that if D is an open, connected subset of R 2 then a continuous function F : D −→ R , which is strictly monotone in one of Motivated by this result, it seems natural to consider the analogous version of the above mentioned system of composite functional equations for n ≥ 2 variables. Therefore, in our work we are going to investigate the system of functional equations F (x 1 + t 1 , x 2 , . . . , x n ) = Ψ 1 (F (x 1 , x 2 , . . . , x n ), t 1 ) (1) F (x 1 , x 2 + t 2 , . . . , x n ) = Ψ 2 (F (x 1 , x 2 , . . . , x n ), t 2 ) (2) . . .
Our purpose is to obtain some decomposition theorems for the continuous solutions of this system of equations, similar to the one in [1]. However, we will take an approach which fundamentally differs from the arguments applied in [1]. The main reason for using alternative methods is that the ideas used by Boros do not seem easily applicable for the higher dimensional system of equations. Therefore we will utilize the geometrical meaning of the functional equations. Namely, one can easily check that each one of the equations (1) − (n) ensures that if F (x) = F (y) holds for some points of the domain of definition of F , then F (x + t) = F (y + t) is also fulfilled for vectors t ∈ R n which are parallel to the corresponding coordinate axis (of course, assuming that F is defined in x + t and y + t). It seems reasonable to investigate whether an analogous property holds for arbitrary translation vectors as well. Hence we will introduce the concept of translation invariant functions: if S is a non-empty subset of R n then the function F : S −→ R is said to be translation invariant if F (x) = F (y) implies F (x + t) = F (y + t) for all vectors t ∈ R n such that x + t , y + t ∈ S.
In the most extensive part of our work we will examine continuous, translation invariant functions with the purpose of formulating a decomposition theorem similar to the one in [1]. Then we will show that the obtained results can be applied to characterize the continuous solutions of (1) − (n). As we will see, this can be done without any major difficulties, as the solutions of the system of equations are locally translation invariant, so they behave similarly to 'proper' translation invariant functions. Another advantage of our approach is that we do not need to assume strict monotonicity in any of the variables Vol. 96 (2022) Solutions of a system of functional equations 1181 of the solutions. This means that, as a particular case, we immediately obtain a stronger version of the main result of [1]. Finally, we are going to present an application of our results, in the field of mathematical economics. One can find numerous works (e. g. [2,7]) which deal with the problem of how to characterize certain types of so-called utility functions. However, it is common that strong regularity conditions (such as higher-order differentiability) are assumed, which excludes many possible utility functions. On the other hand, our decomposition theorem provides a characterization of the frequently used Cobb-Douglas type utility functions, with the help of a system of composite functional equations, while assuming relatively weak regularity.

Preliminaries
Firstly, we will collect some fundamental notions and propositions concerning convex geometry and particular sets of metric spaces. Throughout our work we consider R n with its standard inner product, norm and the induced topology. In order to avoid possible technical difficulties, we shall always assume that the dimension n is at least 2 (we are going to explicitly state if this is not the case).
We will use the concepts of affine/convex set, affine/convex combination and affine/convex hull in the usual sense. Special affine/convex sets, such as lines, line segments and hyperplanes will also be used in the standard way. These definitions can be found, for instance, in the first chapter of the monograph [4] of Lay. Let us introduce some notations. Notation 1. Let x, y ∈ R n . The line passing through x and y will be denoted by l(x, y), and the line segment joining x and y will be denoted by s(x, y). Furthermore, let int s(x, y) = { (1 − λ)x + λy | λ ∈ ]0 , 1[ } be the interior of the segment. Moreover, for fixed vectors x ∈ R n and 0 = a ∈ R n , the hyperplane that passes through x and has normal vector a will be denoted by H(x, a), i.e.
Remark 2.1. The affine/convex hull of finitely many points x 1 , . . . , x k ∈ R n will be denoted by Aff(x 1 , . . . , x k ) and conv(x 1 , . . . , x k ) , respectively. Since the affine/convex hull of a set S consists of all the affine/convex combinations of the points of S (see [4,Theorem 2.22]), we get that these sets have the form As it is well-known, the affine subsets of R n can be characterized as the translates of linear subspaces. Namely, if A ⊂ R n is affine, then there exists a unique linear subspace L ⊂ R n such that A = p + L, for any p ∈ A (cf. [4,Theorem 2.13]). Motivated by this result, we will refer to affine sets of R n as affine subspaces (as it is common in the literature).
We will also use the following notion: the dimension of an affine subspace A is the dimension of the (uniquely determined) linear subspace belonging to A. For example, the n − 1 dimensional affine subspaces of R n are the hyperplanes. Furthermore, the affine hull of a set S ∈ R n will be called the affine subspace generated by S.
Finally, we shall mention affine independence and give some equivalent conditions. Then the following statements are equivalent i) x 1 , . . . , x k are affinely independent. ii) For any i ∈ {1, . . . , k}, the system of vectors is linearly independent. iii) The affine subspace generated by x 1 , . . . , x k has dimension k − 1.
The results of this statement can be found in [4], mostly in the form of exercises (e.g. [4, Exercise 2.27]) and remarks. Now we formulate a corollary of the proposition, which later will be an important auxiliary tool. Lemma 2.4. Let x 1 , . . . , x k ∈ R n be affinely independent and let Furthermore, let us consider some non-zero scalars λ 1 , . . . , λ k ∈ R \ {0}, and define Then y, y 1 , . . . , y k are affinely independent.
Vol. 96 (2022) Solutions of a system of functional equations 1183 Proof. Since x 1 , . . . , x k are affinely independent and y / ∈ Aff(x 1 , . . . , x k ), it follows that x 1 , . . . , x k together with y are also affinely independent and therefore x 1 − y, . . . , x k − y are linearly independent. Multiplying some of these vectors by non-zero scalars does not affect their linear independence. This means that the vectors y j − y = λ j (x j − y) for j = 1, . . . , k are linearly independent, so y, y 1 , . . . , y k are affinely independent.
In the next part we will summarize some important topological notions and theorems. Since we will work in R n , in this section we also restrict ourselves to metric spaces only, instead of a more general approach. We shall use the concept of open sets, closed sets as well as compact sets and connected sets in the usual sense (as they are introduced, for instance, in the monographs of Rudin [6] or Sutherland [8]).
An open ball with center x and radius r will be denoted by B(x, r). We will frequently use the fact that the image of a connected set under a continuous function is connected, while the image of a compact set under a continuous function is compact. A well-known consequence of the latter statement is that if X is a metric space, ∅ = K ⊂ X is compact and f : K −→ R is a continuous function, then f attains its minimum and maximum on the set K. The proof of these previous statements can be found in [8,Propositions 13.15, 12.13 and Corollary 13.18].
Finally, we enumerate two statements that later will play a crucial role in many of the main results of our work. Both of them are often used in the proofs of some classical theorems of complex analysis. Proposition 2.5. Let (X, d) be a metric space, K ⊂ X be compact, ∅ = C ⊂ X be closed and assume K ∩ C = ∅. Then there exists r > 0 such that for every x ∈ K it holds that B(x, r) ⊂ X \ C.
where z 0 , z 1 , . . . z m ∈ D such that z 0 = x and z m = y. We shall note that the proof of a somewhat weaker statement -namely that any open, connected subset of R n is path-connected -can be found in the monograph of Sutherland [8,Proposition 12.25]. The author also mentions that the proof could be applied to the case of polygonal paths as well, without any major adjustments. P. Tóth AEM

Translation invariant functions
In this section we introduce the concept of translation invariance, and then formulate various propositions for continuous, translation invariant functions. We will show that such functions -if the domain of definition is connected and open -can be represented as the composition of a strictly monotone, continuous, real valued function and a linear functional.

Translation invariant functions on affine sets
Definition 3.1. Let S ⊂ R n be a nonempty set and F : S −→ R be a function.
We say that the function for any vectors x, y, t ∈ R n such that x, y, x + t, y + t ∈ S.
Sometimes it is more convenient to use another condition which will be referred to as local translation invariance.

Definition 3.2.
Let S ⊂ R n be a nonempty set and F : S −→ R be a function. Suppose that for any x, y ∈ S and for any 0 < r ∈ R such that B(x, r) ⊂ S and B(y, r) ⊂ S the following assertion holds: if F (x) = F (y) then F (x + h) = F (y + h) is fulfilled for any h ∈ B(0, r). Then the function F is said to be locally translation invariant.
We recall a notation which will be used later in many of our proofs: let x be an arbitrary real number, then x = max{k ∈ Z | k ≤ x} is the floor of x and Proof. Let x, y ∈ K and 0 = t ∈ R n be arbitrary vectors such that x+t, y +t ∈ K and F (x) = F (y). Then the convexity of K provides s(x, x + t) ⊂ K and s(y, y + t) ⊂ K. These line segments are compact while R n \ K is closed, thus, due to Proposition 2.5, there exists r > 0 such that Hence we get that Now the local translation invariance implies F (x + h) = F (y + h). We shall repeat the translation with h (and use the local translation invariance) N times for the appropriate starting points x + kh, y + kh (k = 1, . . . , N − 1). Then we obtain F (x + t) = F (x + Nh) = F (y + Nh) = F (y + t). Thus we have proven the translation invariance of F .
The next lemma will be crucial for our later investigations. Proof. We may assume x = y, otherwise the statement is trivial. In the first step we show that for all 0 < r ∈ R there exist u, v ∈ s(x, y) such that Let us introduce two notations: Since the line segment T is compact, the continuous function F attains its extrema on T . Moreover, as F (x) = F (y), there exists m ∈ int s(x, y) such that F (m) = max{F (z) | z ∈ T } or F (m) = min{F (z) | z ∈ T }. We investigate only the first case, the other one can be handled analogously. Now let us choose ε ∈ ]0, r[ such that Obviously, 0 < u − v ≤ ε < r and u ∈ s(x, v), so we have obtained an adequate pair of points.
In the second part of the proof we show that we are able to give a partition of the segment consisting of finitely many sub-segments such that the length of each new segment is at most r, and at each endpoint of these segments F has value α. For this purpose our first observation is that using the translation 1186 P. Tóth AEM invariance for the previously obtained points u and v and for the translating vector x − u, we get and let us define the points Since Furthermore, from the definition of N it is easy to see that z N − y < r also holds. On the other hand, we have already shown For the final step of the proof let p ∈ T be arbitrary. Applying the previous construction for r = 1 n (for all n ∈ N), we get a sequence of points (x n ) : Since p was an arbitrary point of the segment s(x, y), we have verified our statement.
The following corollary generalizes this lemma.
Proof. The point p can be written as an affine combination of u and v: Without loss of generality, we may suppose λ ≥ 0 (by exchanging the role of u and v, if necessary). Let Let us also define some particular points of the segment s(x, y): Vol. 96 (2022)

Solutions of a system of functional equations 1187
This definition ensures that the introduced points are indeed on the segment s(x, y). Actually one can easily see that they are elements of s(u, p), especially According to the assumptions of the statement F (z 0 ) = F (z 1 ) = α holds, therefore by induction we may claim that F (z j ) = α is fulfilled for all j = 0 , 1, . . . , k. Indeed, the translation invariance of F means for all j = 1, . . . , k − 1. Furthermore w and s(u, v) satisfy the assumptions of Lemma 3.4, thus F (w) = α. This means that, by applying translation invariance once again, we get which had to be proven.

Remark 3.6.
If the domain of definition of F is convex, then the two previous propositions can be summarized as follows: Finally, we will formalize a theorem that is a further generalization of the previous results. Namely, instead of two points, we will consider the affine hull of finitely many points having the same function value. This time we assume local translation invariance which will be more convenient for later applications of the statement.
Proof. Since K is open and convex, Proposition 3.3 implies that F is translation invariant.
In the case of k = 1 we have nothing to prove, so from now on we assume k ≥ 2. Let us observe that conv(x 1 , . . . , x k ) ⊂ K, since K is convex. Firstly, we will show that the value of F is α in all points of the convex hull.
Under the assumptions of the theorem, we can apply Lemma 3.4 which ensures that if p ∈ s(x i , x j ) for some i, j ∈ {1, . . . , k}, then F (p) = α holds. Now let us consider an arbitrary point of conv(x 1 , . . . , x k ) ⊂ K, in the form of a convex combination of x 1 , . . . , x k . If the number of non-zero coefficients in this convex combination is at most two, then the function value of this point is α, according to the cited lemma.
Let r ≥ 3, and let us assume that the value of F is α in all such points of conv(x 1 , . . . , x k ) ⊂ K which can be expressed as a convex combination of at P. Tóth AEM most r − 1 vectors from the system x 1 , . . . , x k . This means that if p = λ 1 x i1 + · · · + λ r x ir for some {i 1 , . . . , i r } ⊂ {1, . . . , k} and λ 1 , . . . , λ r ∈ [0, 1], then we may suppose that neither of those coefficients is 0 or 1, because otherwise, using the induction hypothesis, the proof is complete. However, if the assumption holds, then we can do the following calculations: and here for the point we have F (p) = α, due to the inductive hypothesis.
As p ∈ s(p, x ir ), applying Lemma 3.4 we get F (p) = α, which means that the function F is constant on the whole conv( Finally, let us choose an arbitrary q ∈ Aff( Now c = q grants that M > 0 and therefore ε > 0 , too. Hence for all j = 1, . . . , k we have This means that the and here the affine coordinates of v are from the interval [0, 1], according to the calculation above. Thus v is definitely in the convex hull. Therefore F (v) = α, Vol. 96 (2022) Solutions of a system of functional equations 1189 so using Corollary 3.5 for q ∈ l(c, v) we also get F (q) = α which needed to be verified.

Decomposition of translation invariant functions
In the previous subsection we showed that if a continuous, (locally) translation invariant function F , defined on an open, convex set, takes the same value in some points of its domain, then F is constant on the affine subspace spanned by these points. However, the dimension of that subspace will be critical for us later. We are going to present some results concerning the dimension of such subspaces. In order to proceed to that question, we need to prove a general existence theorem for continuous functions.
Theorem 3.8. Let p ∈ R n and 0 < ε ∈ R be arbitrary, and let F : . , x n are affinely independent and Proof. We will prove the statement by induction on the dimension of the domain of definition. The one-dimensional case is trivial. From now on, let us assume that n + 1 ≥ 2 and the theorem holds in R n . Therefore let us fix an arbitrary point p = (p 1 , . . . , p n , p n+1 ) ∈ R n+1 and a radius ε > 0. We may introduce the following notations: Furthermore, let us define the function F as follows: One can easily check that actually holds, while the continuity of F implies that F is also a continuous function. Hence we can apply the inductive hypothesis for the domain B and the function F . Namely, there exist affinely independent pointsỹ 1 , . . . ,ỹ n ∈ B ⊂ R n such that The (n − 1 dimensional) hyperplane in R n passing through these points will be denoted by A. Now let us introduce 1190 P. Tóth AEM Obviously, the points y 1 , . . . , y n ∈ U are affinely independent in R n+1 and the affine subspace generated by them is A. Moreover, follows from the definition of F . Let us denote this common function value by α. Now if there exists z ∈ B \ A such that F (z) = α, then the proof is finished. Indeed, according to Lemma 2.4, the system z, y 1 , . . . , y n is affinely independent, consisting of n + 1 points which all have the same value of F . Therefore, in the next step, we consider the case when there is no point in B \ A with value α. Then we may assume that there exists z ∈ U \ A such that F (z) > α (otherwise, if the value of every point in U \ A is less than α, then we should continue the proof using the function −F and replacing α by −α).
For the remaining part of the proof let us fix such a point z ∈ U \ A. Now if there exists w ∈ B \ U such that F (w) < α, then we shall argue as follows: As B is convex, it holds that s(w, z) ⊂ B. Furthermore, as the segment s(w, z) is connected and F is continuous, we get that F (s(w, z)) is an interval. Therefore there has to exist some But this is a contradiction as we have assumed earlier that no such vector exists.
Therefore the only possible case is when F (w) > α holds for every w ∈ B \ U . Using again the continuity of F in a similar manner, we can get that there exists a vector v ∈ B \ U such that α < F (v) < F (z). With further basic arguments using the continuity, we can conclude the existence of points This means that, for every index j = 1, . . . , n, there exists a real number λ j ∈]0, 1[ so that In order to complete the proof we shall use Lemma 2.4: the points x 1 , . . . , x n are affinely independent -as z was fixed in the complement of A -and for a similar reason (namely, v ∈ B \ U ) the points v, x 1 , . . . , x n are an affinely independent system, as well. Due to our construction, all of these n + 1 points have function value F (v).
Combining this theorem with the results of the previous subsection we can verify an important property of locally translation invariant functions. Proof. Observe that B(p, ε) is a convex set hence F is in fact translation invariant. According to Theorem 3.8 there exists a system of affinely independent points x 1 , . . . , x n ∈ B(p, ε 2 ) such that F (x 1 ) = · · · = F (x n ). Let us denote the hyperplane Aff(x 1 , . . . , x n ) by H and let a denote a normal vector of H. Using Theorem 3.7 we get If p ∈ H then H = H(p, a) and F (p) = F (x 1 ), so the proof is finished. Otherwise, if p / ∈ H holds then let us consider the following points: We shall observe that thus y j ∈ B(p, ε). On the other hand y 1 = p holds. Hence, from the translation invariance, the equalities F (y j ) = F (p) follow for all indices j = 1, . . . , n.
It is also clear that the system y 1 , . . . , y n is affinely independent, while the affine hull of these points is H + (p − x 1 ) = H(p, a). Therefore we may apply Theorem 3.7 once again and obtain which had to be proven.
The meaning of the previous statement is that, for every interior point p in the n dimensional domain of definition of a continuous, locally translation invariant function, there exists an n − 1 dimensional open disc with center p such that the function is constant on this ball. We immediately note that, of course, these are not open balls in the standard topology of R n , they are intersections of proper open balls and appropriate (n − 1 dimensional) hyperplanes. However, for the sake of simplicity, we will continue to use the term n − 1 dimensional disc, when it is not confusing.
We would like to show that under certain circumstances we can claim more than this local property. Namely, that a continuous, locally translation invariant function is globally constant on parallel hyperplanes, if the domain of definition is open and connected. In order to prove such a statement, we will need the following technical lemma.

P. Tóth AEM
Let us also assume that I 1 and I n have a common endpoint as well, i.e.
Moreover let X be an arbitrary set, and for every k = 1, . . . , n consider f k : I k −→ X such that for any index i = 1, . . . , n − 1 the functions f i and f i+1 have the same function value in at least one of the common endpoints of the intervals I i and I i+1 , i.e Furthermore let us suppose that for all indices i, j = 1, . . . , n (i = j) the following holds: if Under these assumptions we may claim that if w is a common endpoint of I 1 and I n then f 1 (w) = f n (w).
Remark 3.11. We shall note that in this lemma we did not exclude singleton intervals. This fact will be important later in some proofs.
Proof. In the first place we verify an auxiliary statement from which we can easily deduce the implication of the lemma. The statement is the following: for arbitrary indices i = j it holds that if I i ∩ I j = ∅ then there exists p ∈ I i ∩ I j such that f i (p) = f j (p). Therefore let i and j be fixed indices and let us introduce the notation m = |i − j|.
We will prove this statement by induction on m. The case of m = 1 follows directly from the assumptions of the lemma: I i and I i+i have a common endpoint where the corresponding function values are equal (i = 1, . . . , n − 1). Now let m ≥ 2 and suppose that the statement holds for smaller natural numbers. Let us consider the intervals I i and I j where j = i + m and assume M = I i ∩ I j = ∅. We can show that there exists an index k such that i < k < j and M ∩ I k = ∅.
We will consider 4 cases, depending on the order of the endpoints of I i and I j . We shall note that these cases are not completely separated, although they cover all possibilities.
Let us observe that if two nonempty, closed intervals of R have a common point, then their union is also a closed interval. Because of that, the set j−1 l=i+1 I l is a closed interval as well. Therefore a j ∈ j−1 l=i+1 I l holds as a i < a j < b j was supposed. This means that there exists a required index i < k < j such that We may use an argumentation analogous to the previous case: if a i is a common endpoint of I i+1 and I i , then choose k = i + 1. Similarly, if b j is a common endpoint of I j−1 and I j , then k = j − 1 is appropriate. Otherwise a j ∈ I j−1 and b i ∈ I i+1 thus Hence a i ∈ j−1 l=i+1 I l so there exists i < k < j such that a i ∈ I k , consequently I k ∩ M = ∅.
Therefore we have investigated every possibility, and we have obtained that a required interval I k must exist. Let p ∈ I k ∩M . Apply the inductive hypothesis, firstly to the intervals I i and I k then for I k and I j : according to the hypothesis there exist elements x ∈ I i ∩ I k and y ∈ I k ∩ I j such that f i (x) = f k (x) and f k (y) = f j (y). The assumptions of the lemma ensure Therefore we have verified the auxiliary statement formulated at the beginning of the proof. The implication of the lemma is a straightforward corollary of that: since I 1 ∩ I n = ∅ was assumed, there exists p ∈ I 1 ∩ I n such that f 1 (p) = f n (p), thus for any common endpoint w (or, in fact, for any point of the intersection I 1 ∩ I n ) the equation From now on, for any fixed vector a ∈ R n , p a will denote the inner product with a (as a linear functional):  1, . . . , m).
The polygonal path S = S 1 ∪· · ·∪S m is compact while the set R n \D is closed. Therefore, according to Proposition 2.5, there exists a real number r > 0 such that Observe that the open sets are convex, so the restrictions F | T k are translation invariant, according to Proposition 3.3. Using Corollary 3.9 we get that there exists 0 = a ∈ R n such that F is constant over the n − 1 dimensional disc H(z 0 , a) ∩ B(z 0 , r). We will show that for this vector a the implication of our proposition holds. Firstly, the translation invariance on T 1 implies that, for each s ∈ S 1 , F is constant over the translated disc H(s, a) ∩ B(s, r), especially F | H(z1,a)∩B(z1,r) is also constant. By analogous reasoning for T 2 , T 3 and so on, we obtain that F | H(zm,a)∩B(zm,r) is constant, that is, F | H(y,a)∩B(y,r) is constant. Since y ∈ D can be chosen arbitrarily, we get the following: for all z ∈ D there exists ε > 0 such that F | H(z,a)∩B(z,ε) is constant.
Using Theorem 3.7 we can deduce immediately that, for all z ∈ D and r > 0 such that B(z, r) ⊂ D, it holds that From now on assume that p a (x) = p a (y) and consider the previous construction of S and T . For every k ∈ {1, . . . , m} the sets I k = p a (S k ) ⊂ R are images of the compact, connected line segments S k , under the continuous function p a therefore they are also compact and connected. This means that they are bounded, closed intervals.
Moreover, if p a (z k−1 ) < p a (z k ) holds for some index k ∈ {1, . . . , m}, then by using the bilinearity of the inner product we obtain For similar reasons, we may claim that if p a (z k−1 ) > p a (z k ) is fulfilled for an index k ∈ {1, . . . , m} then As a summary of the three cases we get that, for all k = 1, . . . , m, we have We proceed with some further investigation of these three types of intervals For such intervals it is easy to see that the function p a | S k : S k −→ I k is bijective. Surjectivity is obvious while injectivity can be justified as follows: if p a (s) = p a (t) was true for two different points s, t ∈ S k , then this would imply s, a = t, a , and therefore s − t, a = 0 =⇒ t ∈ H(s, a).
Hence the whole line segment S k would be contained in the affine sub- space H(s, a), especially p a (z k−1 ) = p a (z k ) would hold, but this is a contradiction. So p a | S k is indeed a bijection, thus the definition of the function ) is correct. Note that for the endpoints of I k the following equations hold: f k (p a (z k−1 )) = F (z k−1 ) and f k (p a (z k )) = F (z k ).
2. If p a (z k−1 ) > p a (z k ) then I k = [p a (z k ), p a (z k−1 )]. By analogous reasoning one can see that p a | S k : S k −→ I k is a bijection, so we may define a function f k with the same formula . Especially, at the endpoints of I k it holds that f k (p a (z k )) = F (z k ) and These singleton intervals occur if and only if the segment S k is contained in a hyperplane with normal vector a. However, that being so we may apply Theorem 3.7 for the convex set: T k = s∈S k B(s, r). As the function F is constant on the n − 1 dimensional disc H(z k , a) ∩ B(z k , r) with value P. Tóth AEM F (z k ), due to Theorem 3.7 F | S k ≡ F (z k ) is fulfilled. Nevertheless, in the case of these singleton intervals the definition of f k remains the same: As a summary we may claim that for every index k = 1, . . . , m the (not necessarily different) endpoints of an above defined interval I k are exactly the values of p a at the endpoints of the segment S k , in the correct order. Furthermore, the value of f k at any endpoint of I k is equal to the value of F at the corresponding endpoint of S k .
In the next part of the proof we will show that the intervals I k and functions f k fulfill the assumptions of Lemma 3.10.
First of all, due to Eq. (1) the intervals I i and I i+1 have a common endpoint, namely p a (z i ) (i = 1, . . . , m − 1). Furthermore, since z 0 = x and z m = y, it holds that p a (z 0 ) = p a (z m ) which means that I 1 and I m have a common endpoint. Moreover it is also clear, that at an appropriate common endpoint of two intervals with adjacent indices, the corresponding function values are equal, because the construction above implies To check the last assumption of Lemma 3.10, let us consider two intervals We shall prove f i | Ii∩Ij = f j | Ii∩Ij . If either I i or I j is a singleton, then it holds automatically. Thus the only interesting case is when both intervals are proper (none of them is a singleton) and their intersection is also proper.
Let d ∈ I i ∩ I j such that d = c. That being so, there exist (uniquely determined) points v,ṽ ∈ S i and w,w ∈ S j such that v =ṽ and w =w, moreover p a (v) = p a (w) = c and p a (ṽ) = p a (w) = d. Besides that, let us define two unit vectors It is easy to see that b 1 , a = 0 and b 2 , a = 0. Otherwise S i or S j would be contained in a hyperplane orthogonal to a, which would entail that its image under p a shrinks to a single point, but this was excluded. Furthermore, by calculating we obtain that the sign of b 1 , a and b 2 , a is the same. Without loss of generality we may assume | b 1 , a | ≤ | b 2 , a | (if necessary, define the unit vectors inversely, i.e. use the points of S j for b 1 and use the points of S i for b 2 ). This way we may introduce We shall observe that this implies, for all s ∈ S, Furthermore, it also holds that a). Here using the local translation invariant property of F we get We should also keep in mind that we already concluded that F is constant on Observe that the first inequality is strict, because otherwise we would have b 1 = γ(−λb 2 ) for some γ ≥ 0. However, this would imply which is a contradiction. Hence we have in fact w + λ r 2 b 2 ∈ B(w + r 2 b 1 , r). As w + λ r 2 b 2 ∈ H(w + r 2 b 1 , a) was obtained previously, we may claim that and therefore We shall observe that this process works not just for r 2 , but for an arbitrary real number 0 < ≤ r 2 we can get With some basic calculations analogous to the previously discussed ones it is easy to see that besides F (w + λ b 2 ) = F (v + b 1 ), the equation p a (v + b 1 ) = p a (w + λ b 2 ) holds as well, for any ∈]0, r 2 ].

P. Tóth AEM
Now let us introduce the notation We shall execute this translation process N times for r 2 , starting every step from the most recently obtained points v + lr 2 b 1 and w + λ lr 2 b 1 where l = 0, 1, . . . , N − 1. This way one gets If necessary, we may do one final step, but instead of r 2 now with some 0 < δ < r 2 . Hence we get that F (ṽ) = F (w). Finally, we shall utilize the fact that I i and I j are proper intervals and not singletons. Therefore the functions f i and f j were defined with the help of the bijective restrictions p a | Si and p a | Sj . Hence, for the considered number As d was an arbitrary element of I i ∩ I j , we have checked that all the assumptions of Lemma 3.10 are fulfilled. Use the implication of the lemma for p a (z 0 ) = p a (z m ) which is a common endpoint of I 1 and I m . Therefore f 1 (p a (z 0 )) = f m (p a (z m )), but considering that z 0 = x and z m = y, this means which completes our proof. Proof. Let y ∈ D\{x} be an arbitrary point, and let us choose a vector 0 = b ∈ R n such that b, y − x = 0 and therefore p a (x) = p a (y) holds. In the proof of Proposition 3.12 we have shown that, for any x ∈ D, 0 = a ∈ R n and r > 0, if B(x, r) ⊂ D and F is constant on the n − 1 dimensional disc H(x, a) ∩ B(x, r), then F is globally constant on the hyperplanes orthogonal to a. Now F | B(x,ε) is constant, so especially for the vector b we get that p b (x) = p b (y) implies F (x) = F (y). Since y was an arbitrary point of D, we have shown that F is constant on the whole domain.
Before proving our main result we recall a well-known fact about real functions.  = (a 1 , . . . , a n ) ∈ R n and a strictly monotone, continuous function f : p a (D) −→ R such that Proof. According to Proposition 3.12 there exists a vector 0 = a ∈ R n such that x, y ∈ D , p a (x) = p a (y) implies F (x) = F (y). Now p a (D) ⊂ R is connected since p a is continuous and D is connected. Thus p a (D) is a nonempty real interval. Obviously it cannot be a singleton, because that would mean that the set D is contained in an n − 1 dimensional hyperplane, which contradicts that D is open. For every c ∈ p a (D) let us consider an element x c ∈ D such that p a (x c ) = c. Then we shall define the function f in the following way: Let us observe that the properties of a mentioned before ensure that f is welldefined (i.e. independent of the choice of x c ). Indeed, if we use some otherx c in the definition of f instead of x c , then p a (x c ) implies F (x c ) = F (x c ) = f (c), so f remains the same. Now we may show that f is continuous. For this purpose let us fix an arbitrary c 0 ∈ p a (D) and choose y 0 ∈ D so that p a (y 0 ) = c 0 . Since D is open, there exists a real number r 0 > 0 such that B(y 0 , r 0 ) ⊂ D. Therefore, if r < r0 a , then y 0 + λa ∈ D holds for all λ ∈ [−r, r]. This means that by using the notation S := s(y 0 − ra, y 0 + ra) we have that S ⊂ D and c 0 is an interior point of p a (S). Moreover, since S is compact and connected, we get that p a (S) is a closed interval while clearly it is a proper interval, as S is not contained in any hyperplane orthogonal to a. Furthermore, it is easy to check that p a | S : S −→ p a (S) is a bijective function. Therefore holds for all c ∈ p a (S).
Here p a | S is a restriction of a linear function, so it is continuous. As its domain of definition is a compact line segment, we get that the inverse of p a | S is continuous, too. Hence f is a composition of two continuous functions, therefore f itself is continuous on p a (S). Recall that c 0 is an interior point of p a (S), so f is continuous in an open neighborhood of c 0 . Since c 0 ∈ p a (D) was arbitrary, we have obtained that f is continuous on its whole domain of definition p a (D).

P. Tóth AEM
We shall prove that if f is not injective then F is constant. If there exist s, t ∈ p a (D), s < t such that f (s) = f (t), then this means that there exist [s,t] is constant, then clearly F is also constant on an open ball and hence constant on the whole domain D, according to Corollary 3.13. Therefore we may assume that f attains one of its extrema in an inner point of the interval [s, t]. Suppose that there exists u ∈ ]s, t[ such that f (u) = max{f (c) | c ∈ [s, t]} (the case when the minimum is attained in an inner point can be handled analogously). Let x u ∈ D such that p a (x u ) = u. Then there exists ε > 0 such that Moreover u is a local maximum and therefore, due to the Darboux-property of the continuous function f | pa(S) , there exist x 1 , x 2 ∈ S and c ∈ p a (D) such that p a (x 1 ) < u < p a (x 2 ) and

This implies
Consequently, there exist n + 1 affinely independent points in B where F has the same value (namely c). According to Theorem 3.7, F is then constant on B and therefore on D as well.
So we have shown that if F is not constant on D then f must be injective. But f is also continuous hence it is strictly monotone as well.

Continuous solutions of a system of functional equations
Let us consider a given set ∅ = S ⊂ R n and a function F : S −→ R . For every k = 1, . . . , n let us define the sets E k (S, F ) ⊂ R 2 in the following way: Suppose that there exist some functions Ψ k : E k (S, F ) −→ R (k = 1, . . . , n) such that the following equations hold: . . .
Then we say that F is a solution of the system of composite functional equations (1) − (n). In this section we will describe the continuous solutions of this system of functional equations, using the previously verified results about locally translation invariant functions.
From now on, a vector v ∈ R n will often be represented by its coordinate vector with respect to the standard basis. Proof. Let x, y ∈ D such that F (x) = F (y) and suppose that for some radius 0 < r ∈ R the inclusions B(x, r) ⊂ D and B(y, r) ⊂ D hold. Moreover suppose that h < r is fulfilled for some vector h ∈ R n . Due to the assumptions, it is obvious that hold for all indices k = 1, . . . , n. Therefore we can execute the following calculations:   = (a 1 , . . . , a n ) ∈ R n and a strictly monotone, continuous function f : p a (D) −→ R such that F (x 1 , . . . , x n ) = f (a 1 x 1 + · · · + a n x n ) holds for all (x 1 , . . . , x n ) ∈ D .
Proof. It immediately follows from Theorem 3.16 and Lemma 4.1.

Application in mathematical economics
In this section we are going to use our previous decomposition theorems in order to characterize the Cobb-Douglas type utility functions with a system of functional equations. Let us introduce a notation for such vectors of R n that have only positive coordinates: Then u is called a Cobb-Douglas utility function.
A utility function u : D −→ R always generates a preference relation u on its domain of definition: However, in mathematical economics the preference relation generated by a utility function is more relevant than the function itself [3]. It is easy to see that if the utility function is composed with a strictly increasing real function then the generated preference relation remains the same. Hence, if u is a Cobb-Douglas utility function and ϕ is a strictly increasing real function, then the composite function ϕ • u shall be considered as a Cobb-Douglas type utility function. Now let ∅ = S ⊂ R n be a given set and F : S −→ R be a given function. At the beginning of Section 4 we defined the sets E k (S, F ). We shall introduce a similar notation which will be useful in the formulation and proof of the following theorem. For every k = 1, . . . , n let us define G k (S, F ) ⊂ R 2 in the following way: with the following property: for all (x 1 , . . . , x n ) ∈ D, t k ∈ R + such that (x 1 , . . . , x k−1 , x k · t k , x k+1 , . . . , x n ) ∈ D the equations u(x 1 , . . . , x k−1 , x k · t k , x k+1 , . . . , x n ) = Φ k (u(x 1 , . . . , x n ), t k ) are fulfilled for all k = 1, . . . , n.
Proof. Firstly, let u be a Cobb-Douglas type utility function i.e.
To check that the requirements of the theorem are fulfilled we shall calculate Conversely, let us assume that u is continuous, strictly increasing in all of its variables and it is a solution of the system of composite functional equations u(x 1 , . . . , x k−1 , x k · t k , x k+1 , . . . , x n ) = Φ k (u(x 1 , . . . , x n ), t k ) for every k = 1, . . . , n. Now we may define the set S = { (ln x 1 , . . . , ln x n ) ∈ R n | (x 1 , . . . , x n ) ∈ D }.
Clearly, S is connected, since it is the image of the connected set D under a continuous function. In order to see that S is open as well, let us introduce the function E : R n −→ R with the formula E(y 1 , . . . , y n ) = (e y1 , . . . , e yn ). Then E is obviously continuous and, as S is the preimage of D under E, we get that S is open. Let us define the function v : S −→ R in the following way: v(y 1 , . . . , y n ) = u (e y1 , . . . , e yn ) , where (y 1 , . . . , y n ) ∈ S.