Elastic Elements in -Connected Matroids
Abstract
It follows by Bixby’s Lemma that if is an element of a -connected matroid , then either , the cosimplification of , or , the simplification of , is -connected. A natural question to ask is whether has an element such that both and are -connected. Calling such an element “elastic”, in this paper we show that if , then has at least four elastic elements provided has no -element fans and, up to duality, has no -separating set that is the disjoint union of a rank- subset and a corank- subset of such that is isomorphic to a member or a single-element deletion of a member of a certain family of matroids.
1 Introduction
A result widely used in the study of -connected matroids is due to Bixby [1]: if is an element of a -connected matroid , then either or has no non-minimal -separations, in which case, , the cosimplification of , or , the simplification of , is -connected. A -separation is minimal if . This result is commonly referred to as Bixby’s Lemma. Thus, although an element of a -connected matroid may have the property that neither nor is -connected, Bixby’s Lemma says that at least one of and is close to being -connected in a very natural way. In this paper, we are interested in whether or not there are elements in such that both and are -connected, in which case, we say is elastic. In general, a -connected matroid need not have any elastic elements. For example, all wheels and whirls of rank at least four have no elastic elements. The reason for this is that every element of such a matroid is in a -element fan and, geometrically, every -element fan is positioned in a certain way relative to the rest of the elements of the matroid. However, -element fans are not the only obstacles to having elastic elements.
Let , and let be a basis of . Suppose that is a line that is freely placed relative to . For each , let be the unique point of contained in the hyperplane spanned by . Let , and let denote the restriction of to . Note that is -connected and is a corank- subset of . For all , we denote the matroid by . The matroid is well defined as, up to isomorphism, for all . For the interested reader, the matroid underlies the matroid operation of segment-cosegment exchange [6] which generalises the operation of delta-wye exchange. A more formal definition of is given in Section 5.
If , then is isomorphic to . However, for all , the matroid has no -element fans and, also, no elastic elements. Furthermore, for all , the set is a modular flat of [6]. Thus, if is a matroid and is a subset of such that , then the generalised parallel connection of and exists. In particular, it is straightforward to construct -connected matroids having no -element fans and no elastic elements. For example, take and repeatedly use the generalised parallel connection to “attach” copies of , where , to any -element subset of the elements of .
Let be a -connected matroid, and let and be rank- and corank- subsets of . We say that is a -separator of if and , and either or is isomorphic to one of the matroids and for some . We will show in Section 5 that if is a -separator of , then contains at most one elastic element. Note that if , then is -connected for all , while if , then is -connected for all . The main theorem of this paper is that, alongside -element fans, -separators are the only obstacles to elastic elements in -connected matroids.
A -separation of a matroid is vertical if . Now, let be a matroid and let be a partition of . We say that is a vertical -separation of if and are both vertical -separations and . Furthermore, is maximal in this separation if there exists no vertical -separation of such that is a proper subset of . Essentially, all of the work in the paper goes into establishing the following theorem.
Theorem 1.
Let be a -connected matroid with a vertical -separation such that is maximal. Then at least one of the following holds:
-
(i)
contains at least two elastic elements;
-
(ii)
is a -element fan; or
-
(iii)
is contained in a -separator.
Note that, in the context of Theorem 1, if is a -element fan, then it is possible that contains two elastic elements. For example, consider the rank- matroids and for which geometric representations are shown in Fig. 1. For each , the tuple is a -element fan of and is a vertical -separation of . In , none of , , and are elastic, while in , both and are elastic. However, provided is a maximal fan, the instance illustrated in Fig. 1(i) is essentially the only way in which does not contain two elastic elements. This is made more precise in Section 3. As noted above, if is contained in a -separator, then contains at most one elastic element. The details of the way in which this happens is given in Section 5.
An almost immediate consequence of Theorem 1 is the following corollary.
Corollary 2.
Let be a -connected matroid. If , then contains at least four elastic elements provided has no -element fans and no -separators. Moreover, if , then every element of is elastic.
The condition in Corollary 2 that has no -element fans and no -separators is not necessarily that restrictive. For example, if is an excluded minor for -representability (or, more generally, for -representability, where is a partial field), then has no -element fans and no -separators. The fact that has no -element fans is well known and straightforward to show. To see that has no -separators, suppose that has a -separator. By duality, we may assume that has rank- and corank- sets and , respectively, such that is isomorphic to either or , for some . Say is isomorphic to . Then the matroid obtained from by a cosegment-segment exchange on is isomorphic to the matroid obtained from by deleting and, for each , adding an element in parallel to . It is shown in [6, Theorem 1.1] that the class of excluded minors for -representability (or, more generally, -representability) is closed under the operation of cosegment-segment exchange, and so is also an excluded minor for -representability. But contains elements in parallel, a contradiction. The same argument holds if is isomorphic to except that, in applying a cosegment-segment exchange, we additionally add an element freely in the span of .
Like Bixby’s Lemma, Corollary 2 is an inductive tool for handling the removal of elements of -connected matroids while preserving connectivity. The most well-known examples of such tools are Tutte’s Wheels-and-Whirls Theorem [9] and Seymour’s Splitter Theorem [8]. In both theorems, this removal preserves -connectivity. More recently, there have been analogues of these theorems in which the removal of elements preserves -connectivity up to simplification and cosimplification. These analogues have additional conditions on the elements being removed. Let be a basis of a -connected matroid , and suppose that has no -element fans. Say is representable over some field and that we are given a standard representation of over . To keep the information displayed by the representation in an -representation of a single-element deletion or a single element contraction of , we need to avoid pivoting. To do this, we want to either contract an element in or delete an element in . Whittle and Williams [11] showed that if , then has at least four elements such that either is -connected if or is -connected if . Brettell and Semple [2] establish a Splitter Theorem counterpart to this last result where, again, -connectivity is preserved up to simplification and cosimplification. These last two results are related to an earlier result of Oxley et al. [5]. Indeed, the starting point for the proof of Theorem 1 is [5].
The paper is organised as follows. The next section contains some necessary preliminaries on connectivity, while Section 3 considers fans and determines exactly which elements of a fan are elastic. Section 4 establishes two results concerning when an element in a rank- restriction of a -connected matroid is deletable or contractible, and Section 5 considers -separators, and determines the elasticity of the elements of these sets. Section 6 consists of the proofs of Theorem 1 and Corollary 2. Effectively, all of the work that proves these two results goes into proving Theorem 1. We break the proof of Theorem 1 into two lemmas depending on whether or not contains at least one element that is not contractible. The statements of these lemmas, Lemma 17 and Lemma 18, provide additional structural information when is contained in a -separator. Throughout the paper, the notation and terminology follows [3].
2 Preliminaries
Connectivity
Let be a matroid with ground set and rank function . The connectivity function of is defined on all subsets of by
Equivalently, . A subset of or a partition is -separating if and exactly -separating if . A -separating partition is a -separation if . A matroid is -connected if it has no -separations for all .
Let be an element of a -connected matroid . We say is deletable if is -connected, and is contractible if is -connected. Thus, is elastic if it is both deletable and contractible.
Two -separations and cross if each of the intersections , , , are non-empty. The next lemma is a standard tool for dealing with crossing separations. It is a straightforward consequence of the fact that the connectivity function of a matroid is submodular, that is,
for all . An application of this lemma will be referred to as by uncrossing.
Lemma 3.
Let be a -connected matroid, and let and be -separating subsets of .
-
(i)
If , then is -separating.
-
(ii)
If , then is -separating.
The next five lemmas are used frequently throughout the paper. The first follows from orthogonality, while the second follows from the first. The third follows from the first and second. A proof of the fourth and fifth can be found in [10] and [2], respectively.
Lemma 4.
Let be an element of a matroid , and let and be disjoint sets whose union is . Then if and only if .
Lemma 5.
Let be an exactly -separating set in a -connected matroid , and suppose that . Then is -separating if and only if .
Lemma 6.
Let be an exactly -separating partition of a -connected matroid , and suppose that and . Then is exactly -separating if and only if is in exactly one of and .
Lemma 7.
Let be a rank- cocircuit of a -connected matroid . If has the property that contains a triangle of , then is -connected.
Lemma 8.
Let be a -separation of a -connected matroid . If and , then .
Vertical connectivity
A -separation of a matroid is vertical if . As noted in the introduction, we say a partition of is a vertical -separation of if and are both vertical -separations of and . Furthermore, is maximal if there is no vertical -separation of such that is a proper subset of . A -separation of is cyclic if both and contain circuits. The next lemma gives a duality link between the cyclic -separations and vertical -separations of a -connected matroid.
Lemma 9.
Let be a partition of the ground set of a -connected matroid . Then is a cyclic -separation of if and only if is a vertical -separation of .
Proof.
Suppose that is a cyclic -separation of . Then is a -separation of . Since is a -separation of a -connected matroid, is exactly -separating, and so . Therefore, as , it follows that
As contains a circuit, is dependent, so . Hence . By symmetry, , and so is a vertical -separation of . A similar argument establishes the converse. ∎
Following Lemma 9, we say a partition of the ground set of a -connected matroid is a cyclic -separation if is a vertical -separation of .
Of the next two results, the first combines Lemma 9 with a straightforward strengthening of [5, Lemma 3.1] and, in combination with Lemma 9, the second follows easily from Lemma 6.
Lemma 10.
Let be a -connected matroid, and suppose that . Then is not -connected if and only if has a vertical -separation . Dually, is not -connected if and only if has a cyclic -separation .
Lemma 11.
Let be a -connected matroid. If is a vertical -separation of , then is also a vertical -separation of . Dually, if is a cyclic -separation of , then is also a cyclic -separation of .
Note that an immediate consequence of Lemma 11 is that if is a vertical -separation such that is maximal, then must be closed. We will make repeated use of this fact.
3 Fans
Let be a -connected matroid. A subset of with at least three elements is a fan if there is an ordering of such that
-
(i)
for all , the triple is either a triangle or a triad, and
-
(ii)
for all , if is a triangle, then is a triad, while if is a triad, then is a triangle.
If , then the elements and are the ends of . Furthermore, if is a triangle, then is a spoke-end; otherwise, is a rim-end. Observe that if is a -element fan , then either or is the unique spoke-end of depending on whether or is a triangle, respectively. The proof of the next lemma is straightforward and omitted.
Lemma 12.
Let be a -connected matroid, and suppose that is a -element fan of with spoke-end . Then is a vertical -separation of provided , in which case, is maximal.
We end this section by determining when an element in a fan of size at least four is elastic. For subsets and of a matroid, the local connectivity between and , denoted , is defined by
Let be a -connected matroid and let be a positive integer. A flower of is an (ordered) partition of such that each has at least two elements and is -separating, and each is -separating, where all subscripts are interpreted modulo . If , we say is swirl-like if is exactly -separating for all proper subsets of whose members form a consecutive set in the cyclic order , and
for all distinct . For further details of swirl-like flowers and, more generally flowers, we refer the reader to [4].
Lemma 13.
Let be a -connected matroid such that , and let be a maximal fan of .
-
(i)
If , then contains no elastic elements of .
-
(ii)
If , then contains either exactly one elastic element, namely , or no elastic elements of .
-
(iii)
If , then contains either exactly two elastic elements, namely and , or no elastic elements of .
Moreover, if and contains no elastic elements, then, up to duality, has a swirl-like flower as shown geometrically in Fig. 2, or and there is an element such that .
Proof.
It follows by Lemma 12 that the ends of a -element fan in are not elastic. Thus, if , then, as every element of is the end of a -element fan, contains no elastic elements, and if , then, as every element of , except , is the end of a -element fan, contains no elastic elements except possibly . Thus (i) and (ii) hold, and we assume that . By applying the dual argument if needed, we may also assume that is a triangle.
13.1.
If is contractible, then is elastic unless and there is an element such that , or and is not contractible.
Suppose that is contractible. If is not elastic, then is not -connected. First assume that . Then, as is the end of a -element fan, is not -connected, and so, by Bixby’s Lemma, is -connected. By orthogonality, is the unique triad containing , and so . But then is -connected unless there is an element such that is a triangle of , in which case . Now assume that . If is contained in a triad other than , then, by orthogonality, either or is contained in . If , then is not maximal, a contradiction. Thus . But then has corank and so, as is -connected, is a triad, contradicting orthogonality. Thus, as is maximal, is the unique triad containing . Hence . Thus and so, as is not -connected, is not contractible. This completes the proof of (13.1).
Since is also a fan ordering for if , it follows by (13.1) that we may now assume is not -connected. We next complete the proof of the lemma for when . The remaining part of the lemma for when is proved similarly and is omitted.
As is not -connected, it follows by Lemma 10 that
is a vertical -separation of , where and . Say , where . Then is a triad, and so is a -element fan, contradicting the maximality of . Thus . Since and are -separating in , it follows by uncrossing that is -separating in . Similarly, is -separating in . Hence
is a flower . Since , it follows by [4, Theorem 4.1] that
To show that is a swirl-like flower, it remains to show that
If , then, as , it follows that . But then , a contradiction. Thus . Furthermore, . Assume that . Then, as ,
and so is -separating in , a contradiction. Thus , and so . To see that , first assume that . Then, as ,
and so is -separating in . This contradiction implies that . It follows that , that is . We deduce that is a swirl-like flower. Lastly, as and , it follows that is a cyclic -separation of , and so is not -connected, that is, is not elastic. Hence (iii) holds. ∎
4 Elastic Elements in Segments
Let be a matroid. A subset of of size at least two is a segment if is isomorphic to a rank- uniform matroid. In this section we consider when an element in a segment is deletable or contractible. We begin with the following elementary lemma.
Lemma 14.
Let be a segment of a -connected matroid . If has at least four elements, then is -connected for all .
In particular, Lemma 14 implies that, in a -connected matroid, every element of a segment with at least four elements is deletable. We next determine the structure which arises when elements of a segment in a -connected matroid are not contractible.
Lemma 15.
Let be a -connected matroid, and suppose that is a rank- cocircuit of , where is a segment. If two distinct elements and of are not contractible, then there are distinct elements and of such that is a cocircuit for each .
Proof.
Let and be distinct elements of that are not contractible. For each , it follows by Lemma 10 that there exists a vertical -separation of such that , where . By Lemma 11, we may assume is closed, in which case, . Furthermore, for each , we may also assume, amongst all such vertical -separations of , that is minimised. If , then, as is a cocircuit, is contained in the hyperplane , and so . This contradiction implies that . Thus, for each , we deduce that has a vertical -separation
where and . Next we show the following.
15.1.
For each , we have .
Since is a cocircuit, the elements . But , and so . Thus, by the MacLane-Steinitz exchange property, .
15.2.
For each , we have , where .
By Lemma 11,
is a vertical -separation of . If , then, as , the segment is contained in . Therefore , and so . Since is contained in the hyperplane , it follows that , a contradiction. Thus (15.2) holds.
Since is -connected and is a vertical -separation, it follows by (15.1) that
Thus is a -separation of for each . We next show that
15.3.
.
Let . If , then
contradicting (15.2). Therefore, for , we have . Consider the -connected matroid . Since , it follows by uncrossing that is -separating in . But, by (15.1), and so is -separating in . Since is -connected, it follows that . Thus (15.3) holds.
Let and be the unique elements of and , respectively. Now and so, by uncrossing, and , as well as and , we see that and are -separating in . So
is a vertical -separation of unless . Since and are closed, is closed. Furthermore,
and so, by the minimality of , we have . Therefore, as and are both vertical -separations, and
it follows that is a cocircuit for each . Since , we have , thereby completing the proof of the lemma. ∎
5 Theta Separators
We begin this section by formally defining, for all , the matroid . Let , and let be the matroid whose ground set is the disjoint union of and , and whose circuits are as follows:
-
(i)
all -element subsets of ;
-
(ii)
all sets of the form , where ; and
-
(iii)
all sets of the form , where , , and are distinct elements of .
It is shown in [6, Lemma 2.2] that is indeed a matroid, and we denote this matroid by . If , then is isomorphic to the direct sum of and , while if , then is isomorphic to . Also, for all , the matroid is self-dual under the map that interchanges and for all [6, Lemma 2.1], and the rank of is . For all , we say and are partners. Furthermore, it is easily checked that, for all , we have . Up to isomorphism, we denote the matroid by . Observe that if , then is a -element fan. We refer to the elements in and as the segment elements and cosegment elements, respectively, of and .
Recalling the definition of a -separator, the next lemma considers the elasticity of elements in a -separator when . The analogous lemma for when is covered by Lemma 13. Observe that, if is -connected and is a -separator of such that for some , then
Lemma 16.
Let be a -connected matroid, and let . Suppose that is a -separator of . If , then contains no elastic elements of . Furthermore, if , then contains exactly one elastic element, namely the unique cosegment element of with no partner, unless there is an element of such that .
Proof.
Suppose that , where . Without loss of generality, we may assume that is the disjoint union of and , where and are as defined in the definition of . Let . As , the set is a circuit of . Now, as has corank , the circuit has corank , and so
So is -separating. Furthermore, and, by Lemma 4, . Thus, by Lemma 6, and so, as contains a triangle in ,
is a cyclic -separation of . Therefore, by Lemma 10, is not deletable. Moreover, as
is a vertical -separation of , it follows by Lemma 10 that is not contractible. Thus contains no elastic elements of .
Now suppose that , where . Without loss of generality, let be the disjoint union of and , where and are as defined in the definition of . Let . Then the argument in the last paragraph shows that
is a cyclic -separation of provided contains a circuit. If , then , and so contains a circuit. Assume that . Then, as , we have . Therefore, as , where , and is exactly -separating, it follows by Lemma 6 that . In particular, contains a circuit. Hence is not deletable. Furthermore, the argument in the previous paragraph shows that if , then is not contractible.
We complete the proof of the lemma by considering the elasticity of . Since , it follows by Lemma 14 that is contractible. Assume that is not deletable. Let such that . Then is a circuit of . Furthermore,
Therefore, as and all elements of are not deletable, the dual of Lemma 15 implies that there is an element such that is a circuit. But then, as , it follows that , and it is easily checked that , thereby completing the proof of the lemma. ∎
6 Proofs of Theorem 1 and Corollary 2
In this section, we prove Theorem 1 and Corollary 2. However, almost all of the section consists of the proof of Theorem 1. The proof of this theorem is essentially partitioned into two lemmas, Lemmas 18 and 19. Let be a -connected matroid with a vertical -separation such that is maximal. Lemma 18 establishes Theorem 1 for when contains at least one non-contractible element, while Lemma 19 establishes the theorem for when every element in is contractible.
To prove Lemma 18, we will make use of the following technical result which is extracted from the proof of Lemma 3.2 in [5].
Lemma 17.
Let be a -connected matroid with a vertical -separation such that is maximal. Suppose that is a vertical -separation of such that , , and is closed. Then each of the following holds:
-
(i)
None of , , , and are empty.
-
(ii)
.
-
(iii)
If , then is a rank- cocircuit.
-
(iv)
If , then .
Lemma 18.
Let be a -connected matroid with a vertical -separation such that is maximal. Suppose that at least one element of is not contractible. Then at least one of the following holds:
-
(i)
has at least two elastic elements;
-
(ii)
is a -element fan; or
-
(iii)
is contained in a -separator .
Moreover, if (iii) holds, then is a rank- cocircuit, is isomorphic to either or , where , and there is a unique element such that is a segment element of and is the set of cosegment elements of .
Proof.
Let be an element of that is not contractible. Then, by Lemma 10, there exists a vertical -separation of . Without loss of generality, we may assume . Furthermore, by Lemma 11, we may also assume that is closed. By Lemma 17, each of , , , and is non-empty. The proof is partitioned into two cases depending on the size of . Both cases use the following:
18.1.
If contains two contractible elements, then either has at least two elastic elements, or and there exists a triangle , where , , and .
By Lemma 17(ii), . Let and be distinct contractible elements of . If , then, by Lemma 14 each of and is elastic. Thus we may assume that and that either or , say , is not deletable. Let be a -separation of such that neither nor . Since is not deletable, such a separation exists. Furthermore, as and each contain a cycle. If or , then either or , respectively, is a -separation of , a contradiction. So and . Therefore, without loss of generality, we may assume and . Since is a -separation of and , we deduce that is a -separation of . Thus, as is contractible, is -connected, and so . In turn, as and are both closed, this implies that and ; otherwise, or . Thus and, in particular, is the desired triangle. Hence (18.1) holds.
We now distinguish two cases depending on the size of :
-
(I)
; and
-
(II)
.
Consider (I). Let be the unique element in . By Lemma 17, is a segment of at least three elements and is a rank- cocircuit. Let . As , we may assume that is closed.
18.2.
At most one element of is not contractible.
Suppose that at least two elements in are not contractible, and let be such an element. Then, by Lemma 15, there is an element distinct from such that is a rank- cocircuit. If , then and , contradicting Lemma 8. Thus . Since , it follows by Lemma 5 that each of and are exactly -separating. Furthermore, as , it follows by Lemma 6 that . Therefore
is a vertical -separation of . But then, as , we contradict the maximality of . Hence (18.2) holds.
If , then, by Lemma 14 and (18.2), , and more particularly , contains at least two elastic elements. Thus, as , we may assume , and so is a triad. Let and let .
18.3.
For each , the element is contractible.
If is not contractible, then, by Lemma 10, has a vertical -separation , where . By Lemma 11, we may assume that is closed. By Lemma 17, is non-empty and . First assume that . Then , and so is contained in a triangle . If , then, as is closed, . Thus and so, by orthogonality, as is a triad, . This contradicts . It now follows that and so . Thus, as is closed and , we have , and therefore . Let be the unique element in . Then, by Lemma 17 again, is a triad, and so . Furthermore, and , and so, by Lemma 8, we deduce that . This implies that . But then contains , contradicting that is closed. Now assume that . By Lemma 17, . If , then, as is closed, , and so is a triangle. Since is a triad, this contradicts orthogonality. Thus . Also, ; otherwise, as is closed, , a contradiction. By Lemma 17, is non-empty, and so has a triangle , where . As is a triad, contradicts orthogonality unless . But and therefore cannot be in . Hence is contractible, and so (18.3) holds.
Since and are both contractible, it follows by (18.1) that either contains two elastic elements or is in a triangle with two elements of . If the latter holds, then . As is a triad and is contained in , it follows that . Therefore
is a -separation of , a contradiction. Thus contains two elastic elements. This concludes (I).
Now consider (II). Let and . By parts (ii) and (iv) of Lemma 17, and are both segments. Since is -connected, is -separating, and is closed, it follows that is a rank- cocircuit of and is closed.
First assume that . Since is a rank- cocircuit of , we have . Therefore, as and , it follows that . Now, Lemma 14 implies that each element of is deletable. If , then, by Lemma 7, each element of is contractible, and so each element of is elastic. Since , it follows that has at least two elastic elements. Thus we may assume that , that is . We may also assume that contains at most one contractible element; otherwise, contains at least two elastic elements. Let denote the elements in . Without loss of generality, we may assume that if contains a contractible element, then it is . Let if is contractible; otherwise, let . Furthermore, let denote the unique element in . Since is a rank- cocircuit, and at most one element of is contractible, it follows by Lemma 15 that, for all , there are distinct elements of such that is a cocircuit. Let . As is in the coclosure of the -separating set , we have . It follows that is a cocircuit of for all distinct elements . By a comparison of the circuits of , it is straightforward to deduce that is isomorphic to either if no element of is contractible, or if is contractible. Hence is contained in a -separator of as described in the statement of the lemma.
We may now assume that . Let . If , then , and so is a triad. In turn, this implies that is a -element fan. Thus . Let and be distinct elements in . Since is a triangle in for each , it follows by Lemma 7 that is contractible for each . Thus, by (18.1), either contains two elastic elements, or and is in a triangle with two elements of . The latter implies that . As and is contained in , it follows that . Hence, as
we have , and so
is a -separation of , a contradiction. Thus contains two elastic elements. This concludes (II) and the proof of the lemma. ∎
Lemma 19.
Let be a -connected matroid with a vertical -separation such that is maximal. Suppose that every element of is contractible. Then at least one of the following holds:
-
(i)
has at least two elastic elements;
-
(ii)
is a -element fan; or
-
(iii)
is contained in a -separator .
Moreover, if (iii) holds, then is a circuit, is isomorphic to either or for some , and is a subset of the cosegment elements of .
Proof.
First suppose that is independent. Then, as and , we have . That is, is a segment in . As , it follows that either is a circuit for some , or is a circuit. If is a circuit, then either is a -element fan, or it is easily checked that is a vertical -separation, contradicting the maximality of . Thus we may assume that is a circuit of . Now, if two elements of are deletable, then contains at least two elastic elements, so we may assume that at most one element of is deletable. Assume first that is coclosed, and let . Without loss of generality, we may assume that if contains a deletable element, then it is . Let if is deletable; otherwise, let . Since has corank and is coclosed, it follows by the dual of Lemma 15 that, for all , there are distinct elements such that is a circuit. Let . Since is -separating and , it follows that . As every -element subset of is a cocircuit, it follows by orthogonality that is a circuit for all distinct . By a comparison with the circuits of , it is easily checked that is isomorphic to if , and is isomorphic to if , and so is contained in a -separator of as described in the statement of the lemma. Now assume that is not coclosed. Then, as is a corank- circuit, . Let , and denote the elements of as . Applying the previous argument to and recalling that is a circuit, we deduce that is again contained in a -separator of as described in the statement of the lemma.
Now suppose that is dependent, and let be a circuit in . As is -connected, . If every element in is deletable, then contains at least two elastic elements. Thus we may assume that there is an element, say , in that is not deletable. By Lemma 10, there exists a cyclic -separation in , where . By Lemma 11, we may also assume that is coclosed. Note that, as is a cyclic -separation, , and so .
We next show that
19.1.
.
If either or , then or , respectively, in which case either or is a -separation of , a contradiction. Thus and are both non-empty, and so . Say , where . Since is a circuit, . Therefore, as is closed and so , and is a -separation of , we have
Thus is a -separation of . Since every element in is contractible, is contractible, and so . Since , it follows that , and so , a contradiction as is closed. Hence . An identical argument interchanging the roles of and establishes that , thereby establishing (19.1).
Say . It follows by two application of uncrossing that each of and is -separating. Since and is -connected, and are exactly -separating. Therefore, by Lemma 5, or . Since , it follows by Lemma 4 that . So . Thus, if , then is a vertical -separation, contradicting the maximality of . Therefore . But then , a contradiction.
Now assume that . Say is empty. Then . Let be a cyclic -separation of such that with the property that there is no other cyclic -separation in which is a proper subset of . Observe that such a cyclic -separation exists as we can choose if necessary. If every element in is deletable, then, as and , it follows that has at least two elastic elements. Thus we may assume that there is an element in that is not deletable. By the dual of Lemma 18, either , and thus , contains at least two elastic elements or is a -element fan, or is contained in a -separator. If is a -element fan, then, by Lemma 12,
is a vertical -separation, where is the spoke-end of the -element fan . But then, as is non-empty, is properly contained in , contradicting maximality. If is contained in a -separator, then, by the dual of Lemma 18, is a circuit and there is an element of such that is a cosegment. But then
is a vertical -separation of , contradicting the maximality of as is properly contained in . Hence we may assume that .
Let Since , we have and so, by two applications of uncrossing, and are both -separating. Since is -connected and , these sets are exactly -separating. If , then, by Lemma 4, . But then is not coclosed, a contradiction. Thus , and so . Now , and so . Hence as and, therefore, the complement is -separating, Lemma 5 implies that . Therefore, as and each have rank at least three, it follows that is a vertical -separation of . Note that ; otherwise, , in which case, is not closed. But is a proper subset of , a contradiction to the maximality of . This last contradiction completes the proof of the lemma. ∎
Proof of Theorem 1.
Let be a vertical -separation of , where is maximal, and suppose that is not a -element fan and is not contained in a -separator. If at least one element in is not contractible, then, by Lemma 18, contains at least two elastic elements. On the other hand if every element in is contractible, then by Lemma 19, again contains at least two elastic elements. This completes the proof of the theorem. ∎
We end the paper by establishing Corollary 2.
Proof of Corollary 2.
Let be a -connected matroid. If every element of is elastic, then the corollary holds. Therefore suppose that has at least one non-elastic element, say. Up to duality, we may assume that is not -connected. Then, by Lemma 10, has a vertical -separation . As , this implies that , and so we deduce that every element in a -connected matroid with at most six elements is elastic. Now, suppose that has no -element fans and no -separators, and let be a vertical -separation such that is maximal and contains . Then it follows by Theorem 1 that , and hence , contains at least two elastic elements. Interchanging the roles of and , an identical argument gives us that also contains at least two elastic elements. Thus, contains at least four elastic elements. ∎
Acknowledgments
The authors thank the referee for their comments. The fourth author was supported by the New Zealand Marsden Fund.
References
- [1] Bixby R.: A simple theorem on -connectivity, Linear Algebra Appl. 45 (1982), 123-126.
- [2] Brettell N,. Semple C .: A splitter theorem relative to a fixed basis, Ann. Comb. 18 (2014), 1-20.
- [3] Oxley, J.: Matroid Theory, Second edition, Oxford University Press, New York, 2011.
- [4] Oxley J., Semple C., Whittle G.: The structure of the -separations of -connected matroids, J. Combin. Theory Ser. B 92 (2004), 257–293.
- [5] Oxley J., Semple C., Whittle G.: Maintaining 3-connectivity relative to a fixed basis, Adv. in Appl. Math. 41 (2008), 1–9.
- [6] Oxley J., Semple C., Vertigan D.: Generalized exchange and -regular matroids, J. Combin. Theory Ser. B 79 (2000), 1–65.
- [7] Oxley J., Wu H.: On the structure of 3-connected matroids and graphs, European J. Combin. 21 (2000), 667-688.
- [8] Seymour, P.D.: Decomposition of regular matroids, J. Combin. Theory Ser. B 28 (1980), 305–359.
- [9] Tutte, W.T.: Connectivity in matroids, Canad. J. Math. 18 (1966), 1301–1324.
- [10] Whittle G.: Stabilizers of classes of representable matroids, J. Combin. Theory Ser. B 77 (1999) 39–72.
- [11] Whittle G., Williams A.: On preserving matroid 3-connectivity relative to a fixed basis, European J. Combin. 34 (2013), 957-967.