Nonpivot and Implicit Projected Dynamical Systems on Hilbert Spaces

This paper presents a generalization of the concept and uses of projected dynamical systems to the case of nonpivot Hilbert spaces. These are Hilbert spaces in which the topological dual space is not identified with the base space. The generalization consists of showing the existence of such systems and their relation to variational problems, such as variational inequalities. In the case of usual Hilbert spaces these systems have been extensively studied, and, as in previous works, this new generalization has been motivated by applications, as shown below.


Introduction
In this paper we study the existence of solutions for a class of differential equations with discontinuous and nonlinear right-hand side on the class of nonpivot Hilbert spaces.This class of equations called projected differential equations was first introduced in the form we use in 1 ; however have other studies of a similar formulation has been known since 2-4 .The formulation of the flow of such equations as dynamical systems in R n is due to 1, 5 , and it has been applied to study the dynamics of solutions of finite-dimensional variational inequalities in 5, 6 .
Finite-dimensional variational inequalities theory provides solutions to a wide class of equilibrium problems in mathematical economics, optimization, management science, operations research, finance, and so forth see, e.g., 4, 6-8 and the references therein .Therefore there has been a steady interest over the years in studying the stability of solutions to finitedimensional variational inequalities and consequently the stability of equilibria for various problems .In general, such a study is done by associating a projected dynamical system to a variational inequality problem; however in the past few years the applied problems, as well

Dual Realization of a Hilbert Space
Each time we work with a Hilbert space V , it is necessary to decide whether or not we identify the topological dual space V * L V, R with V .Commonly this identification is made, one of the reasons for this being that the vectors of the polar of a set of V are in V .In some cases the identification does not make sense.For clarity of presentation, we remind below of the basic results regarding the dual realization of a Hilbert space.The readers can refer to 25 for additional information.
First, consider a pre-Hilbert space V with an inner product x, y , and its topological dual V * L V, R .It is well known that V * is a Banach space for the classical dual norm f * sup x∈V |f x |/ x .It is also known that there exists an isometry J : V → V * such that J is linear and for all x ∈ V , J x grad x 2 /2 .This mapping J is called a duality mapping of V, V * .Theorem 2.1 Theorem 1 page 68, 25 .Let V be a Hilbert space with the inner product x, y and J ∈ L V, V * the duality mapping above.Then J is a surjective isometry from V to V * .The dual space V * is a Hilbert space with the inner product: f, g * J −1 f, J −1 g f J −1 g .

2.1
Theorem 2.2 Theorem 2 page 69, 25 .Let V be a pre-Hilbert space.Then there exists a completion V of V, that is, an isometry j from V to the Hilbert space V such that j V is dense in V .
Definition 2.3.Let V be a Hilbert space.We call {F, j}, where i F is a Hilbert space, ii j is an isometry from F to L V, R , a dual realization of V .We then set where f, x is the duality pairing for F × V .
Remark 2.4.The duality pairing is a nondegenerate bilinear form on F × V and f F sup x∈V | f, x |/ x .These properties permit us to prove that F is isomorphic to V * .
We deduce from Theorems 2.1 and 2.2 that k j −1 • J ∈ L V, F is a surjective isometry such that x, y k x , y .

2.3
We use the following convention here: when a dual realization {F, j} of a space has been chosen, we set F V * and j •f x f, x .We say that the isometry k : V → V * is the duality operator associated to the inner product on V and to the duality pairing on V * × V by the relation x, y k x , y .

2.4
A special but most frequent case is to choose a dual realization of V the couple {V, J}; in this case the Hilbert space V is called a pivot space.To be more precise, we introduce the following definition.
Definition 2.5.A Hilbert space H with an inner product x, y is called a pivot space, if we identify H * with H.In that case H * H, j J, x, y x, y .

2.5
Sometimes it does not make sense to identify the space itself with its topological dual, as the following example shows.
Let us consider

2.6
An element ϕ ∈ L 2 R * is also an element of V * .If we identify ϕ to an element f ∈ L 2 R , this function does not define a linear form on V , and the expression ϕ v f, v V has no meaning on V .In this situation it is necessary to work in a non-pivot Hilbert space.We provide now some useful examples of non-pivot H-spaces.
Let Ω ⊂ R n be an open subset of, a : Ω → R \ {0}, a continuous and strictly positive function called "weight" and s : Ω → R \ {0}, a continuous and strictly positive function called "real time density."The bilinear form defined on C 0 Ω continuous functions with compact support on Ω by x, y a,s

Ω
x ω y ω a ω s ω dω 2.7 is an inner product.We remark here that if a is a weight, then a −1 1/a is also a weight.Let us introduce the following.
Definition 2.6.We call L 2 Ω, a, s a completion of C 0 Ω for the inner product x, y a,s .
We now introduce an n-dimensional version of the previous space.If we denote by is a non-pivot Hilbert space with the inner product: The space is clearly a non-pivot Hilbert space for the following inner product and the following bilinear form 12 defines a duality between V and V * .More precisely we have the following see 20 for a proof .
Proposition 2.7.The bilinear form 2.12 defines a duality mapping between V * × V , given by J F a 1 F 1 , . . ., a m F m .

2.13
For applications of these spaces, the reader can refer to 20 .

Variational Analysis in Non-Pivot H-Spaces
Let X be a Hilbert space of arbitrary finite or infinite dimension and let K ⊂ X be a nonempty, closed, convex subset.We assume the reader is familiar with tangent and normal cones to K at x ∈ K T K x , respectively, N K x , and with the projection operator of X onto K, P K : X → K given by P K z − z inf x∈K x − z .Moreover we use here the following characterization of P K x : The properties of the projection operator on Hilbert and Banach spaces are well known see e.g., 26-28 .The directional derivative of the operator P K is defined, for any x ∈ K and any element v ∈ X, as the limit for a proof see 26 :

2.15
Let π K : K×X → X be the operator given by x, v → π K x, v .Note that π K is nonlinear and discontinuous on the boundary of the set K. In 1, 29 several characterizations of π K are given.
The following theorem has been proven in the framework of reflexive strictly convex and smooth Banach spaces.We will use it to obtain a decomposition theorem in non-pivot Hilbert spaces for a proof see 30, Th.2.4 .Theorem 2.8.Let X be a real reflexive strictly convex and smooth Banach space, and let C be a nonempty, closed and convex cone of X.Then for all x ∈ X and for all f ∈ X * the following decompositions hold:

2.16
Here P C is the metric projection operator on K, and Π C 0 is the generalized projection operator on C 0 (for a definition of Π C 0 see [28]).
Remark 2.9.It is known that P C and Π C coincide whenever the cone C belongs to a Hilbert space.This observation implies the following result.
Corollary 2.10.Let C be a nonempty closed convex cone of a non-pivot Hilbert space X.Then for all x ∈ X and f ∈ X * the following decompositions hold: x P C x J −1 P C 0 J x , P C 0 J x , P C x 0, 2.17 We highlight that Zarantonello has shown in 27 a similar decomposition result in reflexive Banach spaces.Lemma 2.11 26, Lemma 4.5 .For any closed convex set K, where • h / h → 0 as h → 0 over any locally compact cone of increments.
Remark 2.12.To prove Lemma 2.11 only the properties of the norm in Hilbert spaces are used; therefore the proof is valid in the non-pivot setting.
The following lemma has been proven in the pivot case in 26 .We give below a similar proof in non-pivot spaces.Lemma 2.13.For any x ∈ K, where • h / h → 0 as h → 0 over any locally compact cone of increments.
Proof.Clearly, we have in general that Taking using the variational principle 2.14 applied to P x T K x x h .By definition of the projection operator we have

2.24
Therefore we have

2.25
As P x T K x x h x P T K x h just apply the definition and the variational principle 2.14 , we have but using the Corollary 2.10 we have h P T C x h J −1 P N K x J h , and therefore,

2.27
But by Lemma 2.11, x P T K x h − P K x P T K x h o P T K x h , so we can write

PDS in Pivot H-Spaces
Let X be a pivot Hilbert space of arbitrary finite or infinite dimension and let K ⊂ X be a nonempty, closed, convex subset.The following result has been shown see 21 .

Journal of Function Spaces and Applications
Theorem 3.1.Let X be a Hilbert space and let K be a nonempty, closed, convex subset.Let F : K → X be a Lipschitz continuous vector field and let x 0 ∈ K. Then the initial value problem associated to the projected differential equation (PrDE) has a unique absolutely continuous solution on the interval 0, ∞ .
This result is a generalization of the one in 6 , where X : R n , K was a convex polyhedron and F had linear growth.Definition 3.2.A projected dynamical system then is given by a mapping φ : R × K → K which solves the initial value problem: φ t, x π K φ t, x , −F φ t, x a.a.t, φ 0, x x 0 ∈ K.

PDS in Non-Pivot H-Spaces
In this subsection we show that, with minor modifications, the existence of PDS in nonpivot H-spaces can be obtained.We first introduce non-pivot projected dynamical systems NpPDSs and then show their existence.In analogy with 21 we first introduce the following.
Consequently the associated Cauchy problem is given by Next we define what we mean by a solution for a Cauchy problem of type 3.3 .

Definition 3.4. An absolutely continuous function
is called a solution for the initial value problem 3.3 .
Finally, assuming that problem 3.3 has solutions as described above, then we are ready to introduce the following.Definition 3.5.A non-pivot projected dynamical system NpPDS is given by a mapping φ : R × K → K which solves the initial value problem φ t, x π K φ t, x , − J −1 • F φ t, x , a.a.t, φ 0, x x 0 ∈ K.
To end this section we show how problem 3.3 can be equivalently in the sense of solution set coincidence formulated as a differential inclusion problem.Finally, in Subsection 3.3 we show that solutions for this new differential inclusion problem exist.We introduce the following differential inclusion: and we call x : I ⊂ R → X absolutely continuous a solution to 3.5 if We introduce also the following differential inclusion: where Obviously, we call x : I ⊂ R → X absolutely continuous a solution to 3.7 if  and x • is a solution to 3.9 .
3.9 ⇒ 3.3 .As the trajectory remains in K it is clear that ẋ t ∈ T K x t .First we show that for almost all t ∈ I we have ẋ t ∈ N ⊥ K x t .

3.10
Let us consider three different cases; first suppose that x t ∈ int K , we have then N K x t {0 X * } and then N ⊥ K x t X * and 3.10 is automatically satisfied.Suppose now that x t ∈ ∂K and in x t , ∂K is smooth.In that case T K x t is flat and ; then in a neighbourhood V t the trajectory x t , t ∈ V t goes in int K , so we are in the first case and we can exclude time t.Suppose now that x t ∈ ∂K and x t is in a corner point.In that case N ⊥ K x t {0}; therefore if ẋ t 0, 3.10 is satisfied.If ẋ t / 0, it means that x t / x t for t ∈ V t , with x t in one of the two previous cases; as we can "exclude" time t, we have 3.10 .As we can write ẋ t J −1 −F x − n K x , we have Using the polarity between N K x t and T K x t and the variational principle 2.14 we deduce 3.3 .

Existence of NpPDS
In this section we show that problem 3.3 has solutions and consequently that NpPDSs exist in the sense of Definition 3.5, by showing that problem 3.7 has solutions, in the sense of Definition 3.4.To obtain the main result of this paper, we need some preliminary ones, according to the following steps.
1 We first prove the existence of a sequence of approximate solutions with "good" properties such that for any neighbourhood M of 0 in X × X.This step constitutes Theorem 3.9.
2 we prove next that the sequence obtained in the first step converges to a solution of problem 3.7 and that it has a weakly convergent subsequence whose derivative converges to ẋ • .
The methodology of the proofs is completely analogous to that used for pivot Hilbert spaces in 21 .Therefore we present the results with summary proofs, pointing out where they need to be updated for the case of a non-pivot H-space.The main difference in all proofs is made by the presence of the linear mapping J.
The main result can be stated as follows.
Theorem 3.7.Let X be a Hilbert space and X * its topological dual and let K ⊂ X be a nonempty, closed and convex subset.Let F : K → X * be a Lipschitz continuous vector field with Lipschitz constant b.Let x 0 ∈ K. Then the initial value problem 3.3 has a unique solution on R .
Proof Existence of a solution on an interval 0, l , l < ∞ For this part of the proof, we need two major results, as follows.
Proposition 3.8.Let X be a nonpivot H-space, let X * be its topological dual, and let K ⊂ X be a nonempty, closed and convex subset.Let F : K → X * be a Lipschitz continuous vector field with Lipschitz constant b, so that on K ∩ B X x 0 , L , with L > 0 and x 0 ∈ K arbitrarily fixed, we have F x ≤ M : F x 0 bL.Then the set-valued mapping N p : K ∩ B X x 0 , L → R given by has a closed graph.
Proof.The proof is similar to the one in 21 .
We show first that the mapping N p : K ∩ B X x 0 , L → R given by x → − N K x , p has a closed graph.It is clear that for each p ∈ X, the set-valued map We want to show that x, y ∈ graph N p .From z n ∈ graph N p , for all n, we deduce that there exists y n ∈ − N K x n such that z n y n , p .Since the set − N K x ⊂ B X * 0, M and B X * 0, M is weakly compact, then there exists a subsequence y n k and y ∈ X * such that y n k y 3.14 for the weak topology σ X * , X * * by reflexivity σ X * , X , which is equivalent to y n k , β −→ y, β , ∀β ∈ X.

3.15
Suppose now that y / ∈ − N K x .This implies that at least one of the following two alternatives should be satisfied.
In the first case as In the second case as y n k , β → y, β , ∀β ∈ X, we have 31, Proposition III.12 F x < y ≤ lim inf k → ∞ y n k which is a contradiction because y n ∈ − N K x n , ∀n ∈ N. The continuity of F and the first part of the proof implies that has non-empty, closed and convex values for each x ∈ K and has a closed graph.
The next result is constructing the sequence of approximate solutions for the problem 3.7 .Theorem 3.9.Let X be a Hilbert space and X * its topological dual, and let K ⊂ X be a non-empty, closed and convex subset.Let F : K → X * be a Lipschitz continuous vector field so that on K ∩ B X x 0 , L , with L > 0 and x 0 ∈ K, we have F x ≤ M : F x 0 bL.Let l : L/M and I : 0, l .Then there exists a sequence {x k • } of absolutely continuous functions defined on I, with values in K, such that for all k ≥ 0, x k 0 x 0 and for almost all t ∈ I, {x k t } and { ẋk t } (the sequence of its derivatives) have the following property: for every neighbourhood M of 0 in X × X there exists k 0 k 0 t, M such that 3.17 Proof.The proof, based on topological properties of the space X, can be found in 21 .However, given we are now working in non-pivot H-spaces, then instead of z p : P K x − h p F x we now construct z p : Next we show that the sequence {x k • } built in Theorem 3.9 is uniformly convergent to some x • .Again, following closely 21 , by Theorem 3.9 there exists a pair

3.19
But using the monotonicity of x → N K x , the isometry property of J, and the b-Lipschitz continuity of F we get that

3.20
We now let φ t : x k t − x m t , so from the previous inequalities we get

3.21
Using the same technique as in 21 we get where l is the length of I.So the Cauchy criteria are satisfied uniformly and we get the conclusion.
From the previous step we know that {x k • } is uniformly convergent to x • and as x k t , ẋk t ∈ graph −F− N K M, we now deduce that there exists a θ such that ẋk t ≤ θ.Using the arguments in 21 and the result of 32 , we deduce the existence of a subsequence of { ẋk } weakly * -convergent to ẋ • ∈ L ∞ I, X .
Finally, we finish this part of the proof by showing that x • is indeed a solution of the differential inclusion 3.7 .From Theorem 3.9, for each k ≥ k 0 and almost every t ∈ I there exists a pair

3.24
So u k t → x t for every t ∈ I and v k t , p → ẋk t , p for almost all t ∈ I.By Proposition 3.8, we know that graph −F − N K , p is closed, so it follows that for almost all t ∈ I, x t , ẋk t , p ∈ graph −F − N K , p .

3.25
Since the set F x t − N K x t is convex and closed, it follows that

3.26
By Proposition 3.6, x t is a solution of problem 3.3 .

Uniqueness of Solutions on 0, l
Step 1 x • is the unique solution .Suppose that we have two solutions x 1 • and x 2 • starting at the same initial point.For any fixed t ∈ I we get

3.27
because the metric projection is a nonexpansive operator in X, J is a linear isometry, and F is b-Lipschitz.By Gronwall's inequality we obtain x 1 t − x 2 t 2 ≤ 0, so we have x 1 t x 2 t for any t ∈ I.

Existence of Solutions on R
From above we can assert the existence of a solution to problem 3.3 on an interval 0; l , with b > 0 fixed and L > 0 arbitrary.We note that we can choose L such that l ≥ 1/ 1 b in the following way: if F x 0 0, we let L 1, and if F x 0 / 0, then we let L ≥ F x 0 .In both cases we obtain l ≥ 1/ 1 b .Therefore beginning at each initial point x 0 ∈ K, problem 3.3 has a solution on an interval of length at least 0; 1/ 1 b .Now if we consider problem 3.3 with x 0 x 1/ 1 b , applying again all the above, we obtain an extension of the solution on an interval of length at least 1/ 1 b .By continuing this solution we obtain a solution on 0, ∞ .

Implicit PDS
In this section we consider a generic Hilbert space X, where generic is taken to mean that the dimensionality could be either finite or infinite, and the space could be either a pivot or a non-pivot space.Let us introduce the following definition.
Definition 3.10.Let X be a generic H-space and let K ⊂ X be a non-empty, closed subset.Consider a pair g, K such that K is convex and g : K → K r K ⊂ X, is continuous, injective, and g −1 is Lipschitz continuous.Consider F : X → X * satisfying F • g y F y , ∀y ∈ K .Then the pair g, K is called a convexification pair of F, K .
Example 3.11.Here is an example of such a convexification pair in R 2 .Let K { x, y ∈ R 2 | 0 ≤ x ≤ 1, 0 ≤ y ≤ x} and let g be the map of K into K 0, 1 × 0, 1 , namely: We can easily check that g is continuous and monotone.Now take F to be F x, y x, a , where a is an arbitrary constant in R. Then we have F • g x, y x, a F x, y .
We now introduce another type of a projected equation as follows.
Definition 3.12.Let X be a generic H-space and let K ⊂ X be a non-empty, closed subset.An implicit projected differential equation ImPrDE is a PrDE given by 3.2 where x t : g y t , g : K → K ⊂ X, that is:

3.29
The motivation for the introduction of such an equation comes from the desire to study the dynamics on a set K ⊂ X, where K could be nonconvex, and to study as well some dynamic problems on a so-called translated set see Section 4 below .Considering now 3.29 and a convexification pair g, K of a nonempty, closed K ⊂ X, then the Cauchy problem associated to 3.29 and the pair g, K is given by dg y t dt π K g y t , − J −1 • F| K y t , g y 0 x 0 ∈ K.

3.30
Next we define what we mean by a solution for a Cauchy problem of type 3.30 .
Definition 3.13.An absolutely continuous function y : I ⊂ R → X, such that is called a solution for the initial value problem 3.30 .
We claim that problem 3.30 has solutions by Theorem 3.9.It is obvious that by a change of variable x • : g y • , problem 3.30 has solutions on K, in the sense of Definition 3.4.But since g is assumed continuous and strictly monotone, then g is invertible and so y • g −1 x • ; moreover, we see that such a y is a solution to problem 3.30 in the above sense.Now we are ready to introduce the following.
Definition 3.14.An implicit projected dynamical system ImPDS is given by a mapping φ : R × K → K which solves the initial value problem: where g, K is a convexification pair.
Theorem 3.15.Let X be a generic Hilbert space, and let K be a non-empty closed subset of X.Let K be non-empty, closed and convex, let g : K → K be continuous and strictly monotone, and let Let also x 0 ∈ K and L > 0 such that x 0 ≤ L. Then the initial value problem 3.30 has a unique solution on the interval 0, l , where l L/ F x 0 bL .
Proof.The proof consists in the modification of a few easy steps of the proof given in 21 combined with the results of the present paper.

NpPDS, ImPDS, and Variational Inequalities
It is worth noting at this point that, as in the pivot case, a NpPDS is also related to a variational inequality VI problem.To show this relation, we first define what is meant by a critical point of NpPDS.
Let X be a generic Hilbert space and let K ⊂ X be a non-empty, closed and convex subset.Let F : X → X * be a vector field.Consider the variational inequality problem: Then the solution set of 4.2 coincides with the set of critical points of the non-pivot projected dynamical system 3.2 .
Proof.It follows from the decomposition Theorem 2.8 see also 23 .
The relation between an ImPDS and a VI problem is more interesting, as has been considered before in the literature, but with superfluous conditions on the projection operator P K we describe this relation next.
Definition 4.3.Let X be a generic H-space and let K ⊂ X be a non-empty, closed subset.Let F : X → X * be a mapping.Then we call g-variational inequality on the set K the problem of where g, K is a convexification pair of F, K .
We highlight the importance of the relation F • g y F y from Definition 3.10 in order for 4.3 to make sense.Under 3.5 we can rewrite 4.3 as find y ∈ K , F y , z − g y ≥ 0, ∀z ∈ K.

4.4
Remark 4.4.In 24 , 4.4 is considered in a pivot H-space and is called a "general variational inequality."We prefer to use the term "g-variational inequality" in relation to 4.4 , in order to avoid confusion with the commonly accepted "generalized variational inequality" which involves multimappings.So by multiplying by a strictly positive constant λ and using the bilinearity of the inner product, we get −F y * , y ≤ 0, ∀y ∈ T K g y * . 4.6 So we deduce that −F y * ∈ N K g y * ; using the decomposition Theorem 2.8 we get P T K g y * −J −1 F y * 0, and so y * is a critical point of 3.30 .Now suppose that y * is a critical point of 3.30 ; then by definition we have and by the decomposition theorem we get −F y * ∈ N K g y * .By the definition of the normal cone to K in g y * , the following inequality is satisfied: which is exactly 4.4 .

Weighted Traffic Problem
Let us introduce a network N, that means a set W of origin-destination pair origin/destination node and a set R of routes.Each route r ∈ R links exactly one origin-destination pair w ∈ W. The set of all r ∈ R which link a given w ∈ W is denoted by R w .For each time t ∈ 0, T we consider vector flow F t ∈ R n .Let us denote by Ω an open subset of R, by n card R , a {a 1 , . . ., a n }, and by a −1 {a −1 1 , . . ., a −1 n } two families of weights such that for each 1 ≤ i ≤ n, a i ∈ C Ω, R \ {0} .We introduce also the family of real time traffic densities s {s 1 , . . ., s n } such that for each 1 Let r i correspond to an element of a and s, newly to a i and s i .If we denote by is a Hilbert space for the inner product The space V * n i 1 V * i is a Hilbert space for the following inner product and the following bilinear form defines a duality between V and V * : More exactly we have the following.
Proposition 5.1.The bilinear form 5.5 is defined over V * × V and defines a duality between V * × V .The duality mapping is given by J F a 1 F 1 , . . ., a n F n .
The feasible flows have to satisfy the time-dependent capacity constraints and demand requirements; namely, for all r ∈ R, w ∈ W and for almost all t ∈ Ω, where 0 ≤ λ ≤ μ are given in L 2 0, T , R n , ρ ∈ L 2 0, T , R m where m card W , F r , r ∈ R, denotes the flow in the route r.If Φ Φ w,r is the pair route incidence matrix, with w ∈ W and r ∈ R, that is, Φ w,r : χ R w r , 5.7 the demand requirements can be written in matrix-vector notation as ΦF t ρ t .

5.8
The set of all feasible flows is given by in Ω; ΦF t ρ t , a.e in Ω .

5.9
We provide now the definition of equilibrium for the traffic problem.First we need to define the notion of equilibrium for a variational inequality.A variational inequality VI in a Hilbert space V is to determine where K is a closed convex subset of V , and C : K → V * is a mapping.
⇒ H q t μ q t or H m t λ m t .
Based on previous results 20 , this solution coincides with set of critical points of the associated projected dynamical system.

QVI
Let X be a generic H-space, D closed, convex, nonempty in X.Let K : D → 2 X with K x convex for all x ∈ D and F : K → 2 X * a mapping.
Let us introduce the following variational inequality: Note that in this case the set in which we are looking for the solution depends on x.For problem 5.14 we can provide the following existence result see 17 or 33 .Then there exists x such that x ∈ K x : C x , y − x ≥ 0, ∀y ∈ K x .

5.15
In order to study the disequilibrium behavior of 5.14 , we introduce now the following projected differential equation.Definition 5.5.We call projected dynamical system associated to the quasivariational inequal-5.14the solution set of the projected differential equation:

5.16
Remark 5.6.In general there are no existence results for problem 5.16 .An existence result for a particular case of 5.16 has been given in 24 , assuming the following fact.
Assumption 5.7.Let X be a pivot H-space.For all u, v, w ∈ X, P K u satisfies the condition where λ > 0 is a constant.However, this assumption fails to be true.One counterexample is as follows.We denote by C a closed convex set and we take u, v ∈ C; we denote by K u T C u and by K v T C v the tangent cones of C at u and v.In fact, w ∈ X can only be chosen in one of the following four situations: Suppose now that we have w ∈ K u \ K v ; then by Moreau's decomposition theorem we get where N C v is the normal cone of C at v. Consider now X R 2 , C 0, 2 , u 0, 0 and v , .It is clear that we have the following: Consider now the special case of a set-valued mapping K which is the translation of a closed, convex subset K: where v x is a vector linearly dependant on x; then problems 5.14 and 5.16 can be studied, under certain conditions, respectively, as a g-VI and an implicit PDS as shown below.
If K x K p x as done by Noor for type B PDS 24 , we have the following equivalent formulations: dx t dt P T K p x x −J −1 F x P T K g x −J −1 F x , x 0 x 0 ∈ K, 5.23 where g x x − p x , assuming F g x F x − p x F x .We can observe that if dp x /dt 0, then 5.23 is equal to the implicit projected differential equation 3.29 , and therefore Theorem 3.15 provides an existence result without assuming any kind of Lipschitz condition of the projection operator.

Conclusions
We show in this paper that previous results of existence of projected dynamical systems can be generalized to two new classes, namely, the non-pivot and the implicit PDS.The generalizations came as needed to study a more realistic traffic equilibrium problem, as well as to study the relations between an implicit PDS and a class of variational inequalities as previously introduced in 24 as an open problem.

Theorem 4 . 5 .
If the problems 4.4 and 3.30 admit a solution, then the equilibrium points of 4.4 coincide with the critical points of 3.30 .Proof.Suppose y * ∈ K is a solution of 4.4 ; then by definition we have F y * , z − g y * ≥ 0, ∀z ∈ K. 4.5

Theorem 5 . 4 .
Let D be a closed convex subset in a locally convex Hausdorff topological vector space X.Let us suppose that i K : D → 2 D is a closed lower semicontinuous correspondence with closed, convex, and nonempty values, ii C : D → 2 X is a monotone, finite continuous, and bounded single-valued map, iii there exist a compact, convex, and nonempty set Z ⊂ D and a nonempty subset B ⊂ Z such that a K B ⊂ Z, b K z ∩ Z / ∅, ∀z ∈ Z, c for every z ∈ Z \ B, there exist z ∈ K z ∩ Z with C z , z − z < 0. 20 Journal of Function Spaces and Applications
Definition 5.2.H ∈ V is an equilibrium flow if and only if