A remark on the paper "Properties of intersecting families of ordered sets" by O. Einstein
Sang-il Oum, Sounggun Wee

TL;DR
This paper discusses a correction to a previous theorem on intersecting families of ordered sets and subspaces, providing two weaker variants due to an identified mistake in the original proof.
Contribution
It identifies a mistake in Einstein's original proof and offers two alternative weaker theorems for intersecting families of ordered subspaces.
Findings
Original theorem's proof contains a mistake.
Two weaker variants of the theorem are proven.
Clarifies the limitations of the original results.
Abstract
O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker variants.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A remark on the paper “Properties of intersecting families of ordered sets”
by O. Einstein
Sang-il Oum [email protected] by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. NRF-2017R1A2B4005020). Department of Mathematical Sciences, KAIST, Daejeon, South Korea.
Sounggun Wee [email protected] Department of Mathematical Sciences, KAIST, Daejeon, South Korea.
Abstract
O. Einstein (2008) proved Bollobás-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker variants.
1 Introduction
The following theorem generalizing the theorem of Bollobás [2] is well known and proved by using the wedge product method (see [1]).
Theorem 1** (Lovász [6]; skew version).**
Let , be positive integers. Let , be subspaces satisfying the following:
- (i)
* and for all .* 2. (ii)
* for all .* 3. (iii)
* for all .*
Then .
Ori Einstein [3] published a paper on a generalization of the above theorem and its consequence on finite sets by Frankl [4]. We will show that his proof of Theorem 2.7 in [3] is incorrect and so we state it as a conjecture.
Conjecture 1** (Theorem 2.7 of [3]).**
Let , , , be positive integers. Let be a linear space over a field . Consider the following matrix of subspaces:
[TABLE]
If these subspaces satisfy:
- (i)
for every , , ; 2. (ii)
for every fixed , all subspaces are pairwise disjoint; 3. (iii)
for each , there exist some such that ;
then
[TABLE]
Here is the overview of this note. In the next section, we will sketch the reason why the proof of Theorem 2.7 in [3] is incorrect and present a weaker theorem (Theorem 3) obtained by tightening condition (ii). In Section 3, we prove another weaker theorem (Theorem 4), by providing a weaker upper bound for instead of modifying any assumptions. Section 4 will discuss the threshold versions.
2 The mistake and its first remedy
Let us first point out the mistake in the proof of Conjecture 1 in [3]. As it is typical in the wedge product method, we take and for some linear transformations , , , . Then the following claim is made:
Claim** (Page 41 in [3]).**
For every , if and only if .
This claim is false in general. For instance, if , then and therefore . The crucial mistake is that condition (ii) in Conjecture 1 does not imply that . (For instance the spans of , , and are pairwise disjoint and yet their sum has dimension only.)
If , then the claim is true and so we can recover the following weaker theorem by the proof in [3].
Theorem 2**.**
Let , , , be positive integers. Let be a linear space over a field . Consider the following matrix of subspaces:
[TABLE]
If these subspaces satisfy:
- (i)
for every , , ; 2. (ii)
for every fixed , ; 3. (iii)
for each , there exist some such that ;
then
[TABLE]
Though Theorem 2 is weaker than Conjecture 1, it allows us to recover Theorem 2.8 of [3].
Theorem 3** (Theorem 2.8 of [3]).**
Let , , , be positive integers. Consider the following matrix of sets:
[TABLE]
If these sets satisfy:
- (i)
for every , , ; 2. (ii)
for every fixed , all sets are pairwise disjoint; 3. (iii)
for each , there exist some such that ;
then
[TABLE]
Note that Theorem 3 implies that Conjecture 1 is true when .
3 Second remedy
Naturally we ask whether Conjecture 1 can be proven with some upper bound on . Here we show that this is possible, while generalizing Theorem 1.
Theorem 4**.**
Under the same assumptions of Conjecture 1, we have
[TABLE]
Proof.
We may assume that for all , and is infinite. Let be a -dimensional vector space over , decomposed into the direct sum of subspaces , each of dimension . By Corollary 3.14 of [1], for all , there exists a linear transformation such that for all , , , and for all . Finally, for each , let and .
We claim that for , if and only if . If , then there exist such that . By the choice of , and so , which implies that . If , then is the wedge product of disjoint subspaces and so .
Therefore are linearly independent in the space , whose dimension is . This proves that . ∎
4 Threshold versions
The paper [3] uses Conjecture 1 to deduce the threshold versions (Lemma 2.9 and Theorem 2.10) to generalize a result of Füredi [5]. We do not know how to prove Lemma 2.9 and Theorem 2.10 of [3] and so we leave them as conjectures. It is not clear how one can relax conditions in Lemma 2.9 and Theorem 2.10 of [3], while avoiding ugly conditions from (ii) of Theorem 3. (A necessary condition was missing in [3].)
Conjecture 2** (Lemma 2.9 of [3]).**
Let , , , be positive integers such that for all . Let be a linear space over a field . Consider the following matrix of subspaces:
[TABLE]
If these subspaces satisfy:
- (i)
for every , , ; 2. (ii)
for every fixed , ; 3. (iii)
for each , there exists some such that ;
then
[TABLE]
Conjecture 3** (Theorem 2.10 of [3]).**
Let , , , be positive integers such that for all . Consider the following matrix of sets:
[TABLE]
If these sets satisfy:
- (i)
for every , , ; 2. (ii)
for every , and , ; 3. (iii)
for each , there exists some such that ;
then
[TABLE]
By using Theorem 4, we can prove the following weaker variants of Conjectures 2 and 3 by the same reduction in [3].
Theorem 5**.**
Under the same assumptions of Conjecture 2, we have
[TABLE]
Theorem 6**.**
Under the same assumptions of Conjecture 3, we have
[TABLE]
Acknowledgement
The author would like to thank students attending the graduate course on combinatorics in the spring semester of 2017; they pointed out the difficulty, when they were given Conjecture 1 for as a homework problem. We also like to thank the anonymous referees for their helpful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Babai and P. Frankl. Linear algebra methods in combinatorics . Department of Computer Science, The University of Chicago, September 1992.
- 2[2] B. Bollobás. On generalized graphs. Acta Math. Acad. Sci. Hungar , 16:447–452, 1965.
- 3[3] O. Einstein. Properties of intersecting families of ordered sets. Combinatorica , 28(1):37–44, 2008.
- 4[4] P. Frankl. An extremal problem for two families of sets. European J. Combin. , 3(2):125–127, 1982.
- 5[5] Z. Füredi. Geometrical solution of an intersection problem for two hypergraphs. European J. Combin. , 5(2):133–136, 1984.
- 6[6] L. Lovász. Flats in matroids and geometric graphs. In Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham, 1977) , pages 45–86. Academic Press, London, 1977.
