Convex geometries representable with colors, by ellipses on the plane, and impossible by circles
Abstract
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries on a 5-element base set. It introduces several properties: the opposite property, nested triangle property, area Q property, and separation property, of convex geometries of circles on a plane, preventing this representation for numerous convex geometries on a 5-element base set. It also demonstrates that all 672 convex geometries on a 5-element base set have a representation by ellipses, as given in the appendix for those without a known representation by circles, and introduces a method of expanding representation with circles by defining unary predicates, shown as colors.
1 Introduction
This paper follows the first paper of the convex geometries team [14] developed during the Polymath REU - 2020 project, see more details in [1].
In both papers we addressed the problem raised in Adaricheva and Bolat [2]: whether all convex geometries with convex dimension at most 5 are representable by circles on the plane using the closure operator of convex hull for circles.
A convex geometry is a closure system , where closure operator satisfies the anti-exchange property. The survey paper of Edelman and Jamison [9] was instrumental to start off the study of finite convex geometries, which are also the dual systems to antimatroids. The study of infinite convex geometries was initiated in Adaricheva, Gorbunov and Tumanov [3]. To see the development of the topic, including infinite convex geometries, one needs to consult the more recent survey Adaricheva and Nation [4].
In [7] G. Czédli proposed representation of convex geometries by interpreting elements of base set as circles on the plane, and closure operator as a convex hull operator acting on circles. He also showed that all finite convex geometries with convex dimension at most 2 can be represented by circles on the plane. The parameter of convex geometry represents the diversity of closed sets with respect to closure operator by measuring the size of maximal anti-chain of closed sets, see Edelman and Saks [10]. In Adaricheva and Bolat [2], it was found that there is an obstruction for representation of convex geometries by circles on the plane, in the form of the Weak Carousel property, which allowed the authors to build an example of a convex geometry on a 5-element set of .
In [14] it was discovered that all convex geometries for are representable by circles on the plane, and among 672 non-isomorphic geometries for , 621 were represented, while 49 were deemed “impossible”, i.e. no circle representation was found for them. Finally, it was proved in [14] that 7 of 49 impossible geometries cannot be represented due to the Triangle property, in addition to one from [2] due to the Weak Carousel property. In particular, some geometries are non-representable due to the Triangle property had .
In the current paper, we prove four new geometric properties related to circles on the plane that allow us to prove an additional 30 of the 49 geometries from the impossible list given in [14] are not representable.
We identify these geometries by their number in the list as generated in [14], and additionally by their tight implications, sometimes with the elements of the set relabeled for clarity.
1) Opposite Property (Theorem 1 and Corollary 2) implies that the following geometries are not representable:
Note that these three lists slightly overlap, with several of the geometries appearing in more than one list, and a few appeared earlier due to the Triangle Property in [14].
This provides a partial answer to Question 2 in [14].
The following 11 impossible geometries comprise still unproven cases:
Through the work on these “impossible” geometries, we used a program, previously developed for [14], which searched for all convex geometries that satisfied a given list of implications. In addition, we also used the GeoGebra software [11], to help with proofs and various representations.
Finally, we address two alternate schemes of representation.
In section 6 we discuss representation of geometries by ellipses on the plane. It was shown in J. Kincses [12] that not all geometries can be represented by ellipses. However, we demonstrate in Appendix A that all 49 geometries on a 5-element set that were deemed “impossible” for circle representation in [14], in fact, have representation by ellipses.
Question 1.
What is the smallest cardinality of the base set and the smallest convex dimension of a geometry that cannot be represented by ellipses on the plane?
In the last section 7 we introduce a new type of representation of geometries using unary predicates on the base set that can be interpreted as colors. In Appendix B we give representation of all 49 “impossible” convex geometries on a 5-element set using colored circles. It is also shown in section 7 that one of the geometries, G18, cannot be represented with two colors only. The rest of the “impossible” geometries are represented with 2 colors only. Note that G18 has , thus, we may ask:
Question 2.
Can all convex geometries of convex dimension 4 or 5 be represented by circles with 2 colors only?
2 Terminology and known results
A convex geometry is a special case of a closure system. It can be defined through a closure operator, or through an alignment.
Definition 1.
Let be a set. A mapping is called a closure operator, if for all :
-
1.
-
2.
if then
-
3.
A subset is closed if . The pair , where is a closure operator, is called a closure system.
Definition 2.
Given any (finite) set , an alignment on is a family of subsets of which satisfies two properties:
-
1.
-
2.
If then .
Closure systems are dual to alignments in the following sense:
Often, a closure operator is described by the means of implications. For example means that , for the underlying closure operator . Note that every closure operator can be expressed by some set of implications, for example, . On the other hand, given any set of implications , one can find a unique minimal closure operator such that .
If is a closure system, one can define a family of closed sets . Then is an alignment.
If is an alignment, then define in the following manner:
for all , let . Then is a closure system.
A useful perspective on closure systems is provided by its implications. Given a closure system , an ordered pair , where , also denoted , is an implication if .
A set of implications fully defining closure operator is often referred to as implicational basis of a closure system. The recent exposition on implicational bases is given in Adaricheva and Nation [5].
Definition 3.
A closure system is called a convex geometry if
-
1.
-
2.
For any closed set and any distinct points if then .
The second property in this definition is called the Anti-Exchange Property.
We can use duality between closure operators and alignments to provide another definition of a convex geometry.
Definition 4.
A closure system is a convex geometry iff the corresponding alignment satisfies the following two properties:
-
1.
-
2.
If and then s.t. .
A particular example of a closure operator on a set is the convex hull operator, where the base set is a set of points in Euclidean space . For the goals of this paper we use only the plane, i.e. the space .
Definition 5.
A set in is called convex if for any two points , the line segment connecting and is also contained in .
Definition 6.
Given set of points in , the convex hull of , in notation , is the intersection of all convex sets in which contain .
Thus, can be thought as a closure operator acting on .
Finally, we want to recall the definition of the convex hull operator for circles introduced in Czédli [7].
If is a circle on the plane, then by we denote a set of points belonging to . We allow a circle to have a radius , in which case it is a point.
Definition 7.
Let be a finite set of circles in . Define the operator , a convex hull operator for circles, as follows:
for any .
We think of any circle as a closed set of points (in standard topology of ), and we use for the boundary of , which is included in . Often we will be using the same notation for an element of convex geometry of circles, but also as the set of points in , thus avoiding notation . For example, means that in convex geometry of circles, but should be understood as .


We often will be writing , for the subset of circles, instead of . For example, for circles represents the convex set of points .
The following statement is modified Lemma 5.1 in [2].
Lemma 1.
Let be three circles on the plane such that none is included into another. Then there are three different types of configurations formed by :
|
|
|
|
Definition 8.
Let be circles in configuration 1 or 2. We say that circle is in the center (of configuration), if or . We call circles and external circles.
Definition 9.
Let be in configuration 2 such that has a touching point on only one tangent of and 2 points of intersection on the other tangent; then is in limit case 2.
Lemma 2.
Suppose is a circle inscribed in of a triangle . Let be an area of outside the circle and adjacent to the vertex , and as in Figure 7. Then any circle cannot have non-empty intersections with both areas .

Note that the version of this statement is still true and also addressed in [2], when circle touches two parallel lines and , and , denote two disjoint parts of a strip between these lines.
The next result was a crucial observation about tight implication for circles from [14]. The underlying closure operator here is .
Definition 10.
Let be a closure system. An implication , , is called tight, if implications do not hold, for all . We will call implication loose, if and it may not be tight.
Lemma 3 (The Triangle Property).
If and are circles in the plane with centers and respectively, and is a tight implication, then must lie in the interior of triangle formed by , and .
Lemma 4.
Given points in the plane, for to lie in the interior of the triangle formed by , and , must be located in the opposite angle to .
We add one new observation we will need later in our paper.
Lemma 5.
Let circles be in configuration (3) of Lemma 1. If overlap, then .
Proof.
Let be centers of circles , respectively. Every point in , which is not in , will belong to one of ,, . Therefore, we only need to consider a point . Since overlap, segment is covered by a union of two radii segments on the line : radius of circle and radius of circle . Let intersect at point . Then either , or . Since , we have or . ∎
3 Opposite Property
In this section we show that circle configurations on the plane satisfy the property that we call the Opposite Property. It shows that 7 geometries that were included in the list of impossible geometries in paper [14] cannot be represented by circles on the plane.
Theorem 1.
If is a tight implication and , , and , then .
Proof.
Suppose the hypotheses hold, and let be the centers of circles respectively. If then either , in which case the theorem holds, or , in which case is only possible if , but then is not tight. If , we have the following picture, where the distance between and is the radius of (i.e. is the point in farthest away from ; note that and , and thus and , are not necessarily distinct):
splits the plane into two semi-planes, and if any point in is in the semi-plane opposite , then clearly and the theorem holds.
If is contained in the open semi-plane containing , then in order for , , and , and must all have at least one point in the semi-plane opposite (otherwise both circles will be contained in the same open semi-plane not containing , and thus their convex hull cannot contain ).
also splits the plane into two semi-planes and since, by the triangle property (lemma 5), is in the interior of the triangle formed by and , at least one of must be contained in the same open semi-plane as . Without loss of generality, suppose this is true of . cannot be on the ray from through (else , in which case is not tight), so must be contained an open quadrant formed by and .
Call this quadrant “quadrant I” (shaded below) and label the other quadrants II, III, and IV, according to the figure below and which semi-planes formed by and they share with .
Since is a circle that must have at least one point in the semi-plane opposite with respect to , as noted above, must contain the point closest to in this semi-plane, namely the intersection of and a line through parallel to , which we will call . Thus must at least contain the circle of minimal radius centered at that includes .
Call this circle, pictured below with a dashed line, .
Now splits the plane into two semi-planes, and since is in the interior of the triangle formed by and , one of must be in the open semi-plane that does not contain , so without loss of generality suppose it is . Note that, regardless of the placement of , this semi-plane is contained within quadrants I, II, and III. As with , the convex hull of also must contain the point closest to in the semi-plane opposite with respect to , namely the point where and a line through parallel to intersect, or itself if is already in this semi-plane. The convex hull of must at least contain the circle of minimal radius centered at that includes , which we will call , so the convex hull of and is contained in the convex hull of and .
If is not in quadrant I, it must be contained in the open semi-plane opposite with respect to . First consider a placement of on the line (although can in fact only be arbitrarily close to such a placement). In this case the convex hull of and is symmetric about . If is in the same semi-plane as with respect to , i.e. , then and are all on , so and all share a common tangent line. They must also share this common tangent reflected about , the line through their centers, so is in the convex hull of and and thus also of and .
This argument still holds in the case where is on , and from here moving further away from along only adds the the convex hull of and , which already includes . Thus all placements of on the line lead to the implication .
Similarly, moving horizontally off the line into the opposite semi-plane as with respect to , where it is assumed to be, only adds to the convex hull of and .
Therefore any possible placement of not in quadrant I leads to the strict implication , so must be in quadrant I, as is.
Now splits the plane into two semi-planes, and since is in the interior of the triangle formed by and , must be in the open semi-plane that does not contain . But now we have already seen that such a placement of not in quadrant I leads to the implication (by playing the role of and playing the role of in the previous argument, so must also be in quadrant I. (Note that while was additionally shown to be in the open quadrant I, by the same argument used for , also cannot be on the line between and , and this is all that is needed.) However, this makes it impossible for to be in the interior of the triangle formed by and , so there is no possible representation for the given implications without the additional implication . ∎
In the next statement we use the numbering of geometries given in [14] with their implications, but elements of geometry 74 have been relabeled to better fit the statement of Theorem 1.
Corollary 2.
The following geometries, identified here by their tight implications, are not representable by circles on the plane:
Geometry 46: , , , and .
Geometry 60: , , , , and .
Geometry 74: , , , and .
Geometry 84: , , , and .
Geometry 114: , , , and .
Geometry 115: , , , and .
Geometry 153: , , , and .
Proof.
In all of the above geometries, no proper subset of implies , so this is a tight implication. Additionally, the implications , , and are all always present, so by theorem 4.1 any representation by circles on the plane would have the additional tight implication not present in these geometries. ∎
4 Area Q and non-representable geometries
4.1 Area Q for binary hulls
In this section we consider simple facts about the convex hulls of two circles, which we call binary hulls. We investigate the possible configurations formed by two or three binary hulls involving one fixed circle . The center of is denoted , and similarly, we use for centers of circles , respectively.
Throughout this section we will use the following labels and notation: for , with respect to a specified circle with center , when a different circle , with center , is given, we will denote by the ray from that goes through . We denote , and denote another point of intersection of the line with by . Note that when is a point.
For any center on segment , if the radius of is , then . When the radius of grows beyond , there will be exactly two common tangent lines to with touching points on . We will denote these two touching points , and observe that they are symmetric around line .
As the radius of grows, travel along corresponding halves of from to . When the radius reaches or surpasses , we obtain a configuration where .
Similarly, for located on , we may start from and find touching points on for tangents from to , and as the radius of is allowed to grow, the touching points travel toward point until .
For illustration with and , see Fig. 9.
Thus, whenever and , there will be two lines tangent to both and with touching points on , symmetric around .

Now our goal is to establish some facts about the set of points
defined by some circle and set of one, two or three additional circles.
We start from , just a single circle, i.e. .
We will assume that are not included within each other and thus we will have points on , which are 4 distinct points, unless . To distinguish the two arcs connecting on , we will include another point on the arc in the notation, in this case or .
The following lemma links the properties of certain arcs with information about points in .
When we say that the set of points has points arbitrarily close to points of some set , we mean that any open ball (standard open set of metric space ) centered at has non-empty intersection with .
Lemma 6.
Suppose , and . Then
-
(1)
The arc is a part of the border of .
-
(2)
has points arbitrarily close to all points of the arc .
Proof.
(1) is a convex closed set (in regular topology of ), whose border consists of two tangent segments with end points on , the arc of and arc of circle , see Figure 9.
(2) The arc is inside closed set . When is removed from , the remaining set has points arbitrary close to the points of this arc.
∎
Now we move to consider configurations of three circles. For area Q in these cases, consists of two circles, for example, , and .
We will assume that none of the three circles involved is included into another, and in the next several statements we will refer to configurations 1, 2 or 3 from Lemma 1.
Lemma 7.
Let circles be in configuration 1 with center . Then points follow on circle such that and .

Lemma 8.
Suppose that circles are in configuration 2 with center . Then:
-
a)
Points follow such that
and .
-
b)
On external circle , .
-
c)
The border arcs of on are formed by the intersection of arcs and .
-
d)
.
Furthermore:
-
d)
If the circles are not in limit case 2, then and there are two border arcs of on .
-
e)
If the circles are in limit case 2, then or , and there is one nontrivial (i.e. consisting of more than one point) border arc of on .

Lemma 9.
Suppose that circles are in configuration 3. Then:
-
a)
Points and alternate on .
-
b)
The arc is arbitrarily close to and is part of the border of . Neither of these arcs are empty or trivial.

Lemma 10.
Suppose circles are in limit case 2 configuration with in the center, and let the points on be in counter-clockwise order
If the radius of is decreased, but still , then and the points are in the order
Proof.
Indeed, when the radius is reduced, the circles become in configuration 3, therefore, the points should alternate. ∎
Note that, by lemma 1, any three circles on the plane with none included into another must be in one of the three configurations addressed by Lemmas 7 - 9. Therefore, for such circles, one of those Lemmas must apply, and observations of the conclusions of Lemmas 7 - 9 can be used to determine the possible configuration(s) of such circles.
4.2 Configurations of circles in a tight implication
The goal of this section is to show that some circle configurations are restricted under tight implication.
We first make observations about configuration of circles and given the tight implication .
Lemma 11.
If is tight, then are in configuration 3.
Proof.
Indeed, if is in configuration 1, then, say , therefore, holds, which contradicts the tightness of implication . If are in configuration 2, say, with at the center, then implies either or , again a contradiction with the tightness. ∎
Lemma 12.
If is tight, then cannot be in configuration 1.
Proof.
If , then and therefore , so is not tight. If , then , and combination with requires the additional implication , as in every convex geometry, due to the anti-exchange axiom. This once again violates tightness of , so , and by the same argument . ∎
Our next goal is to show that whenever is tight, circles will not form configuration 2, except in limit case with in the center.
For this we show some extended version of Lemma 2.
Consider the setting: circle inscribed into angle with vertex and touching sides of angle at points . We may adopt notation of Lemma 2 and denote two disjoint regions of the angle outside as and , and notation outlined in section 4.1 for points , relating to circle , on circle . Suppose points are on arc bordering .
Similar version of the statement should work for the case when two tangents of at are parallel lines.
Lemma 13.
If related to circle form a sub-arc on arc of circle bordering area , then .
In Figure 13 circle satisfying requirement on points can be located inside , where is the intersection of tangent lines at and .
Proof.
We start from the case of infinite region . Given point on the arc bordering , we think of ray as obtained from rotating ray that is on line and does not have : point moves along the arc until it arrives at , while the ray is tangent to circle at every location.
Ray may be completely inside angle , or it may cross side . Assume that it does cross it, say, at point .
Now we will be rotating ray so that goes along the arc until reaches , and at every location the ray remains to be tangent to . If we watch the point of intersection with line , then it moves from toward , so it remains inside area . In particular, the final location is point , the point of intersection of two rays and .
We must have and . Since any circle with touching points and center on must be in , we obtain .
In case none of rays intersect with the sides of angle , we conclude that , thus, .
Similar argument works for region , except rays and , obtained by rotation of and , respectively, always intersect with sides of angle . ∎
Lemma 14.
If circle is at the center of configuration 2 for and , then .
Proof.
Note that cannot have radius 0 in the described configurations.
Let on be as specified in section 4.1.
Then , the touching points on from circles , do not alternate with ; thus, all are located on arc . By assumption on configurations, points and are also on the same arc.
Let us assume wlog that the region between tangents bordered by this arc is . Then by Lemma 13 we have . On the other hand, , where we call the region formed by extending tangent segments between beyond touching points on , and bordered by arc . Since are disjoint regions, cannot be in (unless is inside , which we exclude). ∎
Lemma 15.
Let circles form configuration 3 and . If form configuration 2 with center , then .
Proof.
Let on be as specified in section 4.1.
Since is in the center of in configuration 2, touching points on do not alternate (and has a positive radius). Then are located on arc .
Since are in configuration 3, touching points alternate on . Without loss of generality assume that is an arc where is attached, then is the arc on which is part of the border of . Due to the latter fact, arc cannot be on , which is inside , therefore, arc is on . Apparently, cannot be on arc , therefore, they are on arc from which we remove arc . This is arc , which is also a part of arc . We conclude that are also on the arc , therefore, do not alternate.
This means that are in configuration 1 or 2. If is in the center of configuration 1, then and we are done. If, say, is in the center of configuration 1, then , thus, together with we conclude due to the anti-exchange property, and contradicts the assumption that is in the center of in configuration 2.
It remains to show that in configuration 2 will bring or a contradiction with or configuration 3 for .
If is at the center of configuration 2 for , then we have the setting of Lemma 14, and we get to the contradiction with . See Figure 14.
Suppose are in configuration 2 and is in the center. Then on circle points are located on the arc , while points are located on arc .
Indeed, the latter is due to also in configuration 2 with in the center. Thus, do not alternate on , a contradiction with assumption that in configuration 3. See Figure 15.
Finally, consider at the center of , like in Figure 16. For now, assume has a positive radius. Then on circle points do not alternate , and are on the arc . But also, since are in configuration 2 with at the center, on are on the arc . Apply Lemma 13 replacing by , points by , lines by tangents of and by either or by . Then, circles are inside , where is a region formed by tangents of at and bordered by arc . This implies that (unless , which we exclude).
The case when is a point follows from the above: if is not on a tangent of binary hulls within , we can pick some small radius for a circle with center such that the assumptions hold (, are in configuration 2 with center , and are in configuration 2 with in the center) and lead to a contradiction as before. If is on a tangent of then the conclusion holds, and if is on a tangent of or , we can replace both and with slightly larger circles such that the given assumptions hold and are again in the case above. ∎
We finally collect all the previous observations in the following result.
Theorem 3.
If is tight, then is in configuration 3 or in limit case 2 with at the center.
Proof.
By Lemma 12, circles cannot be in configuration 1. By Lemma 11 form configuration 3, therefore, the assumptions of Lemma 15 hold. By Lemma 15 if any or is in the center of configuration 2 for , then the implication is not tight.
Thus, if form configuration 2, then only can be in the center. Moreover one of common tangents of has the border of , therefore, cannot intersect it in more than one point. Thus, if is in center of configuration 2 for , then it is in limit case 2. ∎
4.3 Point Order Theorem
We will be establishing consistent labeling of touching points on circle , when four circles satisfy tight implication , for the underlying closure operator .
We first fix a consistent orientation of circles around . We will set points on using the approach described in section 4.1. Let ray start at center and go through center . The point of crossing and is called .
The second point of intersection of and is denoted . The same labeling conventions give , from ray and circle . Furthermore, points and come from and .
Now we establish the orientation. Consider circle as a clock with the center of rotation for the clock hand at . Start the clock hand at and move counterclockwise. Without loss of generality, the circular order on will be as follows: .
Now we establish the orientation of tangent points with respect to the various ray intersections on . There are two tangent points on from that we label and . When starting at and walking counterclockwise, the circular order will be . The tangent points from are and with inside . Starting at , we have the circular order as . For , we have points . When walking counterclockwise, we get the point order .
Finally, we label the outer tangents of as , and .
For any two non-collinear rays and we call proper angle a smaller of two angles formed by these two rays.
Theorem 4 (Point Order Theorem).
With the counterclockwise orientation of and the associated labeling when is tight, the counterclockwise point order on beginning at is .
Proof.
By Theorem 3, triples of circles: , , and , are only in limit case 2 with at the center or the convex hulls are in configuration 3. Since is in , we may start with the case where is touching all three lines , and .
Then we proceed with cases where is tangent to two of these lines, one of these lines, and finally none of these lines.
Case 1: is inscribed in .

This is the case where is tangent to , , and . For discussion convenience, label the tangent points on as , and , on lines , and , respectively.
Then, according to agreement on orientation of around , we have the following coincidence of points:
Therefore, the counter-clock sequence is, indeed,
Case 2: is tangent to and but not .
This new condition does not change the assumption that and .
Now are in configuration 3 by Theorem 3, which means alternate around by Lemma 9. This allows the counter-clockwise point order or, the order . The latter order is not possible, because circles are in limit case 2 with center , therefore, by Lemma 8, . But with the order , the arc will contain point instead of the arc , a contradiction.
Therefore, the only possible order is , and, thus, including into the sequence, we get
Case 3: is tangent to but not and .
We still have , thus is at the center of limit case 2 for circles . Therefore, the circular sequence of points on starting from will be either
or
But only first sequence satisfies the agreement of counter-clockwise order .
Now, by assumption in this case, circles as well as are in configuration 3. Since points alternate with both and , by Lemma 9, one of points is on arc and another on arc . There are two possibilities to insert points into the first sequence above. Suppose we have the following placement of :
This would mean that the arc is the same as , but arc is an inner arc of , with only points on its border, thus, it is an inner arc of , and cannot have points on the border of , in particular, cannot have point .
Therefore, the only possible sequence of points is
which can be written starting from as follows:
Case 4: is not tangent to , and .
Now every triple of circles: , and - is in configuration 3 by Theorem 3, therefore, alternate on , as well as and .
Gradually increase the radius of so that remains in . At the limit of this process will touch at least one of outer borders of . Call new circle . Then is again tight. Moreover, one of Cases 1-3 will describe the configuration of .
Assume wlog that is touching and not touching other lines , . Then we can apply the result of Case 3 to . Therefore, the sequence of points on is
Also, focusing on subsequence of , we have, starting from :
If we slightly reduce the radius of , circles will no longer be in limit case 2, but since is tight, are in configuration 3, due to Theorem 3. By Lemma 10, the sequence of points on starting from is
We need to embed this sequence into sequence of limit case 2
We notice that we have to place after , and if we place it before , then points will not alternate, which contradicts being in configuration 3. Therefore, the proper sequence is
If we continue reducing the radius of back to , we remain in configuration 3 for all triples of circles. Indeed, at every moment of the process we have tight, and at the start of the process was not at the center of limit case 2 with any two other circles. Therefore, the sequence of points on will not change.
Suppose we get in its limit position touching and . Then, according to the result for case 2, we get the following sequence on :
When the radius of is slightly reduced, we get the following sequence of points :
Similarly, we expect the following sequence of points :
Incorporating them into original sequence in limit position of , we get only one possibility:
Finally, consider the case when in its limit position is touching all three lines , and . Then we have configuration of in case 1, therefore, there are only three distinct touching points on :
If we give them other labeling, focusing on , then we get the same sequence as
Then, when the radius of is slightly reduced, we expect, by Lemma 10, that the points will alternate:
Similarly, if we write the original sequence of points on in their labeling, we get
Therefore, after reducing the radius of we obtain
Finally, if we write the original sequence in its labeling, we will have
After the radius of is reduced it turns into
There is only one circular sequence of all points that honors three established subsequences:
This finishes the analysis of Case 4. ∎
5 Point Order Theorem in action
In this section we find several applications of Point Order Theorem, which will generate several families of non-representable convex geometries.
5.1 Separation property
Theorem 5.
Let be circles on the plane. If and are both tight, then it is not possible to also have the implication .
Proof.
First, let us consider the case where . Since and are both tight, by the triangle property (Lemma 3) the center of circle must lie in the interior of the triangles formed by centers and . Then, by lemma 4, both and must be in the opposite angle to . Thus, if any point of crosses the line , then , violating the tightness of the implication . (See figure 18 below.)
Similarly, if any point of crosses the line , then , so , and by the same argument , must be strictly contained in the opposite angle to , and therefore their convex hull cannot contain and the hypothesis holds.
Now let us consider the case when has a positive radius. Wlog, let us assume the counterclockwise orientation of and associated labeling around circle as in Theorem 4, with circles and playing the roles of circles and respectively. Specifically, note that we have labeled such that is the counterclockwise circular order of these points around . Since is tight, this Lemma then tells us that the counterclockwise point order on beginning at is .
Now, consider the placement of , the center of circle . Again, since and are both tight, by the triangle property the center of circle must lie in the interior of the triangles formed by centers and , and by lemma 4, both and must be in the opposite angle to .
In particular, the rays from to and that define and are both in the opposite angle to , and so the counterclockwise orientation of around must be the same as the counterclockwise orientation of . Thus, again using the same labeling such that is the counterclockwise circular order of these points around , by Theorem 4 the counterclockwise point order on beginning at is .
Now, for the sake of contradiction, suppose we also have the implication . Then circles are in configuration 1, with in the center, so by lemma 7 follow on a walk around . The only possible point orders are then , or the symmetric order with and switched. In this case, , so the complementary arc (unless is all of circle , which we exclude since contradicts being tight), which contradicts Lemma 7. Thus the implication must be absent.
∎
In the following corollary, the labels in geometry 26 have been changed to better fit the statement of theorem 5.
Corollary 6.
The following geometries, identified here by their tight implications, are not representable by circles on the plane:
Geometry 14: , , and .
Geometry 23: , , , and .
Geometry 26: , , and .
Geometry 39: , , and .
Geometry 54: , , and .
Proof.
In all these geometries the assumptions of Theorem 5 hold, but the conclusion is not compatible with the given implications. ∎
5.2 Nested triangles
Finally, we will make use of technical work of the previous section. The first statement is a key Lemma that deals with the tight implication . We could think of the combination of “nested triangles” formed by and (or ) within the larger “triangle” formed by .

Lemma 16.
If is tight, then in case , and when .
Proof.
Let us assume that we proved the case , and consider .
Since the right side of the equality for that case is always contained in the left side, we need to show that the left side is contained in the right side.
According to assumption, we have for :
Now we can take the limit when approaches , and the right side will approach .
It remains to notice that cannot overlap, when and is tight. Indeed, by Lemma 5, if overlap, then is in one of double hulls , thus, is not tight.
Since do not overlap, . Therefore, .
Thus, it remains to prove the case when has a positive radius.
Note that it follows from the definition of that . Moreover, set is convex; therefore, it will contain an area around every point not in with points arbitrarily close to some portion of the border of . We will show that the only portion of the border of for which contains arbitrarily close points is the arc of attachment of .
We would think of orientation of so that we would take advantage of circular order of touching points on circle . Draw line through centers of , and then name touching points on as and point of intersection of with as so that moving from to to would be in counter clockwise order. By assumption, points appear in counter clockwise order. Besides, by Triangle Propoerty (Lemma 3), must be inside , therefore, are separated by , and, thus, is in the same semiplane with respect to as point , and and are in the opposite semiplane. See Figure 19 for illustration.
By Theorem 4, we have the following point order on :
Note that is located on arc because of the labelling assumption which states the counter clockwise points on from is . Thus, is contained on the complement arc . The intersection of and gives arc .
Furthermore, is located on arc , because of the labelling assumption, so . Thus, is on arc . By the labelling assumption and Theorem 4, arc , so the intersection of and gives arc .
Finally, is on arc and is on , so is a border arc of on .
By Lemma 9, the following arcs on circle are border arcs of corresponding convex hulls:
-
•
is a border arc of ;
-
•
is a border arc of ;
-
•
is a border arc of .
By Lemma 9, is where is attached because is a border arc of .
Consider now the touching points on . Denote by the touching points of the common tangents with , so that are connected by common tangents and . Note that is in the same semiplane with respect to as point , and is in the opposite semiplane.
Denote by the touching point of the outer tangent between , and the touching point of the outer tangent between . Then moving around from to , we will meet , then . Note that arc on is part of the border of , while arc is part of the border of , and is a part of the border of .
Here is the sequence of points on the border of , when walking around this binary hull:
and we summarize what we established earlier:
-
•
segment is on the border of ;
-
•
arc of is on the border of ;
-
•
arc of is on the border of ;
-
•
segment is on the border of ;
-
•
arc on is a part of the border of ;
-
•
arc of is where is attached;
-
•
arc of is a part of the border of .
Therefore, there are no other points in than those in . ∎
Note. Since and , we can rewrite the conclusion of Lemma 16 as follows:
The left side of equality involves “triple” convex hulls, while the right side is -combination of “double” convex hulls. Remarkably, the only assumption is the tight implication .
Theorem 7.
Assume that is a tight implication. Suppose that , but . Then .
Proof.
By assumption, we have . Since , we cannot have and , thus, we must have point from in .
By Lemma 2, if circle is inscribed into angle, and are two areas: outside circle and next to vertex of angle, and another outside of circle and far from the vertex - then any other circle inside that angle cannot have points in both and . The version of this Lemma is also true in the case the tangents forming are parallel.
We have an application of this Lemma here: vertex of the angle is a point of intersection of tangents forming , and circle plays the role of . Then is contained either in or from that Lemma. Say, the case on Figure 20 is .
Thus, if has a point in , and is contained in angle formed by extension of sides of from its vertex (which follows from ), then . But then , because . Similarly, . ∎
We will say that implication on circles is loose, if .
Corollary 8.
Let be circles on the plane. If is tight, and are loose, then either , or and .
Proof.
Indeed, if , then, by Theorem 7, we will conclude that and . ∎
In the statement of the next corollary, we use the numbering of geometries given in [11] along with their implications. Elements of geometries 12, 15, 21, 23, 27, 33, and 47 have been relabeled to better fit the statement of Corollary 8.
Corollary 9.
The following geometries, identified here by their tight implications, are not representable by circles on the plane:
Geometry 12: , , and .
Geometry 15: , , and .
Geometry 18: , , , and .
Geometry 21: , , , and .
Geometry 23: , , , and .
Geometry 26: , , and .
Geometry 27: , , , and .
Geometry 33: , , and .
Geometry 35: , , , and .
Geometry 45: , , and .
Geometry 47: , , , and .
Geometry 49: , , , and .
Geometry 56: , , , and .
Geometry 60: , , , , and .
Geometry 70: , , , and .
Geometry 89: , , and .
Geometry 94: , , , , and .
Geometry 134: , , and .
Proof.
In all these geometries the assumptions of Corollary 8 hold, but the conclusion either does not follow from given implications, or make one of them not tight. ∎
5.3 Surrounding and capturing
The following result describes the situation of “capturing” circle surrounded within a special set-up of 4 other circles.
Theorem 10.
If is tight and , , , then .
Proof.
Suppose the statement is proved when , and we have 5 circles with all assumptions of Theorem and . Since is tight, is an inner points of . Therefore, we may set a small positive number as so that still holds, as well as other assumptions , , . Since we assumed that statement is proved for the case , we conclude that . This will hold for arbitrary , therefore, , and we are done. Thus, we only prove Theorem under additional assumption that .
By Theorem 4, using the same labeling, the counterclockwise point order on beginning at is .
, else and is not tight, and , since is not contained in , so the complements of the arcs mentioned above are disjoint. Therefore, the two arcs forming the borders of the convex hulls include the entire border of . It follows that there is no point outside from . Thus and . ∎
Corollary 11.
The following geometries, identified here by their tight implications, are not representable by circles on the plane:
Geometry 74: , , and .
Geometry 96: , , , and .
Geometry 105: , , , , and .
Geometry 143: , , and .
Geometry 147: , , , , , and .
Geometry 206: , , , and .
Geometry 235: , , and .
Geometry 351: , , and .
Proof.
In all these geometries the assumptions of Theorem 10 hold, but the conclusion does not follow from given implications. ∎
6 Representation of geometries by ellipses
In paper [14] it was shown that from 672 known non-isomorphic geometries on 5-element set 623 can be represented by circles on the plane. From remaining 49, 8 are not representable due to the Weak carousel property from [2] or the Triangle property from [14]. It turns out that all of these 49 geometry can be represented by ellipses. See appendix for the representations.
In recent paper [12], it was shown that there exist convex geometries not representable by ellipses. The result provides Erdös-Szekeres type of obstruction and follows from specific construction in [8] of arbitrary large families of convex sets on the plane with the list of specific properties, which cannot be realized by families of ellipses.
But no specific convex geometry defined by convex sets or implications was found so far that cannot be represented by ellipses. Also, the minimal cardinality of the base set of such convex geometry is not yet known.
7 Geometries with colors
In this section, we propose a method of expanding the number of convex geometries which can be represented with circles in the plane by defining several unary predicates on the set of circles in representations. For visualization purposes unary predicates can be shown as colors.
7.1 An operator on systems with unary predicates
In this section we consider a general approach of defining a special operator on sets with unary predicates.
In general a -ary predicate on set is a subset of . In particular, for , a unary predicate is a subset of . Predicates are parts of the language of general algebraic systems, that may have, besides predicates, some functions defined on base set of a system. A unary predicate can distinguish elements from with a special property.
Suppose are unary predicates on set , thus, we think of as an algebraic predicate system. For every define .
Define an operator as follows:
Lemma 17.
is a closure operator on .
Proof.
Apparently, this operator is increasing and monotone. So we only need to check that it is idempotent: . Indeed, . ∎
The following example shows that does not necessarily satisfy the anti-exchange property.
Example 1.
Consider and , . Then One can check that the range of in is .
Note that does not satisfy the anti-exchange property: set covers in the lattice of closed sets, but the difference between the two subsets is 2 elements. ∎
Suppose now that we have another closure operator on . We then can define an associated operator on as follows:
Lemma 18.
is a closure operator. Moreover, , for any , therefore, all -closed sets are simultaneously -closed.
Proof.
Since both and are closure operators, so is operator , which incidentally equals the greatest lower bound of two operators on poset of closure operators on . In particular, for any . Therefore, every is also closed for . Indeed, , i.e., . ∎
The poset of closure operators on set was studied in J.B. Nation [13].
Unfortunately, operator might not satisfy the anti-exchange property, even if does. This is due to the earlier observation that may fail the anti-exchange property.
Example 2.
Consider 4-element base set and linear convex geometry with following convex sets: . Suppose and are two predicates on .
Then , because -closure is the whole set and . Thus, is -closed set. Moreover, is in , because is in together with , and is in . But the same is true when they are switched: is in . Thus, we can exchange elements and anti-exchange fails. This is shown by the fact that in the lattice of closed sets of from element to there is no progression by adding one element: one would jump by two elements . ∎
Example 3.
We could change the predicates on from Example 2 and get an extension of convex geometry in that example. Let , . Then , .
We verify that there are new closed sets for operator . Moreover, the operator is with the anti-exchange property. ∎
What was shown in Example 3 is possible to achieve for convex geometries given by circle configuration. Introducing one, two or three predicates to circle configuration, it is possible to represent all 5-element geometries that are not representable by circles only.
Example 4.
It was shown in Corollary 9 that G134 is not representable by circles. G134 is given by the following implications on :
The geometry on same set as circles, with closure operator , represented on Figure 21 satisfies these implications, except is not tight, and can be replaced by .
It can be checked directly that the family of closed sets of G134 has , which is not closed in .
We can introduce two predicates and on , which results in the following family of closed sets for operator :
Note that sets and are already closed in , and proper intersections of closed sets of with give , which are already -closed. Therefore, is the only new closed set of operator compared to . Moreover, set is -closed set, which is one-point extension of . This means that has exactly one more closed set than and it satisfies the anti-exchange property. ∎
7.2 Sufficient condition for representation with unary predicates
We are going to formulate a sufficient property of operator so that a closure system with operator can be expanded by -closed sets so that still satisfies the anti-exchange property. Let be the family of -closed sets.
Recall, say, from [6] that subset is called quasi-closed w.r.to operator , if it is not in and is closed under the intersection, i.e., it is a family of closed sets of another closure operator. Such property is equivalent to:
for all .
Lemma 19.
Suppose is a closure operator with the anti-exchange property defined on set , and operator is defined by unary predicates on . Assume that every -closed set is ether -closed or quasi-closed w.r.t. , and in latter case has one-element extension in . Then satisfies the anti-exchange property as well.
Proof.
-closed sets are of the form , where and is -closed. By the definition, it is either in , or it is . Thus only -closed sets may be added to the family of -closed sets. By assumption, all -closed sets have one-element extensions in , thus, adding them to will give us a closure system with one-point extension, which is equivalent to to satisfy the anti-exchange property. ∎
Revisiting Example 4, note that the closed sets of operator are
From these, only is not -closed. We check that all proper intersections of this set with -closed sets give , which are -closed. Therefore, is quasi-closed. It also has one-element extension among -closed sets. Therefore, Lemma 19 applies.
The next example shows that Lemma 19 allows some further generalization.
Example 5.
Consider representation of (id: 4294924159 in [14]) by circles with predicates given by implications
We start with representation of on 4-element set , with id:65303 from [14]. It is defined by implications

If we ignore color-predicates on Figure 22, then we get representation of G52(id: 4294907671 in [14]) on with implications
i.e., represent on , and is added so that does not participate in any implication.
We can introduce two predicates on : red and blue, where and , as on Figure 22. This gives the -closed sets:
This time, are closed in , while is neither closed nor quasi-closed, and intersections of with -closed sets give non-closed sets for :
All of these are quasi-closed w.r.t. , and they have one-point extensions in : , respectively. Similarly, has one-point extension in . Thus, sets can be added to preserving one-point extension property, which guarantees that has AEP.
Adding to -closed sets, make all subsets of -closed, but are still not closed, which gives needed implications describing :
This example shows that we can extend assumptions of Lemma 19 to sets that are the intersections of -closed and -closed sets, and obtain the same conclusion.
7.3 Geometry that requires more than 2 colors
In Appendix A we show colored representations of all convex geometries on 5-element set which cannot be represented by circles. Most of them require only one or two colors for representation by colored circles. Only one geometry, G18 requires three colors, which is demonstrated in this section.
Proposition 12.
Convex geometry G18 on 5-element set defined by implications:
cannot be represented by circles with coloring by at most two colors.
Proof.
Assume that we have representation of G18 by 5 circles with at most two colors and . Let be color sets of respectively. Since we have tight, and , by Corollary 8 we have either or and that hold by the convex hall operator on circles. We study both of these cases and show that we get to a contradiction.
Case 1: Assume that and hold. Since and by the convex hull operator, we need to have some color such that , and . Thus . Thus does not hold with the new operator, since and . This brings to the contradiction.
Case 2: . We further split it into two sub-cases:
Case 2.1: Suppose holds for the convex hall operator on circles. Since and by the convex hull operator, we need to have some color such that , and . Thus and does not hold with the new operator. This brings to the contradiction.
Case 2.2: Assume that . We use Corollary 8 again, relabelling b with c. Since tight, and , by Corollary 8 we have either or and . Now, since , we have and . Since and hold for the convex hull operator, we need to have some color such that , and . Thus . Thus, does not hold with the new operator, bringing to the contradiction. ∎
On the other hand, the representation with three colors is possible and it is shown on Figure LABEL:fig:G18.
8 Acknowledgments.
The paper follows up [14] completed by the team of 18 undergraduate and 2 graduate students in 2020, in the framework of PolyMath - 2020 project. We thank participants of the original project who continued to support the work of the current group in various capacities: Fernanda Yepez-Lopez, Rohit Pai and Stephanie Zhou.
Address for correspondence:
Kira Adaricheva, Department of Mathematics, Hofstra University, Hempstead NY, 11549
Email address: [email protected]
References
- [1] K. Adaricheva, B. Brubaker, P. Devlin, S. J. Miller, V. Reiner, A. Seceleanu, A. Sheffer, and Y. Zeytuncu, When life gives you lemons, make mathematicians, Notices of AMS, March 2021, 375–78.
- [2] K. Adaricheva, M. Bolat, Representation of finite convex geometries by circles on the plane, Discrete Mathematics v.342 (2019), N3, 726-746.
- [3] Adaricheva K.V., Gorbunov V.A., Tumanov V.I., Join-semidistributive lattices and convex geometries, Advances in Mathematics 173(2003), 1-49.
- [4] K. Adaricheva, J.B.Nation, Convex geometries, in Lattice Theory: Special Topics and Applications, v.2, G. Grätzer and F. Wehrung, eds. Springer, Basel, 2016.
- [5] K. Adaricheva, J.B.Nation, Bases in closure systems, in Lattice Theory: Special Topics and Applications, v.2, G. Grätzer and F. Wehrung, eds. Springer, Basel, 2016.
- [6] N. Caspard and B. Monjardet, The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey, Disc. Appl. Math. 127 (2003), 241–269.
- [7] G. Czédli, Finite Convex Geometries of Circles. Discrete Mathematics 330 (2014), 61–75.
- [8] M.G.Dobbins, A.Holmes, A.Hubard, Regular systems of paths and families of convex sets in convex position, Trans. AMS 368 (2016), N5, 3271–3303.
- [9] P.H. Edelman and R.E. Jamison, The Theory of Convex Geometries. Geom Dedicata 19 (1985), 247–274.
- [10] P.H. Edelman and M. Saks, Combinatorial representation and convex dimension of convex geometries. Order 5 (1988), 23–32.
- [11] GeoGebra Toolkit https://www.geogebra.org/classic/dk88mrgu
- [12] J. Kincses, On the representation of finite convex geometries with convex sets, Acta Sci. Math.83 (2017).
- [13] J.B.Nation, Closure operators and lattice extensions. Order 21 (2004), 43–48.
- [14] PolyMath REU-2020, Convex geometries representable by at most 5 circles on the plane, arxiv: 2008.13077