Canonical: https://knowlpedia.com/shared-foundations/strict-partial-order/

# Strict partial order

An irreflexive and transitive binary relation.

A **strict partial order** on a set \(P\) is a [relation](https://knowlpedia.com/shared-foundations/relation/) \(<\) that is irreflexive, meaning \(a\not<a\) for every \(a\), and transitive, meaning \(a<b\) and \(b<c\) imply \(a<c\). These properties imply asymmetry: \(a<b\) excludes \(b<a\).

## Nonstrict form

Setting \(a\le b\) when \(a=b\) or \(a<b\) gives a [partial order](https://knowlpedia.com/shared-foundations/partial-order/). Conversely, deleting the diagonal from a partial order gives a strict partial order. Comparability of every distinct pair is not required. A strict partial order on an infinite set may have infinite descending chains.
