Mathematical logic and foundations Definition
Partition of a set
Definition
Let be a set. A partition of is a set of subsets of , called blocks, with these three properties:
- each block is nonempty;
- the blocks are pairwise disjoint;
- the union of the blocks is .
Equivalently, each element of is in exactly one block.
Remarks
The set is a partition of . The even and the odd integers form a partition of with two blocks. The equivalence classes form a partition, and each partition comes from exactly one equivalence relation. See the correspondence between equivalence relations and partitions.
Reading path
To understand this page from the ground up, read these 17 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Empty set object
- Family of sets definition
- Intersection definition
- Union definition
- Existential quantifier definition
- Universal quantifier definition
- Disjoint sets definition
- Subset definition
- Union of a family of sets definition
- Partition of a set definition
Where this leads
57 pages build on this one.
- Prior probability
- A finite group is nilpotent iff it is the product of its Sylow subgroups
- Chapman–Kolmogorov equation
- Equivalence classes form a partition
- Law of total variance
- Law of total expectation
- Groups of prime order are cyclic
- Correspondence between equivalence relations and partitions
- Order of an element divides the order of the group
- Fixed points of a p-group action
- Second Sylow theorem
- Groups of order p squared are abelian
- The number of Sylow subgroups is the index of the normaliser
- Base rate fallacy
- Law of total probability
- The alternating group A5 is simple
- Abelian simple groups have prime order
- Cauchy's theorem
- Bayesian inference
- Posterior probability
- The number of Sylow subgroups divides the index
- Bayes' theorem
- Monty Hall problem
- Converse of Lagrange's theorem fails for the alternating group A4
- Third Sylow theorem
- Frattini argument
- Size of an orbit times the size of the stabiliser
- First Sylow theorem
- Law of total probability for an event and its complement
- Gambler's ruin
- Absorbing Markov chain
- Groups of order pq
- Burnside's lemma
- g to the order of the group is the identity
- Bernstein–von Mises theorem
- Lagrange's theorem
- Galois group of a prime degree polynomial with two nonreal roots
- Empirical Bayes method
- Bayes factor
- Lindley's paradox
- Bayes estimator
- Nichols–Zoeller theorem
- Hall's theorem on solvable groups
- Continuous-time Markov chain
- Proof that the order of an element divides the order of the group
- Hall subgroup
- Sylow theorems
- Bayes risk
- Frattini subgroup
- Proof that groups of prime order are cyclic
- Credible interval
- Jeffreys prior
- Bayesian hierarchical model
- Conjugate prior
- Shrinkage estimator
- Proof of Lagrange's theorem
- Particle filter
Further reading
- Web https://en.wikipedia.org/wiki/Partition_of_a_set, lead section
About this page
| Tag | 09CCE86A6D |
|---|---|
| URI | m2://09CCE86A6D |
| Kind | definition |
| Writing | W1 stated |
| MSC | 03E20 |
| Defines | Partition of a set |
| Uses | Subset, Disjoint sets, Union of a family of sets |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.