Semiorder¶
A partial order representable by assigning real-valued utilities and a positive discrimination threshold so that one item is preferred to another only when their scores differ by at least that threshold, allowing nontransitive incomparability.
Core Idea¶
A semiorder is a partial order represented by real utilities and a positive threshold: one item outranks another only when their scores differ enough. Close scores are incomparable, and that incomparability need not be transitive. Equivalent axioms and forbidden-suborder tests distinguish exact semiorders from approximate threshold fits. Items closer than the threshold are incomparable. Items closer than the threshold are incomparable.
Scope of Application¶
Semiorder is useful only when its topic-specific roles and limits are declared. Use it in order theory, mathematical psychology, decision theory, ranking, and algorithms with item set, orientation, utility scale, threshold, equality convention, axiom tests, empirical elicitation, and interpretation explicit.
- Order theory. Classifies threshold orders.
- Mathematical psychology. Models just-noticeable preferences.
- Decision theory. Represents imprecise comparison.
- Ranking systems. Handles tolerance bands.
- Algorithms. Recognizes and represents semiorders.
Clarity¶
State item set, relation orientation, utility scale, threshold and equality convention, representation existence/uniqueness, normalization, forbidden configurations, missing comparisons, empirical elicitation, and whether threshold means perception, preference, or measurement tolerance. The closest near miss sets the boundary: A strict weak order is the closest miss: only equal-score items are incomparable, making incomparability transitive, whereas a semiorder permits chains of near-equality ending in a perceptible comparison.
Manages Complexity¶
The numerical picture is intuitive but not unique: positive affine transformations change utility and threshold together without changing the order. Boundary equality must be declared. Empirical indifference is not automatically mathematical incomparability, and noisy responses can violate transitivity. The forbidden-suborder characterization separates genuine semiorder structure from a fitted score model that merely approximates observations. Threshold variation across people or items defines more general models. A sound application tests the order axioms before interpreting the threshold psychologically. The central realistic tolerance–formal rigidity tradeoff is this: One threshold is interpretable but may not fit heterogeneous discrimination. A second incomparability–indifference tension matters because No declared preference can reflect limited discrimination rather than equal value. The numeric representation–order invariant tension adds that Scores aid computation but only comparisons are intrinsic.
Abstract Reasoning¶
Use three linked moves: orient and validate the binary relation; test partial-order and semiorder axioms; construct a utility/threshold representation or prove impossibility. As a collapse test, identity exits when no single-threshold utility representation or equivalent semiorder axioms exist. A fourth check is to check boundary and scaling conventions. A final check is to interpret incomparability only within the elicitation design.
Knowledge Transfer¶
Thresholded comparison transfers across preference, perception, and ranking only when one common margin and order invariant are supported. It stops at generic uncertainty intervals or arbitrary nontransitive choice. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Utilities and a threshold form a medium mapping pairwise target comparisons to a partial order, with declared fidelity and interpretation convention. Every semiorder satisfies additional restrictions beyond partial ordering.
Relationships to Other Abstractions¶
Current abstraction Semiorder Domain-specific
Parents (1) — more general patterns this builds on
-
Semiorder is a kind of Representation Prime
A semiorder is a strict Representation: utilities plus one threshold encode pairwise comparisons while intentionally mapping close differences to incomparability.
Hierarchy path (1) — routes to 1 parentless root
- Semiorder → Representation → Abstraction
Neighborhood in Abstraction Space¶
Semiorder sits in a moderately populated region (40th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Empirical Measurement & Statistical Inference Methods (50 abstractions)
Nearest neighbors
- Bongard Problem — 0.88
- Evaluation function — 0.87
- Filtration (algebra) — 0.87
- Social comparison bias — 0.87
- Constructional System — 0.87
Computed from structural-signature embeddings · 2026-10-08