Convex and discrete geometry Definition
Oriented matroid
Builds on MatroidLinear independence
Definition
Let be a finite set. A signed subset of is a pair of disjoint subsets of ; its support is , and . An oriented matroid on , given by its signed circuits, is a set of signed subsets of such that:
- .
- If , then .
- If and , then or .
- If , , and , then there is with and .
Remarks
The supports of the signed circuits are the circuits of a matroid on , the underlying matroid. Axiom 4 is the signed form of circuit elimination. There are equivalent axiom systems in terms of covectors, of vectors and of chirotopes, which are signed versions of the bases.
Example: let be vectors in and . For each linear dependence whose support is minimal and nonempty, put and . These signed sets satisfy the axioms; such oriented matroids are called realizable. For , , in , the only minimal dependence up to scaling is , so .
Non-example: on , the set fails axiom 3, since all four sets have the same support but .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Linear independence concept
- Matroid concept
- Oriented matroid definition
Further reading
About this page
| Tag | YWTT6FD50Y |
|---|---|
| URI | m2://YWTT6FD50Y |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C40, 05B35, 52B40 |
| Defines | Oriented matroid |
| Uses | Matroid, Linear independence |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.