In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in X) of a partially ordered set ( X , ≤ ) {\displaystyle...
9 KB (1,291 words) - 14:07, 1 February 2023
mathematics, particularly in order theory, an upper bound or majorant of a subset S of some preordered set (K, ≤) is an element of K that is greater than...
6 KB (687 words) - 13:18, 26 September 2024
only if every upper set is also open (or equivalently every lower set is also closed). Let A be a subset of X. The smallest upper set containing A is...
10 KB (1,414 words) - 16:06, 25 December 2023
Well-order (redirect from Well-ordered set)
well-ordered set S contains for every subset T with an upper bound a least upper bound, namely the least element of the subset of all upper bounds of T...
12 KB (1,882 words) - 17:26, 22 September 2024
definition. A directed set is a set A {\displaystyle A} with a preorder such that every finite subset of A {\displaystyle A} has an upper bound. In this definition...
16 KB (2,717 words) - 03:56, 3 August 2024
Infimum and supremum (redirect from Least upper bound)
than any other lower bound). Similarly, an upper bound of a subset S {\displaystyle S} of a partially ordered set ( P , ≤ ) {\displaystyle (P,\leq )} is an...
24 KB (4,346 words) - 14:05, 4 November 2024
descriptions as a fallback Directed set – Mathematical ordering with upper bounds Graded poset – partially ordered set equipped with a rank functionPages...
40 KB (5,388 words) - 19:57, 4 November 2024
a partially ordered set X has the least-upper-bound property if every non-empty subset of X with an upper bound has a least upper bound (supremum) in...
12 KB (1,470 words) - 13:11, 11 September 2024
Total order (redirect from Total ordered set)
non-empty totally ordered set with no upper bound. The integers form an initial non-empty totally ordered set with neither an upper nor a lower bound. The...
21 KB (3,093 words) - 12:07, 5 October 2024
Lower Egypt, and ruled the Nile Delta, from Avaris. They chose Set, originally Upper Egypt's chief god, the god of foreigners and the god they found...
38 KB (4,600 words) - 21:08, 23 October 2024
{\displaystyle X} x ∈ X {\displaystyle x\in X} The upper contour set of x {\displaystyle x} is the set of all y {\displaystyle y} that are related to x...
7 KB (1,288 words) - 19:59, 9 December 2021
Natural density (redirect from Set density)
A somewhat weaker notion of density is the upper Banach density d ∗ ( A ) {\displaystyle d^{*}(A)} of a set A ⊆ N . {\displaystyle A\subseteq \mathbb {N}...
11 KB (1,757 words) - 00:54, 29 August 2024
is called an upper bound of S. The terms bounded from below and lower bound are similarly defined. A set S is bounded if it has both upper and lower bounds...
6 KB (733 words) - 08:59, 4 March 2024
subset S of F is a base or basis for F if the upper set generated by S (i.e., the smallest upwards-closed set containing S) is equal to F. Since every filter...
23 KB (2,819 words) - 18:40, 14 October 2024
The trading card game Magic: The Gathering has released a large number of sets since it was first published by Wizards of the Coast. After the 1993 release...
233 KB (11,642 words) - 16:40, 4 November 2024
Order theory (section Partially ordered sets)
Formally, the upper closure of a set S in a poset P is given by the set {x in P | there is some y in S with y ≤ x}. A set that is equal to its upper closure...
31 KB (4,508 words) - 03:55, 24 August 2024
Preorder (redirect from Preordered set)
has an upper bound. The definition of convergence via nets is important in topology, where preorders cannot be replaced by partially ordered sets without...
23 KB (3,351 words) - 13:50, 21 July 2024
Semi-continuity (redirect from Upper semi-continuous)
and upper semicontinuity and set-valued lower and upper semicontinuouty. An upper semicontinuous single-valued function is not necessarily upper semicontinuous...
24 KB (3,980 words) - 23:40, 18 September 2024
dual concepts are upper and lower bounds, lower sets and upper sets, and ideals and filters. In topology, open sets and closed sets are dual concepts:...
53 KB (6,701 words) - 16:16, 31 August 2024
The Upper Deck Company, LLC (colloquially as Upper Deck and Upper Deck Authenticated, Ltd. in the UK) is a private company primarily known for producing...
57 KB (6,527 words) - 15:23, 24 October 2024
attributed by some metamorphosis to the two "fingers" of the "upper hand" of the Mandelbrot set; therefore, the number of "spokes" increases from one "seahorse"...
59 KB (7,722 words) - 10:10, 6 November 2024
mathematics, an index set is a set whose members label (or index) members of another set. For instance, if the elements of a set A may be indexed or labeled...
2 KB (298 words) - 06:46, 10 May 2024
Venn diagram (redirect from Set diagram)
between sets, popularized by John Venn (1834–1923) in the 1880s. The diagrams are used to teach elementary set theory, and to illustrate simple set relationships...
31 KB (3,249 words) - 16:32, 29 October 2024
are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and Yoneda's representability theorem generalizes Cayley's...
13 KB (1,889 words) - 11:12, 28 July 2024
Ultrafilter (category Families of sets)
mathematical field of order theory, an ultrafilter on a given partially ordered set (or "poset") P {\textstyle P} is a certain subset of P , {\displaystyle P...
20 KB (2,956 words) - 14:53, 25 July 2024
For a preordered set P, any upper set O is Alexandrov-open. Inversely, a topology is Alexandrov if any intersection of open sets is open. Algebraic...
29 KB (4,210 words) - 15:47, 13 October 2024
Well-founded relation (redirect from Well-founded set)
relation R is called well-founded (or wellfounded or foundational) on a set or, more generally, a class X if every non-empty subset S ⊆ X has a minimal...
10 KB (1,382 words) - 15:55, 4 November 2024
terms of a pair of sets which give the lower and the upper approximation of the original set. In the standard version of rough set theory described in...
51 KB (8,156 words) - 04:59, 25 October 2024
Zorn's lemma (category Lemmas in set theory)
Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds for every chain (that is, every totally...
31 KB (4,700 words) - 12:19, 5 October 2024
subset of any ordered set, every member of that set will be an upper bound and lower bound for the empty set. For example, when considered as a subset of...
15 KB (2,184 words) - 19:22, 16 October 2024