Scale (descriptive Set Theory)
In the mathematical discipline of descriptive set theory, a scale is a certain kind of object defined on a set (mathematics), set of point (mathematics), points in some Polish space (for example, a scale might be defined on a set of real numbers). Scales were originally isolated as a concept in the theory of uniformization (descriptive set theory), uniformization, but have found wide applicability in descriptive set theory, with applications such as establishing bounds on the possible lengths of wellorderings of a given complexity, and showing (under certain assumptions) that there are largest countable sets of certain complexities. Formal definition Given a pointset ''A'' contained in some product space :A\subseteq X=X_0\times X_1\times\ldots X_ where each ''Xk'' is either the Baire space (set theory), Baire space or a countably infinite discrete set, we say that a ''norm'' on ''A'' is a map from ''A'' into the ordinal numbers. Each norm has an associated prewellordering, where on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Descriptive Set Theory
In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" set (mathematics), subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other areas of mathematics such as functional analysis, ergodic theory, the study of operator algebras and Group action (mathematics), group actions, and mathematical logic. Polish spaces Descriptive set theory begins with the study of Polish spaces and their Borel sets. A Polish space is a second-countable topological space that is metrizable with a complete metric. Heuristically, it is a complete separable metric space whose metric has been "forgotten". Examples include the real line \mathbb, the Baire space (set theory), Baire space \mathcal, the Cantor space \mathcal, and the Hilbert cube I^. Universality properties The class of Polish spaces has several universality properties, which show that there is no loss ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Ordinal Number
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets. A finite set can be enumerated by successively labeling each element with the least natural number that has not been previously used. To extend this process to various infinite sets, ordinal numbers are defined more generally using linearly ordered greek letter variables that include the natural numbers and have the property that every set of ordinals has a least or "smallest" element (this is needed for giving a meaning to "the least unused element"). This more general definition allows us to define an ordinal number \omega (omega) to be the least element that is greater than every natural number, along with ordinal numbers , , etc., which are even greater than . A linear order such that every non-empty subset has a least element is called a well-order. The axiom of choice implies that every set can be well-orde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Uniformization (set Theory)
In set theory, a branch of mathematics, the axiom of uniformization is a weak form of the axiom of choice. It states that if R is a subset of X\times Y, where X and Y are Polish spaces, then there is a subset f of R that is a partial function from X to Y, and whose domain (the set of all x such that f(x) exists) equals : \\, Such a function is called a uniformizing function for R, or a uniformization of R. To see the relationship with the axiom of choice, observe that R can be thought of as associating, to each element of X, a subset of Y. A uniformization of R then picks exactly one element from each such subset, whenever the subset is non-empty. Thus, allowing arbitrary sets ''X'' and ''Y'' (rather than just Polish spaces) would make the axiom of uniformization equivalent to the axiom of choice. A pointclass \boldsymbol is said to have the uniformization property if every relation R in \boldsymbol can be uniformized by a partial function in \boldsymbol. The uniformizati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Relation (mathematics)
In mathematics, a relation denotes some kind of ''relationship'' between two mathematical object, objects in a Set (mathematics), set, which may or may not hold. As an example, "''is less than''" is a relation on the set of natural numbers; it holds, for instance, between the values and (denoted as ), and likewise between and (denoted as ), but not between the values and nor between and , that is, and both evaluate to false. As another example, "''is sister of'' is a relation on the set of all people, it holds e.g. between Marie Curie and Bronisława Dłuska, and likewise vice versa. Set members may not be in relation "to a certain degree" – either they are in relation or they are not. Formally, a relation over a set can be seen as a set of ordered pairs of members of . The relation holds between and if is a member of . For example, the relation "''is less than''" on the natural numbers is an infinite set of pairs of natural numbers that contains both and , b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Prewellordering Property
In set theory, a prewellordering on a set X is a preorder \leq on X (a transitive and reflexive relation on X) that is strongly connected (meaning that any two points are comparable) and well-founded in the sense that the induced relation x < y defined by is a . Prewellordering on a set A prewellordering on a is a homogeneous binary relation on that satisfies the following conditions: |
|
Pointclass
In the mathematical field of descriptive set theory, a pointclass is a collection of Set (mathematics), sets of point (mathematics), points, where a ''point'' is ordinarily understood to be an element of some perfect set, perfect Polish space. In practice, a pointclass is usually characterized by some sort of ''definability property''; for example, the collection of all open sets in some fixed collection of Polish spaces is a pointclass. (An open set may be seen as in some sense definable because it cannot be a purely arbitrary collection of points; for any point in the set, all points sufficiently close to that point must also be in the set.) Pointclasses find application in formulating many important principles and theorems from set theory and real analysis. Strong set-theoretic principles may be stated in terms of the determinacy of various pointclasses, which in turn implies that sets in those pointclasses (or sometimes larger ones) have regularity properties such as Lebesgue m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
![]() |
Axiom Of Choice
In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family (S_i)_ of nonempty sets (S_i as a nonempty set indexed with i), there exists an indexed set (x_i)_ such that x_i \in S_i for every i \in I. The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. The axiom of choice is equivalent to the statement that every partition has a transversal. In many cases, a set created by choosing elements can be made without invoking the axiom of choice, particularly if the number of sets from which to choose the elements is finite, or if a canonical rule on how to choose the elements is available — some distinguishing property that happens to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prewellordering
In set theory, a prewellordering on a set X is a preorder \leq on X (a transitive and reflexive relation on X) that is strongly connected (meaning that any two points are comparable) and well-founded in the sense that the induced relation x < y defined by is a . Prewellordering on a set A prewellordering on a is a homogeneous binary relation on that satisfies the following conditions: |
|
Baire Space (set Theory)
In set theory, the Baire space is the set of all infinite sequences of natural numbers with a certain topology, called the product topology. This space is commonly used in descriptive set theory, to the extent that its elements are often called "reals". It is denoted by \N^, or ωω, or by the symbol \mathcal or sometimes by ωω (not to be confused with the countable ordinal obtained by ordinal exponentiation). The Baire space is defined to be the Cartesian product of countably infinitely many copies of the set of natural numbers, and is given the product topology (where each copy of the set of natural numbers is given the discrete topology). The Baire space is often represented using the tree of finite sequences of natural numbers. (This space should also not be confused with the concept of a Baire space, which is a certain kind of topological space.) The Baire space can be contrasted with Cantor space, the set of infinite sequences of binary digits. Topology and trees ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Set (mathematics)
In mathematics, a set is a collection of different things; the things are '' elements'' or ''members'' of the set and are typically mathematical objects: numbers, symbols, points in space, lines, other geometric shapes, variables, or other sets. A set may be finite or infinite. There is a unique set with no elements, called the empty set; a set with a single element is a singleton. Sets are ubiquitous in modern mathematics. Indeed, set theory, more specifically Zermelo–Fraenkel set theory, has been the standard way to provide rigorous foundations for all branches of mathematics since the first half of the 20th century. Context Before the end of the 19th century, sets were not studied specifically, and were not clearly distinguished from sequences. Most mathematicians considered infinity as potentialmeaning that it is the result of an endless processand were reluctant to consider infinite sets, that is sets whose number of members is not a natural number. Specific ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Countable Set
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements. In more technical terms, assuming the axiom of countable choice, a set is ''countable'' if its cardinality (the number of elements of the set) is not greater than that of the natural numbers. A countable set that is not finite is said to be countably infinite. The concept is attributed to Georg Cantor, who proved the existence of uncountable sets, that is, sets that are not countable; for example the set of the real numbers. A note on terminology Although the terms "countable" and "countably infinite" as def ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Wellordering
In mathematics, a well-order (or well-ordering or well-order relation) on a set is a total ordering on with the property that every non-empty subset of has a least element in this ordering. The set together with the ordering is then called a well-ordered set (or woset). In some academic articles and textbooks these terms are instead written as wellorder, wellordered, and wellordering or well order, well ordered, and well ordering. Every non-empty well-ordered set has a least element. Every element of a well-ordered set, except a possible greatest element, has a unique successor (next element), namely the least element of the subset of all elements greater than . There may be elements, besides the least element, that have no predecessor (see below for an example). A well-ordered set contains for every subset with an upper bound a least upper bound, namely the least element of the subset of all upper bounds of in . If ≤ is a non-strict well ordering, then < is a strict ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |