EXTENSIONS OF CONVEX FUNCTIONALS ON CONVEX CONES

Similar documents
The Asymptotic Theory of Transaction Costs

Functions of several variables of finite variation and their differentiability

Discrete-Time Market Models

A Simple Computational Approach to the Fundamental Theorem of Asset Pricing

A Barrier Version of the Russian Option

QUANTITATIVE FINANCE RESEARCH CENTRE

E. The Hahn-Banach Theorem

OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS

Calculating the set of superhedging portfolios in markets with transactions costs by methods of vector optimization

Sample of Ph.D. Advisory Exam For MathFinance

2 Lecture Span, Basis and Dimensions

No-Arbitrage Criteria for Financial Markets with Transaction Costs and Incomplete Information

Efficient portfolios in financial markets with proportional transaction costs

Monetary Risk Measures and Generalized Prices Relevant to Set-Valued Risk Measures

No Arbitrage: On the Work of David Kreps

Abstract. The connectivity of the efficient point set and of some proper efficient point sets in locally convex spaces is investigated.

SOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS

The New Operators in Topological Space

Completeness of bond market driven by Lévy process

Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets

Super-replication and utility maximization in large financial markets

CHAPTER II HILBERT SPACES

Lecture 7: Semidefinite programming

At t = T the investors learn the true state.

Snell envelope and the pricing of American-style contingent claims

Handout 4: Some Applications of Linear Programming

Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets

Optimal Pricing Strategies in a Continuum Limit Order Book

arxiv: v1 [math.fa] 20 Aug 2015

Introduction Optimality and Asset Pricing

We suppose that for each "small market" there exists a probability measure Q n on F n that is equivalent to the original measure P n, suchthats n is a

ON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES

Optimal investment and contingent claim valuation in illiquid markets

Translative Sets and Functions and their Applications to Risk Measure Theory and Nonlinear Separation

Fixed Point Theorems for Condensing Maps

UNCERTAINTY FUNCTIONAL DIFFERENTIAL EQUATIONS FOR FINANCE

FUBINI PROPERTY FOR MICROSCOPIC SETS

An Introduction to Noncooperative Games

Geometry and topology of continuous best and near best approximations

A Concise Course on Stochastic Partial Differential Equations

Noncooperative Games, Couplings Constraints, and Partial Effi ciency

The local equicontinuity of a maximal monotone operator

Coherent risk measures

Continuous Sets and Non-Attaining Functionals in Reflexive Banach Spaces

ON A CERTAIN GENERALIZATION OF THE KRASNOSEL SKII THEOREM

AN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE. Mona Nabiei (Received 23 June, 2015)

Essential Supremum and Essential Maximum with Respect to Random Preference Relations

EXISTENCE OF PURE EQUILIBRIA IN GAMES WITH NONATOMIC SPACE OF PLAYERS. Agnieszka Wiszniewska Matyszkiel. 1. Introduction

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

ON DENSITY TOPOLOGIES WITH RESPECT

SEPARABLE TERM STRUCTURES AND THE MAXIMAL DEGREE PROBLEM. 1. Introduction This paper discusses arbitrage-free separable term structure (STS) models

Bing maps and finite-dimensional maps

arxiv: v2 [q-fin.mf] 10 May 2018

Market environments, stability and equlibria

C* ALGEBRAS AND THEIR REPRESENTATIONS

Some topologies in the half-plane

Boundedly complete weak-cauchy basic sequences in Banach spaces with the PCP

On operator equilibrium problems

Strong Duality and Dual Pricing Properties in Semi-infinite Linear Programming A Non-Fourier-Motzkin Elimination Approach

2. The Concept of Convergence: Ultrafilters and Nets

CHARACTERIZATION OF CARATHÉODORY FUNCTIONS. Andrzej Nowak. 1. Preliminaries

Robust pricing hedging duality for American options in discrete time financial markets

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.

Closedness of the solution mapping to parametric vector equilibrium problems

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games

Set theory and topology

Portfolio Optimization in discrete time

UTILITY OPTIMIZATION IN A FINITE SCENARIO SETTING

Lecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.

ON UNIFORM TAIL EXPANSIONS OF BIVARIATE COPULAS

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

WHEN AN ATOMIC AND COMPLETE ALGEBRA OF SETS IS A FIELD OF SETS WITH NOWHERE DENSE BOUNDARY

REAL RENORMINGS ON COMPLEX BANACH SPACES

THE ASYMPTOTIC ELASTICITY OF UTILITY FUNCTIONS AND OPTIMAL INVESTMENT IN INCOMPLETE MARKETS 1

OUTER MEASURES ON A COMMUTATIVE RING INDUCED BY MEASURES ON ITS SPECTRUM. Dariusz Dudzik, Marcin Skrzyński. 1. Preliminaries and introduction

The Skorokhod problem in a time-dependent interval

Lectures for the Course on Foundations of Mathematical Finance

LYAPUNOV STABILITY OF CLOSED SETS IN IMPULSIVE SEMIDYNAMICAL SYSTEMS

The small ball property in Banach spaces (quantitative results)

ARBITRAGE AND GROWTH RATE FOR RISKLESS INVESTMENTS IN A STATIONARY ECONOMY

The main purpose of this chapter is to prove the rst and second fundamental theorem of asset pricing in a so called nite market model.

Some Generalizations of Caristi s Fixed Point Theorem with Applications

Necessary Conditions for the Existence of Utility Maximizing Strategies under Transaction Costs

Duality and optimality conditions in stochastic optimization and mathematical finance

On the dual problem of utility maximization

Chapter 2: Preliminaries and elements of convex analysis

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17

Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption

ON SOME SUBCLASSES OF THE FAMILY OF DARBOUX BAIRE 1 FUNCTIONS. Gertruda Ivanova and Elżbieta Wagner-Bojakowska

Chapter 4. Applications/Variations

USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION

New Generalizations of Caristi s Fixed Point Theorem Via Brézis Browder Principle

z -FILTERS AND RELATED IDEALS IN C(X) Communicated by B. Davvaz

Exhaustible Resources and Economic Growth

Optimal Stopping Problems and American Options

Notes on Ordered Sets

Economics 501B Final Exam Fall 2017 Solutions

In these notes we will outline a proof of Lobachevskiĭ s main equation for the angle of parallelism, namely

Transcription:

APPLICATIONES MATHEMATICAE 25,3 (1998), pp. 381 386 E. IGNACZAK (Szczecin) A. PASZKIEWICZ ( Lódź) EXTENSIONS OF CONVEX FUNCTIONALS ON CONVEX CONES Abstract. We prove that under some topological assumptions (e.g. if M has nonempty interior in X), a convex cone M in a linear topological space X is a linear subspace if and only if each convex functional on M has a convex extension on the whole space X. 1. Introduction. Let M be any convex cone in a linear topological space X (i.e. M + M M and R + M M). Assume that every convex functional π on M (π(λm) = λπ(m), π(m + m 1) π(m) + π(m 1 ) for λ R +, m, m 1 M) can be extended to a convex functional π on X. It is not difficult to notice that this condition on M is rather restrictive. In fact, we shall prove that it can be valid only for M being a linear subspace of X. But some auxiliary constructions are necessary. We also need some topological assumptions, e.g. that M has nonempty interior. The possibility of extending any convex functional is a natural question important in a number of applications of functional analysis. We only point out that convex functionals appear in a natural way in the pricing of contingent claims on market with transaction costs [3], [4]. We explain this in the simple case of a finite set of trading times (0, 1,..., T ) (cf. [1]). Let X 0, X 1,..., X T be random prices of a unit of one stock. Thus (X t ) is adapted to increasing σ-fields F 0 = {, Ω} F 1... F T. For any trading strategy, which is a predictable sequence θ 1,..., θ T (that is, θ t is F t 1 -measurable), and for the number V 0 denoting initial investments, one defines the payoff of the strategy by the formula V T = V 0 + θ 1 (X 1 X 0 ) +... + θ T (X T X T 1 ). It was Harrison and Kreps [1] who showed the role of models of this type. 1991 Mathematics Subject Classification: 52A07, 46A22. Key words and phrases: Hilbert space, convex cone, convex functional. [381]

382 E. Ignaczak and A. Paszkiewicz They proved that, for X 0, X 1,..., X T satisfying the so-called no arbitrage condition, all the payoffs V T form a linear subspace. The initial investment V 0 is uniquely determined by V T and V 0 is a linear functional of V T. To describe a more realistic case, one assumes that bid and ask prices of a stock are given by different (F 0,..., F T )-adapted processes (X 0,..., X T ), (X 0,..., X T ) with X t X t. In such a case, one describes a trading strategy by two nonnegative, nondecreasing processes (θ 1,..., θ T ) and (θ 1,..., θ T ), predictable with respect to the filtration (F 1,..., F T ). At each trading time t, the investor sells θ t+1 θ t units of the stock and buys θ t+1 θ t units. Therefore θ t and θ t are respectively the cumulative long position and cumulative short position in the stock just before time t = 0,..., T. Denote by V t the amount of the investor s money (in a bank or riskless bonds) just before trading time t = 0,..., T. We assume that θ 0 = θ 0 = 0 and, moreover, that after time T, our net position in the stock should be equal to zero. More precisely, θ T +1 θ T = θ T, θ T +1 θ T = θ T. The final payoff is given by the formula (1) V = V 0 + [θ 1 X 0 θ 1X 0] + [(θ 2 θ 1 )X 1 (θ 2 θ 1)X 1] +... + [(θ T θ T 1 )X T 1 (θ T θ T 1)X T 1] + θ T X T θ T X T. This example is, in fact, a special case of the model described in [3]. We assume that prices are discounted in such a way that the interest rate of a bank deposit (bond) equals zero (and that the short position in a bond is possible with no restrictions). The investor cumulates all his income in the bank and the self-financing condition is satisfied automatically. Obviously, V 0 still describes an initial investment. Assume that V is a possible final payoff. Then π(v ) = inf V 0, where the infimum is taken over all θ, θ, V 0 satisfying (1), is a necessary initial investment, uniquely determined by V. In this situation the V s form a convex cone M with π being a convex functional on M. Extension of this functional has a very important interpretation as the pricing of all possible contingent claims (see [4] for general explanations). From this point of view, our result is negative. Extension of pricing functionals cannot be obtained by general (geometrical) methods dealing with all cones and functionals. 2. Extensions in linear topological spaces. We use the following terminology. A convex cone means any set M contained in a real linear space X, satisfying M + M M and R + M M. A convex functional means a function π : M R satisfying π(λx) = λπ(x) and π(x + y) π(x) + π(y) for λ 0 and x, y M (see [5] for more information). Theorem 2.1. Let X be a linear space, M X a convex cone, ψ a linear functional on X, and let a, b be two elements of X such that:

(i) ψ(x) 0 for x M; (ii) ψ(a) = 0, a 0; (iii) ψ(b) < 0; (iv) a + t(b a) M for t (0, 1]. Extensions of convex functionals 383 Then there exists a convex functional π : M R without a convex extension to X. If X is a linear topological space and ψ is continuous, then π can be chosen continuous. P r o o f. Define L = lin(a, b). Let ϕ : L R be a linear functional with ϕ(a) = ϕ(b) = 1 and let ϕ : X R be a linear extension of ϕ on X, i.e. ϕ L = ϕ. Define D = M {x X : ϕ(x) = 1}. It is clear that a, b D. Let f : (, 0] R be given by { f(t) = 1 1 (t + 1)2, 1 t 0, 0, t 1. Notice that f is a convex non-decreasing function with non-negative values. Let π be the function on M given by { λf(ψ(d)) for x = λd with some λ > 0 and d D, π(x) = 0 for the remaining x M. Observe that π is well defined and convex. We prove that π cannot be extended to X. It is enough to show that there exists no convex functional π defined on L = lin(a, b) such that (2) π L M = π L M. So, suppose that a convex functional π satisfies (2). Consider the function g(t) = π (a + t(b a)), t R. Note that g is convex. Moreover, for t (0, 1], we have g(t) = π(a + t(b a)) because ϕ(a + t(b a)) = ϕ(a) + t(ϕ(b) ϕ(a)) = 1, i.e. a + t(b a) L M. Hence g(t) = f(ψ(a + t(b a))) = f(tψ(b)), which means that (3) g(t) = 1 1 (tψ(b) + 1) 2, t (0, 1/ψ(b)]. This is impossible because the function (3) cannot be extended to a convex function on the whole real line. Theorem 2.2. Let X be a real linear topological space and M a cone in X with nonempty interior. The following conditions are equivalent: (i) M = X; (ii) every convex functional π : M R can be extended to a convex functional π on X; (iii) every continuous convex functional π : M R can be extended to a convex functional π on X.

384 E. Ignaczak and A. Paszkiewicz P r o o f. It is enough to prove the implication (iii) (i). Let M X be a convex cone with nonempty interior such that M X. Suppose that b int M, and c M (i.e. c 0). We may assume that b, c are linearly independent. Let a = b + sup{t [0, 1] : b + t(c b) M}(c b). Then a 0 and a M \ int M. If a int M, then a a = 0 int M, i.e. M = X. Thus lin a int M =. By the Mazur theorem [5], there exists a linear functional such that ψ(a) = 0 and ψ(x) < 0 for each x int M. To complete the proof, it is now enough to apply the previous theorem. Corollary 2.3. If M is a convex cone in R n containing at least two linearly independent vectors, then the following conditions are equivalent: (i) M is a linear subspace; (ii) every continuous convex functional π defined on M can be extended to a convex functional on R n. P r o o f. It suffices to prove (ii) (i). Let x 1,..., x k be a maximal system of linearly independent vectors in M. Observe that (ii) is equivalent to (ii ) every continuous convex functional on M can be extended to a convex functional on lin(x 1,..., x k ). First we prove that (ii ) implies (ii). Let π be a convex functional on lin(x 1,..., x k ) and let x R n. Then x = α 1 x 1 +...+α k x k +α k+1 x k+1 +...+ α n x n for some linear basis x 1,..., x k,..., x n. Define a functional π (x) = π (α 1 x 1 +...+α k x k ). Since π is convex, so is π. In view of (ii ), without loss of generality we may assume that k = n. So, it remains to show that M = R n. This, however, follows from Theorem 2.2 since int M. 3. Extensions in a Hilbert space Theorem 3.1. Let H be a Hilbert space and let M H be a closed convex cone containing at least two linearly independent vectors. Then the following conditions are equivalent: (i) M is a closed linear subspace; (ii) every continuous convex functional π defined on M can be extended to a convex functional π on H. P r o o f. (i) (ii) is obvious; it is sufficient to take π (x) = π(p M x), x H, where P M is the orthogonal projection onto M. (ii) (i). Suppose that (i) does not hold. Let H 1 = lin M. There exist vectors c H 1 \ M and b M, b 0. We may assume b, c to be linearly independent. Let a = b+t 0 (c b) where t 0 = sup{t (0, 1] : b+t(c b) M}.

Extensions of convex functionals 385 There exists t 1 (t 0, 1] such that, for y = b + t 1 (c b) H 1, we have (4) 0 < y a < min b + t(c b) y. t [0,1] Denote by P M y the orthogonal projection of y onto the closed convex set M (see [2]). From (4) we have P M y 0. Let ψ = y P M y. Then ψx := (x, ψ) 0 for x M. Hence ψp M y = (P M y, y P M y) = 0. Since H 1 = lin M, there exists b M such that ψ b < 0. It is now enough to take ã = P M y and apply Theorem 2.1. Definition 3.1. the condition A real function π on a topological space X satisfying lim sup x x 0 π(x) π(x) for any x 0 X is said to be upper semicontinuous (u.s.c.). Theorem 3.2. Let H be a Hilbert space and let M H be a convex cone containing at least two linearly independent vectors. Then the following statements are equivalent: (i) M is a linear subspace; (ii) every continuous convex functional π : M R can be extended to a convex functional π which is u.s.c. P r o o f. We prove that (ii) (i) ((i) (ii) is obvious). The idea of the proof is similar to that of Theorem 2.1. Assume that M is not a linear subspace and let H 1 = lin M. Then there exists some y H 1 \ M. Let P M y be the orthogonal projection of y onto M and let ψ := y P M y, ψx := (x, ψ), x M. Note that x M : ψ(x) 0; b M : ψ(b) < 0. Let a = P M y. There exists a function ϕ such that ϕ = kb + (1 k)a for some k and ϕ (b a). Notice that (ϕ, a) = (ϕ, b). As a M, there is a sequence (a n) M such that a n a. Hence ϕ(a n) ϕ(a) = 1. Now, consider the sequence a n = a n/ϕ(a n). It is obvious that (a n ) M and ϕ(a n ) = 1. As in the proof of Theorem 2.1, consider the set L = M {x H 1 : ϕ(x) = 1} (obviously, a n, b L) and let π : M R be given by { λf(ψ(l)) if x = λl for some λ > 0, π(x) = 0 for other x M, where f(t) = { 1 1 (t + 1)2, 1 t 0, 0, t < 1. Let π : H R be a convex u.s.c. functional with π M g n (τ) = π (a n + τ(a n b)), τ R. = π. Define

386 E. Ignaczak and A. Paszkiewicz Notice that for all τ [ 1, 0], a n + τ(a n b) M L and g n (τ) = π(a n + τ(a n b)) = f(ψ(a n ) + τψ(a n b)), ψ(a n ) 0. From the existence of g n(0 ) and from the convexity of g n we obtain g n (τ) g n (0) + g n(0 )τ for all τ R. In particular, for τ = 1, we have g n (1) g n (0)+g n(0) g n = f (ψ(a n ))ψ(a n b) n, contrary to the assumption that π is u.s.c. Example 3.1 The functional π(m) = sup m defined on some convex cone of functions bounded from above is an elementary example of a convex functional (for example in L 2 ) for which the lack of a convex extension is possible. Let (Ω, F, P ) = ((0, 1), B (0,1), λ) and { M = α(1 } 1 ϖ 2 1 ) β : ϖ (0, 1), α, β 0. 1 ϖ2 For α = 1, ( f(β) = sup α(1 ) 1 ϖ 2 1 ) β ϖ (0,1) 1 ϖ 2 = 1 [2 1/3 + 2 2/3 ]β 1/3, when 0 β 1/2. Thus f(β) cannot be extended to a convex function for β R, and π(x) = sup ϖ (0,1) x(ϖ) cannot be extended from M to lin(1 1 ϖ 2, 1/(1 ϖ 2 )). References [1] J. M. Harrison and D. M. Kreps, Martingales and arbitrage in multiperiod securities markets, J. Econom. Theory 20 (1979), 381 408. [2] R. B. H o l m e s, Geometric Functional Analysis and its Applications, Springer, Berlin, 1975. [3] E. J o u i n i, Market imperfections, equilibrium and arbitrage, in: Financial Mathematics, Lecture Notes in Math. 1656, Springer, Berlin, 1997, 247 307. [4] M. Musiela and M. Rutkowski, Martingale Methods in Financial Modeling, Springer, Berlin, 1997. [5] S. Rolewicz, Functional Analysis and Control Theory, PWN Polish Sci. Publ., Warszawa, 1971. Institute of Mathematics Technical University of Szczecin Piastów 17 70-310 Szczecin, Poland E-mail: epignacz@sz.onet.pl Institute of Mathematics University of Lódź Banacha 22 90-238 Lódź, Poland E-mail: adampasz@math.uni.lodz.pl Received on 15.12.1997