Math 2.0

Convex and discrete geometry Definition

Oriented matroid

Builds on MatroidLinear independence

Definition

Let EE be a finite set. A signed subset of EE is a pair X=(X+,X−)X = (X^+, X^-) of disjoint subsets of EE; its support is X‾=X+∪X−\underline{X} = X^+ \cup X^-, and −X=(X−,X+)-X = (X^-, X^+). An oriented matroid on EE, given by its signed circuits, is a set 𝒞\mathcal{C} of signed subsets of EE such that:

  1. (∅,∅)∉𝒞(\emptyset, \emptyset) \notin \mathcal{C}.
  2. If X∈𝒞X \in \mathcal{C}, then −X∈𝒞-X \in \mathcal{C}.
  3. If X,Y∈𝒞X, Y \in \mathcal{C} and X‾⊆Y‾\underline{X} \subseteq \underline{Y}, then X=YX = Y or X=−YX = -Y.
  4. If X,Y∈𝒞X, Y \in \mathcal{C}, X≠−YX \ne -Y, and e∈X+∩Y−e \in X^+ \cap Y^-, then there is Z∈𝒞Z \in \mathcal{C} with Z+⊆(X+∪Y+)∖{e}Z^+ \subseteq (X^+ \cup Y^+) \setminus \set{e} and Z−⊆(X−∪Y−)∖{e}Z^- \subseteq (X^- \cup Y^-) \setminus \set{e}.

Remarks

The supports of the signed circuits are the circuits of a matroid on EE, 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 v1,…,vnv_1, \dots, v_n be vectors in ℝr\R^r and E={1,…,n}E = \set{1, \dots, n}. For each linear dependence ∑iλivi=0\sum_i \lambda_i v_i = 0 whose support {i:λi≠0}\set{i : \lambda_i \ne 0} is minimal and nonempty, put X+={i:λi>0}X^+ = \set{i : \lambda_i > 0} and X−={i:λi<0}X^- = \set{i : \lambda_i < 0}. These signed sets satisfy the axioms; such oriented matroids are called realizable. For v1=e1v_1 = e_1, v2=e2v_2 = e_2, v3=e1+e2v_3 = e_1 + e_2 in ℝ2\R^2, the only minimal dependence up to scaling is v1+v2−v3=0v_1 + v_2 - v_3 = 0, so 𝒞={({1,2},{3}),({3},{1,2})}\mathcal{C} = \set{(\set{1,2}, \set{3}), (\set{3}, \set{1,2})}.

Non-example: on E={1,2}E = \set{1, 2}, the set 𝒞={({1},{2}),({1,2},∅),({2},{1}),(∅,{1,2})}\mathcal{C} = \set{(\set{1}, \set{2}), (\set{1,2}, \emptyset), (\set{2}, \set{1}), (\emptyset, \set{1,2})} fails axiom 3, since all four sets have the same support but ({1},{2})≠±({1,2},∅)(\set{1}, \set{2}) \ne \pm (\set{1,2}, \emptyset).

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Linear independence concept
  2. Matroid concept
  3. Oriented matroid definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Oriented_matroid
About this page
TagYWTT6FD50Y
URIm2://YWTT6FD50Y
Kinddefinition
WritingW0 stub
MSC52C40, 05B35, 52B40
DefinesOriented matroid
UsesMatroid, 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.