A MAXIMUM PRINCIPLE FOR STOCHASTIC DIFFERENTIAL GAMES WITH PARTIAL INFORMATION
|
|
- Ἀκελδαμά Καλάρης
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Dept. of Math./CMA Univ. of Oslo Pure Mathematics No 4 ISSN April 27 A MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES WITH PATIAL INFOMATION TA THI KIEU AN AND BENT ØKSENDAL Abstract. In this paper we first deal with the problem of optimal control for zero-sum stochastic differential games. We give a necessary sufficient maximum principle for that problem with partial information. Then we use the result to solve a problem in finance. Finally, we extend our approach to general stochastic games (nonzero-sum), obtain an equilibrium point of such game. 1. Introduction Game theory had been an active area of research a useful tool in many applications, particularly in biology economic. In the recent paper by Mataramvura Øksendal 6, the stochastic differential game was solved with restriction to consider only Markov controls. Then the equilibrium point or other type of solution are constructed using Hamilton-Jacobi- Bellman (HJB) equations. In this paper, we require that the control process is adapted to a given sub-filtration of the filtration generated by the underlying Lévy processes. So we cannot use dynamic programming HJB equations to solve the problems. Here we establish a maximum principle for such stochastic control problems. There is already a lot of literature on the maximum principle. See e.g. 1, 2, 5, 9 the references therein. Our paper is organized as follows: In section 2 we give a sufficient maximum principle for zero-sum stochastic differential games (Theorem 1). And a necessary type of this problem is given in the section 3. In section 4 we put a problem in finance into the framework of a stochastic differential game with partial information use Theorem 1 to solve it. With complete information this problem is solved in 8 by using HJB equations. In section 4 we generalize our approach to the general case, not necessarily of zero-sum type, also give an equilibrium point for nonzero-sum games. 2. The sufficient maximum principle for zero-sum games Suppose the dynamics of a stochastic system is described by a stochastic differential equation on a complete filtered probability space (Ω, F, {F t } t, P) of the form Date: evised in October 27. Key words phrases. Jump diffusion, stochastic control, stochastic differential game, sufficient maximum principle, necessary maximum principle. 1
2 2 T.T.K.AN AND B.ØKSENDAL dx(t) = b(t, X(t), u (t))dt σ(t, X(t), u (t))db(t) (2.1) γ(t, X(t ), u n 1 (t, z), z)ñ( dt, dz), t, T X() = x n Here b :, T n K n ; σ :, T n K n n γ :, T n K n n are given continuous functions, B(t) is n- dimensional Brownian motion, Ñ(.,.) are n independent compensated Poisson rom measures K is a given closed subset of n. The processes u (t) = u (t, ω) u 1 (t) = u 1 (t, z, ω), ω Ω are our control processes. We assume that u (t), u 1 (t, z) have values in a given set K for a.a. t, z that u (t), u 1 (t, z) are càdlàg adapted to a given filtration {E t } t, where For example, we could have E t F t, t E t = F (t δ) ; t where (t δ) = max(, t δ). This models a situation where the controller only has delayed information available about the state of the system. Let f :, T n K be a continuous function, namely the profit rate, let g : n be a concave function, namely the bequest function. We call u = (u, u 1 ) an admissible control if (2.1) has a unique strong solution (2.2) E x T f(t, X(t), u (t)) dt g(x(t )) < If u is an admissible control we define the performance criterion J(u) by (2.3) J(u) = E x T f(t, X(t), u (t)) dt g(x(t )) (2.4) (2.5) Now suppose that the controls u (t) u 1 (t, z) have the form u (t) = (θ (t), π (t)); t u 1 (t, z) = (θ 1 (t, z), π 1 (t, z)); (t, z), ) n We let Θ Π be given families of admissible controls θ = (θ, θ 1 ) π = (π, π 1 ), respectively. The partial information zero-sum stochastic differential game problem is to find (θ, π ) Θ Π such that ( ) (2.6) Φ E (x) = J(θ, π ) = sup inf J(θ, π) π Π θ Θ Such a control (θ, π ) is called an optimal control (if it exists). The intuitive idea is that there are two players, I II. Player I controls θ := (θ, θ 1 ) player II controls π := (π, π 1 ). The actions of the players are antagonistic, which means that between I II there is a payoff J(θ, π) which is a cost for I a reward for II.
3 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 3 Let K 1, K 2 be two sets such that θ(t, z) K 1 π(t, z) K 2 for a.a t, z. As in 5 we now define the Hamiltonian H :, T n K 1 K 2 n n n by H(t, x, θ, π, p, q, r) =f(t, x, θ, π) b T (t, x, θ, π)p tr(σ T ((t, x, θ, π)q) (2.7) γ ij (t, x, θ, π, z)r ij (t, z)ν j (dz j ) i,j=1 where is the set of functions r :, T n n such that the integral in (2.7) converges. From now on we assume that H is continuously differentiable with respect to x. The adjoint equation in the unknown adapted processes p(t) n, q(t) n n r(t, s) n n is the backward stochastic differential equation (BSDE) dp(t) = x H(t, X(t), θ(t), π(t), p(t), q(t), r(t,.)) dt (2.8) q(t) db(t) r(t, z)ñ( dt, dz), t < T n p(t ) = g(x(t )) ( ) T where y ϕ(.) = ϕ y 1,..., ϕ y n is the gradient of ϕ : n with respect to y = (y 1,..., y n ). We can now state the following verification theorem for optimality: Theorem 1. Let (ˆθ, ˆπ) Θ Π with corresponding state process ˆX(t) = X (ˆθ,ˆπ) (t). Denote by X π (t) X θ (t) to be X (ˆθ,π) (t) X (θ,ˆπ) (t), respectively. Suppose there exists a solution ( ˆp(t), ˆq(t), ˆr(t, z)) of the corresponding adjoint equation (2.8) such that for all θ Θ π Π, we have (2.9) T E ( ˆX(t) X (π) (t)) T {ˆqˆq T (t) ˆrˆr T (t, z)ν(dz) } ( ˆX(t) X (π) (t))dt < n (2.1) T E ( ˆX(t) X (θ) (t)) T {ˆqˆq T (t) ˆrˆr T (t, z)ν(dz) } ( ˆX(t) X (θ) (t))dt <, n (2.11) T E ˆp(t) T { σσ T (t, X(t), θ(t), ˆπ(t)) γγ T (t, X (θ) (t), θ(t), ˆπ(t), z)ν(dz) } p(t)dt <, (2.12) T E ˆp(t) T { σσ T (t, X(t), ˆθ(t), π(t)) γγ T (t, X (π) (t), θ(t), ˆπ(t), z)ν(dz) } p(t)dt <,
4 4 T.T.K.AN AND B.ØKSENDAL ensuring that the integrals with respect to B the compensated small jumps part indeed have zero mean. Moreover, suppose that for all t, T, the following partial information maximum principle holds: (2.13) inf EH(t, X(t), θ, ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) E t θ K 1 = EH(t, X(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) E t = sup π K 2 EH(t, X(t), ˆθ(t), π, ˆp(t), ˆq(t), ˆr(t,.)) E t i) Suppose that, for all t, T, g(x) is concave is concave. Then (x, π) H(t, x, ˆθ(t), π, ˆp(t), ˆq(t), ˆr(t,.)) J(ˆθ, ˆπ) J(ˆθ, π) for all π Π J(ˆθ, ˆπ) = sup J(ˆθ, π) π Π ii) Suppose that, for all t, T, g(x) is convex is convex. Then (x, θ) H(t, x, θ, ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) J(ˆθ, ˆπ) J(θ, ˆπ) J(ˆθ, ˆπ) = inf J(θ, ˆπ) θ Θ for all θ Θ iii) If both cases (i) (ii) hold (which implies, in particular, that g is an affine function), then (θ, π ) := (ˆθ, ˆπ) is an optimal control ( ) ( ) (2.14) Φ E (x) = sup inf J(θ, π) = inf sup J(θ, π) π Π θ Θ θ Θ π Π Proof. i) Suppose (i) holds. Choose (θ, π) Θ Π. Let us consider J(ˆθ, ˆπ) J(ˆθ, π) = I 1 I 2 where T { (2.15) I 1 = E f(t, ˆX(t), ˆθ(t), ˆπ(t)) f(t, X (π) (t), ˆθ(t), π(t)) } dt (2.16) I 2 = E g( ˆX(T )) g(x (π) (T )) Since g is concave in x from integration by parts formula for jump processes we get the following, where the L 2 conditions (2.9) (2.12)
5 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 5 ensure that the stochastic integrals with respect to the local martingales have zero expectation: I 2 = E g( ˆX(T )) g(x (π) (T )) E ( ˆX(T ) X (π) (T )) T g( ˆX(T )) = E (X (ˆθ,ˆπ) (T ) X (ˆθ,π) (T )) T ˆp(T ) T = E ( ˆX(t ) X (π) (t )) T dˆp(t) T T T ˆp T (t)(d ˆX(t) dx (π) (t)) tr {σ(t, ˆX(t), ˆθ(t), ˆπ(t)) σ(t, X (π) (t), ˆθ(t), π(t))} T ˆq(t) {γ ij (t, ˆX(t), ˆθ(t), ˆπ(t), z) i,j=1 γ ij (t, X (π) (t), ˆθ(t), π(t), z)}ˆr ij (t, z)ν(dz j )dt dt T = E ( ˆX(t) X (π) (t)) T ( x H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)))dt (2.17) T T T ˆp T (t) { b(t, ˆX(t), ˆθ(t), ˆπ(t)) b(t, X (π) (t), ˆθ(t), π(t)) } dt tr {σ(t, ˆX(t), ˆθ(t), ˆπ(t)) σ(t, X (π) (t), ˆθ(t), π(t))} T ˆq(t) dt i,j=1 {γ ij (t, ˆX(t), ˆθ(t), ˆπ(t), z) γ ij (t, X (π) (t), ˆθ(t), π(t), z)}ˆr ij (t, z)ν(dz j )dt By the definition (2.7) of H we have T I 1 = E {f(t, ˆX(t), ˆθ(t), ˆπ(t)) f(t, X (π) (t), ˆθ(t), π(t))}dt T = E {H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) H(t, X (π) (t), ˆθ(t), π(t), ˆp(t), ˆq(t), ˆr(t,.))}dt T E T E ˆp T (t) { b(t, ˆX(t), ˆθ(t), ˆπ(t)) b(t, X (π) (t), ˆθ(t), π(t)) } dt tr {σ(t, ˆX(t), ˆθ(t), ˆπ(t)) σ(t, X (π) (t), ˆθ(t), π(t))} T ˆq(t) dt
6 6 T.T.K.AN AND B.ØKSENDAL (2.18) T E i,j=1 {γ ij (t, ˆX(t), ˆθ(t), ˆπ(t), z) γ ij (t, X (π) (t), ˆθ(t), π(t), z)}ˆr ij (t, z)ν(dz j )dt By concavity of H in x π we have H(t, ˆX(t),ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) H(t, X (π) (t), ˆθ(t), π(t), ˆp(t), ˆq(t), ˆr(t,.)) (2.19) x H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) T ( ˆX(t) X (π) (t)) π H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) T (ˆπ(t) π(t)) Since π EH(t, X π (t), ˆθ(t), π, ˆp(t), ˆq(t), ˆr(t,.)) E t is maximum for π = ˆπ(t) π(t), ˆπ(t) are E t -measurable, we get E π H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) T (ˆπ(t) π(t)) E t = (ˆπ(t) π(t)) π E H(t, X π (t), ˆθ(t), π(t), ˆp(t), ˆq(t), ˆr(t,.)) E t T π=ˆπ(t) Combining this with (2.19) we obtain T E {H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) H(t, X (π) (t), ˆθ(t), π(t), ˆp(t), ˆq(t), ˆr(t,.))}dt (2.2) T E Hence T I 1 E (2.21) T E x H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) T ( ˆX(t) X (π) (t)) x H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) T ( ˆX(t) X (π) (t)) T E T E ˆp T (t) { b(t, ˆX(t), ˆθ(t), ˆπ(t)) b(t, X (π) (t), ˆθ(t), π(t)) } dt tr {σ(t, ˆX(t), ˆθ(t), ˆπ(t)) σ(t, X (π) (t), ˆθ(t), π(t))} T ˆq(t) dt i,j=1 {γ ij (t, ˆX(t), ˆθ(t), ˆπ(t), z) γ ij (t, X (π) (t), ˆθ(t), π(t), z)}ˆr ij (t, z)ν(dz j )dt Adding (2.17), (2.21) above, we get (2.22) J(ˆθ, ˆπ) J(ˆθ, π) = I 1 I 2
7 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 7 We therefore conclude that J(ˆθ, ˆπ) J(ˆθ, π) for all π Π. ii) Proceeding in the same way as in (i) we can show that J(ˆθ, ˆπ) J(θ, ˆπ) for all θ Θ if (ii) holds. iii) If both (i) (ii) hold then for any (θ, π) Θ Π. Thereby J(ˆθ, ˆπ) inf θ Θ J(ˆθ, π) J(ˆθ, ˆπ) J(θ, ˆπ) J(θ, ˆπ) sup π Π ( inf J(θ, π)) θ Θ On the other h ( J(ˆθ, ˆπ) sup J(ˆθ, π) inf sup J(θ, π) ) π Π θ Θ π Π Now due to the inequality we have inf θ Θ ( sup π Π J(θ, π) ) ( sup inf J(θ, π)) π Π θ Θ ( Φ E (x) = sup inf J(θ, π)) ( = inf sup J(θ, π) ) π Π θ Θ θ Θ π Π If the control process (θ, π) is admissible adapted to the filtration F t we have the following Corollary. Corollary 2. Suppose E t = F t for all t that (2.9)-(2.12) hold. Moreover, suppose that for all t the following maximum principle holds (2.23) inf θ K 1 H(t, X(t), θ, ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) Then for all t, T we have = H(t, X(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) = sup π K 2 H(t, X(t), ˆθ(t), π, ˆp(t), ˆq(t), ˆr(t,.)) i) If g(x) is concave (x, π) H(t, x, ˆθ(t), π, ˆp(t), ˆq(t), ˆr(t,.)) is concave, then J(ˆθ, ˆπ) J(ˆθ, π) for all π Π J(ˆθ, ˆπ) = sup J(ˆθ, π) π Π ii) If g(x) is convex (x, θ) H(t, x, θ, ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) is convex, then J(ˆθ, ˆπ) J(θ, ˆπ) J(ˆθ, ˆπ) = inf J(θ, ˆπ) θ Θ for all θ Θ
8 8 T.T.K.AN AND B.ØKSENDAL iii) If both cases (i) (ii) hold, then (θ, π ) := (ˆθ, ˆπ) is an optimal control based on the information flow F t ( ) ( ) (2.24) Φ E (x) = sup inf J(θ, π) = inf sup J(θ, π) π Π θ Θ θ Θ π Π 3. A necessary maximum principle for Zero-sum games In addition to the assumptions in Section 2 we now assume the following: (A1) For all t, h such that t < t h T, all bounded E t -measurable α, ρ, for s, T the controls β(s) := (,..., β i (s),..., ) η(s) := (,..., η i (s),..., ), i = 1,..., n with β i (s) := α i χ t,th (s), η i (s) := ρ i χ t,th (s) belong to Θ Π, respectively. (A2) For given θ, β Θ π, η Π with β, η are bounded, there exists δ > such that where y, v ( δ, δ). θ yβ Θ, π vη Π Denote X θyβ (t) = X (θyβ,π) (t) X πvη (t) = X (θ,πvη) (t). For a given θ, β Θ π, η Π with β, η bounded, we define the processes Y θ (t) Y π (t) by (3.1) (3.2) We have that Y θ (t) = d dy Xθyβ (t) y= = (Y θ 1 (t),..., Y θ n (t)) T Y π (t) = d dv Xπvη (t) v= = (Y π 1 (t),..., Y π n (t)) T (3.3) dy θ i (t) = λ θ i (t)dt (3.4) dy π i (t) = λ π i (t)dt ξij(t)db θ j (t) j=1 ξij(t)db π j (t) j=1 j=1 j=1 ζ θ ij(t, z)ñj(dt, dz), ζ π ij(t, z)ñj(dt, dz), where i = 1,..., n λ θ i (t) = xb i (t, X(t), θ(t), π(t)) T Y θ (t) θ b i (t, X(t), θ(t), π(t)) T β(t) ξij θ (3.5) (t) = xσ ij (t, X(t), θ(t), π(t)) T Y θ (t) θ σij(t, X(t), θ(t), π(t)) T β(t) ζ ij θ (t) = xγ ij (t, X(t), θ(t), π(t)) T Y θ (t) θ γ ij (t, X(t), θ(t), π(t)) T β(t)
9 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 9 (3.6) λ π i (t) ξ π ij (t) ζ π ij (t) = xb i (t, X(t), θ(t), π(t)) T Y π (t) π b i (t, X(t), θ(t), π(t)) T η(t) = xσ ij (t, X(t), θ(t), π(t)) T Y π (t) π σij(t, X(t), θ(t), π(t)) T η(t) = xγ ij (t, X(t), θ(t), π(t)) T Y π (t) π γ ij (t, X(t), θ(t), π(t)) T η(t) Theorem 3. Suppose (ˆθ, ˆπ) Θ Π is a directional critical point for J(θ, π), in the sense that for all bounded β Θ η Π there exist δ > such that ˆθ yβ Θ ˆπ vη Π for all y ( δ, δ) v ( δ, δ) h(y, v) := J(ˆθ yβ, ˆπ vη) y, v ( δ, δ) has a critical point at (, ), i.e. (3.7) h h (, ) = (, ) =. y v Suppose there exists a solution ˆp(t), ˆq(t), ˆr(t,.) of the associated adjoint equation dˆp(t) = x H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) dt (3.8) ˆq(t) db(t) ˆr(t, z)ñ( dt, dz), t < T n ˆp(T ) = g( ˆX(T )) Moreover, suppose that if Y ˆθ, Y ˆπ, (λˆθ i, ξ ˆθ ij, ζ ˆθ ij ) (λˆπ i, ξˆπ ij, ζ ij ˆπ ) are the corresponding coefficients (see (3.1)-(3.6)) then T { } E Y ˆθ T (t) ˆqˆq T ˆrˆr T (t, z)ν(dz) Y ˆθ(t)dt (3.9) <, (3.1) (3.11) (3.12) { } E Y ˆπT (t) ˆqˆq T ˆrˆr T (t, z)ν(dz) Y ˆπ (t)dt <, T E T E { ˆp T (t) { ˆp T (t) Then for a.a. t, T, we have (3.13) ξ ˆθξ ˆθ T (t, ˆX(t), ˆθ(t), ˆπ(t)) γγ T (t, ˆX(t), ˆθ(t), } ˆπ(t))ν(dz) ˆp(t)dt <, ξˆπ ξˆπt (t, ˆX(t), ˆθ(t), ˆπ(t)) γγ T (t, ˆX(t), ˆθ(t), } ˆπ(t))ν(dz) ˆp(t)dt <, E θ H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) E t = E π H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) E t =
10 1 T.T.K.AN AND B.ØKSENDAL Proof. Since h has a minimum at y = we have = T y h(y, ) y== E T x f(t, ˆX(t), ˆθ(t), ˆπ(t)) T d dy X ˆθyβ (t) y= dt θ f(t, ˆX(t), ˆθ(t), ˆπ(t)) T β(t)dt g( ˆX(T ) T d dy X ˆθyβ (T ) y= T = E x f(t, ˆX(t), ˆθ(t), ˆπ(t)) T Y ˆθ(t)dt (3.14) T θ f(t, ˆX(t), ˆθ(t), ˆπ(t)) T β(t)dt g( ˆX(T ) T Y ˆθ(T ) By the Itô formula, (3.15) E g( ˆX(T ) T Y ˆθ(T ) = Eˆp T (T )Y ˆθ(T ) T { = E ˆp i (t)( x b i (t, ˆX(t), ˆθ(t), ˆπ(t)) T Y ˆθ(t) i=1 θ b i (t, ˆX(t), ˆθ(t), ˆπ(t)) T β(t)) Y ˆθ i (t)( x H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) i ˆq ij (t)( x σ ij (t, ˆX(t), ˆθ(t), ˆπ(t)) T Y ˆθ(t) j=1 j=1 θ σ ij (t, ˆX(t), ˆθ(t), ˆπ(t)) T β(t)) ˆr ij (t, z)( x γ ij (t, ˆX(t), ˆθ(t), ˆπ(t)) T Y ˆθ(t) n θ γ ij (t, ˆX(t), ˆθ(t), } ˆπ(t)) T β(t)) dt On the other h, (3.16) x H(t, x, θ, π, p, q, r) = x f(t, x, θ, π) x σ ji (t, x, θ, π)q ji j,i=1 j,i=1 x b i (t, x, θ, π)p i i=1 x γ ji (t, x, θ, π)r ji (t, z)ν j (dz) Substituting this into (3.15) combining with (3.14) we get T { f = E (t, θ ˆX(t), ˆθ(t), ˆπ(t)) i=1 i (ˆpj (t) b j (t, θ ˆX(t), ˆθ(t), ˆπ(t)) ˆq kj (t) σ kj (t, i θ ˆX(t), ˆθ(t), ˆπ(t)) i j=1 k=1
11 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 11 (3.17) T = E ˆr kj (t, z) γ kj (t, θ ˆX(t), ˆθ(t), ˆπ(t))ν j (dz) ) } β i (t) dt i θ H(t, ˆX(t), ˆθ(t), ˆπ(t), ˆp(t), ˆq(t), ˆr(t,.)) T β(t)dt By assumption (A1), the equation (3.17) leads to th E H(s, θ ˆX(s), ˆθ(s), ˆπ(s), ˆp(s), ˆq(s), ˆr(s,.))α i (s)ds = i t Differentiating with respect to h at h = gives E H(s, θ ˆX(s), ˆθ(s), ˆπ(s), ˆp(s), ˆq(s), ˆr(s,.))α i (s) = i Since this holds for all bounded E t -measurable α i, we conclude that E H(s, θ ˆX(s), ˆθ(s), ˆπ(s), ˆp(s), ˆq(s), ˆr(s,.)) E t =, i as claimed. Proceeding in the same way by differentiating the function h(, v) with respect to v we get E H(s, π ˆX(s), ˆθ(s), ˆπ(s), ˆp(s), ˆq(s), ˆr(s,.)) E t = i This completes the proof. 4. Applications to Finance In this section, we will use our result to solve a partial information version of the problem studied in 8. Consider the following jump diffusion market: (4.1) (4.2) (risky free asset) ds (t) = ρ(t)s (t)dt; S () = 1 (risky asset) ds 1 (t) = S 1 (t ) α(t)dt β(t)db(t) γ(t, ; z)ñ(dt, dz) S 1 () > where ρ(t) is a deterministic function, α(t), β(t) γ(t, z) are given F t - predictable functions satisfying the following integrability condition: T { (4.3) E ρ(s) α(s) 1 2 β(s)2 } log(1 γ(s, z)) γ(s, z) ν(dz) ds < where T is fixed. We assume that (4.4) γ(t, z) 1 for a.a. t, z, T
12 12 T.T.K.AN AND B.ØKSENDAL where = \{}. This model represents a natural generalization of the classical Black-Scholes market model to the case where the coefficients are not necessarily constants, but allowed to be (predictable) stochastic processes. Moreover, we have added a jump component. See e.g. 3 or 7 for discussions of such markets. Let E t F t be a given sub-filtration. Let π(t) be a portfolio, which is E t - measurable rom variable represented by the fraction of the wealth invested in the risky asset at time t. The the dynamics of the corresponding wealth process V (π) (t) is (4.5) dv (π) (t) = V (π) (t ) V (π) () = v >. {ρ(t) (α(t) ρ(t))π(t)}dt π(t)β(t)db(t) π(t ) γ(t, z)ñ(dt, dz) A portfolio π is called admissible if it is a measurable càdlàg stochastic process adapted to filtration E t satisfies (4.6) T π(t )γ(t, z) > 1 a.s. { ρ(t) (α(t) ρ(t))π(t) π 2 (t)β 2 (t) } π 2 (t) γ 2 (t, z)ν(dz) dt < a.s. The requirement that π should be adapted to the filtration E t is a mathematical way of requiring that the choice of the portfolio value π(t) at time t is allowed to depend on the information (σ-algebra) E t only. The wealth process corresponding to an admissible portfolio π is the solution of (4.5): (4.7) V (π) t (t) = v exp {ρ(t) (α(t) ρ(t))π(t) 1 2 π2 (t)β 2 (t) (ln(1 π(s)γ(s, z)) π(z)γ(s, z))ν(dz)}ds t π(s)β(s)db(s) t ln(1 π(s)γ(s, z))ñ(ds, dz) The family of admissible portfolios is denoted by Π. Now we introduce a family Q of measures Q θ parameterized by processes θ = (θ (t), θ 1 (t, z)) such that (4.8) dq θ (ω) = Z θ (T )dp (ω) on F T, where (4.9) { dzθ (t) = Z θ (t ) θ (t)db(t) θ 1(t, z)ñ(dt, dz) Z θ () = 1
13 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 13 We assume that θ 1 (t, z) 1 for a.a. t,z T { } (4.1) θ(s) 2 θ1(s, 2 z) ds < a.s. Then by the Itô formula the solution of (4.9) is given by t Z θ (t) = exp θ (s)db(s) 1 t θ 2 (s)ds 2 t ln(1 θ 1 (s, z))ñ(dt, dz) (4.11) t If θ = (θ (t), θ 1 (t, z)) satisfy (4.12) EZ θ (T ) = 1 {ln(1 θ 1 (s, z)) θ 1 (s, z)}ν(dz)ds then Q θ is a probability measure. If, in addition (4.13) β(t)θ (t) γ(t, z)θ 1 (t, z)ν(dz) = α(t) r(t); t, T then dq θ (ω) = Z θ (T )dp (ω) is an equivalent local martingale measure. See e.g. 7, Ch.1. But here we do not assume (4.13) holds. For all θ = (θ, θ 1 ) adapted to sub-filtration E t satisfies (4.1)-(4.12) is called admissible controls of the market. The families of admissible controls θ is denoted by Θ. The problem is to find (θ, π) Θ Π such that (4.14) inf θ Θ ( sup E Qθ U(X π (T )) ) = E Qθ U(X π (T )) π Π where U :, ), ) is a given utility function, which is increasing, concave twice continuously differentiable on (, ). We can consider this problem as a stochastic differential game between the agent the market. The agent wants to maximize her expected discounted utility over all portfolios π the market wants to minimize the maximal expected utility of the representative agent over all scenarios, represented by all probability measures Q θ ; θ Θ. To put this problem into the Markovian context discussed in the previous sections we combine the adon-nikodym process Z θ (t) the wealth process V (π) (t) into a 2-dimensional state process X(t), as follows: Put dx1 (t) dzθ (t) dx(t) = = dx 2 (t) dv (π) (t) = V (π) (t ){ρ(t) (α(t) ρ(t))π} dt
14 14 T.T.K.AN AND B.ØKSENDAL (4.15) Z θ (t )θ (t) V (π) (t )β(t)π(t) db(t) Z θ (t ) θ 1(t, z) V (π) (t )π(t) γ(t, z) Ñ(dt, dz) To solve this problem we first write down the Hamiltonian function (4.16) H(t, x 1, x 2, θ, π, p, q, r) = x 2 {ρ(t) (α(t) ρ(t))π(t)}p 2 x 1 θ q 1 x 2 β(t)π(t)q 2 { x 1 θ 1 (t, z)r 1 (t, z) x 2 π(t)γ(t, z)r 2 (t, z)}ν(dz) The adjoint equations are (4.17) dp 1 (t) = ( θ (t)q 1 (t) θ 1(t, z)r 1 (t, z)ν(dz) ) dt q 1 (t)db(t) r 1(t, z)ñ(dt, dz) p 1 (T ) = x1 U(X 2 (T )) (4.18) dp 2 (t) = {ρ(t) (α(t) ρ(t))π(t)}p 2 (t) β(t)π(t)q 2 (t) π(t)γ(t, z)r 2(t, z)ν(dz) dt q 2 (t)db(t) r 2(t, z)ñ(dt, dz) p 2 (T ) = x2 U(X 2 (T )) Let (ˆθ, ˆπ) be cidate for an optimal control let ˆX(t) = ( ˆX 1 (t), ˆX 2 (t)) be the corresponding optimal processes with corresponding solution ˆp(t) = (ˆp 1 (t), ˆp 2 (t)), ˆq(t) = (ˆq 1 (t), ˆq 2 (t)), ˆr(t,.) = (ˆr 1 (t,.), ˆr 2 (t,.)) of the adjoint equations. We first maximize the Hamiltonian EH(t, x 1, x 2, θ, π, p, q, r) E t over all π K 2. This gives the following condition for a maximum point ˆπ: (4.19) E(α(t) ρ(t))ˆp 2 (t) E t Eβ(t)ˆq 2 (t) E t γ(t, z)eγ(t, z)ˆr 2 (t, z) E t ν(dz) = And then we minimize EH(t, x 1, x 2, θ, π, p, q, r) E t over all θ K 1 get the following conditions for a minimum point ˆθ = (θ, θ 1 ) (4.2) E ˆX 1 (t)ˆq 1 (t) E t = (4.21) We try a process ˆp 1 (t) of the form E ˆX 1 (t)ˆr 1 (t, z) E t ν(dz) = (4.22) ˆp 1 (t) = U(f(t) ˆX 2 (t))
15 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 15 with f is a deterministic differentiable function. Differentiating (4.22) using (4.5) we get dˆp 1 (t) = f (t) ˆX 2 (t)u (f(t) ˆX 2 (t))dt ˆX 2 (t)(ρ(t) (α(t) ρ(t))ˆπ(t))dt β(t)ˆπ(t)db(t)f(t)u (f(t) ˆX 2 (t)) 1 2 f 2 (t) ˆX 2(t)β 2 2 (t)π 2 (t)u (f(t) ˆX 2 (t))dt {U( ˆX 2 (t)(f(t) ˆπ(t)γ(t, z)) U(f(t) ˆX 2 (t))) = ˆX 2 (t)ˆπ(t)γ(t, z)f(t)u (f(t) ˆX 2 (t))}ν(dz)dt {U( ˆX 2 (t)(f(t) ˆπ(t)γ(t, z)) U(f(t) ˆX 2 (t)))}ñ(dt, dz) { f (t) ˆX 2 (t)u (f(t) ˆX 2 (t)) 1 2 f 2 (t) ˆX 2 2(t)β 2 (t)π 2 (t)u (f(t) ˆX 2 (t)) ˆX 2 (t)(ρ(t) (α(t) ρ(t))ˆπ(t))f(t)u (f(t) ˆX 2 (t)) {U( ˆX 2 (t)(f(t) ˆπ(t)γ(t, z)) U(f(t) ˆX 2 (t))) ˆX 2 (t)ˆπ(t)γ(t, z)f(t)u (f(t) ˆX } 2 (t))}ν(dz) dt ˆX 2 (t)β(t)ˆπ(t)f(t)u (f(t) ˆX 2 (t))db(t) {U( ˆX 2 (t)(f(t) ˆπ(t)γ(t, z)) U(f(t) ˆX 2 (t)))}ñ(dt, dz) Ñ(dt, dz) coeffi- Comparing this with (4.17) by equating the dt, db(t) cients respectively, we get (4.23) (4.24) ˆq 1 (t) = ˆX 2 (t)β(t)ˆπ(t)u (f(t) ˆX 2 (t)) ˆr 1 (t, z) = U( ˆX 2 (t)(f(t) ˆπ(t)γ(t, z))) U(f(t) ˆX 2 (t)) (4.25) f (t) ˆX 2 (t)u (f(t) ˆX 2 (t)) 1 2 ˆX 2 2(t)β 2 (t)π 2 (t)u (f(t) ˆX 2 (t)) ˆX 2 (t)(ρ(t) (α(t) ρ(t))ˆπ(t))f(t)u (f(t) ˆX 2 (t)) {U( ˆX 2 (t)(f(t) ˆπ(t)γ(t, z)) U(f(t) ˆX 2 (t))) ˆX 2 (t)ˆπ(t)γ(t, z)f(t)u (f(t) ˆX 2 (t))}ν(dz) = ˆθ (t)ˆq 1 (t) ˆθ 1 (t, z)ˆr 1 (t, z)ν(dz) Substituting (4.23) into (4.2) we get (4.26) ˆπ(t)E ˆX 1 (t) ˆX 2 (t)β(t)u (f(t) ˆX 2 (t)) E t =
16 16 T.T.K.AN AND B.ØKSENDAL or (4.27) ˆπ(t) = Now we try the process ˆp 2 (t) of the form (4.28) ˆp 2 (t) = ˆX 1 (t)f(t)u (f(t) ˆX 2 (t)) Differentiating (4.28) using (4.27) we get (4.29) dˆp 2 (t) = f (t) ˆX 1 (t)u (f(t) ˆX 2 (t))dt f(t)u (f(t) ˆX 2 (t))d ˆX 1 (t) f(t) ˆX 1 (t)du (f(t) ˆX 2 (t)) = ˆX ( 1 (t) f (t)u (f(t) ˆX 2 (t)) f(t)f (t) ˆX 2 (t)u (f(t) ˆX 2 (t)) f 2 (t) ˆX 2 (t)ρ(t)u (f(t) ˆX ) 2 (t)) dt f(t) ˆX 1 (t)θ (t)u (f(t) ˆX 2 (t))db(t) f(t) ˆX 1 (t)θ 1 (t, z)u (f(t) ˆX 2 (t))ñ(dt, dz) Compare this with (4.18) we get (4.3) (4.31) (4.32) ˆq 2 (t) = f(t) ˆX 1 (t)θ (t)u (f(t) ˆX 2 (t)) ˆr 2 (t, z) = f(t) ˆX 1 (t)θ 1 (t, z)u (f(t) ˆX 2 (t)) f (t)u (f(t) ˆX 2 (t)) f(t) ˆX 2 (t)u (f(t) ˆX 2 (t))(f (t) f(t)ρ(t)) = ρ(t)f(t)u (f(t) ˆX 2 (t)) Substituting (4.3), (4.31) into (4.19) we get (4.33) E(α(t) ρ(t))f(t) ˆX 1 (t)u (f(t) ˆX 2 (t)) E t θ (t)eβ(t)f(t) ˆX 1 (t)u (f(t) ˆX 2 (t)) E t θ 1 (t, z)eγ(t, z)f(t) ˆX 1 (t)u (f(t) ˆX 2 (t)) E t = This can be written as (4.34) ˆθ (t)eβ(t) E t ˆθ 1 (t, z)eγ(t, z) E t ν(dz) = Eα(t) E t ρ(t) From (4.32) we get ( (4.35) U (f(t) ˆX 2 (t)) ˆX 2 (t)f(t)u (f(t) ˆX 2 (t)) ) (f (t) r(t)f(t)) = or (4.36) f (t) r(t)f(t) =
17 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 17 i.e. ( T (4.37) f(t) = exp We have proved: t ) r(s)ds Theorem 4. The optimal portfolio π Π for the agent is (4.38) π(t) = ˆπ(t) = the optimal measure Qˆθ for the market is to choose ˆθ = (ˆθ, ˆθ 1 ) such that (4.39) ˆθ (t)eβ(t) E t ˆθ 1 (t, z)eγ(t, z) E t ν(dz) = Eα(t) E t ρ(t) emark. In the case when E t = F t for all t, this was proved in 8. In this case the interpretation of this result is the following: The market minimizes the maximal expected utility of the agent by choosing a scenario (represented by a probability law dq θ = Z θ (T )dp ) which is an equivalent martingale measure for the market (see (4.13)). In this case the optimal strategy for the agent is to place all the money in the risk free asset, i.e. to choose π(t) = for all t. Theorem 4 states that an analogue result holds also in the case when both players have only partial information E t F t to their disposal, but now the coefficients β(t), γ(t, z) α(t) must be replaced their conditional expectations Eβ(t) E t, Eγ(t, z) E t Eα(t) E t. 5. The sufficient maximum principle for nonzero-sum game Let X(t) be a stochastic process describing the state of the system. We now consider the case when two controllers I II intervene on the dynamics of the system their advantages are not necessarily antagonistic but each one acts such as to save her own interest. This situation is a nonzero-sum game. Let Et 1, Et 2 be filtrations satisfying Et i F t, t, i = 1, 2 Let u = (θ, π), where θ = (θ, θ 1 ) π = (π, π 1 ) are controls for player I II, respectively. We assume that θ = (θ, θ 1 ) are adapted to Et 1 π = (π, π 1 ) are adapted to Et 2. Denote by Θ Π the sets of admissible controls θ π, respectively. Suppose the players act on the system with strategy (θ, π) Θ Π, then the costs associated with I II are, respectively, J (θ,π) 1 (x) J (θ,π) 2 (x) of the form (5.1) J i (θ, π) = E x T f i (t, X(t), u(t)) dt g i (X(T )), i = 1, 2. The problem is to find a control (θ, π ) Θ Π such that (5.2) J 1 (θ, π ) J 1 (θ, π ) for all θ Θ
18 18 T.T.K.AN AND B.ØKSENDAL (5.3) J 2 (θ, π) J 2 (θ, π ) for all π Π The pair of controls (θ, π ) is called a Nash equilibrium point for the game because when player I (resp. II) acts with the strategy θ (resp. π ), the best that II (resp. I) can do is to act with π (resp. θ ). Let us introduce the Hamiltonian functions associated with this game, namely H 1 H 2, from, T n K 1 K 2 n n m to which are defined by H i (t, x, θ, π, p i, q i, r i ) = f i (t, x, θ, π) b (t, x, θ, π)p i tr(σ ((t, x, θ, π)q i ) (5.4) γ kj (t, x, θ, π, z)rkj i (t, z)ν j(dz j ), i = 1, 2. k,j=1 And we also have the adjoint equations for the game, as follows dp i (t) = x H i (t, X(t), θ(t), π(t), p i (t), q i (t), r i (t,.))dt q (5.5) i (t)db(t) r i (t, z)ñ(dt, dz), t < T n p i (T ) = g i (X(T )), i = 1, 2. The following result is a generalization of Theorem 1: Theorem 5. Let (ˆθ, ˆπ) Θ Π with corresponding state process ˆX(t) = X (ˆθ,ˆπ) (t). Suppose there exists a solution (ˆp i (t), ˆq i (t), ˆr i (t, z)), i = 1, 2 of the corresponding adjoint equation (5.5) such that for all θ Θ π Π, we have (5.6) (5.7) EH 1 (t, ˆX(t), ˆθ(t), ˆπ(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.)) E 1 t EH 1 (t, ˆX(t), θ(t), ˆπ(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.)) E 1 t EH 2 (t, ˆX(t), ˆθ(t), ˆπ(t), ˆp 2 (t), ˆq 2 (t), ˆr 2 (t,.)) E 2 t EH 2 (t, ˆX(t), ˆθ(t), π(t), ˆp 2 (t), ˆq 2 (t), ˆr 2 (t,.)) E 2 t Moreover, suppose that for all t, T, H i (t, x, θ, π, ˆp i (t), ˆq i (t), ˆr i (t,.)), i = 1, 2, is concave in x, θ, π g i (x), i = 1, 2, is concave in x. Then (ˆθ(t), ˆπ(t)) is a Nash equilibrium point for the game (5.8) (5.9) J 1 (ˆθ, ˆπ) = sup θ Θ J 1 (θ, ˆπ) J 2 (ˆθ, ˆπ) = sup π Π J 2 (ˆθ, π) Proof. As in the proof of Theorem 1 we have J 1 (ˆθ, ˆπ) J 1 (θ, ˆπ) T { = E f1 (t, ˆX(t), ˆθ(t), ˆπ(t)) f 1 (t, X (π) (t), ˆθ(t), π(t)) } dt g 1 ( ˆX(T )) g 1 (X (π) (T ))
19 MAXIMUM PINCIPLE FO STOCHASTIC DIFFEENTIAL GAMES 19 T { = E H 1 (t, ˆX(t), ˆθ(t), ˆπ(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.)) H 1 (t, X (π) (t), ˆθ(t), π(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.)) (5.1) x H 1 (t, ˆX(t), ˆθ(t), ˆπ(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.)))( ˆX(t) } X (π) (t)) T dt From (5.6) concavity of H 1 in x π we have T E {H 1 (t, ˆX(t), ˆθ(t), ˆπ(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.)) H 1 (t, X (π) (t), ˆθ(t), π(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.))}dt (5.11) T E Hence x H 1 (t, ˆX(t), ˆθ(t), ˆπ(t), ˆp 1 (t), ˆq 1 (t), ˆr 1 (t,.))( ˆX(t) X (π) (t)) T dt (5.12) J 1 (ˆθ, ˆπ) J 1 (θ, ˆπ) Since this holds for all θ Θ we have (5.13) J 1 (ˆθ, ˆπ) = sup J 1 (θ, ˆπ) θ Θ In the same way we show that J 2 (θ, π) J 2 (θ, π ) J 2 (ˆθ, ˆπ) = sup J 2 (ˆθ, π), π π whence the desired result. eferences 1 A. Bensoussan. Maximum principle dynamic programming approaches of the optimal control of partially observed diffusions. Stochastics 9, (1983). 2 F. Baghery B. Øksendal. A maximum principle for stochastic control with partial information. Stochastic Analysis Applications 25, (27). 3. Cont P. Tankov. Financial Modelling with Jump Processes. Chapman Hall W. H. Fleming P. E. Souganidis. On the existence of value function of two-player, zero-sum stochastic differential games. Indiana Univ. Math. J. 38, (1989). 5 N. Framstad B. Øksendal A. Sulem. Stochastic maximum principle for optimal control of jump diffusions applications to finance. J. Optimization Theory Appl. 121 (1), (24). Errata J. Optimization Theory Appl. 124 (2), (25). 6 S. Mataramvura B. Øksendal. isk minimizing portfolios HJB equations for stochastic differential games. E-print, University of Oslo 4, 25. To appear in Stochastics. 7 B. Øksendal A. Sulem Applied Stochastic Control of Jump Diffusions. Second Edition. Springer (27).
20 2 T.T.K.AN AND B.ØKSENDAL 8 B. Øksendal A. Sulem A game theoretic approach to martingale measures in incomplete markets. E-print, University of Oslo 24, S. Tang. The maximum principle for partially observed optimal control of stochastic differential equations. SIAM Journal on Control Optimization, 36 (5), (1998). (Ta Thi Kieu An) Centre of Mathematics for Applications (CMA) Department of Mathematics University of Oslo P.O. Box 153, Blindern N 316 Oslo, Norway address: atkieu@math.uio.no (Bernt Øksendal) Centre of Mathematics for Applications (CMA) Department of Mathematics University of Oslo P.O. Box 153, Blindern N 316 Oslo, Norway Norwegian School of Economics Business Admistration Helleveien 3 N 545 Bergen, Norway address: oksendal@math.uio.no
Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Example Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Statistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Mean-Variance Analysis
Mean-Variance Analysis Jan Schneider McCombs School of Business University of Texas at Austin Jan Schneider Mean-Variance Analysis Beta Representation of the Risk Premium risk premium E t [Rt t+τ ] R1
Credit Risk. Finance and Insurance - Stochastic Analysis and Practical Methods Spring School Jena, March 2009
Credit Risk. Finance and Insurance - Stochastic Analysis and Practical Methods Spring School Jena, March 2009 1 IV. Hedging of credit derivatives 1. Two default free assets, one defaultable asset 1.1 Two
Chapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Every set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
P AND P. P : actual probability. P : risk neutral probability. Realtionship: mutual absolute continuity P P. For example:
(B t, S (t) t P AND P,..., S (p) t ): securities P : actual probability P : risk neutral probability Realtionship: mutual absolute continuity P P For example: P : ds t = µ t S t dt + σ t S t dw t P : ds
Homomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Concrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Other Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Second Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Chapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Mean-Variance Hedging on uncertain time horizon in a market with a jump
Mean-Variance Hedging on uncertain time horizon in a market with a jump Thomas LIM 1 ENSIIE and Laboratoire Analyse et Probabilités d Evry Young Researchers Meeting on BSDEs, Numerics and Finance, Oxford
CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
D Alembert s Solution to the Wave Equation
D Alembert s Solution to the Wave Equation MATH 467 Partial Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Objectives In this lesson we will learn: a change of variable technique
EE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Areas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Math221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Uniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Matrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Problem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Homework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
ST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Homework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
ΗΜΥ 220: ΣΗΜΑΤΑ ΚΑΙ ΣΥΣΤΗΜΑΤΑ Ι Ακαδημαϊκό έτος Εαρινό Εξάμηνο Κατ οίκον εργασία αρ. 2
ΤΜΗΜΑ ΗΛΕΚΤΡΟΛΟΓΩΝ ΜΗΧΑΝΙΚΩΝ ΚΑΙ ΜΗΧΑΝΙΚΩΝ ΥΠΟΛΟΓΙΣΤΩΝ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΗΜΥ 220: ΣΗΜΑΤΑ ΚΑΙ ΣΥΣΤΗΜΑΤΑ Ι Ακαδημαϊκό έτος 2007-08 -- Εαρινό Εξάμηνο Κατ οίκον εργασία αρ. 2 Ημερομηνία Παραδόσεως: Παρασκευή
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max
Areas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Parametrized Surfaces
Parametrized Surfaces Recall from our unit on vector-valued functions at the beginning of the semester that an R 3 -valued function c(t) in one parameter is a mapping of the form c : I R 3 where I is some
Vol. 34 ( 2014 ) No. 4. J. of Math. (PRC) : A : (2014) XJ130246).
Vol. 34 ( 2014 ) No. 4 J. of Math. (PRC) (, 710123) :. -,,, [8].,,. : ; - ; ; MR(2010) : 91A30; 91B30 : O225 : A : 0255-7797(2014)04-0779-08 1,. [1],. [2],.,,,. [3],.,,,.,,,,.., [4].,.. [5] -,. [6] Markov.
Approximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
C.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ. Ψηφιακή Οικονομία. Διάλεξη 10η: Basics of Game Theory part 2 Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Ψηφιακή Οικονομία Διάλεξη 0η: Basics of Game Theory part 2 Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών Best Response Curves Used to solve for equilibria in games
Tridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Section 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
SOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
forms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Second Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Partial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Robust Markowitz Portfolio Selection in a Stochastic Factor Model
Robust Markowitz Portfolio Selection in a Stochastic Factor Model Dariusz Zawisza Institute of Mathematics, Jagiellonian University in Krakow, Poland 5 May, 2010 Financial Market Probability space (Ω,
Solution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
derivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
The Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering
Electronic Companion A Two-Sie Laplace Inversion Algorithm with Computable Error Bouns an Its Applications in Financial Engineering Ning Cai, S. G. Kou, Zongjian Liu HKUST an Columbia University Appenix
Lecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
A Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
12. Radon-Nikodym Theorem
Tutorial 12: Radon-Nikodym Theorem 1 12. Radon-Nikodym Theorem In the following, (Ω, F) is an arbitrary measurable space. Definition 96 Let μ and ν be two (possibly complex) measures on (Ω, F). We say
Solutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Part III - Pricing A Down-And-Out Call Option
Part III - Pricing A Down-And-Out Call Option Gary Schurman MBE, CFA March 202 In Part I we examined the reflection principle and a scaled random walk in discrete time and then extended the reflection
Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Empirical best prediction under area-level Poisson mixed models
Noname manuscript No. (will be inserted by the editor Empirical best prediction under area-level Poisson mixed models Miguel Boubeta María José Lombardía Domingo Morales eceived: date / Accepted: date
Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Space-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
CHAPTER 101 FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD
CHAPTER FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD EXERCISE 36 Page 66. Determine the Fourier series for the periodic function: f(x), when x +, when x which is periodic outside this rge of period.
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Commutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Risk! " #$%&'() *!'+,'''## -. / # $
Risk! " #$%&'(!'+,'''## -. / 0! " # $ +/ #%&''&(+(( &'',$ #-&''&$ #(./0&'',$( ( (! #( &''/$ #$ 3 #4&'',$ #- &'',$ #5&''6(&''&7&'',$ / ( /8 9 :&' " 4; < # $ 3 " ( #$ = = #$ #$ ( 3 - > # $ 3 = = " 3 3, 6?3
Bounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Congruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
A General Note on δ-quasi Monotone and Increasing Sequence
International Mathematical Forum, 4, 2009, no. 3, 143-149 A General Note on δ-quasi Monotone and Increasing Sequence Santosh Kr. Saxena H. N. 419, Jawaharpuri, Badaun, U.P., India Presently working in
Srednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Lecture 26: Circular domains
Introductory lecture notes on Partial Differential Equations - c Anthony Peirce. Not to be copied, used, or revised without eplicit written permission from the copyright owner. 1 Lecture 6: Circular domains
Reminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Forced Pendulum Numerical approach
Numerical approach UiO April 8, 2014 Physical problem and equation We have a pendulum of length l, with mass m. The pendulum is subject to gravitation as well as both a forcing and linear resistance force.
Depth versus Rigidity in the Design of International Trade Agreements. Leslie Johns
Depth versus Rigidity in the Design of International Trade Agreements Leslie Johns Supplemental Appendix September 3, 202 Alternative Punishment Mechanisms The one-period utility functions of the home
Fractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Jesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
ECE598: Information-theoretic methods in high-dimensional statistics Spring 2016
ECE598: Information-theoretic methods in high-dimensional statistics Spring 06 Lecture 7: Information bound Lecturer: Yihong Wu Scribe: Shiyu Liang, Feb 6, 06 [Ed. Mar 9] Recall the Chi-squared divergence
DESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Lecture 21: Properties and robustness of LSE
Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem
Models for Probabilistic Programs with an Adversary
Models for Probabilistic Programs with an Adversary Robert Rand, Steve Zdancewic University of Pennsylvania Probabilistic Programming Semantics 2016 Interactive Proofs 2/47 Interactive Proofs 2/47 Interactive
Lecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Numerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Finite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Appendix S1 1. ( z) α βc. dβ β δ β
Appendix S1 1 Proof of Lemma 1. Taking first and second partial derivatives of the expected profit function, as expressed in Eq. (7), with respect to l: Π Π ( z, λ, l) l θ + s ( s + h ) g ( t) dt λ Ω(
Space Physics (I) [AP-3044] Lecture 1 by Ling-Hsiao Lyu Oct Lecture 1. Dipole Magnetic Field and Equations of Magnetic Field Lines
Space Physics (I) [AP-344] Lectue by Ling-Hsiao Lyu Oct. 2 Lectue. Dipole Magnetic Field and Equations of Magnetic Field Lines.. Dipole Magnetic Field Since = we can define = A (.) whee A is called the
The Pohozaev identity for the fractional Laplacian
The Pohozaev identity for the fractional Laplacian Xavier Ros-Oton Departament Matemàtica Aplicada I, Universitat Politècnica de Catalunya (joint work with Joaquim Serra) Xavier Ros-Oton (UPC) The Pohozaev
CRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
ENGR 691/692 Section 66 (Fall 06): Machine Learning Assigned: August 30 Homework 1: Bayesian Decision Theory (solutions) Due: September 13
ENGR 69/69 Section 66 (Fall 06): Machine Learning Assigned: August 30 Homework : Bayesian Decision Theory (solutions) Due: Septemer 3 Prolem : ( pts) Let the conditional densities for a two-category one-dimensional
Appendix to On the stability of a compressible axisymmetric rotating flow in a pipe. By Z. Rusak & J. H. Lee
Appendi to On the stability of a compressible aisymmetric rotating flow in a pipe By Z. Rusak & J. H. Lee Journal of Fluid Mechanics, vol. 5 4, pp. 5 4 This material has not been copy-edited or typeset