Partial orders are the free conservative cocompletion of total orders

2024/04/19 by Calin Tataru, Tataru, Calin
Computer Science · Mathematics · #Advanced Algebra and Logic #Category Theory (math.CT) #FOS: Mathematics #Finite Group Theory Research #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2404.12924

openalex publication_date 2024/04/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that the category of partially ordered sets Pos is equivalent to the free conservative cocompletion of the category of finite non-empty totally ordered sets Δ, which is also known as the simplex category.

Related

• Limits and colimits, generators and relations of partial groups
• On better-quasi-ordering classes of partial orders
• Poset-enriched categories and free exact completions
• Pretorsion theories, stable category and preordered sets
• A nonstandard proof for Szpilrajn's theorem