Closed Preordered Set

A preorder is closed to a stated chain length when every descending chain shorter than that length has a common lower bound, so transfinite strengthening can continue through limit stages without leaving the order.

Version

v3 · 2026-09-19 · History

Domain-specific #

1487

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Set Theory and Order Theory → Mathematics

Aliases

Descending Chain Closed Preorder

Core Idea

A closed preordered set, in the sense retained here, is a preorder whose descending chains up to a declared length have common lower bounds. Let (P, \preceq) be a nonempty preorder and let κ be a cardinal. The unambiguous property is.

for every ordinal δ < κ and every descending sequence ⟨p_i : i < δ⟩, there is q ∈ P such that q \preceq p_i for every i < δ.

This draft calls that property closure under descending chains of length <κ. In much forcing literature it is written “<κ-closed”; Kunen's older convention calls a poset κ-closed when it has lower bounds for every descending sequence of length <κ.

How would you explain it like I'm…

The Keep-All-Promises Card

Imagine a line of promises where each one is stronger than the one before, and it includes everything the earlier ones promised. A closed set of promises means that for any such line that is not too long, you can always find one promise that is at least as strong as all of them. That promise doesn't have to be in the line, and it doesn't have to be the smallest one that works.

Always a Promise Below All

A preorder is a set of things where some are 'below' others, like stronger choices below weaker ones. A descending chain is a list of things where each one is below the one before. A closed preordered set, with a chosen size limit, is one where every descending chain shorter than that limit has something below all of its members, a common lower bound. That lower bound does not have to be in the chain or be the best possible one. It does not mean the chain ever stops; it just means you can always find one thing that keeps all the earlier steps. Mathematicians use different labels for exactly where the size limit sits, so you have to check the convention.

Lower Bounds for Descending Chains

Let (P, ≼) be a nonempty preorder and κ a cardinal. P is closed under descending chains of length less than κ if, for every ordinal δ < κ and every descending sequence ⟨p_i : i < δ⟩, there is some q ∈ P with q ≼ p_i for all i < δ. The lower bound q need not be in the chain, be unique, or be a greatest lower bound. This matters in forcing, a technique in set theory: you can build stronger and stronger conditions step by step and, at a limit stage within the allowed length, use closure to get one condition that keeps every earlier commitment. It is about bounding chains, not about chains ending; long descending sequences can go on without stabilizing. Notation is inconsistent: some authors (e.g. Kunen) call this 'κ-closed', while others (e.g. Jech) use 'κ-closed' to include chains of length κ itself, so labels can differ by one level. 'Closed' with no cardinal can mean closure at every length.

 

A closed preordered set here means a preorder (P, ≼) with lower bounds for descending chains up to a declared length: for a cardinal κ, P is closed under descending chains of length < κ if every descending sequence ⟨p_i : i < δ⟩ with δ < κ has some q ∈ P with q ≼ p_i for all i. Much forcing literature writes this '<κ-closed'; Kunen's older convention calls it 'κ-closed', whereas Jech's 'κ-closed' includes sequences of length κ, so a bare 'κ-closed' is incomplete without the source's convention. The witness need not belong to the chain, be unique, or be an infimum; it only needs to lie below every member. This is what makes the property central in forcing: at successor stages one strengthens conditions, and at permitted limit stages closure supplies a condition retaining all prior commitments. It is chain-bounded completeness, not termination or well-foundedness. Unqualified 'closed' can denote closure at every cardinal, equivalently lower bounds for every reverse-well-ordered subset, the unbounded endpoint of the family; none of this concerns topological closedness.

Scope of Application

The home domain is set-theoretic forcing. Conditions are ordered by strength, often with stronger conditions written lower. A descending construction incorporates more information at each step. Closure allows the construction to survive limit stages by finding a single condition below the entire earlier chain. Standard forcing texts connect appropriate closure to distributivity and preservation results: Jech proves that his κ-closure implies κ-distributivity, while Kunen uses his convention to control new short sequences and small cardinal structure. Any preservation statement must inherit the same notation convention and hypotheses; “closed forcing preserves cardinals” without a range is too strong.

Clarity

A five-question diagnostic makes a closure claim checkable.

1. What is the carrier, and is the relation merely a preorder or a partial order?
2. Does lower mean weaker, smaller, or stronger? State the orientation in words.
3. Which sequence lengths are quantified over, and is the endpoint included?
4. Must the witness be only a lower bound, or is a meet, infimum, or member of the chain being claimed?

Manages Complexity

The abstraction compresses a transfinite bookkeeping problem into one reusable invariant. In a recursive construction, successor stages are usually local: choose p_{i+1} below p_i while meeting one more requirement. Limit stages are global: all earlier requirements must be retained at once. Without closure, every limit stage requires a new proof that the accumulated information still constitutes a condition. With closure, the construction checks the chain length and invokes one property to obtain a consolidating witness.

Abstract Reasoning

The definition licenses several exact deductions.

• Monotonicity in length: if every descending chain of length <κ has a lower bound, then the same is true for every smaller length bound. The converse need not hold.
• Failure by one chain: an admitted descending sequence with no common lower bound is a complete counterexample.
• Quotient invariance: replacing a preorder by its antisymmetric quotient preserves the closure verdict.
• Opposite-order duality: lower-bound closure of descending chains becomes upper-bound completeness of ascending chains after reversing the order, provided sequence direction and length are reversed with it.
• Least-element shortcut: a least element is a common lower bound for every subset, so it yields full closure, although not necessarily informative fusion.
• Product reasoning: coordinatewise products inherit a stated chain closure when each coordinate does and the product support rules allow the coordinatewise witnesses to remain valid conditions.
• Forcing union test: when conditions are partial approximations ordered by extension, the union of a descending chain is the natural lower-bound candidate; closure reduces to checking that the union still satisfies size and coherence restrictions.
• Separation from well-foundedness: finding a lower bound does not show that a descending process stops; it only shows that its accumulated commitments have a common continuation.

Knowledge Transfer

Transfer is literal within order theory, set forcing, class forcing, Boolean-algebra forcing presentations, and transfinite construction arguments. In each case there is a strength preorder, an ordinal-indexed descending chain, and a lower-bound witness that consolidates prior commitments. Knowledge of convention checks, union witnesses, quotient invariance, and chain-versus-directed closure carries directly.

Some transfer to domain theory is available through opposite orders, but it is not vocabulary-free. Complete partial orders emphasize suprema of directed sets, frequently with a least element and Scott-continuous maps.

Relationships to Other Abstractions

Current abstraction Closed Preordered Set Domain-specific

Parents (1) — outgoing typed relations

• Closed Preordered Set is a kind of Completeness Prime

  the strict parent: the internal process class is descending chains of a stated length, and its required termination is a common lower bound.

Hierarchy path (1) — routes to 1 parentless root

• Closed Preordered Set → is a kind of Completeness

Neighborhood in Abstraction Space

Closed Preordered Set sits in a sparse region of the domain-specific corpus (74^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

• Freiling's Axiom of Symmetry — 0.85
• Conditioned Disjunction — 0.83
• Prime Graph — 0.83
• Temperley–Lieb Algebra — 0.83
• Accessibility Relation — 0.83

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