An alternative definition of the dual matroid is that its basis sets are the
complements of the basis sets of . The basis exchange axiom, used to define matroids from their bases, is self-complementary, so the dual of a matroid is necessarily a matroid.
flats of are complementary to the cyclic sets (unions of circuits) of , and vice versa.
matroid minor is formed from a larger matroid by two operations: the restriction deletes element from without changing the independence or rank of the remaining sets, and the contraction deletes from after subtracting one from the rank of every set it belongs to. These two operations are dual: and . Thus, a minor of a dual is the same thing as a dual of a minor.
An individual matroid is self-dual (generalizing e.g. the
self-dual polyhedra for graphic matroids) if it is isomorphic to its own dual. The isomorphism may, but is not required to, leave the elements of the matroid fixed. Any algorithm that tests whether a given matroid is self-dual, given access to the matroid via an
independence oracle, must perform an exponential number of oracle queries, and therefore cannot take polynomial time.
Many important matroid families are self-dual, meaning that a matroid belongs to the family if and only if its dual does. Many other matroid families come in dual pairs. Examples of this phenomenon include:
The dual of a
graphic matroid is itself graphic if and only if the underlying graph is planar; the matroid of the dual of a planar graph is the same as the dual of the matroid of the graph. Thus, the family of graphic matroids of planar graphs is self-dual.
Among the graphic matroids, and more generally among the binary matroids, the
bipartite matroids (matroids in which every circuit is even) are dual to the
Eulerian matroids (matroids that can be partitioned into disjoint circuits).