|
Cocountable Extension Topology
In mathematics, a cocountable subset of a set ''X'' is a subset ''Y'' whose complement in ''X'' is a countable set. In other words, ''Y'' contains all but countably many elements of ''X''. Since the rational numbers are a countable subset of the reals, for example, the irrational numbers are a cocountable subset of the reals. If the complement is finite, then one says ''Y'' is cofinite. σ-algebras The set of all subsets of ''X'' that are either countable or cocountable forms a σ-algebra, i.e., it is closed under the operations of countable unions, countable intersections, and complementation. This σ-algebra is the countable-cocountable algebra on ''X''. It is the smallest σ-algebra containing every singleton set. Topology The cocountable topology The cocountable topology or countable complement topology on any set ''X'' consists of the empty set and all cocountable subsets of ''X'', that is all sets whose complement in ''X'' is countable. It follows that the only clos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subset
In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ''B''. The relationship of one set being a subset of another is called inclusion (or sometimes containment). ''A'' is a subset of ''B'' may also be expressed as ''B'' includes (or contains) ''A'' or ''A'' is included (or contained) in ''B''. A ''k''-subset is a subset with ''k'' elements. The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra (structure), Boolean algebra under the subset relation, in which the join and meet are given by Intersection (set theory), intersection and Union (set theory), union, and the subset relation itself is the Inclusion (Boolean algebra), Boolean inclusion relation. Definition If ''A'' and ''B'' are sets and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complement (set Theory)
In set theory, the complement of a set , often denoted by (or ), is the set of elements not in . When all sets in the universe, i.e. all sets under consideration, are considered to be members of a given set , the absolute complement of is the set of elements in that are not in . The relative complement of with respect to a set , also termed the set difference of and , written B \setminus A, is the set of elements in that are not in . Absolute complement Definition If is a set, then the absolute complement of (or simply the complement of ) is the set of elements not in (within a larger set that is implicitly defined). In other words, let be a set that contains all the elements under study; if there is no need to mention , either because it has been previously specified, or it is obvious and unique, then the absolute complement of is the relative complement of in : A^\complement = U \setminus A. Or formally: A^\complement = \. The absolute complement of is u ... [...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 (its number of elements) is not greater than that of the natural numbers. A countable set that is not finite is said 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 defined here are quite co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cofinite
In mathematics, a cofinite subset of a set X is a subset A whose complement in X is a finite set. In other words, A contains all but finitely many elements of X. If the complement is not finite, but it is countable, then one says the set is cocountable. These arise naturally when generalizing structures on finite sets to infinite sets, particularly on infinite products, as in the product topology or direct sum. This use of the prefix "" to describe a property possessed by a set's mplement is consistent with its use in other terms such as " meagre set". Boolean algebras The set of all subsets of X that are either finite or cofinite forms a Boolean algebra, which means that it is closed under the operations of union, intersection, and complementation. This Boolean algebra is the on X. A Boolean algebra A has a unique non-principal ultrafilter (that is, a maximal filter not generated by a single element of the algebra) if and only if there exists an infinite set X such that A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singleton Set
In mathematics, a singleton, also known as a unit set or one-point set, is a set with exactly one element. For example, the set \ is a singleton whose single element is 0. Properties Within the framework of Zermelo–Fraenkel set theory, the axiom of regularity guarantees that no set is an element of itself. This implies that a singleton is necessarily distinct from the element it contains, thus 1 and are not the same thing, and the empty set is distinct from the set containing only the empty set. A set such as \ is a singleton as it contains a single element (which itself is a set, however, not a singleton). A set is a singleton if and only if its cardinality is . In von Neumann's set-theoretic construction of the natural numbers, the number 1 is ''defined'' as the singleton \. In axiomatic set theory, the existence of singletons is a consequence of the axiom of pairing: for any set ''A'', the axiom applied to ''A'' and ''A'' asserts the existence of \, which is the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cocountable Topology
The cocountable topology or countable complement topology on any set ''X'' consists of the empty set and all cocountable subsets of ''X'', that is all sets whose complement in ''X'' is countable. It follows that the only closed subsets are ''X'' and the countable subsets of ''X''. Symbolically, one writes the topology as \mathcal = \. Every set ''X'' with the cocountable topology is Lindelöf, since every nonempty open set omits only countably many points of ''X''. It is also T1, as all singletons are closed. If ''X'' is an uncountable set then any two nonempty open sets intersect, hence the space is not Hausdorff. However, in the cocountable topology all convergent sequences are eventually constant, so limits are unique. Since compact sets in ''X'' are finite subsets, all compact subsets are closed, another condition usually related to Hausdorff separation axiom. The cocountable topology on a countable set is the discrete topology. The cocountable topology on an uncountable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Empty Set
In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set. Any set other than the empty set is called non-empty. In some textbooks and popularizations, the empty set is referred to as the "null set". However, null set is a distinct notion within the context of measure theory, in which it describes a set of measure zero (which is not necessarily empty). The empty set may also be called the void set. Notation Common notations for the empty set include "", "\emptyset", and "∅". The latter two symbols were introduced by the Bourbaki group (specifically André Weil) in 1939, inspired by the letter Ø in the Danish and Norwegian alphabets. In the past, "0" was occasionally used as a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
