|
Delta-ring
In mathematics, a non-empty collection of sets \mathcal is called a -ring (pronounced "") if it is closed under union, relative complementation, and countable intersection. The name "delta-ring" originates from the German word for intersection, "Durschnitt", which is meant to highlight the ring's closure under countable intersection, in contrast to a -ring which is closed under countable unions. Definition A family of sets \mathcal is called a -ring if it has all of the following properties: #Closed under finite unions: A \cup B \in \mathcal for all A, B \in \mathcal, #Closed under relative complementation: A - B \in \mathcal for all A, B \in \mathcal, and #Closed under countable intersections: \bigcap_^ A_n \in \mathcal if A_n \in \mathcal for all n \in \N. If only the first two properties are satisfied, then \mathcal is a ring of sets but not a -ring. Every -ring is a -ring, but not every -ring is a -ring. -rings can be used instead of σ-algebras in the developmen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Of Sets
In mathematics, there are two different notions of a ring of sets, both referring to certain families of sets. In order theory, a nonempty family of sets \mathcal is called a ring (of sets) if it is closed under union and intersection.. That is, the following two statements are true for all sets A and B, #A,B\in\mathcal implies A \cup B \in \mathcal and #A,B\in\mathcal implies A \cap B \in \mathcal. In measure theory, a nonempty family of sets \mathcal is called a ring (of sets) if it is closed under union and relative complement (set-theoretic difference).. That is, the following two statements are true for all sets A and B, #A, B \in \mathcal implies A \cup B \in \mathcal and #A, B \in \mathcal implies A \setminus B \in \mathcal. This implies that a ring in the measure-theoretic sense always contains the empty set. Furthermore, for all sets and , :A\cap B=A\setminus(A\setminus B), which shows that a family of sets closed under relative complement is also closed under inter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sigma-ring
In mathematics, a nonempty collection of sets is called a -ring (pronounced ''sigma-ring'') if it is closed under countable union and relative complementation. Formal definition Let \mathcal be a nonempty collection of sets. Then \mathcal is a -ring if: # Closed under countable unions: \bigcup_^ A_ \in \mathcal if A_ \in \mathcal for all n \in \N # Closed under relative complementation: A \setminus B \in \mathcal if A, B \in \mathcal Properties These two properties imply: \bigcap_^ A_n \in \mathcal whenever A_1, A_2, \ldots are elements of \mathcal. This is because \bigcap_^\infty A_n = A_1 \setminus \bigcup_^\left(A_1 \setminus A_n\right). Every -ring is a δ-ring but there exist δ-rings that are not -rings. Similar concepts If the first property is weakened to closure under finite union (that is, A \cup B \in \mathcal whenever A, B \in \mathcal) but not countable union, then \mathcal is a ring but not a -ring. Uses -rings can be used instead of -field ... [...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] |
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 poin ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set (mathematics)
A set is the mathematical model for a collection of different things; a set contains ''elements'' or ''members'', which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other sets. The set with no element is the empty set; a set with a single element is a singleton. A set may have a finite number of elements or be an infinite set. Two sets are equal if they have precisely the same elements. 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. History The concept of a set emerged in mathematics at the end of the 19th century. The German word for set, ''Menge'', was coined by Bernard Bolzano in his work '' Paradoxes of the Infinite''. Georg Cantor, one of the founders of set theory, gave the following ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Closure (mathematics)
In mathematics, a subset of a given set is closed under an operation of the larger set if performing that operation on members of the subset always produces a member of that subset. For example, the natural numbers are closed under addition, but not under subtraction: is not a natural number, although both 1 and 2 are. Similarly, a subset is said to be closed under a ''collection'' of operations if it is closed under each of the operations individually. The closure of a subset is the result of a closure operator applied to the subset. The ''closure'' of a subset under some operations is the smallest subset that is closed under these operations. It is often called the ''span'' (for example linear span) or the ''generated set''. Definitions Let be a set equipped with one or several methods for producing elements of from other elements of .Operations and ( partial) multivariate function are examples of such methods. If is a topological space, the limit of a sequence of ele ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Union (set Theory)
In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection. It is one of the fundamental operations through which sets can be combined and related to each other. A refers to a union of zero (0) sets and it is by definition equal to the empty set. For explanation of the symbols used in this article, refer to the table of mathematical symbols. Union of two sets The union of two sets ''A'' and ''B'' is the set of elements which are in ''A'', in ''B'', or in both ''A'' and ''B''. In set-builder notation, :A \cup B = \. For example, if ''A'' = and ''B'' = then ''A'' ∪ ''B'' = . A more elaborate example (involving two infinite sets) is: : ''A'' = : ''B'' = : A \cup B = \ As another example, the number 9 is ''not'' contained in the union of the set of prime numbers and the set of even numbers , because 9 is neither prime nor even. Sets cannot have duplicate elements, so the union of the sets and is . Multi ... [...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] |
Intersection (set Theory)
In set theory, the intersection of two sets A and B, denoted by A \cap B, is the set containing all elements of A that also belong to B or equivalently, all elements of B that also belong to A. Notation and terminology Intersection is written using the symbol "\cap" between the terms; that is, in infix notation. For example: \\cap\=\ \\cap\=\varnothing \Z\cap\N=\N \\cap\N=\ The intersection of more than two sets (generalized intersection) can be written as: \bigcap_^n A_i which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols. Definition The intersection of two sets A and B, denoted by A \cap B, is the set of all objects that are members of both the sets A and B. In symbols: A \cap B = \. That is, x is an element of the intersection A \cap B if and only if x is both an element of A and an element of B. For example: * The intersection of the sets and is . * The number 9 is i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
σ-algebra
In mathematical analysis and in probability theory, a σ-algebra (also σ-field) on a set ''X'' is a collection Σ of subsets of ''X'' that includes the empty subset, is closed under complement, and is closed under countable unions and countable intersections. The pair (''X'', Σ) is called a measurable space. A σ-algebra is a type of set algebra. An algebra of sets needs only to be closed under the union or intersection of ''finitely'' many subsets, which is a weaker condition. The main use of σ-algebras is in the definition of measures; specifically, the collection of those subsets for which a given measure is defined is necessarily a σ-algebra. This concept is important in mathematical analysis as the foundation for Lebesgue integration, and in probability theory, where it is interpreted as the collection of events which can be assigned probabilities. Also, in probability, σ-algebras are pivotal in the definition of conditional expectation. In statistics, (sub) σ-alg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
