Existence of continuous right inverses to linear mappings in finite-dimensional geometry

A linear mapping of a compact convex subset of a finite-dimensional vector space always possesses a right inverse, but may lack a continuous right inverse, even if the set is smoothly bounded. Examples showing this are given, as well as conditions guaranteeing the existence of a continuous right inverse.

to a surjective mapping, but also a right inverse with some additional properties, like continuity. In this note we shall study the question of continuity for linear mappings in finite-dimensional vector spaces.
An indication of the interest for this question is the book with its many references by Repovš & Semenov [4] on the selection of a continuous mapping inside a given multivalued mapping.
Let F W R n ! R m be a linear mapping. Let A be a subset of R n and B D fF .x/I x 2 Ag its image in R m under F . We denote by f W A ! B the restriction of F to A and ask whether f has a right inverse which is continuous for the usual vector space topologies on R n and R m , thus whether there exists a continuous mapping v W B ! A such that f ı v D id B . The answer is no in general as we shall see in Sect. 2, even if we assume that A is compact and convex with smooth boundary. Then we prove some results in the positive direction.
If A is convex, then so is its image B. If A is compact, then so is B as the image of a compact set under a continuous mapping. If A is open and if we choose as the codomain the smallest vector space containing the image of F , then also B is open.
In studying this problem we may assume that F is a projection .x 1 ; :::; x n / 7 ! .x 1 ; :::; x m / for some numbers 0 6 m 6 n. If m D n, then f W A ! B D A is the identity and equal to its own inverse. If A is compact and convex and m 6 1, then the existence of such an inverse is also clear. The problem is therefore of interest only if 1 < m < n; there is a counterexample with the minimal dimensions m D 2 and n D 3.
In Sect. 2 we present some examples of convex sets where a linear mapping does not have a continuous right inverse. Sect. 3 prepares for the following Sect. 4, where criteria for the existence of a continuous right inverse are established. These criteria are then applied to open and closed sets in the next two sections. The special case of polyhedra is considered in Sect. 7 and an easy sufficient condition for the existence of continuous right inverses is mentioned in Sect. 8. Finally, in Sect. 9, it is noticed that, after all, projections that do not have a continuous right inverse are exceptional in a precise sense.

Notation
We shall use the customary symbols N D f0; 1; :::g for the semiring of natural numbers and R for the field of real numbers. By We shall write A n B D fx 2 AI x 6 2 Bg for the set-theoretical difference of two sets, and A ı , A and @A D A n A ı for, respectively, the interior, the closure, and the boundary of a set A in a topological space.

Examples
We shall present three examples of projections that do not admit a continuous right inverse. The first is simple, and the third, less simple, has a smooth boundary.
.cos t; sin t; t/ 2 R 3 I t 2 OE0,2 « ; and let f be the restriction to A of the mapping F W .x; y; z/ 7 ! .x; y/. It is clear that A contains the segment OE.1; 0; 0/; .1; 0; 2 / as well as the triangle T .t/ with vertices at .1; 0; 0/, .1; 0; 2 /, .cos t; sin t; t/ for every t with 0 < t < 2 . Actually A is equal to the union of these sets. The convex hull of the union T .t 0 / [ T .t 1 / of two such triangles is a tetrahedron with vertices in .1; 0; 0/, .1; 0; 2 /, p .0/ D .cos t 0 ; sin t 0 ; t 0 / and p .1/ D .cos t 1 ; sin t 1 ; t 1 /. We have kp .j / .0; 0; t j /k 2 D 1, j D 0,1, which implies that any point p .s/ D .1 s/p .0/ C sp .1/ , 0 6 s 6 1, on the segment OEp .0/ ; p .1/ satisfies, writing t s D .1 s/t 0 C st 1 , Thus the convex hull of T .t 0 /[T .t 1 / is contained in the union of all the triangles T .t/ as claimed, proving that this union together with the segment OE.1; 0; 0/; .1; 0; 2 / is a convex set. This also proves that any right inverse v to f must satisfy v.cos t; sin t/ D .cos t; sin t; t/ when t 2 0,2 OE; there cannot be any other choice of the value of v. It also follows that v cannot be continuous at .1; 0/.
We note that f is injective near every point .cos t; sin t; t/ with 0 < t < 2 but not at the points .1; 0; t/, 0 6 t 6 2 . The inverse image f .f.1; 0/g/ of .1; 0/ is the whole segment OE.1; 0; 0/; .1; 0; 2 /. Example 2 In the above example A does not have a smooth boundary. We may improve the smoothness by considering the dilation A r D A C B 6 .0; r/, where B 6 .0; r/ denotes the closed ball af radius r centered at the origin, and where 0 < r < 1. Then A r has a C 1 boundary. As in the previous example, the projection of A r into R 2 cannot have a continuous right inverse, now at the point .1 C r; 0/, which belongs to the boundary of f .A r /.
Is it possible to have even a C 1 boundary? Indeed this is the case as we shall see now. .x; z/ 2 R 2 : Here sgn is the sign function, taking the value 1 for x < 0, 0 for x D 0, and 1 for x > 0, a is a sufficiently large positive constant, and b is a real number, 0 6 b 6 1.
Then the infimum when z varies is attained at z D b when x > 0, at z D b when x < 0 and at every real z when x D 0. We calculate the Hessian determinant of g and find that it is, for x > 0, for some positive constant M . When z 2 OE 2; 2, we have .z b/ 2 6 9, so to get h nonnegative for all z 2 OE 2; 2 it is enough to choose a so large that 2a 9M > 0.
Since also g xx is nonnegative, g is convex in R OE 2; 2. We construct a bounded set in R 3 as follows.
We define H.x; y; z/ D g.x; z/ C .z/ C a.y r/ 2 ar 2 ; .x; y; z/ 2 R 3 ; where r is a positive number to be chosen later, and is even and defined as .z/ D '.z 1/ for z > 1, zero on OE 1; 1. Hence is positive outside this interval.
We now define A D˚.x; y; z/ 2 R 3 I H.x; y; z/ 6 0 « ; B D f.x; y/I inf z H.x; y; z/ 6 0g D˚.x; y/I x 2 C .y r/ 2 6 r 2 « ; and let f be the projection A ! B defined by f .x; y; z/ D .x; y/. Clearly f does not admit a continuous right inverse if b ¤ 0, since any right inverse vW B ! A must satisfy v.x; y/ D .x; y; b sgn.x// when x ¤ 0 and y is such that x 2 C.y r/ 2 D r 2 . For a suitable choice of r, H is convex where it is nonpositive. Indeed, H 6 0 implies that .z/ 6 ar 2 , so if we choose r so small that .2/ > ar 2 , .x; y; z/ 2 A implies z 2 OE 2; 2 and we see that H is convex in A.
Furthermore, the set A has a smooth boundary. For when x > 0, the gradient of H vanishes only when x D 0, y D r, and z D 1, and then H takes the value ar 2 ¤ 0.

Upper and lower inverses
If f W X ! Y and g W Y ! Z are two mappings with right inverses u and v, then u ı v is a right inverse to g ı f . Indeed, When F W R n ! R m is the projection which forgets the last n m coordinates, we can use this observation to reduce the projection to a composition of n m projections each forgetting only one coordinate, thus to the case m D n 1: we project from R n to R n 1 , then from R n 1 to R n 2 and so on, until we reach R m .

Definition 1
If m D n 1 and A is any subset of R n , we define two functions u A ; w A W R m ! R Š by taking the infimum and supremum of the last coordinate, respectively, i.e., If the inverse image f .fxg/ of every point in R m is connected, we have If A is compact, the restrictions of u A and w A to B D f .A/ are actually right inverses. We shall then call them the lower and upper right inverses.
Let as before f W A ! B be the restriction to A of the projection F W R n ! R m . If A is convex and compact, then u A and w A are continuous in the interior of We may ask whether there can exist a continuous right inverse even though the lower and upper right inverses are discontinuous. Maybe the simplest example to show this is the following, taken from [3, p. 63].

Example 4 Let
A be the convex hull of the two points .1; 0;˙1/ and the circle Then there is a continuous right inverse to the projection which forgets z, viz.

Example 5
It is also possible to construct an example with smooth boundary. Indeed, we may take the set in Example 3 with b D 0. Then u A 6 0 6 w, so v A .x; y/ D 0 yields a continuous right inverse. But on the boundary of B, where Not only continuous functions but also semicontinuous functions, which we now proceed to define, are of importance here. To By turning things upside down we define an upper semicontinuous function and its upper regularization f ] ("f sharp"): The mapping f 7 ! f ] is increasing for the usual order of functions (f 6 g implies f ] 6 g ] ) and idempotent (.f ] / ] D f ] ), so it is an ethmomorphism. Moreover it is larger than the identity (f ] > f ) and so is a cleistomorphism.

Proposition 1
Consider a function f W R m ! R Š which is not identically equal to C1 and which satisfies an estimate for some constant C > 0. Then we can approximate it from below by its infimal Then f k has finite values when k > C and is then Lipschitz continuous with Lipschitz constant k. The sequence increases to f [ as k % C1.
If we start with a function defined only on a subset of R m , we extend it by defining it to be C1 in the complement of its original domain of definition.

Proof
The assumption that f has at least one finite value, say at a point c, ensures that f k has values strictly less than C1 everywhere: f k .x/ 6 f .c/ C kV .x c/ < C1.

K
The estimate (5) proves that f k does not take the value 1 if k > C , and also that it has Lipschitz constant k since it is the infimum of a family of functions with Lipschitz constant k.
If s < f.a/ < C1, then f k .a/ > s for k large enough, thus f k .a/ comes arbitarily close to f .a/. If f .a/ D C1 and s < C1, then f k .a/ > s, arbitrarily large for k large.

Remark 1
In applications of this proposition it is sometimes convenient to replace f by arctan f , defined as =2 where f D C1 and as =2 where f D 1, thus bounded and satisfying the hypotheses in the proposition. Of course the Lipschitz continuity of arctan f has to be translated to continuity properties of f with care.
Proposition 2 With f as in Proposition 1, assume in addition that there is a compact set K such that f .x/ D C1 for all x 6 2 K. Then for any positive ", f k 6 f kC" 6 f k C "g, where g.x/ D sup y2K k x y k, x 2 R m . In particular, f k depends continuously on k 2 R, k > 0. The same is true if all points used in the construction of the approximation belong to a compact set.
The proof is an easy estimate. (If f .x/ D k x k, there is a discontinuity at k D 1.) Theorem 1 Let u; v; w W B ! R Š be three functions defined in a nonempty subset B of R m . Assume that u 6 v 6 w and that v has finite values and is continuous.
We shall consider the non-strict inequalityu ] 6 w [ later.
Proof Note that here the functions u and w are defined only in B, not in all of R m as in (2). The functions u ] and w [ are therefore defined only in the closure of B, and to define them only values in B are used. We state an inequality for the restrictions to B of the functions but say nothing about their values on the possibly nonempty set B n B.
For the second part we consider w k D w u .kV /, which minorizes w [ j B and is continuous. For any given compact set K B, we have w k > u ] in K for sufficiently large values of k. So if B is compact we are done.
If B is open, we can find a family .K j / j 2N of compact sets with union equal to B and satisfying K j K ı j C1 , j 2 N. We define K 1 to be the empty set. Then for smooth functions ' j satisfying 0 6 ' j 6 1, with support in the interior of K j and equal to 1 in K j 1 we define v D ' j w k j C .1 ' j /w k j C1 in K j n K j 1 (for each x 2 B, there is a unique index j 2 N such that x belongs to K j n K j 1 ). This yields a continuous function v satisfying u ] < v < u [ in all of B.
The methods in the last part of the proof can be used also for some sets B which are neither compact nor open.

Open sets
If A is open in R m , then u A as defined in Definition 1 is upper semicontinuous and w A is lower semicontinuous:

Theorem 2 Let
A be an open subset of R n D R m R (not necessarily convex), and let f be the restriction to A of the projection R n 3 .x; t/ 7 ! x 2 R m . Assume that the inverse image f .fxg/ under f of every point x is connected. Then f admits a continuous right inverse.

Proof
The assumption on A implies that the inverse image of a point x in the image of f is fxg I x , where I x is a nonempty open interval; let us denote its endpoints by u A .x/ and w A .x/, so that I x D u A .x/; w A .x/OE. Moreover, as noted above, u A is upper semicontinuous and w A is lower semicontinuous.
If u A and w A have finite values, then the midpoint of I x defines a right inverse and it is continuous if u A and w A happen to be continuous. However, in general we have to define another kind of intermediate value between the two endpoints, a value which does not depend only on u A .x/ and w A .x/ but takes into account also points in a neighborhood of x. This is just what we did in Proposition 1 and Theorem 1. See also Remark 1.

Closed sets
If A is closed in R n , then u A is lower semicontinuous and w A is upper semicontinuous; We shall now adopt the methods to the case when the inverse image is a closed interval. Theorem 3 Let u; w W R m ! R Š be two functions such that 1 < u ] 6 w [ < C1. Then there exists a continuous real-valued function v such that u ] 6 v 6 w [ .

Proof
If sup u 6 inf w, we can define a right inverse v by taking its value as any constant c satisfying sup u 6 c 6 inf w.
If instead we have sup u > inf w, we proceed as follows.
At a point such that u ] and w [ take the same value, we define v.x/ to be that value.

K
Let be the open set of all x such that u ] .x/ < w [ .x/. We know that inf w < sup u, so for small values of k we have w k .x/ < u ] .x/, while for large values of k, w k .x/ > u ] .x/. We know that w k .x/ increases to w [ .x/ and even continuously so. We can apply Proposition 2: we note that the construction here is local, so that we can redefine w to be C1 outside some compact set which contains all the points under consideration.
Therefore it is possible to choose a value for k so that w k .x/ is equal to for instance w k .x/ D 1 2 u ] .x/ C 1 2 w [ .x/. Now the inequality u ] .y/ < w k .y/ < w [ .y/ holds not only for y D x but for all y in some neighborhood ! x of x. The non-denumerable union of all the ! x , x 2 , is equal to . A classical result on partitions of unity (see [5, p. 22], Théorème II or [1, p. 28], Theorem 1.4.5) now proves that there is a locally finite (thus denumerable) partition of unity .
For the direction only if, we note that the result follows from Theorem 1 if u and w are bounded. If not, we consider arctan u and arctan w as explained in Remark 1. However, a priori it may then happen that w k , which is constructed from arctan w, takes the value C1, corresponding to =2 for arctan w k , for we have only non-strict inequalities u ] 6 w k 6 w [ in general. If so, the constructed function v would not be real valued. To prove that we have strict inequality we note that, by hypothesis, arctan u ] .x/ < arctan w [ .x/ as soon as arctan w [ .x/ D =2 and x is in the image of the projection. Then w k .x/ < w.x/ by Theorem 3. The case when u ] .x/ D =2 is similar. Hence we can be assured that =2 < w k .x/ < =2 for all x in the image of f , so that v is real valued and continuous.
We can now give a characterization of the sets and the projections that admit a continuous right inverse in the case of closed convex sets.

Corollary 1 Let
A be a closed convex subset of R n D R m R, let f be the restriction to A of the projection R n 3 .x; t/ 7 ! x 2 R m , and denote by B the image of A under f . Assume that there are two functions u; w W B ! OE 1; C1 such that A D f.x; t/ 2 B RI u.x/ 6 t 6 w.x/g:

Then f admits a continuous right inverse if and only if
Proof Since A is closed, u is lower semicontinuous and w is upper semicontinuous. However, due to the convexity, they are in fact continuous in the interior of B, so that u ] D u 6 w D w [ there. The condition u ] 6 w [ is therefore automatically satisfied in B ı , so we need require it only on a part of the boundary, viz. on B n B ı .
That the conditions u ] < C1, w [ > 1 in B are not superfluous is shown by the following example.

Example 6 Let
This is a closed convex set. Indeed, it is the finite epigraph of the function .x;y/2 R 2 ; i.e., the set f.x; y; t/ 2 R 2 RI t > f .x; y/g. The function f is convex, being the supremum of a family of affine functions. Define u W R 2 ! OE 1; C1 by u.x; y/ D x 2 =y when y > 0, u.0; 0/ D 0, and u.x; y/ D C1 otherwise. We have uj B D f j B and u [ D f in R 2 . The set B n B ı consists of f.0; 0/g only, and u ] .0; 0/ D C1, since u.x; y/ > x 2 =y > x 2 if y D x 4 , x ¤ 0. So the condition u ] < C1 in B is violated, while the condition u ] 6 w [ is satisfied, since w [ D C1 in B. In B ı there is a continuous right inverse to the projection which forgets z, but not in B, since any right inverse must satisfy v.x; y/ > u.x; y/, and, as we just saw, u.x; y/ tends to C1 along a curve which approaches the origin.
If A is bounded, the corollary can be simplified: Proof That f j f .@B/ is injective means that the lower right inverse u equals the upper right inverse w on @B. The last coordinates satisfy At a point a such that u.a/ D w.a/ we must have u ] .a/ D w [ .a/, so the criterion in Corollary 2 is satisfied at all points a 2 @B.
How arbitrary can the upper and lower right inverses be on the boundary @B of B? The following result proves that they are quite arbitrary as long as B is strictly convex, but must satisfy a very natural condition on flat pieces of the boundary of B.

Proposition 3
Let B be a compact and convex subset of R m and let two functions u; w W @B ! R be given, u being lower semicontinuous and w being upper semicontinuous with u 6 w. Assume that, for any supporting hyperplane Y , the restriction of u to Y \ @B is convex, and that, similarly, the restriction of w to Y \ @B is concave. Then there exists a compact convex set A such that the lower right inverse of f restricted to @B is x 7 ! .x; u.x// and the upper right inverse restricted to @B is x 7 ! .x; w.x//. Proof We define the lower surface of A as the supremum of all affine functions gW R m ! R such that g.x/ 6 u.x/ for all x 2 @B. The supremum g of these functions is lower semicontinuous. The condition on u guarantees that this supremum is equal to u on @B. It is finite in B and equal to C1 in the complement of B.
Similarly, the infimum of all affine functions hW R m ! R such that h > w in @B is equal to w on @B.

Polyhedra
The origin of this section on polyhedra is a problem in digital geometry encountered by one of us; see Erik Melin's paper [2]. When approximating real-valued mappings by Khalimsky-continuous mappings, there are sometimes choices: we can introduce an upper and a lower approximation. However, for some real-valued mappings, the upper and the lower approximations are equal.
In the paper mentioned it was proved that affine mappings have this property, and in the proof it had to be shown that two convex sets have non-empty intersection. This was done via the Brouwer fixed-point theorem. To construct the continuous functions involved, a slightly weaker version of the following result was needed.

Proposition 4
Let F be a linear mapping of R n into R m and let A be a compact convex subset of R n , B its image under F . Assume that the restriction of F to A possesses a continuous right inverse. Then the same is true for any set A 1 which is the convex hull of A and finitely many points.
Proof By induction it is enough to let A 1 be the convex hull of the union of A and a single point a such that F .a/ does not belong to B, thus and v 1 as an affine function on each segment between F .a/ and a point in @B, more precisely the first point in @B when going from a through the given point. In fact, any point x 2 B 1 n B can be written uniquely as x D .1 t/F .a/ C ty for some t satisfying 0 6 t < 1, where y belongs to B and is such that .1 s/F .a/ C sy 6 2 B when 0 6 s < 1. (Then necessarily y belongs to @B.) We then set v 1 .x/ D .1 t/a C tv.y/.

Theorem 6 With f W A ! B as in Proposition 4, assume in addition that A is a polyhedron. Then the upper and lower right inverses are Lipschitz continuous.
Proof That A is a polyhedron means that it can be described as the intersection of a finite family of closed half spaces, say n where J is a finite index set. We may assume that . .j / / n is either 1, 1 or 0. Let J OE 1 be the set of those j for which . .j / / n D 1. Then the last coordinate of the lower right inverse u D .u 1 ; :::; u n / is u n .x 1 ; :: thus a supremum of a finite family of affine functions, hence Lipschitz continuous.

A sufficient condition for injectivity of a projection
The support function of a subset A of a vector space E is where E is the algebraic dual of E. When E D R m we identify E with R m .
Then f has a continuous right inverse v W B ! A such that graph.v/ A 0 .
Proof The limit of the quotient .H A 0 . 0 ; t/ H A 0 . 0 ; 0//=t as t tends to zero along positive values is equal to the derivative to the right at . 0 ; 0/. The difference between this limit and the derivative from the left is the kink in the graph, and condition (7) ensures that the hypothesis on injectivity in Theorem 5 is satisfied.

The exceptional character of bad projections
We have seen projections that do not admit a continuous right inverse. Are they rare in any sense? We shall prove a result in this direction here.
Theorem 7 Let A be a convex compact set in R n , n > 3, and fix an affine subspace E of dimension 3 in R n . Assume that A \ E has a nonempty interior in E, and let be any unit vector in E. Letˇbe any unit vector in E orthogonal to˛and define fˇto be the projection from A \ E alongˇto the two-dimensional plane Yˇ E of equationˇ x D 0.
There are only denumerably manyˇsuch that fˇdoes not have a continuous right inverse.
Proof We may assume that the origin belongs to the interior of A relative to E. Let p be any point on the boundary of A \ E relative to E and assume that there is no continuous right inverse at the point fˇ.p/ 2 Yˇfor the projection fˇalonǧ . Then we know from Theorem 3 that there is a segment of positive length in the boundary of A \ E relative to E which is mapped to fˇ.p/. Now the boundary of the two-dimensional convex set A \ Yˇhas finite length, and so can only contain denumerably many such segments, whereas there are card.R/ > card.N/ different projections defined byˇin total.
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/.