|
Cardinal Function
In mathematics, a cardinal function (or cardinal invariant) is a function that returns cardinal numbers. Cardinal functions in set theory * The most frequently used cardinal function is a function that assigns to a set ''A'' its cardinality, denoted by , ''A'' , . * Aleph numbers and beth numbers can both be seen as cardinal functions defined on ordinal numbers. * Cardinal arithmetic operations are examples of functions from cardinal numbers (or pairs of them) to cardinal numbers. * Cardinal characteristics of a (proper) ideal ''I'' of subsets of ''X'' are: :(I)=\min\. ::The "additivity" of ''I'' is the smallest number of sets from ''I'' whose union is not in ''I'' any more. As any ideal is closed under finite unions, this number is always at least \aleph_0; if ''I'' is a σ-ideal, then \operatorname(I) \ge \aleph_1. :\operatorname(I)=\min\. :: The "covering number" of ''I'' is the smallest number of sets from ''I'' whose union is all of ''X''. As ''X'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Function (mathematics)
In mathematics, a function from a set to a set assigns to each element of exactly one element of .; the words map, mapping, transformation, correspondence, and operator are often used synonymously. The set is called the domain of the function and the set is called the codomain of the function.Codomain ''Encyclopedia of Mathematics'Codomain. ''Encyclopedia of Mathematics''/ref> The earliest known approach to the notion of function can be traced back to works of Persian mathematicians Al-Biruni and Sharaf al-Din al-Tusi. Functions were originally the idealization of how a varying quantity depends on another quantity. For example, the position of a planet is a ''function'' of time. Historically, the concept was elaborated with the infinitesimal calculus at the end of the 17th century, and, until the 19th century, the functions that were considered were differentiable (that is, they had a high degree of regularity). The concept of a function was formalized at the end of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Topological Properties
In topology and related areas of mathematics, a topological property or topological invariant is a property of a topological space that is invariant under homeomorphisms. Alternatively, a topological property is a proper class of topological spaces which is closed under homeomorphisms. That is, a property of spaces is a topological property if whenever a space ''X'' possesses that property every space homeomorphic to ''X'' possesses that property. Informally, a topological property is a property of the space that can be expressed using open sets. A common problem in topology is to decide whether two topological spaces are homeomorphic or not. To prove that two spaces are ''not'' homeomorphic, it is sufficient to find a topological property which is not shared by them. Properties of topological properties A property P is: * Hereditary, if for every topological space (X, \mathcal) and X' \subset X, the subspace (X', \mathcal, X') has property P. * Weakly hereditary, if for e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Discrete Topological Space
In topology, a discrete space is a particularly simple example of a topological space or similar structure, one in which the points form a , meaning they are ''isolated'' from each other in a certain sense. The discrete topology is the finest topology that can be given on a set. Every subset is open in the discrete topology so that in particular, every singleton subset is an open set in the discrete topology. Definitions Given a set X: A metric space (E,d) is said to be '' uniformly discrete'' if there exists a ' r > 0 such that, for any x,y \in E, one has either x = y or d(x,y) > r. The topology underlying a metric space can be discrete, without the metric being uniformly discrete: for example the usual metric on the set \left\. Properties The underlying uniformity on a discrete metric space is the discrete uniformity, and the underlying topology on a discrete uniform space is the discrete topology. Thus, the different notions of discrete space are compatible with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Open Set
In mathematics, open sets are a generalization of open intervals in the real line. In a metric space (a set along with a distance defined between any two points), open sets are the sets that, with every point , contain all points that are sufficiently near to (that is, all points whose distance to is less than some value depending on ). More generally, one defines open sets as the members of a given collection of subsets of a given set, a collection that has the property of containing every union of its members, every finite intersection of its members, the empty set, and the whole set itself. A set in which such a collection is given is called a topological space, and the collection is called a topology. These conditions are very loose, and allow enormous flexibility in the choice of open sets. For example, ''every'' subset can be open (the discrete topology), or no set can be open except the space itself and the empty set (the indiscrete topology). In practice ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Disjoint Sets
In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set.. For example, and are ''disjoint sets,'' while and are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint. Generalizations This definition of disjoint sets can be extended to a family of sets \left(A_i\right)_: the family is pairwise disjoint, or mutually disjoint if A_i \cap A_j = \varnothing whenever i \neq j. Alternatively, some authors use the term disjoint to refer to this notion as well. For families the notion of pairwise disjoint or mutually disjoint is sometimes defined in a subtly different manner, in that repeated identical members are allowed: the family is pairwise disjoint if A_i \cap A_j = \varnothing whenever A_i \neq A_j (every two ''distinct'' sets in the family are disjoint).. For example, the collection of sets is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Family Of Sets
In set theory and related branches of mathematics, a collection F of subsets of a given set S is called a family of subsets of S, or a family of sets over S. More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. The term "collection" is used here because, in some contexts, a family of sets may be allowed to contain repeated copies of any given member, and in other contexts it may form a proper class rather than a set. A finite family of subsets of a finite set S is also called a '' hypergraph''. The subject of extremal set theory concerns the largest and smallest examples of families of sets satisfying certain restrictions. Examples The set of all subsets of a given set S is called the power set of S and is denoted by \wp(S). The power set \wp(S) of a given set S is a family of sets over S. A subset of S having k elements is called a k-subset of S. The k-subsets S^ of a set S form a family of sets. Let S = \. An e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Open Cover
In mathematics, and more particularly in set theory, a cover (or covering) of a set X is a collection of subsets of X whose union is all of X. More formally, if C = \lbrace U_\alpha : \alpha \in A \rbrace is an indexed family of subsets U_\alpha\subset X, then C is a cover of X if \bigcup_U_ = X. Thus the collection \lbrace U_\alpha : \alpha \in A \rbrace is a cover of X if each element of X belongs to at least one of the subsets U_. Cover in topology Covers are commonly used in the context of topology. If the set X is a topological space, then a ''cover'' C of X is a collection of subsets \_ of X whose union is the whole space X. In this case we say that C ''covers'' X, or that the sets U_\alpha ''cover'' X. Also, if Y is a (topological) subspace of X, then a ''cover'' of Y is a collection of subsets C=\_ of X whose union contains Y, i.e., C is a cover of Y if :Y \subseteq \bigcup_U_. That is, we may cover Y with either open sets in Y itself, or cover Y by open sets in th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Lindelöf Space
In mathematics, a Lindelöf space is a topological space in which every open cover has a countable subcover. The Lindelöf property is a weakening of the more commonly used notion of ''compactness'', which requires the existence of a ''finite'' subcover. A hereditarily Lindelöf space is a topological space such that every subspace of it is Lindelöf. Such a space is sometimes called strongly Lindelöf, but confusingly that terminology is sometimes used with an altogether different meaning. The term ''hereditarily Lindelöf'' is more common and unambiguous. Lindelöf spaces are named after the Finnish mathematician Ernst Leonard Lindelöf. Properties of Lindelöf spaces * Every compact space, and more generally every σ-compact space, is Lindelöf. In particular, every countable space is Lindelöf. * A Lindelöf space is compact if and only if it is countably compact. * Every second-countable space is Lindelöf, but not conversely. For example, there are many compact sp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Separable Space
In mathematics, a topological space is called separable if it contains a countable, dense subset; that is, there exists a sequence \_^ of elements of the space such that every nonempty open subset of the space contains at least one element of the sequence. Like the other axioms of countability, separability is a "limitation on size", not necessarily in terms of cardinality (though, in the presence of the Hausdorff axiom, this does turn out to be the case; see below) but in a more subtle topological sense. In particular, every continuous function on a separable space whose image is a subset of a Hausdorff space is determined by its values on the countable dense subset. Contrast separability with the related notion of second countability, which is in general stronger but equivalent on the class of metrizable spaces. First examples Any topological space that is itself finite or countably infinite is separable, for the whole space is a countable dense subset of itself. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Dense Set
In topology and related areas of mathematics, a subset ''A'' of a topological space ''X'' is said to be dense in ''X'' if every point of ''X'' either belongs to ''A'' or else is arbitrarily "close" to a member of ''A'' — for instance, the rational numbers are a dense subset of the real numbers because every real number either is a rational number or has a rational number arbitrarily close to it (see Diophantine approximation). Formally, A is dense in X if the smallest closed subset of X containing A is X itself. The of a topological space X is the least cardinality of a dense subset of X. Definition A subset A of a topological space X is said to be a of X if any of the following equivalent conditions are satisfied: The smallest closed subset of X containing A is X itself. The closure of A in X is equal to X. That is, \operatorname_X A = X. The interior of the complement of A is empty. That is, \operatorname_X (X \setminus A) = \varnothing. Every point in X eit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
First-countable Space
In topology, a branch of mathematics, a first-countable space is a topological space satisfying the "first axiom of countability". Specifically, a space X is said to be first-countable if each point has a countable neighbourhood basis (local base). That is, for each point x in X there exists a sequence N_1, N_2, \ldots of neighbourhoods of x such that for any neighbourhood N of x there exists an integer i with N_i contained in N. Since every neighborhood of any point contains an open neighborhood of that point, the neighbourhood basis can be chosen without loss of generality to consist of open neighborhoods. Examples and counterexamples The majority of 'everyday' spaces in mathematics are first-countable. In particular, every metric space is first-countable. To see this, note that the set of open balls centered at x with radius 1/n for integers form a countable local base at x. An example of a space which is not first-countable is the cofinite topology on an uncountable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Neighbourhood System
In topology and related areas of mathematics, the neighbourhood system, complete system of neighbourhoods, or neighbourhood filter \mathcal(x) for a point x in a topological space is the collection of all neighbourhoods of x. Definitions Neighbourhood of a point or set An of a point (or subset) x in a topological space X is any open subset U of X that contains x. A is any subset N \subseteq X that contains open neighbourhood of x; explicitly, N is a neighbourhood of x in X if and only if there exists some open subset U with x \in U \subseteq N. Equivalently, a neighborhood of x is any set that contains x in its topological interior. Importantly, a "neighbourhood" does have to be an open set; those neighbourhoods that also happen to be open sets are known as "open neighbourhoods." Similarly, a neighbourhood that is also a closed (respectively, compact, connected, etc.) set is called a (respectively, , , etc.). There are many other types of neighbourhoods that are used i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |