Matroid representation explained

In the mathematical theory of matroids, a matroid representation is a family of vectors whose linear independence relation is the same as that of a given matroid. Matroid representations are analogous to group representations; both types of representation provide abstract algebraic structures (matroids and groups respectively) with concrete descriptions in terms of linear algebra.

A linear matroid is a matroid that has a representation, and an F-linear matroid (for a field F) is a matroid that has a representation using a vector space over F. Matroid representation theory studies the existence of representations and the properties of linear matroids.

Definitions

(E, l{I}) is defined by a finite set E (the elements of the matroid) and a non-empty family l{I} of the subsets of E , called the independent sets of the matroid. It is required to satisfy the properties that every subset of an independent set is itself independent, and that if one independent set A is larger than a second independent set B then there exists an element x\in A\setminus B that can be added to B to form a larger independent set. One of the key motivating examples in the formulation of matroids was the notion of linear independence of vectors in a vector space: if E is a finite set or multiset of vectors, and l{I} is the family of linearly independent subsets of E , then (E, l{I}) is a matroid.^{[1] [2]}

More generally, if

(E, l{I}) is any matroid, then a representation of (E, l{I}) may be defined as a function f that maps E to a vector space V , with the property that a subset A of E is independent if and only if f| _{A} is injective and f(A) is linearly independent. A matroid with a representation is called a linear matroid, and if V is a vector space over field F then the matroid is called an F-linear matroid. Thus, the linear matroids are exactly the matroids that are isomorphic to the matroids defined from sets or multisets of vectors. The function f will be one-to-one if and only if the underlying matroid is simple (having no two-element dependent sets). Matroid representations may also be described more concretely using matrices over a field F, with one column per matroid element and with a set of elements being independent in the matroid if and only if the corresponding set of matrix columns is linearly independent. The rank function of a linear matroid is given by the matrix rank of submatrices of this matrix, or equivalently by the dimension of the linear span of subsets of vectors.^[3]

Characterization of linear matroids

Not every matroid is linear; the eight-element Vámos matroid is one of the smallest matroids that is unrepresentable over all fields.^[4] If a matroid is linear, it may be representable over some but not all fields.For instance, the nine-element rank-three matroid defined by the Perles configuration is representable over the real numbers but not over the rational numbers.

U{} ^{2} _{4} as a minor.^[5] The unimodular or regular matroids are the matroids that can be represented over all fields;^[6] they can be characterized as the matroids that have none of U{} ^{2} _{4} , the Fano plane (a binary matroid with seven elements), or the dual matroid of the Fano plane as minors.^{[5] [7]} Alternatively, a matroid is regular if and only if it can be represented by a totally unimodular matrix.

Rota's conjecture states that, for every finite field F, the F-linear matroids can be characterized by a finite set of forbidden minors, similar to the characterizations described above for the binary and regular matroids.^[8] As of 2012, it has been proven only for fields of four or fewer elements.^{[5] [9] [10] [11]} For infinite fields (such as the field of the real numbers) no such characterization is possible.^[12]

Field of definition

For every algebraic number field and every finite field F there is a matroid M for which F is the minimal subfield of its algebraic closure over which M can be represented: M can be taken to be of rank 3.

Characteristic set

The characteristic set of a linear matroid is defined as the set of characteristics of the fields over which it is linear. For every prime number p there exist infinitely many matroids whose characteristic set is the singleton set,^[13] and for every finite set of prime numbers there exists a matroid whose characteristic set is the given finite set.^[14]

If the characteristic set of a matroid is infinite, it contains zero; and if it contains zero then it contains all but finitely many primes.^[15] Hence the only possible characteristic sets are finite sets not containing zero, and cofinite sets containing zero.^[16] Indeed, all such sets do occur.^[17]

Related classes of matroids

U{} ^{r} _{n} has n elements, and its independent sets consist of all subsets of up to r of the elements. Uniform matroids may be represented by sets of vectors in general position in an r -dimensional vector space. The field of representation must be large enough for there to exist n vectors in general position in this vector space, so uniform matroids are F-linear for all but finitely many fields F.^[18] The same is true for the partition matroids, the direct sums of the uniform matroids, as the direct sum of any two F-linear matroids is itself F-linear.

A graphic matroid is the matroid defined from the edges of an undirected graph by defining a set of edges to be independent if and only if it does not contain a cycle. Every graphic matroid is regular, and thus is F-linear for every field F.^[19]

The rigidity matroids describe the degrees of freedom of mechanical linkages formed by rigid bars connected at their ends by flexible hinges. A linkage of this type may be described as a graph, with an edge for each bar and a vertex for each hinge, and for one-dimensional linkages the rigidity matroids are exactly the graphic matroids. Higher-dimensional rigidity matroids may be defined using matrices of real numbers with a structure similar to that of the incidence matrix of the underlying graph, and hence are

R -linear.^{[20] [21]}

Like uniform matroids and partition matroids, the gammoids, matroids representing reachability in directed graphs, are linear over every sufficiently large field. More specifically, a gammoid with

n elements may be represented over every field that has at least 2 ^{n} elements.^[22]

The algebraic matroids are matroids defined from sets of elements of a field extension using the notion of algebraic independence. Every linear matroid is algebraic, and for fields of characteristic zero (such as the real numbers) linear and algebraic matroids coincide, but for other fields there may exist algebraic matroids that are not linear.^[23]

Notes and References

1. . For the rank function, see p. 26.
2. .
3. , p. 12.
4. , pp. 170–172, 196.
5. .
6. White (1987) p.2
7. White (1987) p.12
8. .
9. .
10. .
11. .
12. .
13. .
14. .
15. , p. 225.
16. , p. 226.
17. , p. 228.
18. , p. 100.
19. .
20. .
21. .
22. .
23. .