matroids on the bases of simple matroids

3
Burop. I. Combinatorics (1981) 2, 61-63 Matroids on the Bases of Simple Matroids BERNT LINDSTROM Let M be a simple matroid ( = combinatorial geometry). On the bases of M we consider two matroids S(M, F) and H(M, F), which depend on a field F. S(M, F) is the simplicial matroid with coefficients in F on the bases of M considered as simplices. H(M, F) has been studied by Bjiirner in [1]. It is defined in terms of the order homology of the associated geometric lattice L(M). We prove that H(M, F) is a minor contraction of the full simplicial matroid on all subsets of elements of size r = r(M). Dually this is equivalent to an isomorphism H(M, F)* "" S(M*, F), where M* denotes the dual of M. It can be deduced that H(M, F) need not be unimodular, a problem in [1], which inspired this study. Consider a simple matroid M, i.e. a matroid without loops and parallel elements (d. [10, p. 51]), sometimes called a combinatorial geometry (d. [5]). The independent sets of M form a simplicial complex IN(M) the homology of which is determined explicitly in [2], where Bjorner proves that it-1(IN(M)) is free of rank ';'(M*) and H;(IN(M)) = 0 for i :I: r -1, where r is the rank of M and';' (M*) is the Mobius invariant of M*, the dual of M. The full simplicial matroid on all r-subsets of a finite set E with coefficients in a field F is denoted by A vector representation is given by the mapping , A = {al, a2,' .. , a,}-+ L (-l);-l(al, ... , a;, ... , a,) = a(A) ;=1 (1) into the chain-group with coefficients in F generated by all oriented (r -1)-tuples of elements in E (d. [3]). Its rank-function is given by r(X) = Ixl- rank H,-l(X, F), where X E e;) and the homology group is with respect to the simplicial complex generated by X and coefficients in F. If M is a matroid of rank r on E we may consider the restriction of to the set 00 s;: (-;) of bases in M. This simplicial matroid will be denoted by S(M, F). It follows by the above mentioned result of Bjorner on the homology of IN(M) using the universal coefficient theorem of homology theory rank S (M, F) = b (M) - ,;, (M*). (2) Let L = L(M) be the geometric lattice associated with M. The supremum operation in L will be denoted by v. The partial order in L is denoted by <. The unique minimal and maximal elements of L are denoted by ° and 1. The linearly « )-ordered subsets of L -{a, 1} give a simplicial complex .:i(L), the homology of which was determined by Folkman in [7]. Folkman proved that H,-2(.:i(L)) is free of rank ';'(M) = IIL(O, 1)1 and H;(.:i(L)) = 0 for i:l: r - 2 (reduced homology over the integers). When A = {a 1, a2, ... , a,} is an r-set of elements in M let P(A) = L (-1);("')(a".(1), a".(l) v a".(2)' ... , a".(1) v a".(2) v ... va".(,-o) (3) ". where the sum is over all permutations 7T(1), 7T(2), ... , 7T(r) of the indices 1, 2, ... , rand i (7T) is the number of inversions of the permutation. Bjorner proved in [1] that P(A) is a cycle when A is a base of M and that these cycles generate the non-trivial homology group H,-2(.:i(L)). There is a similar result in [9, Theorem 4.3] by Orlik and Solomon. 61 0195-6698/81/010061 + 03 $01.00/0 © 1981 Academic Press Inc. (London) Limited

Upload: bernt

Post on 25-Dec-2016

216 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Matroids on the Bases of Simple Matroids

Burop. I. Combinatorics (1981) 2, 61-63

Matroids on the Bases of Simple Matroids

BERNT LINDSTROM

Let M be a simple matroid ( = combinatorial geometry). On the bases of M we consider two matroids S(M, F) and H(M, F), which depend on a field F. S(M, F) is the simplicial matroid with coefficients in F on the bases of M considered as simplices. H(M, F) has been studied by Bjiirner in [1]. It is defined in terms of the order homology of the associated geometric lattice L(M). We prove that H(M, F) is a minor contraction of the full simplicial matroid on all subsets of elements of size r = r(M). Dually this is equivalent to an isomorphism H(M, F)* "" S(M*, F), where M* denotes the dual of M. It can be deduced that H(M, F) need not be unimodular, a problem in [1], which inspired this study.

Consider a simple matroid M, i.e. a matroid without loops and parallel elements (d. [10, p. 51]), sometimes called a combinatorial geometry (d. [5]). The independent sets of M form a simplicial complex IN(M) the homology of which is determined explicitly in [2], where Bjorner proves that it-1(IN(M)) is free of rank ';'(M*) and H;(IN(M)) = 0 for i :I: r -1, where r is the rank of M and';' (M*) is the Mobius invariant of M*, the dual of M.

The full simplicial matroid on all r-subsets of a finite set E with coefficients in a field F is denoted by S~[F]. A vector representation is given by the mapping

, A = {al, a2,' .. , a,}-+ L (-l);-l(al, ... , a;, ... , a,) = a(A)

;=1 (1)

into the chain-group with coefficients in F generated by all oriented (r -1)-tuples of elements in E (d. [3]). Its rank-function is given by r(X) = Ixl- rank H,-l(X, F), where X E e;) and the homology group is with respect to the simplicial complex generated by X and coefficients in F.

If M is a matroid of rank r on E we may consider the restriction of S~[F] to the set 00 s;: (-;) of bases in M. This simplicial matroid will be denoted by S(M, F). It follows by the above mentioned result of Bjorner on the homology of IN(M) using the universal coefficient theorem of homology theory

rank S (M, F) = b (M) - ,;, (M*). (2)

Let L = L(M) be the geometric lattice associated with M. The supremum operation in L will be denoted by v. The partial order in L is denoted by <. The unique minimal and maximal elements of L are denoted by ° and 1. The linearly « )-ordered subsets of L -{a, 1} give a simplicial complex .:i(L), the homology of which was determined by Folkman in [7]. Folkman proved that H,-2(.:i(L)) is free of rank ';'(M) = IIL(O, 1)1 and H;(.:i(L)) = 0 for i:l: r - 2 (reduced homology over the integers).

When A = {a 1, a2, ... , a,} is an r-set of elements in M let

P(A) = L (-1);("')(a".(1), a".(l) v a".(2)' ... , a".(1) v a".(2) v ... va".(,-o) (3) ".

where the sum is over all permutations 7T(1), 7T(2), ... , 7T(r) of the indices 1, 2, ... , rand i (7T) is the number of inversions of the permutation.

Bjorner proved in [1] that P(A) is a cycle when A is a base of M and that these cycles generate the non-trivial homology group H,-2(.:i(L)). There is a similar result in [9, Theorem 4.3] by Orlik and Solomon.

61 0195-6698/81/010061 + 03 $01.00/0 © 1981 Academic Press Inc. (London) Limited

Page 2: Matroids on the Bases of Simple Matroids

62 B. Lindstrom

We now define a second matroid H(M, F) on the bases A E ~ by the vector represen­tation A -+ I3(A) with coefficients in F. By the above mentioned results of Folkman, Bjorner, Orlik and Solomon, it follows using the universal coefficient theorem

rank H(M, F) = ,1 (M). (4)

THEOREM. Assume that M = M(E) and M* are simple matroids. Let ~ be the set of bases of M and suppose that rank M = r. Then H(M, F) = S~[F]/«;) - fRI), where the correspondence is the identity map. Dually H(M, F)* = S(M*, F), where the correspondence is B - E - B when B E fRI.

. E PROOF. When A = {at. ... , a,-l} E (, -1) define

u(A) = L (_1r- I+i(1I')(a".(l), a1l'(l) v a".(2)o ••• , a1l'(1) v ••• va1l'(,-l),

where the sum is over all permutations 7T of 1, ... , r -1. It is easy to verify that

u(a(B» = I3(B) when BE(J.

By the lemma of Orlik and Solomon [9, Lemma 3.8] is

I3(B) = 0 when B is dependent of size r in M.

(5)

(6)

Let Vt. V2 , V3 be the vector spaces over the field F generated respectively by {a(B): BE (;)}, {a(B): BE (;) - ~}, {a(B): B E ~}.

The map u: VI -+ V3 is linear. Since u(V2 ) = 0 by (6), we have the induced linear map (j: V'; V 2 -+ V3. It follows that the identity is a strong map of S~[F]/«;) -~) onto H(M, F). The isomorphism will follow from

rank S;[F]/ (( J -~) = rank H(M, F) (7)

by a well known theorem on strong maps. By "Tutte's law" (M/ A)* = M* - A and since (S~)* "'" Srcl-n we have

S;[F]/ ( ( J -~) = (Srcl-,[F](fRI'»* = S(M*, F)*, (8)

where ~' = {E - B: B E ~}. The relation (7) follows by (2), (4) and (8). Therefore the first isomorphism in our theorem is true. The second isomorphism then follows by (8).

EXAMPLE. Let M be the uniform matroid of rank rand \EI = n, U~, 2:,;;; r:';;; n - 2. Then S(U~, F) = S~[F). By our theorem it follows H(U~, F) == S~[F], which is uni­modular ( = regular) if and only if k = 2 or n - 2 (cf. [4, 8]).

ACKNOWLEDGEMENT

I am indebted to a referee for a neat transformation of my first proof into a shorter one.

REFERENCES

1. A. Bjorner, On the homology of geometric lattices, Algebra Universalis. to appear. 2. A. Bjorner, Homology of matroids (to appear in [6)).

Page 3: Matroids on the Bases of Simple Matroids

Matroids on bases 63

3. R. Cordovil, Sur les geometries simpliciales, C.R. Acad. Sci. Paris Sir. A 286 (1978), 1219-1222. 4. R. Cordovil and M. Las Vergnas, Geometries simpliciales unimodulaires, Discrete Math. 26 (1979),

213-217. 5. H. Crapo and G.-c. Rota, Combinatorial Geometries, M.LT. Press, Cambridge, Massachusetts, 1970. 6. H. Crapo, G.-C. Rota and N. White, Combinatorial Geometries: the Theory of Matroids, to appear. 7. J. Folkman, The homology groups of a lattice, J. Math. Mech. 15 (1966), 631-636. 8. B. Lindstrom, Non-regular simplicial matroids, Discrete Math. 28 (1979),101-102. 9. P. Orlik and L. Solomon, Combinatorics and topology of complements of hyperplanes, Invent. Math. 56

(1980),167-189. 10. D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.

Received 1 September 1980 and in revised form 20 October 1980

B. LINDSTROM

Department of Mathematics, University of Stockholm, Box 6701, S-113 85 Stockholm, Sweden