![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
We answer the question how arbitrarily small perturbations of a pair of one arbitrary and one symmetric matrix can change a normal form with respect to a certain linear group action. This result is then applied to describe the quadratic part of normal forms of complex points of small
-perturbations of real 4-manifolds embedded in a complex 3-manifold.
1. Introduction
The study of complex points was started in 1965 by E. Bishop with his seminal work on the problem of describing the hull of holomorphy of a submanifold near a point with one-dimensional complex tangent space [Citation1]. This is now very well understood for surfaces (see Bishop [Citation1], Kenig and Webster [Citation2], Moser and Webster [Citation3]), and it later initiated in many researches in geometric analysis. For instance, (formal) normal forms for real submanifolds in near complex points were considered by Burcea [Citation4], Coffman [Citation5], Gong [Citation6], Gong and Stolovich [Citation7], Moser and Webster [Citation3] among others. We add that topological structure of complex points was first considered by Lai [Citation8] and in the special case of surfaces by Forstnerič [Citation9]. Up to
-small isotopy complex points of real codimension 2 submanifolds in complex manifolds were treated by Slapar [Citation10–12].
In this paper we describe the behavior of the quadratic part of normal forms of complex points of small -perturbations of real 4-manifolds embedded in a complex 3-manifold (see Corollary 3.8). It is a direct consequence of a result that clarifies how a normal form for a pair of one arbitrary and one symmetric
matrix with respect to a certain linear algebraic group action changes under small perturbations (see Theorem 3.6); by a careful analysis we also provide information how small the perturbations must be. Due to technical reasons, these results are precisely stated in Section 3 and then proved in later sections.
Let be a
-smooth embedding of a real smooth
-manifold into a complex
-manifold
. A point
is CR-regular if the dimension of the complex tangent space
is n−1, while p is called complex when the complex dimension of
equals n, thus
. By Thom's transversality theorem [Citation13, Section 29], for generic embeddings the intersection is transverse and so complex points are isolated. Using Taylor expansion M can near a complex point
be seen as a graph:
where
are suitable local coordinates on X, and
,
,
. By
we denote the group of all
complex matrices, and by
,
, respectively, its subgroups of symmetric and nonsingular matrices. After a simple change of coordinates
it is achieved that
, and the normal form up to quadratic terms is:
(1)
(1) A real analytic complex point p is called flat, if local coordinates can be chosen so that the graph (Equation1
(1)
(1) ) lies in
. It is quadratically flat, if the quadratic part of (Equation1
(1)
(1) ) is real valued; this happens precisely when A in (Equation1
(1)
(1) ) is Hermitian.
Any holomorphic change of coordinates that preserves and
as a set in (Equation1
(1)
(1) ), has the same effect on the quadratic part as a complex-linear change
Furthermore, using this linear changes of coordinates and a biholomorphic change
transforms (Equation1
(1)
(1) ) into the equation that can by a slight abuse of notation be written as
Studying the quadratic part of complex points thus means examining the action of a linear group
on pairs of matrices
, introduced in [Citation5]:
(2)
(2) Problems of the quadratic part thus reduce to problems in matrix theory.
When n = 1 complex points are always quadratically flat and locally given by the equations ,
or
(Bishop [Citation1]). If in addition they are real analytic and elliptic (
), they are also flat (see [Citation3]). A relatively simple description of normal forms of the action (Equation2
(2)
(2) ) was obtained for n = 2 (see Coffman [Citation5] and Izotov [Citation14]), while in dimensions 3 and 4 a complete list of normal forms has been given only in the case of quadratically flat complex points (see Slapar and Starčič [Citation15]). Nevertheless, if B in (Equation1
(1)
(1) ) is nonsingular the classification has been done even in higher dimensions by the result of Hong [Citation16].
The problem of normal forms of matrices under perturbations was first studied by Arnold (see e.g. [Citation13]), who considered matrices depending on parameters under similarity (miniversal deformations). The change of Jordan canonical form has been then successfully investigated through the works of Markus and Parilis [Citation17], Edelman, Elmroth and Kågstrom [Citation18], among others; the software Stratigraph [Citation19] constructs the relations between Jordan forms. However, the problem of normal forms for -conjugation (or T-conjugation) under small perturbations seems to be much more involved, and has been so far inspected only in lower dimensions; check the papers Futorny, Klimenko and Sergeichuk [Citation20], Dmytryshyn, Futorny and Sergeichuk [Citation21] (Dmytryshyn, Futorny, Kågström, Klimenko and Sergeichuk [Citation22]). Virtually nothing has been known until the time of this writing about simultaneous small perturbations of pairs of matrices under these actions.
In connection to these problems we mention results of Guralnick [Citation23] and Leiterer [Citation24], who respectively studied similarity of holomorphic maps from Riemann surfaces or Stein spaces to a set of matrices. We shall not consider this matter here.
2. Normal forms in dimension 2
We recall the basic properties of an action of a Lie group on a manifold (check e.g. [Citation25, Theorem IV.9.3]). These are well known and they are not difficult to prove.
Proposition 2.1
Let be a smooth
analytic
action of a real
complex
Lie group G with a unit e, acting on a smooth
complex
manifold X, i.e.
Then Φ satisfies the following properties:
For any
the map
is an automorphism and the map
is a transitive automorphism.
For any
the orbit map
is transitive and equivariant
for any
we have
and
is of constant rank with
.
An orbit of
denoted by
is an immersed (locally embedded) homogeneous submanifold of dimension equal to
.
Any orbit can be endowed (globally) with the structure of a manifold, but it does not necessarily coincide with the subspace topology [Citation25, Theorem IV.9.6].
We proceed with the list of representatives of orbits (normal forms) of the action (Equation2(2)
(2) ) for n = 2 obtained by Coffman (see [Citation5, Section 7,Table 1]). In addition, we compute tangent spaces of orbits and then arrange normal forms into a table according to dimensions of their orbits (42 types); these are calculated similarly as in the case of similarity (see e.g. Arnold [Citation13, Section 30]). To simplify the notation,
denotes the diagonal matrix with a, d on the main diagonal, while the
identity-matrix and the
zero-matrix are
and
, respectively.
Lemma 2.2
Orbits of the action (Equation2(2)
(2) ) for n = 2 are immersed manifolds, they are represented by its normal forms
given in Table
the dimensions are noted in the first column
.
Table 1. Orbits of the action (Equation2
(2)
(2) ) for n = 2.
A minor change is made in comparison to the original list in [Citation5], as is taken instead of
; conjugate the later one with
.
Proof
Proof of Lemma 2.2
By Proposition 2.1 (2), (3), orbits of the action Ξ in (Equation2(2)
(2) ) for n = 2 are immersed manifolds. To compute the tangent space of the orbit
we fix
, choose a path going through
:
and then calculate
Writing
,
, where
is the elementary matrix with one in the jth row and kth column and zeros otherwise, we deduce that
and in a similar fashion we conclude that
Let a
complex (symmetric) matrix be identified with a vector in a real Euclidean space
(and
), thus
with the standard basis
. The tangent space of an orbit
can then be seen as the linear space spanned by the vectors
, where
(3)
(3)
We split our consideration of tangent spaces according to the list of normal forms in [Citation5, Section 7,Table 1] into several cases. In each case the tangent space will be written as a direct sum of linear subspaces (with trivial intersection) such that
and
will be either trivial or its vectors will be of the form
with some nonvanishing
,
.
Case I. ,
,
From (Equation3(3)
(3) ) we obtain that
It is apparent that
. By further setting
we can choose
,
and observe that
.
Case II. ,
,
,
We have (see (Equation3(3)
(3) )):
It is immediate that
.
For we set
,
and we have
and
. Next, for
,
we take
and
with
,
.
Finally, for we set
If we choose
,
, then
,
.
Case III. ,
,
,
It follows from (Equation3(3)
(3) ) that
Let us denote
For 0<t<1 we set
,
and get that
,
. Next, if t = 1 we take
,
. Observe that
,
. Finally, when t = 0 we set
(4)
(4) with
,
. It follows that
and
.
Case IV . ,
,
By (Equation3(3)
(3) ) we have
These vectors are contained in
and
,
. It is now easy to compute the dimension of their linear span.
This finishes the proof.
Remark 2.3
Sometimes it it is more informative to understand the stratification into bundles of matrices, i.e. sets of matrices having similar properties. Again, this notion was introduced first by Arnold [Citation13, Section 30]. Given a parameter set Λ with smooth maps ,
, one considers a bundle of pairs of matrices under the action Ξ in (Equation2
(2)
(2) ), i.e. a union of orbits
. We set
(5)
(5) and observe that for any
we have
. In a similar manner as we computed the tangent space of an orbit, the tangent space of a bundle can be obtained. It follows that the generic
pairs of one arbitrary and one symmetric matrix (forming a bundle with maximal dimension 14) under the action (Equation2
(2)
(2) ) for n = 2 are:
Indeed, tangent spaces of these bundles are spanned by the tangent vectors in Case II and Case III of the proof of Lemma 2.2 (for the appropriate parameters).
Note that using the list of normal forms in dimension 2, recently a result on holomorphical flattenability of CR-nonminimal codimension 2 real analytic submanifold near a complex point in ,
, was obtained through the works of Huang and Yin [Citation26, Citation27], Fang and Huang [Citation28].
3. Change of the normal form under small perturbations
In this section we study how small deformations of a pair of one arbitrary and one symmetric matrix can change its orbit under the action (Equation2(2)
(2) ) for n = 2.
First recall that ,
are in the same orbit with respect to the action (Equation2
(2)
(2) ) if and only if there exist
,
such that
. By real scaling P we can assume that
, and after additional scaling P by
we eliminate the constant
. Thus the orbits of the action (Equation2
(2)
(2) ) are precisely the orbits of the action of
acting on
by:
(6)
(6) The projections are smooth actions as well:
(7)
(7)
(8)
(8)
Next, let
,
be in the same orbit under the action (Equation6
(6)
(6) ) (
,
for some
,
) and let
be a perturbation of
:
A suitable perturbation of
is in the orbit of an arbitrarily chosen perturbation of
. It is thus sufficient to consider perturbations of normal forms.
Observe further that an arbitrarily small perturbation of is contained in
if and only if
(and hence the whole orbit
) is contained in the closure of
. The same conclusion also holds for actions
,
.
For the sake of clarity the notion of a closure graph for an action has been introduced. Given an action Φ, the vertices in a closure graph for Φ are the orbits under Φ, and there is an edge (a path) from a vertex (an orbit) to a vertex (an orbit)
precisely when
lies in the closure of
. The path from
to
is denoted briefly by
. There are few evident properties of closure graphs:
For every vertex
, there exists
(a trivial path),
Paths
and
imply the path
(usually not drawn).
If there is no path from
to
(denoted by
), then for any vertex
it follows that either
or
(or both).
To simplify the notation , we usually write
, where
,
. In case
it is useful to know the distance of
from the orbit of V. We shall use the standard max norm
,
to measure the distance between two matrices. This norm is not submultiplicative, but
(see [Citation29, p. 342]).
Proceed with basic properties of closure graph for the actions (Equation6(6)
(6) ), (Equation7
(7)
(7) ), (Equation8
(8)
(8) ).
Lemma 3.1
Suppose
and
.
There exists a path
a path
) in the closure graph for the action (Equation7
(7)
(7) )
for the action (Equation8
(8)
(8) )) if and only if there exist sequences
a sequence
such that
(9)
(9)
The existence of a path
a path
implies the following:
If
or
then
or
. Apparently, if
or
then
or
.
.
If
then
. Trivially, if
and
then
.
There exists a path
in the closure graph for an action (Equation6
(6)
(6) ) precisely when there exist sequences
such that
(10)
(10) Moreover, if A and
and
are in the same orbit and sufficiently close to each other, then it may be assumed in (Equation10
(10)
(10) ) that
(
.
When
it follows that
and p = 0.
.
If
are such that
and
then
.
Proof.
By definition (
) if and only if
(
) for some
(
). It is equivalent to (Equation9
(9)
(9) ) (see (Equation7
(7)
(7) ), (Equation8
(8)
(8) )), so the first part of (1) is proved. Apparently,
is then equivalent to (Equation10
(10)
(10) ).
Since the orbit map of the action (the action
) is by Lemma 2.1 (2) of constant rank and hence locally a submersion (see e.g. [Citation25, Theorem II.7.1]), this action has the so-called local Lipschitz property, i.e. if A,
(B,
) are sufficiently close and
(
), then P can be chosen near to identity and c near 1. For any sufficiently small E (or F) such that
,
(
,
) are in the same orbit, then there exists some P close to the identity-matrix and c close to 1, so that
is equal to
(equal to
). As the inverse map
is continuous,
is close to identity-matrix, too. Hence
is in the orbit of
(or
), where
(
) is arbitrarily close to the zero-matrix. This concludes the proof of the first part of (2).
Next, applying the determinant to (Equation9(9)
(9) ) we get
(11)
(11) for some
,
(
). This implies (1) (a) (i).
A necessary condition for to be in the closure of
is that
and
are in the closures of
and
, respectively. Further, by multiplying the limits in (Equation11
(11)
(11) ) for
by
or
, and by comparing the absolute values of the expressions, we deduce (2) (a) (i).
It is well known that the distance from a nonsingular matrix X to the nearest singular matrix with respect to the norm is equal to
(see e.g. [Citation29, Problem 5.6.P47]). Thus (1) (b) follows. Next, applying the triangle inequality, estimating the absolute values of the entries of the matrices by the max norm of the matrices, and by slightly simplifying, we obtain for
:
(12)
(12) Let
, B,
, A be nonsingular matrices,
Using (Equation12
(12)
(12) ) for
, D = E and
, D = F with
, respectively, we get
(13)
(13)
(14)
(14)
To estimate the left-hand sides of the above inequalities from above by
it suffices to take
and
. By combining (Equation13
(13)
(13) ), (Equation14
(14)
(14) ) and applying the triangle inequality we then conclude
By (2) (a) (i) (already proved) we have
and this gives (2) (b).
It is left to show the orbit-dimension inequalities (1) (a) (ii) and (2) (a) (ii). Since orbits of Ψ, ,
can be seen as nonsingular algebraic subsets in Euclidean space (zero loci of polynomials), these facts can be deduced by using a few classical results in real (complex) algebraic geometry [Citation30, Propositions 2.8.13,2.8.14] (or [[Citation31, Propositions 21.4.3,21.4.5], [Citation32, Exercise 14.1.]]). Indeed, orbits
,
,
are contained in the closures (also with respect to a coarser Zariski topology) of orbits
,
,
, respectively. Hence algebraic dimensions of orbits mentioned first are strictly smaller than algebraic dimensions of the later orbits. Finally, orbits are locally regular submanifolds and their manifold dimensions agree with their algebraic dimensions.
Remark 3.2
Lemma 3.1 provides a quantitative information on the distance from an element to another orbit. We observe that it suffices to consider only normal forms. Given any the induced operator norms of maps
,
and
,
are bounded from above by
and
, respectively. If
,
are in the same orbit (i.e.
,
with
,
), then for any
,
we get:
When inspecting
where either A,
or B,
are in the same orbit and sufficiently close, it is by (2) enough to analyse perturbations of the matrix
(the matrix
). Unfortunately, we do not know how close the matrices should be since the constant rank theorem (even the quantitative version [Citation33, Theorem 2.9.4]) does not provide the size of the local charts which define the orbits.
By Autonne-Takagi factorization (see e.g. [Citation29, Corolarry 4.4.4]), any complex symmetric matrix is unitary T-congruent to a diagonal matrix with non-negative diagonal entries, hence T-congruent to a diagonal matrix with ones and zeros on the diagonal. Therefore symmetric matrices with respect to T-conjugacy consist of three orbits, each containing matrices of the same rank. Their closure graph is thus very simple. (For closure graphs of all
or
matrices see [Citation20].)
Lemma 3.3
The closure graph for the action (Equation8(8)
(8) )
-conjugacy on
is
where
. Moreover, if
B are vertices in the above graph, and such
with
for some
then
.
The (non)existence of most paths in the closure graph for the action in (Equation7
(7)
(7) ) follows immediately from the (non)existence of paths in the closure graph for
-conjugacy [Citation22, Theorem 2.2]. The remaining paths are treated by a slight adaptation of the
-conjugacy case. By a careful analysis we provide necessary (sufficient) conditions for the existing paths; see Lemma 3.4 (its proof is given in Section 4). These turn out to be essential in the proof of Theorem 3.6. Furthermore, if
we find a lower bound for the distance from
to
. Note that normal forms for
were first observed by Coffman [Citation34, Theorem 4.3], and by calculating their stabilizers eventually normal forms for the action (Equation6
(6)
(6) ) were obtained [Citation5, Subsection 2.4].
Lemma 3.4
The closure graph for the action (Equation7(7)
(7) ) is drawn in Figure . It contains an infinite set of vertices corresponding to the orbits with normal forms
indexed by the parameters θ, τ
respectively.
Figure 1. The closure graph for the action (Equation7(7)
(7) );
,
. (Orbits at the same horizontal level have the same dimension and these are indicated on the right.)
![Figure 1. The closure graph for the action (Equation7(7) Ψ1:(c,P),(A,B)↦cP∗AP,P∈GL2(C),c∈S1,(7) ); 0<θ<π, 0<τ<1. (Orbits at the same horizontal level have the same dimension and these are indicated on the right.)](/cms/asset/ba340015-6884-49bf-9761-7a6e611854a0/gcov_a_1722112_f0001_ob.jpg)
Furthermore, let A be normal forms in Figure , and let
for some
. Then one of the following statements holds:
If
then there exists a positive constant μ such that
.
If
then there is a positive constant ν such that the moduli of the expressions
depending on c,
listed in the fourth column
and in the line corresponding to
of the Table are bounded from above by
.
If
then also
is assumed.
Conversely, if
A correspond to any of the lines (C1), (C2), (C3), (C4) of the Table , then there exists a positive constant ρ such that: if the moduli of expressions listed in the fourth column of this line are bounded from above by
then
.
Table 2. Given ![](//:0)
, ![](//:0)
, ![](//:0)
, ![](//:0)
, the moduli of the expressions listed in the fourth column are bounded from above by ![](//:0)
. (The constant ![](//:0)
depends only on A, ![](//:0)
.)
Remark 3.5
Constants μ or ν in Lemma 3.4 are calculated for any given pair (see Lemma 3.1 and the proof of Lemma 3.4). The existence of the constant ρ (computable as well) in the converse in Lemma 3.4 (2) is showed only in those cases where it turns to be useful in the proof of Theorem 3.6, though it is expected to be proved (possibly by a slight modification) for most of the cases.
We are ready to state the main results of the paper. The following theorem describes the closure graph for the action (Equation6(6)
(6) ). Its proof is given in Section 5. It is expected that by adapting the proof a similar result should hold for the restriction of the action (Equation6
(6)
(6) ) with c = 1; in this case there are few more types of orbits.
Theorem 3.6
Orbits with normal forms from Lemma 2.2 are vertices in the closure graph for the action (Equation6(6)
(6) ). The graph has the following properties:
There is a path from
to any orbit. There exist paths from
to all orbits, except to
for
and to
.
There exist paths from
with
to all orbits, except to
for
for
for b>0 such that
and to
for
and such that
where M is the maximum of the function given with a constraint
(15)
(15)
All nontrivial paths
with nontrivial
for
not mentioned in (1), (2)) are noted in Figure . Orbits at the same horizontal level have equal dimension
indicated on the right
.
Figure 2. All nontrivial paths with nontrivial
for
in the closure graph for the action (Equation6
(6)
(6) ). The dimensions of orbits are indicated on the right.
![Figure 2. All nontrivial paths (A~,B~)→(A,B) with nontrivial (A~,B~)≠(1⊕0,a~⊕0) for a~≥0 in the closure graph for the action (Equation6(6) Ψ:(c,P),(A,B)↦(cP∗AP,PTBP),P∈GL2(C),c∈S1.(6) ). The dimensions of orbits are indicated on the right.](/cms/asset/820bddb2-5b91-4f86-88a8-46206fe856f6/gcov_a_1722112_f0002_ob.jpg)
Remark 3.7
If in the closure graph for the action (Equation6
(6)
(6) ), it is possible to give some lower bound for the distance from
to the orbit of
; this bound will be provided as part of the proof of Theorem 3.6 in Section 5. However, it makes the proof of the theorem much longer and more involved. One must work with inequalities instead of inspecting the convergence of sequences (see Lemma 3.1), hence many intrigueing and sometimes tedious estimates need to be done. Note also that the non-existence of certain paths in the closure graph (sometimes with a bound for the distances) follow already from Lemmas 3.3, 3.4 and 3.1 (a) (2) (i), (ii).
It would be interesting to have the closure graph for bundles of matrices with respect to the action (Equation6(6)
(6) ) (see (Equation5
(5)
(5) )) or its restriction. One would need to consider the same equations as in our case, but possibly with less constraints.
Let M be a compact codimension 2 submanifold in a complex manifold X. Since the complex dimension of the complex tangent spaces near a regular point of M is preserved under small perturbations, complex points of a small deformation of M can arise only near complex points of M. Recall that
(a normal form up to quadratic terms) can be associated to a complex point
, so that in a neighborhood of p the submanifold M is of the form (Equation1
(1)
(1) ) for
,
. If
is a
-small deformation of M, then it is seen near p as a graph:
where
are local coordinates with
,
,
small, and
,
close to
,
, respectively. Similarly as in the exposition in Section 1 a complex point on this graph is put into the standard position (Equation1
(1)
(1) ) for
,
. (Translate the complex point to
, use a complex-linear transformation close to identity to insure the tangent space at
to be
, and finally eliminate z-terms.) The next result is hence a direct consequence of Theorem 3.6.
Corollary 3.8
Let M be a compact real 4-manifold embedded -smoothly in a complex 3-manifold X and let
be its isolated complex points with the corresponding normal forms up to quadratic terms
. Assume further that
is a deformation of M obtained by a smooth isotopy of M, and let
be a complex point with the corresponding normal form up to quadratic terms
. If the isotopy is sufficiently
-small then p is arbitrarily close to some
and there is a path
in the closure graph for the action (Equation6
(6)
(6) ).
Remark 3.9
In the proof of Theorem 3.6 the lower estimates for the distances from normal forms to other orbits are provided, therefore it can be told how small the isotopy (of M) in the assumption of Corollary 3.8 needs to be.
4. Proof of Lemma 3.4
In this section we prove Lemma 3.4. We start with the following technical lemma related to actions (Equation7(7)
(7) ) and (Equation8
(8)
(8) ).
Lemma 4.1
Suppose
and such that
,
. Denote further
. It then follows that
(16)
(16)
(17)
(17)
If
and such that
then
(18)
(18)
Proof.
First, we observe the following simple fact. For :
(19)
(19) Indeed, we have
with
, hence
and
.
Next, the right-hand side of (Equation12(12)
(12) ) leads to
(20)
(20) By assuming
and applying (Equation19
(19)
(19) ) to (Equation20
(20)
(20) ) we obtain
(21)
(21) We apply
to
,
and after simplifying we get
(22)
(22) From (Equation21
(21)
(21) ) for
, D = E and (Equation22
(22)
(22) ) it follows that
,
,
with ψ as in (Equation21
(21)
(21) ) with
, D = E. Using well known facts
and
for
, we deduce (Equation16
(16)
(16) ). Furthermore, (Equation20
(20)
(20) ) for
, D = E and (Equation22
(22)
(22) ) for
, D = F give
(23)
(23) respectively. To conclude the proof we observe another simple fact. If
then
(24)
(24) To see this, we take
to be the square root of 1 + s (thus
) with
and
. It yields
. For
and
(
in (Equation23
(23)
(23) )), we apply (Equation24
(24)
(24) ) to (Equation23
(23)
(23) ) for s = p and s = q, respectively. It implies (Equation17
(17)
(17) ) and (2).
Proof
Proof of Lemma 3.4
For actions Ψ, (see (Equation6
(6)
(6) ) and (Equation7
(7)
(7) )), it follows that
if and only if
and
. Hence
, where dimensions of orbits of
are obtained from Lemma 2.2.
To prove it is sufficient to find
,
such that
(25)
(25) It is straightforward to see that
with
in (Equation25
(25)
(25) ) yields
, while to prove
,
, and
, we take
and
, respectively, and in both cases again with
. (Compositions of these paths represent paths as well.) It is then left to find necessary (sufficient) conditions for the existence of these paths, i.e. given A,
, E satisfying
(26)
(26) we must find out how c, P depend on E (how E depends on c, P).
On the other hand, if (Equation26(26)
(26) ) fails for every sufficiently small E, it gives
. To prove (1), upper estimates for
will be provided in such cases. This has already been done for
, A = 0 and
,
(see Lemma 3.1 (1) (i)).
Throughout the rest of the proof we denote
(27)
(27) and split our consideration of the remaining paths
into several cases.
Case I. It is straightforward to compute
Multiplying Equations (Equation26
(26)
(26) ) by
and then writing them componentwise yields
(28)
(28) The real and the imaginary parts of the first and the last equation of (Equation28
(28)
(28) ) give:
(29)
(29) while by adding (subtracting) the second and the complex-conjugated third equation of (Equation28
(28)
(28) ) for
we deduce
(30)
(30)
,
For
the second and the last equation of (Equation29
(29)
(29) ) give
and
(hence
). Further, the first equation of (Equation30
(30)
(30) ) for
,
yields
If
we get a contradiction (remember
).
,
The first and the last equation of (Equation28
(28)
(28) ) for
imply
respectively. Next, from (Equation30
(30)
(30) ) for
we obtain
(31)
(31)
Thus the first part of (2) for (C4) follows; the converse is immediate by (Equation28
(28)
(28) ).
,
,
By (Equation16
(16)
(16) ) in Lemma 4.1 we have
with
,
, provided that
. Using this and rearranging the terms in (Equation29
(29)
(29) ), (Equation30
(30)
(30) ) we deduce:
(32)
(32)
Observe that for
the first equation in (Equation32
(32)
(32) ) yields
(33)
(33) while for
the last equation of (Equation28
(28)
(28) ) implies that
,
.
,
After multiplying the third and the fifth equation of (Equation32
(32)
(32) ) for
,
,
, estimating the imaginary parts by its moduli, applying the triangle inequality and using
, we obtain
Combining it with (Equation31
(31)
(31) ) and
leads to a contradiction for
.
is either equal to
,
or
(
)
The statement (2) for (C6) follows immediately from (Equation32
(32)
(32) ), (Equation33
(33)
(33) ) for
and either
,
,
or
,
or
,
,
.
Case II. ,
We have
Thus (Equation26(26)
(26) ) multiplied by
and written componentwise (also rearranged) yields:
(34)
(34) Subtracting the second complex-conjugated equation (and multiplied by λ) from the third equation (and multiplied by
) for
further gives
(35)
(35)
,
By taking the imaginary and the real parts ob the first and the last equation of (Equation34
(34)
(34) ) for
we obtain
(36)
(36)
,
If
then (Equation36
(36)
(36) ) for
implies that
, which contradicts the second equation of (Equation34
(34)
(34) ) for
(
) with
. Next, let
(
). From (Equation35
(35)
(35) ) for
,
,
it then follows
, which fails if
,
. Further, when
we deduce from (Equation16
(16)
(16) ) (Lemma 4.1) that
,
, so the second equation of (Equation34
(34)
(34) ) for
,
yields
. By combining it with the first and the last equation of (Equation34
(34)
(34) ) for
,
we get (2) with (C10).
It is left to consider
. From (Equation36
(36)
(36) ) for
it follows that
(37)
(37)
Applying the triangle inequality to the second equation of (Equation34
(34)
(34) ), and using the estimates (Equation37
(37)
(37) ) leads to an inequality which fails for
:
By (Equation16
(16)
(16) ) in Lemma 4.1 we have
,
, provided that
. The third equation of (Equation36
(36)
(36) ) for
,
yields
, which fails for
. If
, then the second and the last equation of (Equation36
(36)
(36) ) for
,
imply
and
, respectively. From the second equation of (Equation34
(34)
(34) ) for
,
we then conclude
, so we have a contradiction for any
small enough.
Finally, for
we use (Equation36
(36)
(36) ) for
,
,
to get
,
(see (Equation37
(37)
(37) )) and
Applying these estimates to the second equation of (Equation34
(34)
(34) ) for
,
we get an inequality, which fails for every sufficiently small
:
,
If
(
) the Equations (Equation34
(34)
(34) ) for
,
give the first part of (the complete statement) (2) with (C1) (with (C8) for
,
). To see the converse for (C1), we fix s>0 and assume
and
. By observing the imaginary and the real part of
we deduce that
for
and
The second (third) equation of (Equation34
(34)
(34) ) for
(
),
then yields
, so (2) with (C1) is proved. The converse for (C8) is trivial.
,
.
By (Equation16
(16)
(16) ) (Lemma 4.1) we have
,
, assuming that
. Thus the first and the last equation of (Equation34
(34)
(34) ) for
,
are of the form:
(38)
(38)
We now take the imaginary parts of Equations (Equation38
(38)
(38) ), slightly rearrange the terms and use the triangle inequality:
(39)
(39) In particular we have
Multiplying these inequalities and using the triangle inequality we deduce that
(40)
(40) From (Equation35
(35)
(35) ) for
,
we get
. Combining this with (Equation40
(40)
(40) ) we obtain that
(41)
(41) If
then Equations (Equation38
(38)
(38) ) and the second equation of (Equation34
(34)
(34) ) for
already give us the statement (2) for (C8) in case
. (Note that if
, then k is even.) Further, when
the first equation of (Equation39
(39)
(39) ) fails for
.
Next, let
. For
we have
,
, hence it is easy to choose
so small that (Equation41
(41)
(41) ) fails. If
, then the first equation of (Equation39
(39)
(39) ) leads to
, and by comparing the real parts of the first equation of (Equation38
(38)
(38) ), slightly rearranging the terms, we further get:
The second equation of (Equation39
(39)
(39) ) also yields
, thus
implies that k is even. This concludes the proof of (2) about (C5).
(It suffices to consider the case when
.) When
,
the statement (2) with (C9) follows immediately from the first and the third equation of (Equation34
(34)
(34) ) for
. Applying (Equation19
(19)
(19) ) for
to the first equation of (Equation34
(34)
(34) ) for
,
(multiplied by c), yields
,
. Therefore
with
.
If
, the first and the last equation of (Equation34
(34)
(34) ) for
yield
, thus the third equation of (Equation34
(34)
(34) ) for
,
fails for
.
Case III. ,
We calculate
Thus (Equation26
(26)
(26) ) multiplied by
and rearranged is equivalent to
(42)
(42) Rearranging the terms of the first and the last equation immediately yields
(43)
(43) while multiplying the third (second) complex-conjugated equation with τ, subtracting it from the second (third) equation, and rearranging the terms, give
(44)
(44)
Since
is
-congruent to
, the existence of paths in this case was already analysed in Case II It is only left to check (2) with (C3). If either
or
, then by (Equation16
(16)
(16) ) we have
,
,
, provided that
. The second (third) equation of (Equation42
(42)
(42) ) and (Equation43
(43)
(43) ) for
then imply:
(45)
(45) The inequalities (Equation45
(45)
(45) ) are valid also if we consider (Equation42
(42)
(42) ) (and (Equation43
(43)
(43) )) for
,
(
). Note that for
the first equation of (Equation43
(43)
(43) ) for
, and multiplied by c, is of the form
. Therefore, by applying (Equation19
(19)
(19) ) for
we get that
,
,
,
. Moreover,
with
.
Conversely, we assume that the expressions (C3) for
,
are bounded from above by some s>0. Thus
in (Equation42
(42)
(42) ), (Equation43
(43)
(43) ) for
,
(and hence
) are bounded from above by s as well.
From (Equation43
(43)
(43) ) we obtain that
(46)
(46) By multiplying the left-hand and the right-hand sides of these inequalities we get
(47)
(47)
(48)
(48)
,
,
; and either
or
,
Equations (Equation44
(44)
(44) ) for
,
imply
By combining these inequalities and making some trivial estimates we obtain
Together with (Equation48
(48)
(48) ) for
and using
we get
which fails for
; remember
,
,
.
By (Equation16
(16)
(16) ) in Lemma 4.1 for
,
we have
,
,
, thus (Equation44
(44)
(44) ) for
,
yields
It further implies
Moreover, from (Equation44
(44)
(44) ) for
,
we deduce
,
, and (Equation46
(46)
(46) ) for
concludes the proof of (2) for (C7). (The converse is apparent.)
From (Equation44
(44)
(44) ) for
it follows
(49)
(49) Combining this with (Equation47
(47)
(47) ), rearranging the terms we get
(50)
(50) If
then by choosing
we contradict the above inequality. Furthermore, (Equation43
(43)
(43) ), (Equation46
(46)
(46) ), (Equation49
(49)
(49) ) give the first part of (2) for (C2). Conversely, assuming that the expressions of (C2) for
are bounded from above by s>0, then (Equation42
(42)
(42) ) and (Equation43
(43)
(43) ) imply that
.
This completes the proof of the lemma.
5. Proof of Theorem 3.6
Proof
Proof of Theorem 3.6
Recall that the existence of a path in the closure graph for the action (Equation6
(6)
(6) ), immediately implies (see Lemma 3.1):
(51)
(51) When any of the conditions (Equation51
(51)
(51) ) is not fulfilled, then
and we already have a lower estimate on the distance from
to the orbit of
(see Lemmas 3.1, 3.3, 3.4). Further,
if and only if
, and trivially
for any A, B.
From now on we suppose ,
, and such that (Equation51
(51)
(51) ) is valid. Let
(52)
(52) Due to Lemmas 3.4, 4.1 the first equation of (Equation52
(52)
(52) ) yields the restrictions on P, c imposed by
. Using these we then analyse the second equation of (Equation52
(52)
(52) ). When it implies an inequality that fails for any sufficiently small E, F, it proves
. The inequality just mentioned also provides the estimates how small E, F should be; this calculation is very straightforward but is often omitted.
On the other hand, if given matrices A, B, ,
we can choose E and F in (Equation52
(52)
(52) ) to be arbitrarily small, this will yield
. In most cases we find
,
such that
(53)
(53) However, to confirm the existence of a path we can also prove the existence of suitable solutions of (Equation52
(52)
(52) ) by using the last part of Lemma 3.4 (2).
Throughout the rest of the proof we denote (the constant
is provided by Lemma 3.4),
,
where sometimes polar coordinates for x, y, u, v in P might be preferred:
(54)
(54) The second matrix equation of (Equation52
(52)
(52) ) can thus be written componentwise as:
(55)
(55) For the sake of simplicity some estimates in the proof are crude, and it is always assumed
. When applying Lemma 4.1 with
or
nonsingular we in addition take
or
, respectively. Furthermore, we use the notation
when the existence of a path is yet to be considered.
We split our analysis into several cases. (For normal forms recall Lemma 2.2.)
Case I. ,
,
Denoting ,
and slightly rearranging the terms in (Equation55
(55)
(55) ) yields
(56)
(56) From Lemma 3.4 (2) for (C5) we get
and
(therefore
,
). By applying the triangle inequality we conclude from the first equation of (Equation56
(56)
(56) ) that
and similarly the last two equations of (Equation56
(56)
(56) ) yield
Since
, a comparison of the left-hand and the right-hand sides of the above inequalities implies that at least one of them fails for
such that
Case II. ,
From Lemma 3.4 (2) for (C8) for ,
we have
(57)
(57)
,
,
,
,
(see (Equation51
(51)
(51) ))
From (Equation55
(55)
(55) ) applied for
we get:
(58)
(58) From the second equation of (Equation58
(58)
(58) ) and the second inequality (Equation57
(57)
(57) ), it follows that
and
, respectively, and thus
(59)
(59)
,
, d>0
Applying the triangle inequality to (Equation58
(58)
(58) ) for
yields
(60)
(60) respectively. Using (Equation57
(57)
(57) ) and (Equation59
(59)
(59) ) for a = 0 we further obtain
and
These inequalities and the last inequality in (Equation60
(60)
(60) ) eventually lead to
which fails if
are such that
is so small that
.
,
,
,
(remember
,
)
Using the notation (Equation54
(54)
(54) ) the following calculation is validated trivially:
(61)
(61) Furthermore, one easily computes:
(62)
(62) Using the second equation of (Equation58
(58)
(58) ) and the second inequality of (Equation57
(57)
(57) ) we conclude
The above implies that at least one of the moduli of the second terms on the right-hand sides of Equations (Equation61
(61)
(61) ) is bounded from above by
, while from the first and the last inequality in (Equation57
(57)
(57) ) it follows that the moduli of the first terms on the right-hand sides of (Equation61
(61)
(61) ) are bounded from above by
and from below by
. For
thus the first or the last equation of (Equation58
(58)
(58) ) fails (
).
, b>0,
,
,
(see Lemma 2.2)
From (Equation55
(55)
(55) ) for a = d = 0 we obtain that
(63)
(63) By using Lemma 4.1 (2) and
(see (Equation51
(51)
(51) )) we deduce that
with
,
. Combining it further with the second equation of (Equation63
(63)
(63) ) we get
with
. By taking
we guarantie
, hence by applying (Equation19
(19)
(19) ) to the second equation of (Equation63
(63)
(63) ) we conclude (see (Equation54
(54)
(54) )):
(64)
(64) Multiplying the first and the last equation of (Equation63
(63)
(63) ) and using the triangle inequality gives
, so
or
(or both) is at least equal to
. Using (Equation19
(19)
(19) ) the second inequality of (Equation57
(57)
(57) ) for
implies
Adding it to (Equation64
(64)
(64) ) yields
. Applying sin finally gives
It is now easy to see that for any appropriately small ε and δ we get a contradiction.
,
,
,
,
(see Lemma 2.2)
From (Equation55
(55)
(55) ) for b = 0,
we obtain that
(65)
(65) The first and the last equation imply
(66)
(66) and by adding them to the first and the last equation of (Equation57
(57)
(57) ) for
multiplied with d and then using the triangle inequality, we get (
):
One of the left-hand sides is at least d, so for
that inequality fails.
Case III. ,
,
It is easy to check that and
with
in (Equation53
(53)
(53) ) prove
and
, respectively.
By Lemma 3.4 (2) for (C7) we have
(67)
(67) Set
,
,
and after rearranging the terms we write (Equation55
(55)
(55) ) as
(68)
(68)
. Applying the triangle inequality to the second equation gives
(69)
(69) Next, multiplying
and
with
(see (Equation67
(67)
(67) )) gives
and
, respectively (recall
). Thus either
or
or
,
(or more of them) are bounded by
.
From (Equation67
(67)
(67) ) we get
,
and it further yields
. Applying the triangle inequality to the last equation of (Equation68
(68)
(68) ) multiplied by
we obtain an inequality that fails for
and any sufficiently small
:
Further, if d = 0 the last and the first equality of (Equation68
(68)
(68) ) yield
respectively. For
(if
) the second (the first) inequality fails for
(for
). Since
then (Equation69
(69)
(69) ) for d = 0 gives
. When
it is not too difficult to choose
such that the above inequality fails. Remember that the case
,
has already been considered.
We deal with this case in the same manner as in Case III (a), we only replace
by
, respectively; we get similar estimates for
.
Here the inequality (Equation69
(69)
(69) ) fails for
,
. Moreover, if
:
(70)
(70) Next, using (Equation67
(67)
(67) ) we obtain
and
. Hence
(recall
), so the first and the last equation of (Equation68
(68)
(68) ) give
(71)
(71) We set x, y, u, v as in (Equation54
(54)
(54) ) and let
,
,
,
. Applying (Equation19
(19)
(19) ) to the inequality (Equation70
(70)
(70) ), to the estimates (Equation71
(71)
(71) ) and to
,
(see Lemma 3.4 (2) for (C7) with
), then leads to:
(72)
(72) respectively. Subtracting the first and subtracting (adding) the last equation from the second-one (the third-one), rearranging the terms, and applying sin, gives for
:
(73)
(73)
First, let
(or
). Since
,
we have
(or
). The case
(or
) has allready been considered, thus it is left to check the case
with
,
,
,
(and
,
,
,
); see Lemma 2.2. By (Equation73
(73)
(73) ), (Equation72
(72)
(72) ) it is easy to choose suitable
to get a contradiction.
For
, a = 0 (for
, d = 0) the first (the second) inequality of (Equation71
(71)
(71) ) fails for
(for
).
Next, let
. Multiplying the estimates for
,
given by (Equation71
(71)
(71) ) yields
From (Equation70
(70)
(70) ) we further deduce
, so by combining it with the above inequality we obtain an inequality that fails to hold, provided that at least one of
vanishes and
are small enough.
(see (Equation51
(51)
(51) ))
From (Equation71
(71)
(71) ) it follows that
Using (Equation24
(24)
(24) ) we get
By choosing
such that
we assure that
and so
. Further, using (Equation70
(70)
(70) ) and
yields:
If
, then
,
(see by Lemma 2.2 for
), so we easily find
to contradict this inequality. Similarly we treat the cases
with
,
,
or
,
, where either
or
,
. Finally, let
,
,
,
,
, and let
(so
) precisely when
. From (Equation73
(73)
(73) ), (Equation72
(72)
(72) ) we get a contradiction for any small
.
Case IV .
Lemma 3.4 (2) with (C6) for ,
,
, k = 0 (since
) gives
(74)
(74)
,
,
, a>0,
From (Equation55
(55)
(55) ) we obtain the same equations as in (Equation65
(65)
(65) ) and the inequality (Equation66
(66)
(66) ) but with
. Applying the triangle inequality to these (in)equalities, and using (Equation74
(74)
(74) ) gives
,
and finally
It is straightforward to find
such that that the last inequality fails.
,
,
,
, b>0
We have the same equations as in (Equation63
(63)
(63) ), but with
. From the first and the last of these equations we obtain the estimates
and
(
by (Equation74
(74)
(74) )), respectively. Combining them and
,
with the second equation of (Equation63
(63)
(63) ) multiplied by u, yields
Clearly, for any small enough
we get a contradiction.
,
,
,
,
(see (Equation51
(51)
(51) ))
By slightly rearranging the terms in (Equation55
(55)
(55) ) for
,
(see also (Equation58
(58)
(58) )), using the last two estimates in (Equation74
(74)
(74) ) and applying the triangle inequality, we get
(75)
(75) On the other hand the third equation of (Equation58
(58)
(58) ) gives
. Using this and the first two estimates of (Equation74
(74)
(74) ) we conclude that
(76)
(76) Note that according to the list in Lemma 2.2, a = 0 (
) implies
(
).
a = 0 or
If a = 0,
the first inequality of (Equation75
(75)
(75) ) fails for
, while for
(hence
,
) with
the third inequality of (Equation75
(75)
(75) ) fails. If
,
, then the first inequality of (Equation75
(75)
(75) ) yields
. Since
, it is now not to difficult to contradict (Equation76
(76)
(76) ) for any sufficiently small
.
Inequalities (Equation75
(75)
(75) ) yield
,
and
If
it is straightforward to obtain a contradiction for any
small enough.
If
, then
yields
,
,
with
,
. The right-hand (left-hand) side of the first (third) inequality of (Equation75
(75)
(75) ) thus gives
If we choose
such that
, then using (Equation24
(24)
(24) ) it follows that
where
. Hence
and further
Since
,
, then combining the above inequality with the left-hand side of (Equation76
(76)
(76) ) and using the triangle inequality yields a contradiction for every small
.
,
,
(since
)
The first equation of (Equation58
(58)
(58) ) and the last inequality of (Equation74
(74)
(74) ) give
,
and
,
, respectively. Further, (Equation24
(24)
(24) ) leads to
,
and
,
. Therefore we obtain
. From (Equation76
(76)
(76) ) for
and applying the triangle inequality we deduce
Case V .
From Lemma 3.4 (2) with (C6) for ,
we obtain
(77)
(77)
,
,
For
,
in (Equation53
(53)
(53) ) we obtain
,
.
We have the same equations as in (Equation58
(58)
(58) ). Since
(see (Equation77
(77)
(77) )) we deduce that the first (third) of these equation fails for a = 0,
,
(a = 0,
,
). Next, d = 0,
yields
, hence
, which fails for any
chosen sufficiently small. Finally, for
(hence
) the first and the last equation of (Equation58
(58)
(58) ) (with
) give
,
, respectively. Provided that
we multiply these inequalities and a comparison to the second equation of (Equation58
(58)
(58) ) implies:
which fails to hold for
.
,
We have Equations (Equation65
(65)
(65) ). Its first and its last equation yield
, what further with the second equation and
(see (Equation77
(77)
(77) )) gives
Since
this inequality fails for
.
, b>0
,
The first equation of (Equation55
(55)
(55) ) for
is
, which implies
. For
the first inequality of (Equation77
(77)
(77) ) then fails to hold.
,
,
(see (Equation51
(51)
(51) ))
The first and the last equation of (Equation63
(63)
(63) ) give
,
. Combined with the first two estimates in (Equation77
(77)
(77) ), it leads to
Since
then for
we either have
or
. In both cases one of the above inequalities fails for
. Moreover, when
, then
,
in (Equation53
(53)
(53) ) proves
.
Case VI.
Lemma 3.4 (2) with (C6) for ,
yields
(78)
(78)
,
Setting
,
(with
), and rearranging the terms in the first and the last equation of (Equation55
(55)
(55) ) for b = 0, gives
Since
constants
do not both vanish (see Lemma 2.2). For a = 0 at least one of the above equations fails, provided that
. Further, if a>0 we obtain
and
, and using (Equation78
(78)
(78) ) we get
It is not difficult to contradict this inequality for any sufficiently small
.
, b>0
,
Since
(see (Equation51
(51)
(51) )), we have (Equation55
(55)
(55) ) for
,
,
:
(79)
(79) Furthermore, Lemma 4.1 (2) gives
,
, with
. By combining it with the second equation of (Equation79
(79)
(79) ) we obtain:
(80)
(80) If
are small, then for l even (odd), uy is close to 0 (close to 1) and vx is close to 1 (close to 0), and hence
(or
) is close to
,
by (Equation78
(78)
(78) ). Using the notation (Equation54
(54)
(54) ) for x, y, u, v we apply (Equation19
(19)
(19) ) to the third equation of (Equation79
(79)
(79) ), to (Equation80
(80)
(80) ) and to the last estimate of (Equation78
(78)
(78) ), provided that
. We deduce that
(so
), where
,
,
,
. Therefore using a trivial estimate
together with the squared second estimate of (Equation78
(78)
(78) ) and the third equation of (Equation79
(79)
(79) ) we get
It is straightforward to choose
small enough so that this inequality fails.
,
(
,
)
From (Equation55
(55)
(55) ) for a = d = 0 and
,
we get
(81)
(81) As
, Lemma 4.1 gives
,
,
. Adding (subtracting) it from second equation of (Equation81
(81)
(81) ) yields
We combine this with the last estimate in (Equation78
(78)
(78) ) and write it in the notation (Equation54
(54)
(54) ):
where
. Using (Equation19
(19)
(19) ) we deduce
,
,
, while the first equation of (Equation81
(81)
(81) ) gives
,
. Thus
,
and by applying sin we conclude
which fails for
(remember
).
Case VII.
Lemma 3.4 (2) with (C3) for ,
gives
(82)
(82) with
.
First, consider
,
. By applying (Equation24
(24)
(24) ) to the first and the last equation of (Equation55
(55)
(55) ) for a = 1,
we get
(83)
(83) respectively. Next, by manipulation of the third expression of (Equation82
(82)
(82) ) we deduce
By multiply it with x, rearranging the terms and slightly simplify leads to
To conclude, Lemma 4.1 (1) gives
,
with
, and combining it with the first equation of (Equation82
(82)
(82) ) and (Equation83
(83)
(83) ) eventually contradicts the above equation for any sufficiently small
.
For
,
in (Equation53
(53)
(53) ) we get
.
, b>0
From (Equation55
(55)
(55) ) for a = 0, d = 1 we obtain
(84)
(84) Multiplying
with b and then adding and subtracting it from the second equation of (Equation84
(84)
(84) ) yields
respectively. Multiplying the first (the second) equation by u (by v) and comparing it with the first (the last) equation of (Equation84
(84)
(84) ), multiplied by v (u), gives
For
it follows that
(85)
(85)
,
The first and the last equation of (Equation84
(84)
(84) ) for
immediately imply that
and
. Further, (Equation82
(82)
(82) ) gives that
and hence
. For
we have
(since
), so the first and the last equation of (Equation84
(84)
(84) ) yield
and
. Therefore
Adding the real parts of these equalities, applying the triangle inequality and using the first two equations of (Equation82
(82)
(82) ) with the lower estimates on
,
gives
which fails for
.
,
If uv = 0, then (Equation84
(84)
(84) ) fails for
. Next, for
we easily validate the following calculation
(86)
(86) Combining this with the second and the third equation of (Equation82
(82)
(82) ), and comparing it with (Equation85
(85)
(85) ) for
, leads to
Since
(see (Equation51
(51)
(51) )), then
and Lemma 4.1 (2) yields
,
,
. Thus either
or we obtain a contradiction for any suitably small
.
For
,
in (Equation53
(53)
(53) ) it follows that
.
,
From (Equation55
(55)
(55) ) for b = 0, a = 1 we obtain
(87)
(87)
,
The first (the second) equation of (Equation82
(82)
(82) ) yields that at least one of
(and
) is greater or equal to
(remember
). Since equations (Equation87
(87)
(87) ) for
are the same as in (Equation65
(65)
(65) ) for a = 1,
, also inequalities (Equation66
(66)
(66) ) for a = 1 are valid; if
, then
(if
we have
). Similarly holds for y, v as well, so:
(88)
(88) Applying (Equation19
(19)
(19) ) with
to the first and to the last equation of (Equation87
(87)
(87) ) for
,
and x, y, u, v as in (Equation54
(54)
(54) ), leads to
The last equation of (Equation82
(82)
(82) ) (using (Equation19
(19)
(19) )) similarly gives
Collecting everything together yields
and
Since
we can easily choose ε, δ to contradict this inequality.
,
The first two equations of (Equation82
(82)
(82) ) imply
. Hence
, so the second equation of (Equation87
(87)
(87) ) for
(the last equation of (Equation82
(82)
(82) )) yields that either
or
(either
or
) or both are at least
(at least
). By setting x, y, u, v as in (Equation54
(54)
(54) ),
and using (Equation19
(19)
(19) ) we also deduce:
(89)
(89) with
,
,
. Hence
,
(90)
(90) which fails for
(remember
).
Case VIII.
Lemma 3.4 (2) for (C10) gives
(91)
(91)
,
,
We have Equation (Equation58
(58)
(58) ) for
,
. By combining calculations (Equation61
(61)
(61) ), (Equation62
(62)
(62) ) for
with the first two equations of (Equation58
(58)
(58) ) for
and the first two inequalities of (Equation91
(91)
(91) ) we deduce
By rearranging the terms and applying the triangle inequality we further get
It is immediate that
. Moreover, for
:
It follows (see also (Equation91
(91)
(91) )) that for sufficiently small
we have
(
) arbitrarily close and bounded away from 0, so it is straightforward to get a contradiction with the second equation of (Equation58
(58)
(58) ) for
.
Next, let a = d. By combining (Equation61
(61)
(61) ), (Equation62
(62)
(62) ) for
, a = d with Equations (Equation91
(91)
(91) ), (Equation58
(58)
(58) ) for
, and slightly simplifying, we obtain
By applying (Equation19
(19)
(19) ) to these equations with
we then deduce
where
. It implies further that
, which yields an inequality that fails for
(recall
):
,
,
(see (Equation51
(51)
(51) ))
Combining the first and the last equality of (Equation91
(91)
(91) ) with the first and the last equation of (Equation55
(55)
(55) ) for
,
, and applying the triangle inequality, we deduce
These inequalities and (Equation91
(91)
(91) ) imply the upper estimates for
in case
, which further gives an inequality that fails for any
sufficiently small:
Next, when a = d (hence
) it is convenient to conjugate the first pair of matrices with
:
Using (Equation57
(57)
(57) ) for
and (Equation55
(55)
(55) ) for
,
,
, a = d, b = 0, we can write the identities (Equation61
(61)
(61) ), (Equation62
(62)
(62) ) for a = d,
in the form
(92)
(92) where
,
. By combining the first two and the last two equations (rearranging the terms and then multiplying the equations) we obtain
respectively. By comparing the right-hand sides of the equations and rearranging the terms we eventually conclude
where
. Thus
and either
or
(or both). Observe also that if one of the expressions
or
is bounded by
, then by using the angle diffence formula for sine and applying the triangular inequality we deduce that the other expression is bounded by
. In the same manner, but with
replaced by
,
, respectively, in (Equation62
(62)
(62) ), (Equation61
(61)
(61) ) for
,
and (Equation92
(92)
(92) ), we conclude that
. It follows that
. On the other hand, the third equation of (Equation92
(92)
(92) ) with its terms rearranged and simplified can be written as
Provided that
, then applying (Equation19
(19)
(19) ) yields
. We have a contradiction for any small enough
.
, b>0
,
The first equation of (Equation79
(79)
(79) ) and (Equation91
(91)
(91) ) yield that at least one of
or
is not larger that
and the other is not larger than
. Similarly, the last equation of (Equation79
(79)
(79) ) and the last equation of (Equation91
(91)
(91) ) give
. The second estimate of (Equation91
(91)
(91) ) finally implies a contradiction for any sufficiently small
:
,
The same proof as in Case VI (b) (ii) works here, too.
, d>0,
We consider
, d>0. The first and the last equation of (Equation55
(55)
(55) ) for a = b = 0,
yield that
and
. Hence the first and the last estimate of (Equation57
(57)
(57) ) for
give
respectively. For
at least one of these inequalities fails (provided that
), while for d<1 by combining the inequalities with
(see the second estimate of (Equation57
(57)
(57) ) for
) and simplifying, we get (provided that
):
It is not difficult to choose
small enough to contradict this inequality.
Case IX. ,
(see Lemma 2.2 and (Equation51
(51)
(51) ))
Lemma 3.4 (2) with (C3) for ,
and with some
gives
(93)
(93)
,
,
,
,
,
,
Due to the second equation of (Equation87
(87)
(87) ) for
it follows that given a positive constants
and
(to be choosen) it suffices to consider the following two cases:
It is clear that either
or
. We only consider
(the case
is treated similarly, we just replace
with
). The first equation of (Equation87
(87)
(87) ) yields
and (Equation19
(19)
(19) ) gives further
with
, provided that
. Since
we also get
. Applying (Equation19
(19)
(19) ) to the third equation of (Equation87
(87)
(87) ) and to the second equation of (Equation93
(93)
(93) ) implies
By choosing
then for any sufficiently small
we provide
(
). Thus
(recall
,
,
) and if in addition
the next inequality fails for any small
:
We write the first and the last equality of (Equation93
(93)
(93) ) in the form:
hence either
or
or
or
or
(or more at the same time).
First, let
. Applying (Equation19
(19)
(19) ) to the second equation of (Equation87
(87)
(87) ) for
yields
Using the angle sum formula for sine and the triangle inequality we obtain an inequlity that fails for any small
:
Next, suppose
. The first and the third equation of (Equation87
(87)
(87) ) then lead to
and
. Combining these facts with the second equation of (Equation87
(87)
(87) ) for
gives
For
(hence
) we get a contradiction for any small
.
If v = 0, then (Equation87
(87)
(87) ) for
,
yields
,
(hence
),
. Combining this with the squared second equation of (Equation93
(93)
(93) ) gives the equality which fails to hold for any
sufficiently small (
,
):
The case
is due to a symmetry treated similarly, with
replaced by
; the cases when
or
are dealt likewise.
,
,
,
In this case it is convenient to conjugate
with
and consider
By setting y, v as in (Equation54
(54)
(54) ) we conclude from the first equation of (Equation55
(55)
(55) ) that
(94)
(94) Observe that the first summand on the right-hand side is smaller than δ (as in Case VIII we have (Equation91
(91)
(91) )), thus we get the estimate
. Combining it with the first equality of (Equation91
(91)
(91) ) we deduce that
.
Similarly as in (Equation94
(94)
(94) ) we write the third equation of (Equation55
(55)
(55) ) in the form
and using the first and the last equality of (Equation91
(91)
(91) ) we deduce
,
. Applying the triangle inequality to the squared second equality of (Equation91
(91)
(91) ) now leads to an inequality that fails for any small
:
, b>0,
,
,
,
(see (Equation51
(51)
(51) ))
We have Equation (Equation84
(84)
(84) ) for
,
and (Equation85
(85)
(85) ) is valid for
,
,
, thus
. (If u = 0 (v = 0) the first (the last) of Equation (Equation84
(84)
(84) ) fails for
(
).) Further, from (Equation86
(86)
(86) ), (Equation93
(93)
(93) ) we obtain
. Similarly, with
replaced by
in (Equation86
(86)
(86) ) we get
. Since
, then Lemma 4.1 (2) yields
,
,
. We now collect everything together to deduce:
, where a constant K>0 can be obtained by a straightforward computation. If
are small enough it contradicts
.
Case X.
,
For
we have
(Lemma 3.4 (2) for (C1) with
), hence
fails for
. If
then
,
in (Equation53
(53)
(53) ) proves
for
, b>0 and
.
From Lemma 3.4 (2) with (C4) for
we get
. Further, the first equation of (Equation55
(55)
(55) ) for a = b = 0,
is
and fails for
. Taking
and
with
in (Equation53
(53)
(53) ), we prove
for a = d = 0, b>0 and a>0, b = 0,
, respectively.
,
When
and
we can take
and
with
in (Equation53
(53)
(53) ), respectively, to prove
. Next, let a = d = 0 (hence
by Lemma 2.2). From Lemma 3.4 (2) for (C2) with
we get
, so the first equation of (Equation55
(55)
(55) ) for a = d = 0,
fails for
.
To prove
,
, and
we can take
and
, both with
in (Equation53
(53)
(53) ), respectively. From Lemma 3.4 (2) with (C9) for
we have
. When
,
the first equation of (Equation55
(55)
(55) ) for a = b = d = 0 (i.e.
) fails for
.
We prove
by taking
with
in (Equation53
(53)
(53) ). For
,
we have
(Lemma 3.4 (2) with (C9) for
). Combining it with (Equation58
(58)
(58) ) for
yields
and
. Thus we obtain a contradiction for
.
By Lemma 3.4 (2) for (C2) with
we have
. It implies that either
or
(or both). If
then the first and the last equation of (Equation55
(55)
(55) ) for
,
give
, and the application of the triangle inequality to second equation further gives
which fails for
. The case
is for the sake of symmetry treated in a similar fashion, with u, v, x, y, a, d replaced by x, y, u, v, d, a, respectively.
Case XI.
From Lemma 3.4 (2) with (C9) for we get that
(95)
(95)
(hence
,
,
by Lemma 2.2)
The first equation of (Equation63
(63)
(63) ) for b = 1 and
(see (Equation95
(95)
(95) )) yield
, while the second equation (multiplied with y) and the third equation give
. Using the upper (the lower) estimates on
,
(on
) we get an inequality that fails for
and small enough
:
Taking
,
in (Equation53
(53)
(53) ) proves
.
,
,
,
(since
)
From (Equation55
(55)
(55) ) for b = 0 and by slightly rearranging the terms we obtain
(96)
(96) Thus using (Equation95
(95)
(95) ) and applying the triangle inequality to (Equation96
(96)
(96) ) we deduce
(97)
(97)
,
,
When
,
,
, the first inequality of (Equation97
(97)
(97) ) for d = 0 fails for
. Next, combining all the estimates in (Equation97
(97)
(97) ) for
,
, and provided that
,
, yields
which fails for
and appropriately small
. (Note that
implies
for
(see (Equation51
(51)
(51) ), Lemma 2.2).)
Finally,
,
in (Equation53
(53)
(53) ) proves
.
We have
, a>0. The inequalities in (Equation97
(97)
(97) ) for
,
then give
which fails for
small enough.
Case XII.
,
,
,
,
(see (Equation51
(51)
(51) ))
By Lemma 3.4 (2) for (C1) we have
. If
, then the third equation of (Equation55
(55)
(55) ) fails for
.
Next, let
. To prove (disprove) the existence of a path we need to solve (to see that there are no solutions) the Equations (Equation52
(52)
(52) ) for arbitrarily small E, F. Given any small s>0 we must (not) find x, y, u, v, c and
with
satisfying (Equation55
(55)
(55) ) and such that the expressions in Lemma 3.4 for (C1) are bounded from above by s. Observe that by choosing v, y sufficiently small we achieve that the last two equations in (Equation55
(55)
(55) ) for
are fulfilled trivially for some small
, and the first two expressions in Lemma 3.4 (C1) are arbitrarily small. It is thus left to consider the remaining first equation of (Equation55
(55)
(55) ) and the third expression of Lemma 3.4 (C1); note that they do not depend on y, v:
(98)
(98) The second equation can be rewritten as
and it is clearly equivalent to compare only the (squared) moduli of both sides
For
it further implies
for some
,
. By writting x, u in view of (Equation54
(54)
(54) ) we can see (Equation98
(98)
(98) ) as
(99)
(99) Clearly, (Equation99
(99)
(99) ) for
is equivalent to (Equation98
(98)
(98) ) for
.
Next, we observe the range of the function
given with a constraint
(see (Equation15
(15)
(15) )). Provided that
,
lies on on an ellipse
, we can further assume that either
or
is any real nonnegative number. With a suitable choice of β we achieve finally that the following expression (and hence f) vanishes:
If the maximum of f given with a constraint is M, its range is thus
.
Provided that
,
,
(corresponding to β, r, t in (Equation15
(15)
(15) )) are chosen appropriately, the modulus of the left-hand side of the first equation in (Equation99
(99)
(99) ) (hence
) can be any number from the interval
and the second equation of (Equation99
(99)
(99) ) for
(thus
) is valid, simultaneously. By a suitable choice of
(see (Equation99
(99)
(99) )) we arrange
and so
for
is proved. In particular, for a = b = 0 we get
, for d = b = 0 we obtain
, and for a = d = 0 we have
. Moreover, if
,
, d>0 we get M = d, and to prove the existence of a path we take
for
and
for
, both with
in (Equation53
(53)
(53) ).
Furthermore
Applying (Equation24
(24)
(24) ) to
and its root yields
,
. For
,
,
,
with
(note that
), we then deduce
Since M is the maximum of f with respect to a constraint (Equation15
(15)
(15) ), it follows that the maximum of f on a compact domain given by
is at most
. Assuming that the second equation of (Equation99
(99)
(99) ) is valid, the modulus of the left-hand side of the first equation of (Equation99
(99)
(99) ) is then at most
; if
, this equation fails for
.
,
,
(see Lemma 2.2, (Equation51
(51)
(51) );
)
From Lemma 3.4 (2) for (C8) for
,
,
we get
(100)
(100) As in Case II (a) we obtain
(see (Equation59
(59)
(59) )). Further, from the first equation of (Equation58
(58)
(58) ) for
we get
, and by combining it with the first estimate of (Equation100
(100)
(100) ) we deduce
. Moreover,
When
we have
(see the last estimate in (Equation100
(100)
(100) )), and if further
the third equation of (Equation58
(58)
(58) ) gives a contradiction for any
small enough. Next, for a = d and
(hence
) the first equation of (Equation58
(58)
(58) ) and the first estimate in (Equation100
(100)
(100) ) yield
which fails for
. The existence of a path for
follows from (Equation53
(53)
(53) ) for
, b>0
We take
,
, y = v = s,
to satisfy (Equation53
(53)
(53) ).
Case XIII.
,
,
(see Lemma 2.2 and (Equation51
(51)
(51) ))
Lemma 3.4 (2) for (C3) for
,
yields
(101)
(101)
,
(
,
)
From the first estimate in (Equation101
(101)
(101) ) and the first equation of (Equation87
(87)
(87) ) for
we deduce that
(see Case VII (c) (i) (Equation88
(88)
(88) ) for the same conclusion). The last equation of (Equation87
(87)
(87) ) for
further yields that either
or
. By combining these facts we get that either
or
is at least
. Similarly, either
or
is greater or equal to
. As in Case VII (c) (ii) we obtain precisely (Equation89
(89)
(89) ), (Equation90
(90)
(90) ), but now with estimates
which give a contradiction for any suitably small
as well.
To prove the existence of a path for any
, then given an arbitrary s>0 it is sufficient to solve the system of equations
and
, where
. Indeed, provided that y, v are chosen small enough, the last two equations in (Equation87
(87)
(87) ) for
are satisfied for some
, and the absolute values of expressions in Lemma 3.4 (C3) for k = 0 are bounded by s (it implies
for some constant
independent of s; see also (Equation52
(52)
(52) )).
In view of the notation (Equation54
(54)
(54) ) with
,
we obtain
(102)
(102) where
. We now observe the ranges of the following functions:
(103)
(103) Since
as
and
as
,
or
, d = 0, the range of g (and hence f with a constraint) is
. Thus the modulus of the left-hand side of the first equation in (Equation102
(102)
(102) ) can be any number from the interval
and the second equation in (Equation102
(102)
(102) ) is valid at the same time, provided that
,
,
(corresponding to
in (Equation103
(103)
(103) )) are chosen appropriately. Finally, a suitable choice of
guarantees that the left-hand side of (Equation102
(102)
(102) ) is real and positive. Thus (Equation102
(102)
(102) ) is solvable for any
(and any d,
).
, b>0
Let x, u be as in (Equation54
(54)
(54) ). Since
(see (Equation101
(101)
(101) )), then assuming
and applying (Equation19
(19)
(19) ) to the first equation of (Equation84
(84)
(84) ) for
yields
(104)
(104) We multiply the first equation of (Equation84
(84)
(84) ) for
with
to get
. Together with the last estimate in (Equation101
(101)
(101) ) and providing
we obtain:
(105)
(105) Further, we have
Combining it with the second equation of (Equation84
(84)
(84) ) for
, the last equation of (Equation101
(101)
(101) ) and the estimates (Equation105
(105)
(105) ) gives
After simplifying and using (Equation104
(104)
(104) ) we get
Multiplying the third equation of (Equation84
(84)
(84) ) for
by
, and rearranging the terms gives
. Combining this with (Equation105
(105)
(105) ) and with the upper estimate on
finally yields an inequality that fails for any
small enough.
,
To prove the existence of a path we use the same argument as in Case XIII (a) (ii). For a given s>0 it suffices to solve the equations
,
(see (Equation84
(84)
(84) )) and
,
(k = 1 in Lemma 3.4 (C3)). In view of (Equation54
(54)
(54) ) they can be written in the form
(106)
(106) As in the case mentioned before we define the function given with constraint:
Since
with
and
as
, the range of g (and hence f) is
. Thus the left-hand side of the first equation in (Equation106
(106)
(106) ) can be any number from
and the second equation in (Equation106
(106)
(106) ) stays valid for
, simultaneously, provided that
,
,
(corresponding to
above),
(makes the left-hand side of (Equation106
(106)
(106) ) real and positive) are chosen appropriately.
It is equivalent to consider
. In case
,
we apply (Equation53
(53)
(53) ) for
and
,
.
When
(
,
) and a = b = d = 1 we get from (Equation55
(55)
(55) ):
Hence
and
with
,
(see (Equation24
(24)
(24) )). From the first estimate of (Equation100
(100)
(100) ) it follows that either
or
(note
), and furthermore
yields
. Next, on one hand we have
and on the other hand (see (Equation100
(100)
(100) )):
(107)
(107) hence
. Using the lower estimates on x, y, u, v and applying (Equation19
(19)
(19) ) to
and to
(see (Equation100
(100)
(100) )) and simplifying, gives
(108)
(108) Further we denote y, v as in (Equation54
(54)
(54) ) and manipulate the following expression:
Using this and (Equation107
(107)
(107) ), (Equation108
(108)
(108) ) we deduce that
It is not too difficult to find arbitrarily small
to contradict the last inequality.
Case XIV .
,
,
From Lemma 3.4 (2) for (C2) with
we get
(109)
(109) Denoting
,
,
and rearranging the terms in (Equation55
(55)
(55) ) yields:
(110)
(110)
,
From (Equation109
(109)
(109) ) it follows that either
or
or
.
If
the last equation of (Equation110
(110)
(110) ) with
fails for
.
Next, if
the first equation of (Equation110
(110)
(110) ) for
and the last estimate of (Equation109
(109)
(109) ) give
(111)
(111) For d = 0,
we immediately get a contradiction. The last equation of (Equation110
(110)
(110) ) for
and the second equation of (Equation110
(110)
(110) ) for
,
yield
(Note that for v = 0 the last equation of (Equation110
(110)
(110) ) with
fails for
.) Using this and (Equation111
(111)
(111) ) we conclude that
It is straightforward to see that this fails for any sufficiently small
. The case
is done in a similar manner, with a, x, u replaced by d, y, v, respectively.
,
,
As in Case XII (a) we argue that (Equation52
(52)
(52) ) has solutions for arbitrarily small E, F precisely when given
we can solve the system of equations
(112)
(112) where
. Indeed, by choosing y, v small enough the remaining two equations of (Equation110
(110)
(110) ) are satisfied for some
and the moduli of the first three expressions in Lemma 3.4 (C2) for
are bounded by s.
, b>0
Observe that since
the second equation of (Equation112
(112)
(112) ) is equivalent to the equation which compares the moduli (squared) of both sides of the equation:
(113)
(113) In particular it follows that
. Using the first equation of (Equation112
(112)
(112) ) for a = d = 0 we further get
, and thus
Clearly, when
we see that the above inequality fails for every sufficiently small s>0. For
we choose u, x such that
and so that
lies on an ellipse
(see (Equation113
(113)
(113) )). Therefore (Equation112
(112)
(112) ) for
is satisfied and it yields the existence of the path.
,
, b>0 or
Set
,
and let
(with
) solve the equation
(see (Equation112
(112)
(112) ) for
). A direct computation shows that by choosing
we assure that
fullfils the second equation of (Equation112
(112)
(112) ) for
and some
.
Denoting further x, y, u, v as in (Equation54
(54)
(54) ) with
,
,
,
the Equation (Equation112
(112)
(112) ) for
are seen as
(114)
(114) Define a function with constraint
where
. For
,
we set
Since Γ is bounded we get
as
for
(as
for
). As also
(see the above observation) and g is continuous for
, the range of g (and hence f with constraint) is
. Thus the left-hand side of the first equation in (Equation114
(114)
(114) ) can be any number from the interval
and the second equation in (Equation114
(114)
(114) ) stays valid, provided that r, t,
(
) are chosen appropriately. Thus (Equation114
(114)
(114) ) and hence (Equation112
(112)
(112) ) are solvable for any
, which proves the existence of a path.
,
, ad = 0
If
, d = 0 (or
, a = 0) we take y = v = s,
(or
) and u (or x) such that
in (Equation53
(53)
(53) ) to prove
.
Since
by (Equation109
(109)
(109) ), then either
or
(or both). Let us consider
. Then the last equation of (Equation110
(110)
(110) ) for
yields that
. If d = 0, we get a contradiction for
, while for
,
we get
(by (Equation109
(109)
(109) ) for
we have
,
). Note that x = 0 would yield
, and
would imply x = y = 0, both is not possible. Applying the triangle inequality to the right-hand side of the second equation of (Equation110
(110)
(110) ) for
, and using the lower estimates for
and the upper estimates for
give:
By taking
sufficiently small this inequality fails. The case
is for the sake of symmetry done in a similar manner, but with a, x, u replaced by d, y, v.
If a = d = 0 the second equation of (Equation110
(110)
(110) ) for
,
fails for
.
Next, suppose
. As in Case XIV (a) we get that either
or
or
.
If
the first (the last) equation of (Equation110
(110)
(110) ) for
(or
) and
(see (Equation109
(109)
(109) ) for
) yield
(or
). Combining this with the second equation of (Equation110
(110)
(110) ) for
gives
which failes for any sufficiently small
. In case
we get almost the same estimates, but with a, x, y replaced by d, u, v.
Finally, let
. Since
, then either
or
(or both). If
(or
) the first equation of (Equation110
(110)
(110) ) for
yields
(or
). Thus we deduce that
From the second equations of (Equation110
(110)
(110) ) for
(using the triangle inequality) we get
which fails for any sufficiently small
.
Case XV .
,
,
,
(see Lemma 2.2, (Equation51
(51)
(51) ))
, b>0
If
then
,
in (Equation53
(53)
(53) ) yields
.
Next, let
,
. From Lemma 3.4 (2) for (C4) with
,
we get
(115)
(115) We have Equation (Equation63
(63)
(63) ); the first one for
(the third one for
) gives
(and
). The last estimate in (Equation115
(115)
(115) ) further implies
and (provided that
):
Multiplying the second (rearranged) equation of (Equation63
(63)
(63) ) with
, and using the estimates on
,
,
,
we get an inequality that fails to hold for
small enough:
,
(
,
)
We have Equation (Equation58
(58)
(58) ) for a = 0,
and it is apparent that the last of these equations fails to hold for
. Next, we set set
,
,
. The last equation of (Equation58
(58)
(58) ) for
gives
. Combining it with the second and the first equation of (Equation58
(58)
(58) ) for
then yields
and
, respectively. From the last estimate in (Equation115
(115)
(115) ) we finally get an inequality that fails for
and
small enough:
When
,
,
the first and the last equation of (Equation58
(58)
(58) ) for
give
,
. Further, the last estimate in (Equation115
(115)
(115) ) first leads to the upper estimate
(hence
) and then the lower estimate
. Combining these facts with the first estimate in (Equation115
(115)
(115) ) implies the inequality that fails for
:
,
In case d = 0,
the path is guaranteed by
,
in (Equation53
(53)
(53) ).
Next, let a = 0 (hence d>0). The first equation of (Equation58
(58)
(58) ) for a = 0 and the last estimate in (Equation115
(115)
(115) ) imply
, a contradiction for
,
. When
the existence of a path for
and
is proved with (Equation53
(53)
(53) ) for
,
and
,
, respectively.
It is left to consider the case a>0,
. Using a similar argument as in Case XIII (a) (ii) we prove the existence of a path by solving the system of equations
and
; by choosing v, y sufficiently small we assure that the remaining expressions in Lemma 3.4 for (C4) are arbitrarily small (then
is arbitrarily small) and the last two equations in (Equation58
(58)
(58) ) are satisfied. By setting
,
with
we can write the above equations as:
(116)
(116) We show that the range of the following function given with a constraint is
:
If
,
then
, t = 1 satisfy the constraint and
, thus the range of f is
. When
,
then by taking
the constraint can be rewritten as
. Letting
implies
and hence
. For
and by setting
to be the positive root of the equation
we have
. The range of f is again
. Therefore (Equation116
(116)
(116) ) has a solution for any
, provided that
,
,
(corresponding to β, t, r),
are chosen appropriately.
Thic completes the proof of the theorem.
Acknowledgments
The author wishes to thank M. Slapar for helpful discussions considering the topic of the paper.
Disclosure statement
No potential conflict of interest was reported by the authors.
Additional information
Funding
References
- Bishop E. Differential manifolds in complex Euclidean space. Duke Math J. 1965;32:1–21. doi: 10.1215/S0012-7094-65-03201-1
- Kenig CE, Webster SM. The local hull of holomorphy of a surface in the space of two complex variables. Invent Math. 1982;67(1):1–21. doi: 10.1007/BF01393370
- Moser JK, Webster SM. Normal forms for real surfaces in C2 near complex tangents and hyperbolic surface transformations. Acta Math. 1983;150(3–4):255–296. doi: 10.1007/BF02392973
- Burcea V. A normal form for a real 2-codimensional submanifold in CN+1 near a CR singularity. Adv Math. 2013;243:262–295. doi: 10.1016/j.aim.2013.04.018
- Coffman A. CR singularities of real fourfolds in C3. Illinois J Math. 2009;53(3):939–981. doi: 10.1215/ijm/1286212924
- Gong X. Real analytic submanifolds under unimodular transformations. Proc Amer Math Soc. 1995;123(1):191–200. doi: 10.1090/S0002-9939-1995-1231299-8
- Gong X, Stolovitch L. Real submanifolds of maximum complex tangent space at a CR singular point I. Invent Math. 2016;206(1):293–377. doi: 10.1007/s00222-016-0654-8
- Lai HF. Characteristic classes of real manifolds immersed in complex manifolds. Trans AMS. 1972;172:1–33. doi: 10.1090/S0002-9947-1972-0314066-8
- Forstnerič F. Complex tangents of real surfaces in complex surfaces. Duke Math J. 1992;67(2):353–376. doi: 10.1215/S0012-7094-92-06713-5
- Slapar M. Cancelling complex points in codimension 2. Bull Aus Math Soc. 2013;88(1):64–69. doi: 10.1017/S0004972712000652
- Slapar M. Modeling complex points up to isotopy. J Geom Anal. 2013;23(4):1932–1943. doi: 10.1007/s12220-012-9312-6
- Slapar M. On complex points of codimension 2 submanifolds. J Geom Anal. 2016;26(1):206–219. doi: 10.1007/s12220-014-9545-7
- Arnold VI. Geometric methods in the theory or ordinary differential equations. New York (NY): Springer-Verlag; 1988.
- Izotov GE. Simultaneous reduction of a quadratic and a Hermitian form. Izv Vysš Učebn Zaved Matematika. 1957;1:143–159.
- Slapar M, Starčič T. On normal forms of complex points of codimension 2 submanifolds. J Math Anal Appl. 2018;461(2):1308–1326. doi: 10.1016/j.jmaa.2018.01.039
- Hong Y. A canonical form for Hermitian matrices under complex orthogonal congruence. SIAM J Matrix Anal Appl. 1989;10(2):233–243. doi: 10.1137/0610018
- Markus AS, Parilis EÉ. The change of the Jordan structure of a matrix under small perturbations. Mat Issled. 1980;54:98–109. English translation: Linear Algebra Appl. 1983;54:139–152.
- Edelman E, Elmroth E, Kågström B. A geometric approach to perturbation theory of matrices and matrix pencils. Part II: A stratification enhanced staircase algorithm. SIAM J Matrix Anal Appl. 1999;20:667–699. doi: 10.1137/S0895479896310184
- Elmroth E, Johansson P, Kågström B. Computation and presentation of graph displaying closure hierarchies of Jordan and Kronecker structures. Numer Linear Algebra Appl. 2001;8:381–399. doi: 10.1002/nla.253
- Dmytryshyn AR, Futorny V, Kågström B, et al. Change of the congruence canonical form of 2-by-2 and 3-by-3 matrices under perturbations and bundles of matrices under congruence. Linear Algebra Appl. 2015;469:305–334. doi: 10.1016/j.laa.2014.11.004
- Dmytryshyn AR, Futorny V, Sergeichuk VV. Miniversal deformations of matrices of bilinear forms. Liner Algebra Appl. 2012;436:2670–2700. doi: 10.1016/j.laa.2011.11.010
- Futorny V, Klimenko L, Sergeichuk VV. Change of the ∗-congruence canonical form of 2-by-2 matrices under perturbations. Electr J Lin Alg. 2014;27:146–154.
- Guralnick R. Similarity of holomorphic matrices. Linear Algebra Appl. 1988;99:85–96. doi: 10.1016/0024-3795(88)90126-7
- Leiterer J. On the similarity of holomorphic matrices. J Geom Anal. 2018. doi:10.1007/s12220-018-0008-4
- Boothby WM. An introduction to differentiable manifolds and riemannian geometry. New York (NY): Academic Press; 1975.
- Huang X, Yin W. Flattening of CR singular points and analyticity of local hull of holomorphy I. Math Ann. 2016;365(1–2):381–399. doi: 10.1007/s00208-015-1228-6
- Huang X, Yin W. Flattening of CR singular points and analyticity of local hull of holomorphy II. Adv Math. 2017;308:1009–1073. doi: 10.1016/j.aim.2016.12.008
- Fang H, Huang X. Flattening a non-degenerate CR singular point of real codimension two. arXiv:1703.09135.
- Horn RA, Johnson CR. Matrix analysis. Cambridge: Cambridge University Press; 1990.
- Bochnak J, Coste M, Roy MF. Real algebraic geometry. Berlin: Springer-Verlag; 1988.
- Tauvel P, Yu RWT. Lie algebras and algebraic groups. Berlin: Springer-Verlag; 2005.
- Harris J. Algebraic geometry a first course. New York (NY): Springer-Verlag; 1992.
- Hubbard JH, Hubbard BB. Vector calculus, linear algebra, and differential forms: a unified approach. Upper Saddle River (NJ): Prentice Hall; 1999.
- Coffman A. CR singular immersions of complex projective spaces. Beiträge Algebra Geom. 2002;43:451–477.