Graph centered on Partial order / poset, showing the selected concept and its surrounding relations.Preparing the interactive atlas…

Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.

Curated starting points

Stories & Views

Relationship-aware analysis

Compare concepts

Choose two concepts to compare or connect.
Reading the graph

Guide to the Atlas

Canonical static concept record

Partial order / poset

Open this concept in the interactive graphRead the Markdown equivalent

Summary

A preorder in which mutual comparability forces equality.

Record metadata

Carrier(s)

Data

Axioms / constraints

Concept sources

Incoming relations (arrows to this concept)

Each relation below ends at this concept.

Directed acyclic graphPartial order / poset

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

On a DAG, define xyx\le y when yy is reachable from xx; adding reflexivity yields a partial order.

How to interpret this relation type

Pass canonically from a stronger object to structure it determines, or forget part of the data while retaining a valid weaker structure. The carrier may change under a canonical induced construction.

Relation sources

PreorderPartial order / poset

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require xyx\le y and yxy\le x to imply x=yx=y.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Outgoing relations (arrows from this concept)

Each relation below starts at this concept.

Partial order / posetBounded poset

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Select posets in which bottom and top exist; each is unique.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Partial order / posetDirected-complete partial order

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require every directed subset to have a supremum.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Partial order / posetJoin-semilattice

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require every pair to have a least upper bound.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Partial order / posetMeet-semilattice

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require every pair to have a greatest lower bound.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Partial order / posetMonotone map

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

A map becomes monotone after specifying ordered domain and codomain and requiring that every order comparison in the domain is preserved in the codomain.

How to interpret this relation type

Equip an existing carrier or structured object with additional chosen data, when such compatible data exists. Use a construction junction when several independently meaningful inputs must coexist on the same carrier or interact compatibly.

Relation sources

Partial order / posetTotal order

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require each pair to be comparable.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources