Poset topology

In mathematics, the poset topology associated with a partially ordered set S (or poset for short) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of S, ordered by inclusion.

Let V be a set of vertices. An abstract simplicial complex Δ is a set of finite sets of vertices, known as faces $\sigma \subseteq V$, such that

$\forall \rho, \sigma. \;\ \rho \subseteq \sigma \in \Delta \Rightarrow \rho \in \Delta$

Given a simplicial complex Δ as above, we define a (point set) topology on Δ by letting a subset $\Gamma \subseteq \Delta$ be closed if and only if Γ is a simplicial complex:

$\forall \rho, \sigma. \;\ \rho \subseteq \sigma \in \Gamma \Rightarrow \rho \in \Gamma$

This is the Alexandrov topology on the poset of faces of Δ.

The order complex associated with a poset, S, has the underlying set of S as vertices, and the finite chains (i.e. finite totally-ordered subsets) of S as faces. The poset topology associated with a poset S is the Alexandrov topology on the order complex associated with S.

See also

• Topological combinatorics

External links

• Poset Topology: Tools and Applications Michelle L. Wachs, lecture notes IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004)

This topology-related article is a stub. You can help Wikipedia by expanding it.v · Categories: General topology Order theory Topology stubs Wikimedia Foundation. 2010. Игры ⚽ Нужно решить контрольную? Kawasaki Ki-102 Contracture Look at other dictionaries: Divisor topology — In mathematics, more specifically general topology, the divisor topology is an example of a topology given to the set X of positive integers that are greater than or equal to two, i.e., X = {2, 3, 4, 5, …}. The divisor topology is the poset… …   Wikipedia Grid cell topology — The grid cell topology is studied in digital topology for the purpose of providing a theoretical basis for (low level) algorithms in computer image analysis or computer graphics. The elements of the n dimensional grid cell topology ( n ≥ 1) are… …   Wikipedia Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… …   Wikipedia List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… …   Wikipedia Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be …   Wikipedia Ultrafilter — In the mathematical field of set theory, an ultrafilter on a set X is a collection of subsets of X that is a filter, that cannot be enlarged (as a filter). An ultrafilter may be considered as a finitely additive measure. Then every subset of X is …   Wikipedia Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… …   Wikipedia Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y)   (cl… …   Wikipedia Abstract polytope — In mathematics, an abstract polytope is a combinatorial structure with properties similar to those shared by a more classical polytope. Abstract polytopes correspond to the structures of polygons, polyhedra, tessellations of the plane and higher… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”