Abstract
Let be a family of sets in (always ). A set is called -convex, if for any pair of distinct points , there is a set , such that and . A thin right triangle is the boundary of a non-degenerate right triangle in . The aim of this paper is to introduce and begin investigating the thin right triangle convexity for short trt-convexity, which is obtained when is the family of all thin right triangles. We investigate the -convexity of unbounded sets, convex surfaces and planar geometric graphs.
MSC:
52A01; 52A37
1. Introduction
Let be a family of sets in a space ). A set is called -convex if for any pair of distinct points , there is a set such that and .
The investigation of this very general kind of convexity was proposed in 1974 at a meeting on convexity in Oberwolfach by the third author.
Usual convexity, affine linearity, arc-wise connectedness and polygonal connectedness are examples of -convexity (for suitably chosen families ).
Blind, Valette and the third author [1], and Böröczky Jr. [2] investigated the rectangular convexity, the case when contains all non-degenerate rectangles. The last two authors [5] presented a discretization of rectangular convexity, the right quadruple convexity (for short, -convexity), where is the family of all rectangular quadruples, which are vertex sets of rectangles. They are also currently studying another generalization, the thin rectangular convexity, by taking all thin rectangles (boundaries of rectangles) as .
It became clear that these generalizations revealed many interesting families of sets, leading far beyond the horizon of convexity.
In [6], the third author studied right convexity, the case when consists of all right triangles, and the last two authors [4] investigated the right triple convexity for short rt-convexity, where contains all triples with .
Wang and the last two authors [3], generalizing in another way, investigated the poidge-convexity (the case with consisting of all unions , called poidges, where x is a point, a line segment, and a right triangle).
A thin right triangle is the boundary of a non-degenerate right triangle in . The aim of this paper is to introduce and begin investigating the thin right triangle convexity for short trt-convexity, which is obtained when is the family of all thin right triangles.
Two points in M are said to enjoy the trt-property in M, if they belong to some thin right triangle included in M. Thus, M is trt-convex if any pair of its points enjoy the trt-property. Obviously, -convexity implies -convexity.
For convex sets, right convexity, -convexity, poidge-convexity and trt-convexity are equivalent. Not every poidge-convex set is trt-convex, not even -convex, but every rightly convex set is -convexity, poidge-convex and trt-convexity.
In order to obtain results describing -convex sets different from those provided by the initial study of right convexity, we must focus on sets which are essentially non-convex.
2. Definitions and Notation
For , we denote by its complement, by its affine hull and by its convex hull; further, , and denote its topological interior, closure and boundary, respectively, considered in .
For distinct , let be the line through , the line segment from x to y, and the hyperplane through x orthogonal to . If L, are affine subspaces of , means that they are parallel and that they are orthogonal. In addition, denotes the orthogonal projection of x onto L.
For any compact set , let be the smallest hypersphere containing C in its convex hull.
Let M be a closed convex set in (). A point x in M is called an extreme point of M if there exists no non-degenerate line segment in M that contains x in its relative interior. The set of extreme points of M is denoted by .
A convex body is a compact convex set in with a non-empty interior. The intersection of a convex body with a supporting hyperplane is called a face. A facet is a face of dimension .
Let h denote the Pompeiu–Hausdorff distance (also called Hausdorff distance) between compact sets.
For , put .
3. Unbounded trt-Convex Sets
We now investigate the trt-convexity of unbounded sets in .
Theorem 1.
The complement of a connected bounded set which equals intclM is trt-convex if and only if is a right or an acute triangle.
Proof.
The “if” part is obvious.
Suppose is trt-convex. Let .
First, we show that . If the inclusion is not true, we choose . There are such that x lies in the line segment , and is a supporting line of Q. The line is orthogonal to and cuts in at least two points. Let be the longest line segment with . Then any thin right triangle containing meets M, contradiction.
Now we prove that M is convex. Indeed, otherwise we choose , . The line cuts in two points, . Assume that the order on is . Then, do not enjoy the trt-property in .
We claim that does not contain parallel non-degenerate line segments.
Indeed, if contains such line segments, then there is no thin right triangle in containing their midpoints.
Let be supporting lines of , parallel to the sides of a regular pentagon. Choose . Let be the arc in from to not containing . If , for any distinct from , . Let lie between and , such that a supporting line at be parallel to . Obviously, do not enjoy the trt-property in . Hence, , where some of the ’s may not be distinct.
Assume that an angle of the polygon is obtuse. Then, the midpoints of its sides do not enjoy the trt-property in . Hence, has no obtuse angle and must consequently be a rectangle or a non-obtuse triangle. As contains no parallel line segments, the proof is finished. □
Theorem 2.
The complement of a connected bounded open set M in , where , is trt-convex, if for every , there exist two non-parallel hyperplanes disjoint from M, with .
Proof.
We claim that M is convex.
Indeed, otherwise there exist two points such that . Choose . Since , separates u from v. So , a contradiction.
Now, we choose .
If , consider the two non-parallel hyperplanes at x and y, respectively. Take a line . Choose , such that . There exist , far away, yielding a right triangle with , and . Then, , , form a thin right triangle containing .
If , , consider the point closest from y. Let and be the hyperplanes given by the statement. Let be parallel to . It follows that and H are not parallel. The proof continues as before. We proceed similarly if . □
The connectedness condition in Theorem 2 is in fact not necessary. We prove the following strengthening.
Theorem 3.
The complement of a bounded open set M in , with at most two components and , is trt-convex, if for every , there exist two non-parallel hyperplanes disjoint from M, with .
Proof.
For M connected, we apply Theorem 2.
Suppose now that M has the components . Like in the proof of Theorem 2, it can be shown that both are convex.
Consider . If , we proceed like in the preceding proof.
Assume now .
Case 1..
Then, close to x a point z can be found such that and .
Case 2..
Let . (It is easily seen that this intersection has two points.) By hypothesis, there exist non-parallel hyperplanes disjoint from M. Put .
can lie in only one of the four half spaces determined by in . This implies that at most one of the sets , meets , say the latter.
Consider an arbitrary line and the plane . Clearly, , where
There exists a half-line such that, for each , . Now, choose far away, so that . Another pair of points can be chosen on , respectively, such that , and bd. □
Remark 1.
The in Theorem 3 is the best possible. When , we may consider where both cl and cl are right triangles. However, and do not enjoy the -property in . See Figure 1.
Figure 1.
Illustration of Remark 1.
A planar convex set having the union of two half-lines with a common end point as boundary is called a digon.
Theorem 4.
The complement of a bounded open set M in , with at most three components and , is trt-convex, if for every , there exist two non-parallel hyperplanes disjoint from M, with .
Proof.
We proceed like in the preceding proof until Case 1, including it.
Case 2. We again take and as before. The affine subspace has dimension . Consider an arbitrary plane and the 3-dimensional affine subspaces , .
It is again true that at most one of , meets , say the first.
If (notice that this may not be the case), consider . Let be the plane through x parallel to P. If (again, this may not happen), take the two supporting lines of passing through x. Take . Let be the supporting plane of at .
The set includes two half-lines determining a digon with the following property. Every half-line starting at x and containing a point of either misses P or meets P inside .
We proceed in the same way with . It meets conv or conv or none of them. In the first case, we consider , in the second . Going analogously ahead, we find a digon , such that every half-line from y through a point of either misses P or meets P inside .
Now, choose a half-line , and continue as in the preceding proof. □
Question 1.
Is Theorem 2 valid without any condition regarding connectedness?
4. trt-Convexity of Convex Surfaces
Can convex surfaces be trt-convex?
A tetrahedron in having a vertex, at which the angles of all three facets are right, will be called right.
Theorem 5.
For a convex body , is trt-convex if and only if P is a right tetrahedron.
Proof.
For the “if” implication, let be a tetrahedron with all three angles at right. We show that bd is trt-convex.
Let . We have four essentially different situations.
Case 1. .
This case follows from the right convexity of any right triangle.
Case 2. .
Similarly, being an acute triangle, it must be rightly convex.
Case 3.
, .
Assume without loss of generality that y is not closer than x from . Then,
Denote by z this intersection. Put . The points u, and z are the vertices of a thin right triangle included in bd.
Case 4.
, .
Consider the point u from Case 3 and . Clearly,
If , then . If , then .
So, if , then lie in a thin right triangle with vertices , included in . Analogously, for .
Now, let us prove the “only if” implication.
Let .
Claim 1. If two crossing line segments belong to bdP, then they lie in a facet of P.
Indeed, let be the two line segments, and . Being a convex body, P is not included in the plane , supposed horizontal. Let , below , say. Take and assume that for some . Then, , which contradicts . Hence, there exist no such points , and consequently .
Analogously, and is a facet of P. Claim 1 is proven.
For any , we have . Indeed, otherwise there is no thin right triangle in bdP containing .
We now prove that P has a facet. Assume that P has no facet.
Consider three extreme points . We have . Put . Then, .
Since P contains no facet, is not a supporting plane of P. Hence, divides P into two parts .
Choose . We have .
Consider the non-degenerate polytope . By Radon’s theorem, either one vertex is in the tetrahedron determined by the other four, or one line segment joining two vertices meets the triangle formed by the other three. The first possibility is excluded, the vertices being in Q. Since , avoids intP, whence meets bd, and Claim 1 provides a facet of P, which contradicts our assumption.
Let E be a facet of P.
Claim 2. is nowhere dense in bdE.
Suppose, in contrast, there exists a non-degenerate arc . Choose and put . For close to each other, but different from x, is small. If , then and . Then, choose close to z, such that still . Since are not collinear, being in Q, , whence .
Hence, either the triangle is not right, or we find the triangle which is not right. Obviously, the midpoints of the two long sides do not have the -property.
Claim 3. There are no disjoint line segments in bdE.
Suppose, on the contrary, are such line segments, assumed maximal (with respect to inclusion). Let be the component of not containing T, and the component of not containing S. Since points in and have the -property, we must have and .
Thus, the triangles and are facets of P.
Now, we easily find , , such that . Put and . We can arrange the triangle not to be right. Indeed, if, for example , or not. In the first case, for any choice of a point very close to on , the triangle is not right. In the second case, for any choice of a point very close to q on , the triangle is not right.
Hence, we may suppose the triangle not to be right. However, then p and q do not enjoy the -property. Claim 3 is verified.
From Claims 2 and 3, it follows that E is a triangle . In fact, every facet of P is a triangle. Moreover, are edges of P. Suppose is not a facet of P. Then, some point is separated from k by . However, then meets , which means that , as all four points belong to Q and . By Claim 1, P has a quadrilateral facet, and a contradiction is found. Therefore, .
It remains to prove that the tetrahedron P is right.
We call a tetrahedron quasiright, if for any pair of opposite edges, such as , , we have or or or . Notice that a right tetrahedron is quasiright. We first show that P is quasiright.
Choose arbitrarily the pair of opposite edges and of P. Choose and . Then, the only triangle boundaries in bdP containing are bd and bd.
If or , then the condition for P to be quasiright is fulfilled at , . Otherwise, card and card, so is not right for any . Fix such a point y. Since have the -property in bdP, is right for any . So or for all . Suppose without loss of generality and . Choose close to x such that . We also have . So . Again, the condition for P to be quasiright is fulfilled at , .
Hence, P is quasiright. If it is not right, it must look like in Figure 2. However, then, the midpoint of and a point close to w on do not enjoy the -property. □
Figure 2.
A tetrahedron .
5. trt-Convexity of Planar Geometric Graphs
A Jordan curve in is the image of an injective continuous map of a circle into .
A Jordan arc in is the image of an injective continuous map of an interval into .
A geometric graph D is a set containing finitely many points in called vertices, which form a set , and including the union of finitely many Jordan arcs, each joining two vertices, called edges.
A planar geometric graph is a geometric graph in , the edges of which have pairwise no points in common, other than vertices of both.
Theorem 6.
A planar geometric graph is trt-convex if and only if it is a thin right triangle or such a triangle plus its height corresponding to the hypotenuse.
Proof.
Let be a planar geometric graph. The bounded components of will be called regions.
The “if” part is obvious. Let us prove the other implication.
Clearly, D is connected. Each region F of D has a closed Jordan curve as boundary, consisting of two or more edges.
A broken line with at most three line segments and no obtuse angle will be called a 3-path.
Claim 1. Each edge is a 3-path .
Indeed, let E be an edge between the vertices v, w. Take close to v and close to w. The trt-property of yields the existence of a thin right triangle , to which belong. Hence, the subarc from is included in T. Therefore it is a 3-path . By letting converge to , respectively, we obtain the existence of a 3-path from v to w in E, whence E is a 3-path .
Let F be a region of D and an edge.
Claim 2. If the 3-path E has an angle (measured toward F) at some point, then .
Indeed, suppose at some point , the angle is . Take such that bisects that angle. The trt-property at is clearly violated.
An important consequence of Claim 2 is that each edge lying between two regions is a line segment.
Let determine the diameter of D. The trt-property of yields the existence of a thin right triangle with vertices and the right angle at c.
For , we have already the first case of the statement.
Another important consequence of Claim 2 is that each region is convex. Let Y be the polygonal boundary of a region F or of the unbounded component of . Let v be a vertex of Y, not necessarily in , and the angle at v toward F, respectively .
Claim 3.
.
Indeed, assume . Take on the two sides of Y which meet at v, close to v. Clearly, the trt-property is violated at .
From Claim 3 it follows that Y has at most four sides. Moreover, if Y has four sides, then must be a rectangle. However, then, the trt-property is violated at midpoints of opposite sides. Hence, Y is a triangle. So , and D is a triangulation.
Claim 4. If the edges , of D have a common vertex v, then the angle at v equals or is not obtuse.
Indeed, if that angle is obtuse but not , the trt-property at points on , , close to v is not enjoyed.
Remark 2. If D has a vertex distinct from , then, by Claim 4, v has degree 3 and some edge of D is orthogonal to at v.
Remark 3. If D has a vertex , then v has degree four and the four edges at v are pairwise collinear or orthogonal. This also follows from Claim 4.
It is clear that a belongs to a triangle of the triangulation, with .
By Remark 2, has its right angle at p, so either and Remark 3 is contradicted, or and Remark 2 is contradicted, except for the case when , which corresponds to the second case of the statement.
The proof is complete. □
Author Contributions
Conceptualization, T.Z. and L.Y.; writing—original draft preparation, X.N.; writing—review and editing, T.Z.; supervision, T.Z.; project administration, L.Y. All authors have read and agreed to the published version of the manuscript.
Funding
The work is support by NSF of China (12271139, 11871192), the Program for Foreign experts of Hebei Province (2019–2021), the Program for 100 Foreign Experts Plan of Hebei Province, the Program of China Scholarships Council (202208130101), the Graduates Innovation Projects of Hebei Province (CXZZBS2022069).
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Blind, R.; Valette, G.; Zamfirescu, T. Rectangular convexity. Geom. Dedicata 1980, 9, 317–327. [Google Scholar] [CrossRef]
- Böröczky, K., Jr. Rectangular convexity of convex domains of constant width. Geom. Dedicata 1990, 34, 13–18. [Google Scholar] [CrossRef]
- Wang, B.; Yuan, L.; Zamfirescu, T. Poidge-Convexity. J. Convex Anal. 2021, 28, 1155–1170. [Google Scholar]
- Yuan, L.; Zamfirescu, T. Right triple convexity. J. Convex Anal. 2016, 23, 1219–1246. [Google Scholar]
- Yuan, L.; Zamfirescu, T. Right quadruple convexity. Ars Math. Contemp. 2018, 14, 25–38. [Google Scholar]
- Zamfirescu, T. Right convexity. J. Convex Anal. 2014, 21, 253–260. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).