Smallsuch

Smallsuch is a term used in theoretical discussions to denote the least element of a domain that satisfies a given property, with respect to a defined order. Informally, it is the smallest example of a predicate in a structured setting. Formally, if a domain D carries a binary relation ≤, and P is a predicate on D, the smallsuch of P is an element x in D such that P(x) holds and for all y in D, if P(y) then x ≤ y. In this sense, a smallsuch is the minimal witness to the property P within the chosen order.

Existence and uniqueness of a smallsuch depend on the domain and the order. A smallsuch may fail to exist if the subset {y ∈ D | P(y)} has no minimum. This often occurs when the order is not a well-order or when the domain is infinite without a least element for the specified property. Conversely, if D is well-ordered or otherwise guarantees a minimum for any nonempty subset defined by P, the smallsuch is guaranteed to exist and be unique.

Examples help clarify the idea. In the natural numbers with the usual order, if P(n) asserts that n is a prime greater than 5, the smallsuch is 7, the smallest number satisfying the predicate. In a file system, if P describes files larger than 1 MB, the smallsuch is the smallest file that exceeds that size threshold.

Smallsuch is related to concepts such as the least element, minimal element, and well-ordering, and is sometimes used in discussions of minimal exemplars, witness selection in proofs, and minimality analysis in algorithms.