Attracting and Natural Invariant Varieties for Polynomial Vector Fields and Control Systems

We discuss real and complex polynomial vector fields and polynomially nonlinear, input-affine control systems, with a focus on invariant algebraic varieties. For a given real variety we consider the construction of polynomial ordinary differential equations x˙=f(x)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\dot{x}=f(x)$$\end{document} such that the variety is invariant and locally attracting, and show that such a construction is possible for any compact connected component of a smooth variety satisfying a weak additional condition. Moreover we introduce and study natural controlled invariant varieties (NCIV) with respect to a given input matrix g, i.e. varieties which are controlled invariant sets of x˙=f(x)+g(x)u\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\dot{x}}=f(x)+g(x)u$$\end{document} for any choice of the drift vector f. We use basic tools from commutative algebra and algebraic geometry in order to characterize NCIV’s, and we present a constructive method to decide whether a variety is a NCIV with respect to an input matrix. The results and the algorithmic approach are illustrated by examples.


Introduction
In the present paper, we discuss ordinary differential equations with polynomial right hand sideẋ = f (x) (1) as well as polynomial control systemṡ over K n (with K = R or C), with f a K n -valued polynomial, g a polynomial n × m matrix, and u having values in K m . Considering complex systems will turn out to be useful also for the real case. We are mainly interested in polynomial state feedbacks α : K n → K m and the corresponding closed loop systeṁ Overall we are concerned with invariant algebraic varieties of polynomial vector fields, and with the construction of polynomial vector fields that leave a given variety invariant. This approach has proven quite fruitful in qualitative investigations and integrability problems; see e.g. [6,7], Llibre et al. [13] and the monograph by Zhang [22]. For control systems, the notion of controlled invariant variety (CIV) was introduced and investigated in [21]. One calls the algebraic variety V controlled invariant for system (2) if there exists a polynomial state feedback α such that V is an invariant set for (3). This extends the notion of controlled invariant subspaces for linear systems which was introduced by Basile and Marro in 1969. The geometric approach for linear systems provides the theoretical basis for solving certain decoupling and noninteracting problems; see [2] for a comprehensive survey. The theory has been generalized to nonlinear systems by Isidori [10] and several other authors. Recently, some progress has been made in the area of nonlinear polynomial systems; see [15][16][17]21], and Yuno and Ohtsuka [19,20], where it is shown that methods from symbolic computation can be used to test the conditions for controlled invariance of varieties constructively. The purpose of the present work, which is in part based on the doctoral dissertations [11,17] by two authors of the present manuscript, is twofold. First, for real systems (1) there is interest not only in invariance of algebraic varieties but also in attractiveness. For the "inverse problem" to find suitable vector fields for a given variety, we provide some general constructions of vector fields with prescribed Lyapunov functions. Our main result here is concerned with a compact connected component of a smooth variety: Given one (technical) additional condition, we prove the existence of a polynomial vector field for which this component is locally exponentially attracting. Second, for control systems we introduce the notion of natural controlled invariant variety (NCIV) with respect to a given input matrix g, by requiring that this variety can be made invariant for (3) with arbitrary drift f by a suitable choice of the feedback α. For real systems we will also introduce a slightly weaker form (RNCIV) by allowing for rational feedbacks whose denominators have no real zeros. One motivation for introducing these notions is the observation that they ensure robustness with respect to perturbations of the drift. Moreover, from a computational point of view, there are cases where it is possible to construct NCIV's for a given g, whereas no solution method is currently known for the general problem of constructing CIV's for given f and g. Our main result (Theorem 2) provides a precise characterization of NCIV's and RNCIV's, and allows an algorithmic verification of the relevant properties. We illustrate all the results by (classes of) examples.

Preliminaries
We first introduce some notation, and note basic facts from commutative algebra and algebraic geometry that may be found in Kunz [12] and Shafarevich [18], for instance. Moreover we recall some familiar notions related to ordinary differential equations.

Notation
. For a subset S ⊆ R, we write V(S) for the set of common zeros (in K n ) of all elements of S; the set V(S) is then called an algebraic variety. Given an algebraic variety V ⊆ K n , one has the ideal J (V ) of all polynomials vanishing on V . Given a generator set ϕ 1 , . . . , ϕ k , we will fix the notation throughout the paper. By J ∈ R k×n we denote the Jacobian of (ϕ 1 , . . . , ϕ k ), thus The dimension dim(V ) of V is defined as the Krull dimension of R/J (V ). The variety V is a finite union of irreducible components. If all the irreducible components have the same dimension, V is called equidimensional. The tangent space at a ∈ V is given by A point a ∈ V is called simple (or regular, or nonsingular) if dim(T a (V )) is equal to the dimension of the (unique) irreducible component of V that contains a. Finally, the variety V is said to be smooth if all a ∈ V are simple points. Given the ordinary differential equation (1), we call a subset M of K n invariant (resp. positively invariant, resp. negatively invariant) if for any y ∈ M the solution orbit (resp. the positive semi-orbit, resp. the negative semi-orbit) through y is contained in M. We call a closed invariant set M (locally) attracting for (1) if there is a neighborhood U of M such that for any y ∈ U the solution z(t) with initial value y exists for all t ≥ 0 and satisfies dist (z(t), M) → 0 as t → ∞ (see e.g. Perko [14], Ch. 3.2, Def. 2).

Some Known Results
First we recall from [21] some definitions and a criterion for invariance of an algebraic variety with respect to a polynomial vector field. Recall that R = K [x 1 , . . . , x n ].
Definition 1 With the notations from above and for i ∈ {1, . . . , k} define where π denotes the projection onto the first n components. Finally let With these notions one has algebraic characterizations of invariant varieties for Eq. (1).
From the above one sees that the complexification of a real variety that is invariant with respect to a real vector field remains invariant with respect to the complexified vector field.
There are two aspects in the discussion of invariant varieties of polynomial vector fields: In the direct problem one asks for invariant varieties of a given polynomial vector field, while in the inverse problem one considers the existence and construction of polynomial vector fields that admit a given variety as invariant set. For the (easier) inverse problem one knows some general answers. The first part of the following Proposition is obvious, but the proof of the second is nontrivial. For smooth varieties Bavula [3] also provides a precise characterization of the vector fields H which admit every ϕ i as a first integral. For non-smooth varieties there exist further vector fields admitting V ; see a detailed discussion of invariant curves for planar systems in [6], and also [21].

Remark 1
In our context, ideals without zeros are of particular relevance. From Hilbert's Nullstellensatz [12] and the real Nullstellensatz [5]  In some situations it will be appropriate to consider rational vector fields. The pertinent facts are stated next, with the first assertion being standard (see e.g. Perko [14], Section 3.1, Remark 3). The proof of the second statement uses the fact that closures of invariant sets (with respect to the norm topology as well as the Zariski topology) are invariant.
(a) Then the ordinary differential equatioṅ f (x) on U and the restriction of (1) to U have the same solution orbits, hence the same invariant sets.

Prescribed Attracting Invariant Varieties
Throughout this section we assume that K = R. As before, we consider a variety V with J (V ) = ϕ 1 , . . . , ϕ k . Now the objective is to determine polynomial vector fields for which V , or some connected component of V , is invariant and locally attracting.
(Global attractivity will in general be precluded for topological reasons; see Remark 4 below.)

Lyapunov Functions
We first construct real polynomial vector fields with certain prescribed Lyapunov functions.

(e) Given the setting of part (c), let v(t) be any solution ofẋ = f (x). Then
for all t in the maximal interval of existence.
Proof By assumption we have rank ∇ϕ 1 ∇ϕ 2 · · · ∇ϕ r (z) = r , hence there exist polynomial (for instance, constant) vector fields form a basis of R n . Therefore the matrix z = ∇ϕ 1 ∇ϕ 2 · · · ∇ϕ r κ z,r +1 · · · κ z,n is invertible at every point of an appropriate Zariski open neighborhood U z , and part (a) is proven. As for part (b), the matrix A z is symmetric and positive definite on U z and moreover we observe that with the standard basis e 1 , . . . , e n of R n . Consequently, we get Parts (c) and (d) are then clear, while part (e) follows from the identity

Remark 2
It is worth noting that the construction of A z in Lemma 3 ensures that the ∇ϕ i (x) are orthonormal for the scalar product induced by A z (x) for all x ∈ U z . There may be other choices which also yield this property. In particular, for the case r = 1, ϕ 1 = ϕ the construction in Lemma 3 is unnecessarily complicated, since one may choose A as the identity matrix. Indeed the polynomial vector field for which the conclusions of Lemma 3(d) and (e) hold, mutatis mutandis.
Lyapunov functions yield positively invariant sublevel sets (see e.g. Amann [1], Thm. 18.2) and impose restrictions on limit sets (LaSalle's principle; see e.g. Amann [1], Thm. 18.3); note also the invariance of limit sets. We obtain: Proposition 2 Let the setting and notation of Lemma 3 be given. Then: (a) For any c > 0 and any i ∈ {1, . . . , r } the sets Let y ∈ R n such that the omega limit set ω(y) is defined and nonempty, and denote by Y the largest invariant set forẋ = f (x) that is contained in Then

Attracting Compact Components
Keeping the notation from Lemma 3, we denote by V a connected component of V which is also compact. Moreover we assume that dim V = n − r and impose the stronger condition that rank ∇ϕ 1 , . . . , ∇ϕ r (a) = r for all a ∈ V .
Remark 3 For the following we define f as in Lemma 3(c), and require σ (a) > 0 for all a ∈ V . By condition (7), each point a ∈ V admits a neighborhood and a diffeomorphism to a neighborhood of 0 ∈ R n with ϕ i • −1 = x i for 1 ≤ i ≤ r . Thus locally one may assume Thus, there exists a compact neighborhood K a of a such that Theorem 1 Let V be a compact connected component of V . Then any polynomial vector field f as given in Remark 3 has the following property: There exists a compact, positively invariant neighborhood K ⊆ N (see Remark 3) such that V ⊆ int K and: in particular ψ is a Lyapunov function. Since N is compact, so is its boundary ∂ N , hence ψ attains a positive minimum c on ∂ N , and the connected component K of which contains V is a compact subset of N . By construction, K is positively invariant. From La Salle and σ (x) ≥ σ 0 > 0 for all x ∈ N one sees that ω(z) ⊆ V , and this limit set is nonempty since the positive semi-orbit is contained in the compact set K . Finally, with Lemma 3(e) one sees In view of Remark 3, the second assertion follows.
Proof It suffices to prove the assertion for f +εh. Invariance of V w.r.t. the vector field h implies the existence of rational functions μ i, j which are regular on V such that This follows e.g. from Theorem 4 in Shafarevich [18], Ch. II, §3, with the ϕ i forming a system of local parameters at every point of V . In turn we find Now let N be as in Remark 3. Then the symmetric matrix is negative definite for all x ∈ N , provided that ε is sufficiently small. Therefore there exists δ > 0 such that Now the assertion follows from arguments similar to those in the proof of Theorem 1.

Examples
Example 1 When r = 1, i.e. V is a hypersurface, Remark 2 yields If V is a compact and smooth connected component then ∇ϕ does not vanish on V , hence Theorem 1 is applicable.
• As for a concrete example, let ϕ = x 2 + y 2 − 1, i.e. V(ϕ) is a planar circle. In this case we explicitly have for some γ ∈ R. Note that f admits the stationary point (0, 0) and therefore, V(ϕ) is not a globally attracting set. • For a second example consider the variety V = V(y 2 − x(x + 1)(x + 2)) ⊆ R 2 (an elliptic curve) which is irreducible and smooth of dimension 1, with two connected components.
Here we have with some polynomial γ .

Example 2
Another special case is r = n−1, thus V is a compact connected component of a curve. In this situation with Lemma 3 we obtain the vector fielḋ and A can be constructed in the following special manner: By assumption rank ∇ϕ 1 · · · ∇ϕ n−1 = n − 1 holds on V . We define the vector field κ by κ := ∇ϕ 1 × · · · × ∇ϕ n−1 where w 1 × · · · × w n−1 is the generalized cross product on R n defined via det(w 1 , · · · , w n−1 , w n ) = w n , w 1 × · · · × w n−1 .
Then κ(v) is orthogonal to each vector ∇ϕ i (v) for any v ∈ R n , and furthermore κ(z) = 0 for all z ∈ V . Thus = ∇ϕ 1 · · · ∇ϕ n−1 κ is invertible on V , and for Theorem 1 is applicable. Again we give a concrete example. Let n = 3 and consider the ideal Then V := V(I ) is the intersection of the sphere S 2 and the plane x 1 = 0. Clearly, V is smooth, compact and has only one connected component. Furthermore we observe Taking the cross product of both vectors and dividing by two we obtain and thus we have By Theorem 1 there exists an attracting neighborhood of V with respect to any vector field Moreover with Bavula [3] one has that H = ρ · κ for some polynomial ρ.
Next we demonstrate that, in contrast to the above examples, it is not generally possible to construct vector fields κ r +1 , . . . , κ n , such that ∇ϕ 1 · · · ∇ϕ r κ r +1 · · · κ n is invertible on all of V .

Example 3
We consider the smooth, compact and connected variety given by with ϕ 1 = x 2 1 + x 2 2 + x 2 3 + x 2 4 − 1 and ϕ 2 = x 1 ; thus V is isomorphic to the sphere S 2 . Due to the hedgehog theorem (see e.g. Deimling [8], Ch. I, Thm. 3.4), one cannot construct two additional vector fields such that the vectors ∇ϕ 1 , ∇ϕ 2 , κ 1 , κ 2 are linearly independent at every point of V . Therefore, the approach from Lemma 3(a) is not feasible in this situation. However, the problem can be resolved via Lemma 3(c) and Theorem 1. We have Consider the matrices 1 and 2 given by Then we have vanishes if and only if x 2 = x 3 = x 4 = 0 holds. Consequently, σ does not vanish on V and Theorem 1 is applicable.
Finally we note that global attractivity of every connected component of an invariant variety is generally impossible, for topological reasons.

Remark 4
As in Example 1 consider the variety V = V(y 2 − x(x +1)(x +2)) with two connected components of dimension 1, one bounded and one unbounded. Assume that h is a polynomial (or smooth) vector field on R 2 such that for each initial value y ∈ R

Natural Controlled Invariant Varieties
We now turn to control problems (2), (3), and to varieties V that are invariant for (3) with appropriate feedback. Geometrically speaking, in a control problem one needs to modify f via g such that every solution orbit that has one point in common with V is completely contained in it.

Definition and Some Properties
We recall and extend the definition of controlled invariance from [15]. (2) if there exists a polynomial state feedback α ∈ R m such that V is invariant for the closed loop system (3). (b) A variety V is called rationally controlled invariant for (2) if there exists a rational state feedback α whose denominator has no zero in K n such that V is invariant for the closed loop system (3).

Definition 2 (a) A variety V is called controlled invariant for
By Remark 1 both notions coincide for K = C, but there is a significant difference in the real case. Now, given a polynomial input matrix g ∈ R n×m , we wish to characterize varieties which are controlled invariant for (2) for every vector field f ∈ R n . Definition 3 (a) Given a polynomial matrix g ∈ R n×m and a variety V , we call V rationally natural controlled invariant with respect to g (briefly RNCIV) if for all

can be chosen then we call V natural controlled invariant with respect
to g (briefly NCIV).

Remark 5 (a) A necessary requirement for the RNCIV property of a smooth variety V is the "pointwise condition"
T a (V ) + Kg 1 (a) + · · · + Kg m (a) = K n for all a ∈ V .
Indeed, if this condition fails at the point a then take any polynomial drift f . Obviously there exists no rational (or smooth) feedback α such that f + gα leaves V invariant. (b) The requirement of natural controlled invariance ensures robustness with respect to perturbations of the drift, in a dual sense: (i) Whenever the drift is altered from f to f then there exist ψ f and α f such that . This holds by definition. (ii) Let a (smooth) vector field f 1 be given. Then for sufficiently small ε, every nonstationary point a ∈ V of f + ψ −1 gα admits a neighborhood U and a local invariant manifold V * for the perturbed system with V * close to V (with respect to the Hausdorff distance). This is a direct consequence of standard dependency theorems.
While for every given variety it is easy to construct nontrivial polynomial vector fields that leave this variety invariant (see Proposition 1), there exist controls which do not admit interesting rationally natural controlled invariant varieties. We look at a simple example.
Example 4 (a) In R 2 the input matrix admits no smooth RNCIV of dimension one. To see this, assume that V = V(ϕ) is a RNCIV, and let y ∈ V be a point of minimal distance to 0. Setting ρ(x) := (x 2 1 + x 2 2 )/2, the Lagrange multiplier theorem implies that either ∇ϕ(y) = 0 (which is impossible by smoothness of V ) or λ · ∇ϕ(y) = ∇ρ(y) = y for some λ.
When λ = 0 then y = 0, and g(y) = 0 ∈ T 0 (V ); a contradiction to Remark 5(a). But when λ = 0 then g(y), ∇ϕ(y) = 0 which also implies g(y) ∈ T y (V ); again we obtain a contradiction. (b) Note: It is unproblematic to generalize this example to R n , with the columns of g generating the submodule of R n which leaves S n−1 invariant. Moreover, one has the same result for closed submanifolds (rather than varieties). (c) Nonexistence of RNCIV's may imply scarcity of CIV's for a given drift. To see this, we continue part (a) with the particular drift f (x) = x. Let V be a one dimensional smooth invariant variety for some f + gα, with y ∈ V having minimal distance to 0. The arguments from part (a) show that λ = 0, with ( f + gα)(y) = 0, or 0 = ( f + gα)(y), y = y, y .
Since f (z) and g(z) are linearly independent for all z = 0, we find y = 0 in both cases. To summarize, if there exists a CIV for some f + gα then this variety must contain 0. There obviously exist invariant varieties for f = f + g · 0 (α = 0; control is switched off), viz. all straight lines through the origin. For α(0) = 0 the stationary point 0 is a focus of f + gα, which admits no local analytic invariant curves in R 2 , and a fortiori no algebraic invariant curves. In case α(0) = 0 the vector field is locally analytically equivalent to f by Poincaré-Dulac normal form theory (see e.g. Bibikov [4]). Conclusion At most, the input matrix g can deform existing invariant curves of f .

Characterization
Our main result on natural controlled invariant varieties provides equivalent conditions for a variety V to satisfy the "pointwise conditions" from Remark 5. This can be used for the algorithmic verification of the NCIV property, and it is also helpful for the construction of varieties, and for the computation of feedbacks. We are mainly interested in the real case, which is the underlying reason for the introduction of rational feedbacks. On the other hand, a proper understanding of the real case requires to consider the complex setting as well.
We keep the notation from Sect. 2.1, in particular V is a variety with vanishing ideal J (V ) generated by ϕ 1 , . . . , ϕ k , and its Jacobian J is defined in (5).
Theorem 2 Let V be equidimensional and smooth with dim(V ) = d; furthermore let g ∈ R n×m .
(a) The following statements are equivalent for K = R as well as K = C.
(i) V is rationally natural controlled invariant with respect to g.
(c) If K = R and any of (ii), (iii), (iv) holds for the complexification of R or V respectively, then V is natural controlled invariant with respect to g.
Proof We first prove part (a); parts (b) and (c) are rather simple consequences. Since V is smooth and equidimensional, the equality rank(J (a)) = n − d holds for all a ∈ V .
1. For a fixed ψ f ∈ R we can find an α f ∈ R m such that ψ f · f + g · α f ∈ M if and only if ψ f · f ∈ M + im R (g). From this and Lemma 1 we get (i) ⇔ (ii).
To prove equivalence of (iii) and (iv) we use a fact from Linear Algebra (see e.g. Lemma 5.46 in [17]): For matrices A ∈ K k×n , B ∈ K n×m , one has rank(A) = rank(AB) if and only if ker K (A) + im K (B) = K n . The assertion follows with ker(J (a)) = T a V . 2. In order to show the implication (ii) ⇒ (iv) we first prove that Thus let a ∈ V and h ∈ M be arbitrary. Then Lemma 1 implies J · h ∈ I · R k and thus we have 0 = (J · h)(a) = J (a) · h(a). Because of J (V(I)) = I this yields h(a) ∈ ker(J (a)) = T a V as desired.
Next, we prove that statement (ii) implies K n = M(a) + im K (g(a)). Combined with (8) this will yield K n = M(a) + im K (g(a)) ⊆ T a V + im K (g(a)) ⊆ K n which shows (iv). So let v ∈ K n ⊆ R n . By (ii) there exists ψ v ∈ R with V(ψ v ) = ∅ and q ∈ M, w ∈ R m such that ψ v · v = q + g · w. But then for every a ∈ V we have ψ v (a) = 0 and thus v = v(a) = (ψ v (a)) −1 · (q(a) + g(a) · w(a)) ∈ M(a) + im K (g(a)) as desired. 3. As a preliminary step for the proof of "(iv)⇒(ii)" we strengthen the subset relation in (8) to equality, thus we prove To see this, partition whence the columns are defined at a and form a basis of ker J (x) ⊆ K(x 1 , . . . , x n ) n . Multiplying by a common denominator ρ of the w i with ρ(a) = 0, we get and w 1 (a), . . . , w d (a) ∈ M(a) are linearly independent in K n . 4. Now we show that (iv) implies (ii). Let q 1 , . . . , q s generate the module M, and let f ∈ R n . Then for every a ∈ V there exist polynomials such that ρ a (a) = 0, and ρ a · f = j μ a, j q j + ν a, g .
To verify this, assume w.l.o.g. that with σ = 0 in case K = C, and σ (x) ≥ 0 for all x when K = R. Abbreviating μ i j := μ a i , j and ν ik := ν a i ,k , summation yields The first two sums on the right hand side lie in M, since I · R n ⊆ M, and the last sum lies in im R (g). 5. For K = C the equivalence of (ii) and (v) follows by Hilbert's Nullstellensatz (Remark 1); this shows part (b). Finally in part (c) we may choose ψ f = 1 in the complexification by (b), and then take real parts. Thus V is a NCIV with respect to g.

Examples
As shown by Example 4, RNCIV's for a given g do not exist in general. Moreover their construction (if existence is given) is a nontrivial task, although considerably easier than finding CIV's for given f and g. In this section, we construct RNCIV's and NCIV's for special classes of input matrices g ∈ R n×m .

Proposition 3
For K = R, let ψ 1 , . . . , ψ m ∈ R, and A ∈ R n×n such that A(z) is symmetric and positive semidefinite for all z ∈ R n . Define If c 1 , . . . , c m ∈ K are such that is smooth of dimension d, rank (∇ψ 1 (x), . . . , ∇ψ m (x)) = n − d on W , and A(z) is positive definite for all z ∈ W then W is a RNCIV for g, and a NCIV given the conditions of Theorem 2(c).
Proof For any z ∈ W , a positive definite scalar product τ z is defined by Then the vector space im K (g(z)) is spanned by the ∇ψ j (z), and the tangent space T z (W ) is the τ z -orthogonal complement of this space. This implies the "pointwise" condition (ii) in Theorem 2(a).

Remark 6
In particular, if A is given as in Lemma 3 (or A is such that Remark 2 is applicable) and the conditions of Theorem 1 hold for W then any drift admits a feedback such that W is locally attracting for (3): First find a feedback such that W is invariant for (3), then apply Corollary 1.
The next class of examples generalizes invariance properties of homogeneous polynomials, and also works in the complex setting. = (g 1 , . . . , g m ) ∈ R n×m assume there exist nonconstant μ 1 , . . . , μ k ∈ R such that Since μ j (a) = c j = 0 for all a ∈ V and j = 1, . . . , k, we have rank(M(a)) = k for all a ∈ Y and thus rank((J · g)(a)) = rank((M · B)(a)) = rank(M(a) · B) = rank(B) = rank(J (a)) Therefore Y is smooth, and all assumptions of Theorem 2 are satisfied. The assertion follows.

Proposition 4 For an input matrix g
Example 5 (a) Let K = R and n ≥ 2. Consider g ∈ R n with g(x) = x and let μ be any homogeneous polynomial of degree ≥ 1. By the familiar Euler differential equation one has L g (μ) = · μ, So, whenever c ∈ R is such that W := V(μ − c) is smooth then the assumptions of Propositions 3 and 4 are fulfilled and W is a NCIV with respect to g. As a special example consider the real case and μ = n i=1 α i x 2 i , with all α i > 0, and c > 0. Here Remark 6 is applicable. Then W := V(x 1 − c 1 , x 2 2 + x 2 3 − c 2 ), with c 1 ∈ R and c 2 > 0, is a NCIV with respect to g. To see this, note that the complexification of W is smooth of dimension one, and for μ 1 = x 1 , μ 2 = x 2 2 + x 2 3 the identities L g 1 (μ 1 ) = μ 1 , L g 2 (μ 1 ) = 0, L g 1 (μ 2 ) = 0, L g 2 (μ 2 ) = 2μ 2 hold; therefore B = 1 0 0 2 in the notation of Proposition 4. Consequently, we get rank(B) = 2 = 3 − 1 and by applying Proposition 4 the assertion follows.
The elements of the module M are given by with ρ ∈ R and h ∈ R 2 arbitrary, and q := 2x 2 3x 2 1 + 6x 1 + 2 , Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.