In set theory and related branches of mathematics, a collection of subsets of a given set is called a family of subsets of , or a family of sets over More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. A family of sets may be defined as a function from a set , known as the index set, to , in which case the sets of the family are indexed by members of .
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 is also called a hypergraph. The subject of extremal set theory concerns the largest and smallest examples of families of sets satisfying certain restrictions.
The set of all subsets of a given set is called the power set of and is denoted by The power set of a given set is a family of sets over
A subset of having elements is called a -subset of
The -subsets of a set form a family of sets.
Let An example of a family of sets over (in the multiset sense) is given by where and
The class of all ordinal numbers is a large family of sets. That is, it is not itself a set but instead a proper class.
Any family of subsets of a set is itself a subset of the power set if it has no repeated members.
Any family of sets without repetitions is a subclass of the proper class of all sets (the universe).
Hall's marriage theorem, due to Philip Hall, gives necessary and sufficient conditions for a finite family of non-empty sets (repetitions allowed) to have a system of distinct representatives.
If is any family of sets then denotes the union of all sets in where in particular,
Any family of sets is a family over and also a family over any superset of
Certain types of objects from other areas of mathematics are equivalent to families of sets, in that they can be described purely as a collection of sets of objects of some type:
A hypergraph, also called a set system, is formed by a set of vertices together with another set of hyperedges, each of which may be an arbitrary set.
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
Learn to optimize on smooth, nonlinear spaces: Join us to build your foundations (starting at "what is a manifold?") and confidently implement your first algorithm (Riemannian gradient descent).
Un recouvrement d'un ensemble E est une famille (X) d'ensembles dont l'union contient E, c'est-à-dire telle que tout élément de E appartient à au moins l'un des X. Certains auteurs imposent de plus que les X soient des sous-ensembles de E. Dans ce cas, les X forment un recouvrement de E (si et) seulement si leur union est égale à E, et une partition de E s'ils sont de plus non vides et deux à deux disjoints. Par exemple, pour E = {1, 2, 3, 4}, la famille (∅, {1, 2, 3}, {3, 4}) n'est qu'un recouvrement alors que ({1, 2}, {3, 4}) est une partition.
In combinatorics, a greedoid is a type of set system. It arises from the notion of the matroid, which was originally introduced by Whitney in 1935 to study planar graphs and was later used by Edmonds to characterize a class of optimization problems that can be solved by greedy algorithms. Around 1980, Korte and Lovász introduced the greedoid to further generalize this characterization of greedy algorithms; hence the name greedoid. Besides mathematical optimization, greedoids have also been connected to graph theory, language theory, order theory, and other areas of mathematics.
In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids are commonly axiomatized in two equivalent ways, either as a set system modeling the possible states of such a process, or as a formal language modeling the different sequences in which elements may be included.
The course is based on Durrett's text book
Probability: Theory and Examples.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
Couvre la théorie avancée du comptage, des probabilités et de l'information, y compris la résolution des relations de récurrence homogènes linéaires et des problèmes de contrôle de chapeaux.
Neuromodulation of neocortical microcircuits is one of the most fascinatingand mysterious aspects of brain physiology. Despite over a century of research,the neuroscientific community has yet to uncover the fundamentalbiological organizing principles under ...
What are the barriers on the way to zero-emissions personal mobility (ZEM)? Based on the world cafe discussion with experts from the ETH domain, two main sets of barriers arise: a first set related to the difficulties of organising ZEM, a second set relate ...
2020
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combi- natory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragment ...