Abstract
We continue to study the problem of modeling of substitution of production factors motivated by the need for computable mathematical models of economics that could be used as a basis in applied developments. This problem has been studied for several decades, and several connections to complex analysis and geometry have been established. We describe several models of resource distribution and discuss the inverse problems for the generalized Radon transform arising in these models. We give a simple explicit range characterization for a particular case of the generalized Radon transform, and we apply it to show that the most popular production functions are compatible with these models. Besides, we give a necessary condition and a sufficient condition for solvability of the model identification problem in the form of an appropriate moment problem. These conditions are formulated in terms of rhombic tilings.
Similar content being viewed by others
References
Agaltsov, A.D.: A characterization theorem for a generalized Radon transform arising in a model of mathematical economics. Funct. Anal. Appl. 49(3), 201–204 (2015)
Agaltsov, A.D.: On the injectivity of the generalized Radon transform arising in a model of mathematical economics. Inverse Probl. 32(11), 115022 (2016)
Alekseev, V.M., Tikhomirov, V.M., Fomin, S.V.: Optimal control. Consultants Bureau, New York (1987)
Aubin, J.P.: Analyse non linéaire et ces motivations économiques. Masson, Paris (1984)
Bateman, H., Erdélyi, A.: Tables of integral transforms, vol. 1. McGraw-Hill, New York (1954)
Bochner, S.: Harmonic analysis and the theory of probability. University of California press, Berkeley (1955)
Cornwall, R.: A note on using profit functions. Int. Econ. Rev. 14(2), 211–214 (1973)
Danilov, V.I., Karzanov, A.V., Koshevoy, G.A.: Separated set-systems and their geometric models. Russ. Math. Surv. 65(4), 659–740 (2010)
Goodman, J.E., Pollack, R.: Proof of Grünbaum’s conjecture on the stretchability of certain arrangements of pseudolines. J. Comb. Theory Ser. A. 29(3), 385–390 (1980)
Henkin, G.M., Shananin, A.A.: Bernstein theorems and Radon transform. Application to the theory of production functions. Trans. Math. Mon. 81, 189–223 (1990)
Henkin, G.M., Shananin, A.A.: \({\mathbb{C}}^n\)-capacity and multidimensional moment problem. In: Stoll, W. (ed.) Proceedings Symposium on Value Theory in Several Complex Variables, Ser. Notre Dame Mathematical Lectures, vol. 12, pp. 69–85. University of Notre Dame, Notre Dame (1990)
Henkin, G.M., Shananin, A.A.: The Bernstein Theorems for the Fantippie Indicatrix and Their Applications to Mathematical Economics. Ser. Lecture Notes in Pure and Applied Mathematics, vol. 132, pp. 221–227 (1991)
Hildenbrand, W.: Short-run production functions based on micro-data. Econometrica 49(5), 1095–1125 (1981)
Houthakker, H.S.: The Pareto distribution and the Cobb–Douglas production function in activity analysis. Rev. Econ. Stud. 23(1), 27–31 (1955–1956)
Johansen, L.: Production functions. North Holland, Amsterdam (1972)
Karzanov, A.V., Shananin, A.A.: On stable correspondences of finite sets of the Euclidean space and their applications. Ekonomika i Matematicheskie Metody 41(2), 111–112 (2005)
Molchanov, E.G.: Combinatorial properties of polyhedral cone classes in the resource distribution problem. Proc. Moscow Inst. Phys. Technol. 5(3), 67–74 (2013)
Molchanov, E.G.: Rhomboidal tiling’s modifications in the resource distribution problem. Proc. Moscow Inst. Phys. Technol. 5(4), 87–95 (2013)
Petrov, A.A., Pospelov, I.G., Shananin, A.A.: Experience of mathematical modeling for economy. Energoatomizdat, Moscow (1996)
Sato, K.: A two-level constant-elasticity of substitution production function. Rev. Econ. Stud. 34, 201–218 (1967)
Shananin, A.A.: Investigation of a class of production functions arising in a macrodescription of economic systems. USSR Comput. Math. Math. Phys. 24(6), 127–134 (1984)
Shananin, A.A.: Study of a class of profit functions arising in a macro description of economic systems. USSR Comput. Math. Math. Phys. 24(1), 34–42 (1985)
Shananin, A.A.: The generalized model of a pure industry. Matem. Mod. 9(9), 117–127 (1997)
Shananin, A.A.: The investigation of the generalized model of a pure industry. Matem. Mod. 9(10), 73–82 (1997)
Shananin, A.A.: Duality for generalized programming problems and variational principles in models of economic equilibrium. Doklady Akademii Nauk 366(4), 462–464 (1999)
Shananin, A.A.: Non-parametric method for the analysis of industry technological structure. Matem. Mod. 11(9), 116–122 (1999)
Shananin, A.A.: Integrability problem and the generalized non-parametric method for the consumer demand analysis. Proc. Moscow Inst. Phys. Technol. 1(4), 84–98 (2009)
Shor, P.W.: Stretchability of pseudoline arrangements is NP-hard. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. Ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 531–554. AMS, Providence (1991)
Acknowledgements
The present work is supported by the Russian Science Foundation (project number 16-11-10246).
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is dedicated to G. M. Henkin.
Appendices
Appendix 1: Proofs of the Results of Sect. 3
Proof of Proposition 3.1
One can show that if a group of industries satisfies (3.7) and \(l = (l_1,\ldots ,l_n)>0\), then optimization problem (3.3)–(3.6) satisfies Slater’s condition (see [3] for definition).
The Lagrange function \(L = L(X^0,X^1,\ldots ,X^m,l^1,\ldots ,l^m,p_0,q,s)\) for convex programming problem (3.3)–(3.6) is given by
By the Kuhn–Tucker theorem (see, e.g., [3]), the set of vectors \(\{ \widehat{X}^0, \widehat{X}^1,\ldots ,\widehat{X}^m,\widehat{l}^1,\ldots ,\widehat{l}^m\}\) satisfying (3.4)–(3.6) is a solution of convex programming problem (3.3)–(3.6) with Slater condition if and only if:
-
(i)
There exist Lagrange multipliers \(p_0 > 0\), \(q = (q_1,\ldots ,q_m) \ge 0\), \(s = (s_1,\ldots ,s_n) \ge 0\), such that the complementary slackness conditions (3.9), (3.10) are satisfied.
-
(ii)
The maximum of Lagrange function L on the set (3.6) is attained at the set of vectors \(\{ \widehat{X}^0, \widehat{X}^1,\ldots ,\widehat{X}^m,\widehat{l}^1,\ldots ,\widehat{l}^m\}\).
It follows from formula (7.1) that the above condition (ii) is equivalent to (3.8), (3.11). Proposition 3.1 is proved. \(\square \)
Proof of Proposition 3.3
Using the Fenchel duality theorem (see, e.g., [4]) we have that
Formulas (3.15), (7.2) imply (3.16).
Using the Fenchel–Moreau theorem (see, e.g., [4]) and formula (3.16), we obtain (3.17). Proposition 3.3 is proved. \(\square \)
Appendix 2: Proofs of the results of Sect. 4
Proof of Proposition 4.1
Necessity. Let \(\Pi (p,p_0)\) be defined by (4.25). It follows from (4.24) that the definition is correct. Put \(P_r(x_1,\ldots ,x_n) = (x_1^{-r},\ldots ,x_n^{-r})\). Then
Using (8.1), we obtain
Formula (4.28) follows from (8.2). Formulas (4.26), (4.27) follow from (4.25), (8.1).
Sufficiency. Let \(\widetilde{\Pi }(p,p_0)\) be a function satisfying (4.26)–(4.28) and let \(\Pi (p,p_0)\) be the function defined by (4.25).
It follows from formulas (4.27), (4.28) for \(\widetilde{\Pi }\) and \(\Pi \) that
Using formulas (4.27), (4.28) for \(\widetilde{\Pi }\) and \(\Pi \) and formula (8.3), we obtain that \(\widetilde{\Pi }(p,p_0) = \Pi (p,p_0)\), \((p,p_0)>0\). \(\square \)
Demonstration of Example 4.2
It is shown in [14] that \(F_\text {CD}(l_1,l_2)\) is the production function for the resource distribution problem (2.1)–(2.3) with \(\mu \) defined in (2.12). Using formulas (2.7), (2.12), we compute the profit function \(\Pi _\text {CD}(p_1,p_2,p_0)\) corresponding to \(F_\text {CD}(l_1,l_2)\):
Taking the second derivative of (8.4) with respect to \(p_0\), we get
One can see that
Using Proposition 4.1, we obtain that
Formula (8.7) implies that \(\Pi _\text {CD}(p_1,p_2,p_0)\) is the profit function for the resource distribution problem (4.3)–(4.5) with (4.29), (4.30). As a corollary, \(F_\text {CD}(l_1,l_2)\) is the production function for the same problem. \(\square \)
Demonstration of Example 4.3
The profit function \(\Pi _\text {CES}(p,p_0)\) corresponding to \(F_\text {CES}(l_1,l_2)\) is given by formula (2.21). We rewrite formula (2.21) as follows:
Taking the second derivative of (8.8) with respect to \(p_0\), we get
Using Lemma 8.2 formulated below we have that
Using Proposition 4.1, we obtain that
Formula (8.12) and definitions (8.9) imply that \(\Pi _\text {CES}(p_1,p_2,p_0)\) is the profit function for the resource distribution problem (4.3)–(4.5) with (4.31), (4.32). As a corollary, \(F_\text {CES}(l_1,l_2)\) is the production function for the same problem. \(\square \)
Lemma 8.1
Let f(s) be a function such that \(\int _0^{+\infty } \text {e}^{-As} |f(s)| \, \text {d}s < \infty \) for any \(A>0\). Then
Proof
The following formula is well known, see, e.g., [5]:
where \(s = (s_1,s_2) > 0\), \(p = (p_1,p_2) > 0\). We set \(s_1 = s_2\), multiply this equation by f(s) and integrate over \(s \in [0,+\infty )\):
Making the change of variable \(s^2 = t\) in the inner integral on the left, we get (8.13). \(\square \)
Lemma 8.2
Let \(\beta _1\), \(\beta _2\), \(b > 0\). The following formula is valid:
where \(\Gamma \) is the gamma function.
Proof
Consider the case \(\beta _1 = \beta _2 = 1\). Put \(f(s) = \frac{s^{b-1}}{\Gamma (b)}\). We have
We define functions G(s) and \(H(x_1,x_2)\) according to (8.13). Then
Using (8.13), (8.15), (8.16), we get (8.14) with \(\widetilde{H} = H\) for \(\beta _1 = \beta _2 = 1\).
Besides, recall the scaling property of the Laplace transform:
It follows from this scaling property that for arbitrary \(\beta _1\), \(\beta _2\) we have (8.14) with \(\widetilde{H}(x_1,x_2) = (\beta _1 \beta _2)^{-2} H(\tfrac{x_1}{\beta _1^2},\tfrac{x_2}{\beta _2^2})\).
Lemma 8.2 is proved. \(\square \)
Appendix 3: Proofs of the results of Sect. 5
Proof of Proposition 5.2
It follows from (5.9) that
where |S| denotes the number of elements of set S.
Suppose that Problem 5.1 is solvable and \(\mu \) is a solution. Then using (5.3) we get
where \(N_i(G)\) is defined in (9.1).
Formulas (5.10), (9.1), (9.2) and non-negativity of measure \(\mu \) imply (5.11). \(\square \)
Proof of Proposition 5.3
Consider an arbitrary face of cone \(\Gamma _h(\widehat{p}) = \Gamma _h\{ \widehat{p}(t) \mid t = 1,\ldots , T\}\). This face is the linear span of some linearly independent spectra \(Z(G_1)\), ..., \(Z(G_{T-1})\) of \(G_1\), ..., \(G_{T-1} \in \Lambda _h ( \widehat{p} )\). Thus, it can be described by the following equation for \(Z = (Z_1,\ldots ,Z_T)\):
As far as the coordinates of \(Z(G_1)\), ..., \(Z(G_{T-1})\) are integer, the coefficients of Eq. (9.3) are also integer. Besides, this vector of coefficients is a normal vector to the face described by (9.3). \(\square \)
Proof of Proposition 5.4. Sufficiency
Suppose that \(\Gamma _h(\widehat{p}) = \Gamma _h\{ \widehat{p}(t) \mid t = 1,\ldots ,T \}\) is discretely convex. Let \(y = ( y(1), \ldots , y(T) )\) be a vector satisfying the necessary condition of Proposition 5.2. In view of Proposition 5.1, it is sufficient to show that \(y \in \Gamma _h (\widehat{p} )\).
In turn, in order to show that \(y \in \Gamma _h ( \widehat{p} )\), it is sufficient to check that for any inner normal \(\nu = (\nu _1,\ldots ,\nu _T)\) to \(\Gamma _h(\widehat{p})\), whose coordinates belong to \(\{-1,0,1\}\), we have \(y \cdot \nu \ge 0\).
Put
Using that \(z(G) \in \Gamma _h(\widehat{p})\), \(G \in \Lambda _h(\widehat{p})\), we have that
By hypothesis, y satisfies the necessary condition of Proposition 5.2. Thus, (9.5) implies
Hence, \(y \in \Gamma _h ( \widehat{p} )\).
Necessity. For a given pair \((\Omega _1,\Omega _2)\) of subsets \(\Omega _1\), \(\Omega _2 \subset \{1,\ldots ,T\}\) such that \(\Omega _1 \cap \Omega _ 2 = \varnothing \), \(\Omega _1 \cup \Omega _2 \ne \varnothing \), we set
Let
Using these notations, Proposition 5.2 can be reformulated as \(\Gamma _h(\widehat{p}) \subseteq \Gamma \). Suppose that the necessary condition of Proposition 5.2 is also sufficient. Then
By construction, the cone \(\Gamma _h(\widehat{p})\) is spanned by vectors with coordinates in \(\{-1,0,1\}\). It also follows from (9.7), (9.8), (9.9) that each face of \(\Gamma _h ( \widehat{p} )\) admits a non-zero normal vector with coordinates in \(\{-1,0,1\}\). It follows that \(\Gamma _h (\widehat{p} )\) is discretely convex. \(\square \)
Appendix 4: Proofs of the results of Sect. 6
Proof of Proposition 6.2
We prove that using moves (6.23a), (6.23b) one can transform \(\omega _1\) and \(\omega _2\) to a fixed word depending only on \(\Sigma _\rho = \Sigma \{ \tilde{p}(t,\rho ) \mid t = 1,\ldots ,T \} \in S_T\). One can see that it is true for \(T=2\). For arbitrary \(T \ge 3\) we prove it using induction.
Let \(t^* \in \{1,\ldots ,T\}\) be such that
We continuously increase \(\widetilde{p}_2(t^*,\rho )\) leaving the parameters \(\widetilde{p}_1(t,\rho )\), \(t = 1\), ..., T, and \(\widetilde{p}_2(t,\rho )\), \(t = 1\), ..., \(t^*-1\), \(t^*+1\), ..., T, unchanged. This leads to transformations of the word of (6.22) associated to the partition of \(\mathbb R^2_+\) by the lines of (6.13).
As we increase \(\alpha \) from 0 to \(\tfrac{\pi }{2}\), the ray \(R_\alpha \) consecutively meets intersection points (6.19) of the pairs of lines of (6.13). Variations of \(\widetilde{p}_2(t^*,\rho )\) can change the order in which \(R_\alpha \) meets these points. This situation corresponds to application of move (6.23a) to the word (6.22) associated to partition.
Besides, if one increases \(\widetilde{p}_2(t^*,\rho )\), the \(t^*\)th line of (6.13) can meet the intersection point for a pair of other lines of (6.13). This situation corresponds to application of move (6.23b) to the word (6.22) associated to partition.
One can see that the \(t^*\)th line of (6.13) intersects the lines with numbers \(t = t^*+1\), ..., T and does not intersect the other lines of (6.13). Let \(\alpha _{tt^*}\), \(t = t^*+1\), ..., T, be the values of \(\alpha \) for which \(R_\alpha \) meets the intersection point of the \(t^*\)th line with the tth line. Note that
Choose \(\tilde{p}_2(t^*,\rho )\) in such a way that \(\alpha _{tt^*} < \alpha ^*\), \(t=t^*+1\), ..., T, where \(\alpha ^*\) be the minimal of the angles for which the ray \(R_\alpha \) meets an intersection point of a pair of lines of (6.13) with \(t \ne t^*\).
As \(\alpha \) increases from 0 to \(\tfrac{\pi }{2}\), the ray \(R_\alpha \) consecutively meets the intersection points of the pairs of lines of (6.13) with numbers \((t^*,t^*+1)\), ..., \((t^*,T)\) and then the intersection points of the lines of (6.13) different from the \(t^*\)th line. As a corollary, the word (6.22) corresponding to this partition of \(\mathbb R^2_+\) by the lines of (6.13) starts as
Note that this subword is completely determined by \(\Sigma _\rho = \Sigma \{ \widetilde{p}(t,\rho ) \mid t = 1,\ldots ,T\} \in S_T\).
Also note that if \(\alpha >\alpha ^*\) then \(\pi _T(\alpha )=t^*\) and the \(t^*\)th line does not appear in intersections of \(R_\alpha \) with the pairs of lines of (6.13). Thus, symbol \(\sigma _{T-1}\) does not appear in the next part of the word (6.22).
Then remove the \(t^*\)th line from family (6.13), renumber remaining lines, and define the new permutation \(\Sigma ' \in S_{T-1}\) according to (6.31). The new permutation \(\Sigma '\) is uniquely determined by \(\Sigma _\rho \).
The word (6.22) corresponding to the new partition is obtained from the old word by removing the beginning (10.3).
It remains to apply the induction hypothesis to the new partition and corresponding formal word (6.22).
Proposition 6.2 is proved. \(\square \)
Proof of Proposition 6.3
Let \(\alpha \in (0,\tfrac{\pi }{2})\) be such that \(\pi (\alpha )=\lambda \), where \(\pi (\alpha )\) is defined in (6.20). Let \(G_0,\ldots ,G_T\) be the domains of partition \(\Lambda \{ \widetilde{p}(t,\rho ) \mid t = 1,\ldots ,T \}\) consecutively traversed by the point \((z_1,z_2(z_1)) \in R_\alpha \) as \(z_1\) goes from \(+\infty \) to 0.
Let \(\zeta _j \in \mathbb R^2_+\), \(r_j > 0\), \(j = 1\), ..., T, be such that
Put
Then \(\mu (\text {d}x) = f(x) \text {d}x\) is a non-negative absolutely continuous measure which solves the moment problem (6.1). \(\square \)
Proof of Proposition 6.4
We begin by showing that if \(Sn(\lambda )\) does not belong to the closed bounded domain bounded by \(Sn({{\mathrm{id}}}_{S_T})\) and \(Sn(\Sigma _\rho )\), then
Suppose that (10.6) is not true. Let \(Y_t = (y(t),y(t))\), \(t = 1\), ..., T. We join \(Y_t\) by the line segments with \((\tfrac{1}{\widetilde{p}_1(t,\rho )},0)\) and \((0,\tfrac{1}{\widetilde{p}_2(t,\rho )})\). We call this pair of segments a wire.
If (10.6) does not hold, each pair of wires has at most one intersection point, and thus the set of these wires is a strict wiring diagram. The boundaries of the closed domain bounded by this diagram coincide with boundaries of the closed domain bounded by the rhombic tiling corresponding to partition \(\Lambda \{ \widetilde{p}(t,\rho ) \mid t = 1,\ldots ,T \}\). This closed domain contains \(Sn(\lambda )\), and this contradicts the hypothesis.
Next, suppose that \(\mu \) is a solution of the moment problem (6.1), and suppose that \(Sn(\lambda )\) is not contained in the closed bounded region bounded by \(Sn({{\mathrm{id}}}_{S_T})\) and \(Sn(\Sigma _\rho )\). As it was shown above, we have (10.6).
Condition \(\widetilde{p}_2(t_1,\rho ) < \widetilde{p}(t_2,\rho )\) implies that
Applying Proposition 5.2 with \(\Omega _1 = \{t_1\}\), \(\Omega _2 = \{t_2\}\) and using (10.7), we have that \(y(t_2) \le y(t_1)\). It contradicts (10.6). Thus, the moment problem 6.1 is not solvable.
Proposition 6.4 is proved. \(\square \)
Rights and permissions
About this article
Cite this article
Agaltsov, A.D., Molchanov, E.G. & Shananin, A.A. Inverse Problems in Models of Resource Distribution. J Geom Anal 28, 726–765 (2018). https://doi.org/10.1007/s12220-017-9840-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12220-017-9840-1
Keywords
- Mathematical economics
- Inverse problems
- Integral and discrete geometry
- Generalized Radon transform
- Moment problem
- Rhombic tilings