Interval order

A partial order representable by real intervals where one element precedes another exactly when its interval lies completely to the left.

Version

v2 · 2026-09-19 · History

Domain-specific #

5091

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Order Theory → Mathematics

Core Idea

Endpoint openness and equality conventions must be fixed, and finite interval orders are characterized by exclusion of an induced two-plus-two suborder. Assign each element a left and right endpoint, then compare two elements only when the first interval’s right endpoint is strictly before the second’s left endpoint; overlapping intervals remain incomparable. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Finished-Before-Started Order

Imagine each friend has a nap time, like from 1 o'clock to 2 o'clock. We say one friend's nap came 'before' another's only if it was completely over before the other one started. If two naps overlap, even a little, we can't say which came first.

Number-Line Stretch Ranking

An interval order is a way of ranking things by giving each one a stretch of time or a piece of the number line. Thing A is 'before' thing B only when A's piece ends strictly before B's piece begins. If two pieces overlap, A and B are not ranked against each other at all. Mathematicians must also decide small rules, like whether touching endpoints count as overlapping. Not every ranking can be drawn with intervals like this, and there is a special test to tell which ones can.

Order by Non-Overlapping Intervals

An interval order is a partial order you can draw by giving each element a real interval with a left and right endpoint. Then x < y exactly when x's right endpoint is strictly less than y's left endpoint. Overlapping intervals give incomparable elements, so many pairs may have no order between them. You must fix conventions first, such as open versus closed endpoints and how equal endpoints are treated. For finite sets there is a clean test. A partial order is an interval order exactly when it has no induced 'two-plus-two': two separate chains a<b and c<d with no comparisons at all between the two chains.

 

A poset (P, <) is an interval order if each element can be assigned a real interval [l(x), r(x)] so that x < y if and only if r(x) < l(y). Strict precedence is required, and overlapping intervals correspond to incomparability. The representation depends on conventions about endpoint openness and equality, and on whether distinct elements may share an interval. For finite posets the characterization is by a forbidden induced subposet. A finite poset is an interval order iff it contains no induced 2+2, meaning two disjoint two-element chains with no comparabilities between them. This sets interval orders apart from general posets. Claims beyond the finite case depend on stated finiteness or countability assumptions. To verify one, either exhibit a valid interval representation or check for the forbidden 2+2.

Scope of Application

Interval order belongs to order theory and is useful where the analyst can specify the typed order theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the poset and carrier, real interval assigned to each element, endpoint and strictness convention, bijection or repeated intervals, precedence equivalence, induced two-plus-two exclusion and finite or countable assumptions are explicit. The scope is broad within that domain but bounded by the need for the poset and carrier, real interval assigned to each element, endpoint and strictness convention, bijection or repeated intervals, precedence equivalence, induced two-plus-two exclusion and finite or countable assumptions are explicit.

Clarity

The abstraction clarifies a crowded vocabulary by making the poset and carrier, real interval assigned to each element, endpoint and strictness convention, bijection or repeated intervals, precedence equivalence, induced two-plus-two exclusion and finite or countable assumptions are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Interval order. Interval order compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed order theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the poset and carrier, real interval assigned to each element, endpoint and strictness convention, bijection or repeated intervals, precedence equivalence, induced two-plus-two exclusion and finite or countable assumptions are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of order theory because they reuse the typed order theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Assign each element a left and right endpoint, then compare two elements only when the first interval’s right endpoint is strictly before the second’s left endpoint; overlapping intervals remain incomparable., and type the carrier, state every parameter and convention in the definition, test that the poset and carrier, real interval assigned to each element, endpoint and strictness convention, bijection or repeated intervals, precedence equivalence, induced two-plus-two exclusion and finite or countable assumptions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Interval order Domain-specific

Parents (1) — outgoing typed relations

• Interval order is a kind of Order Prime

  It remains its own entry because its identity is fixed by the poset and carrier, real interval assigned to each element, endpoint and strictness convention, bijection or repeated intervals, precedence equivalence, induced two-plus-two exclusion and finite or countable assumptions.

Hierarchy paths (3) — routes to 3 parentless roots

• Interval order → is a kind of Order → presupposes Comparison

Show alternative paths (2)

Neighborhood in Abstraction Space

Interval order sits in a crowded region of the domain-specific corpus (2^nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Order, Type & Classification Foundations (49 abstractions)

Nearest neighbors

• Maximal and minimal elements — 0.95
• Partially ordered set — 0.95
• Duality (order theory) — 0.94
• Sperner property of a partially ordered set — 0.93
• Complete lattice — 0.93

Computed from structural-signature embeddings · 2026-10-25