Pith. sign in

REVIEW 1 cited by

A survey of congruences and quotients of partially ordered sets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.03765 v4 pith:TCDPOWUM submitted 2023-03-07 math.CO math.HO

classification math.COmath.HO
keywords differentcongruencecongruencesquotientsequivalenceexamplesliteraturenaturally
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different theories. The literature on congruences and quotients of partially ordered sets contains a large and profilerating array of approaches, but little in the way of systematic exposition and examination of the subject. We seek to rectify this by surveying the different theories in the literature and providing philosophical discussion on requirements for notions of congruences of posets. We advocate a pluralist approach which recognises that different types of congruence arise naturally in different mathematical situations. There are some notions of congruence which are very general, whilst others capture specific structure which often appears in examples. Indeed, we finish by giving several examples where quotients of posets appear naturally in mathematics.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An order-theoretic circuit syntax and characterisation of the concept lattice

    quant-ph 2025-07 conditional novelty 7.0 of 10

    The concept lattice L_G is characterized as the unique smallest circuit with connectivity G that admits morphisms from every other circuit with the same connectivity.

Pith tools