VIDEOS 1 TO 50

1.5: Partitions of Sets

Published: 2013/01/25

Channel: wishizuk

(Abstract Algebra 1) Definition of a Partition

Published: 2013/12/03

Channel: learnifyable

Partition of a set

Published: 2009/09/15

Channel: Wei Ching Quek

Equivalence Classes Partition a Set Proof

Published: 2014/11/30

Channel: The Math Sorcerer

Find the number of ways to partition a set of 2 elements.

Published: 2013/04/20

Channel: Jeffery Dittenber

Equivalence Relations & Set Partitions, Part One

Published: 2015/09/16

Channel: CU Calculus

Partition of a set

Published: 2014/11/06

Channel: Audiopedia

21 Partition of a set

Published: 2015/05/06

Channel: Sujay Krishna

Windows 10 - How To: Partition Hard Drives

Published: 2015/08/26

Channel: On MSFT

Partition of a set

Published: 2016/01/22

Channel: WikiAudio

2. 3-Partition I

Published: 2015/07/14

Channel: MIT OpenCourseWare

Equivalence Relations And Partitions | Math | Chegg Tutors

Published: 2016/04/20

Channel: Chegg

1.5. Set Partitions

Published: 2014/06/04

Channel: UCLan Cyprus | Mathematics

Finite State Machine State equivalence Partitioning and Minimization FSM-Lec-1

Published: 2014/05/15

Channel: Shibaji Paul

(Abstract Algebra 1) Partitions and Equivalence Relations

Published: 2013/12/09

Channel: learnifyable

Lecture 23 - Equivalence relations and partitions

Published: 2007/12/05

Channel: nptelhrd

Partition Theorem (Total Probability Theorem) & Bayes Theorem | Example

Published: 2015/02/23

Channel: WelshBeastMaths

Counting Elements, Product Sets, Partitions

Published: 2012/05/25

Channel: David Waldo

Chapter 1 #2 - Sets, Partitions, and Tree Diagrams

Published: 2011/01/20

Channel: FiniteHelp

Partitioning Sets By Number Tool

Published: 2013/04/05

Channel: EDUGains Ontario

How to Make a Partition on Windows 7

Published: 2010/03/17

Channel: Allan Baguinon

Equivalence Relations & Set Partitions, Part Two

Published: 2015/09/16

Channel: CU Calculus

set theory lesson 6 partition of a class for bsc part 1

Published: 2017/03/20

Channel: ocean of gyan

Programming Interview: Balanced Partition of Array (Dynamic Programming)

Published: 2012/08/03

Channel: saurabhschool

The Graph Partitioning Problem

Published: 2016/06/06

Channel: Udacity

Example of Countable Partition

Published: 2011/09/29

Channel: MathDoctorBob

Subset Sum Problem Dynamic Programming

Published: 2015/03/29

Channel: Tushar Roy - Coding Made Simple

Unions and Partitions - Foundations of Pure Mathematics - Dr Joel Feinstein

Published: 2015/02/03

Channel: University of Nottingham

Set (Partition) Model

Published: 2015/10/02

Channel: Mildred Osborne

Determine whether they form a partition for the set of integers

Published: 2017/05/02

Channel: stephen jorge

[Mathematical Linguistics] Equivalence Relations and Partitions

Published: 2016/05/16

Channel: TheTrevTutor

Set Partition Statistics moment formulas and normality Part 1

Published: 2014/12/06

Channel: Experimental mathematics

Venn Diagrams and Partitions - Sets, Partitions, and Tree Diagrams - Finite Math

Published: 2011/10/14

Channel: FiniteHelp

How to Install and Partition Windows 7

Published: 2011/01/21

Channel: DIY PC Repairs

Set Partition as primary or logical partition | MiniTool Partition Wizard Official Video Guide

Published: 2014/07/23

Channel: minitoolsolution

Palindrome Partition Dynamic Programming

Published: 2015/03/14

Channel: Tushar Roy - Coding Made Simple

Directed Graphs and Set Partitions

Published: 2012/12/17

Channel: Q Liu

Partitions (Screencast 7.3.3)

Published: 2012/11/27

Channel: GVSUmath

Set Partition of Raid

Published: 2013/11/21

Channel: Romdon Sutthikarn

Apache Hive - 02 Partition an existing data set according to one or more partition keys

Published: 2016/06/30

Channel: itversity

Equivalence Partitions

Published: 2015/10/27

Channel: Jason Aubrey

Class 11 XI CBSE Sets Part 2

Published: 2014/04/27

Channel: studyezee

(PP 2.5) Partition rule, conditional measure

Published: 2011/04/23

Channel: mathematicalmonk

Partitions

Published: 2015/06/09

Channel: Sara Jensen

1.2 Venn Diagrams and Partitions

Published: 2011/01/13

Channel: FiniteHelp

Sizes of Sets - Finding n(A U B)' - Sets, Partitions, and Tree Diagrams - Finite Math

Published: 2011/08/27

Channel: FiniteHelp

Analysis 1.3 Equivalence Relations, Partitions, Definition and Proof

Published: 2016/02/12

Channel: Kaveh Mozafari

Partition of a Set - bury P

Published: 2011/07/27

Channel: sbickleaf

Partitioning a Set of Takis Bags

Published: 2015/04/05

Channel: Carlos F Gonzalez

Commercial Partition Set out

Published: 2013/07/16

Channel: The Wollongong Chippy

From Wikipedia, the free encyclopedia

In mathematics, a **partition of a set** is a grouping of the set's elements into non-empty subsets, in such a way that every element is included in one and only one of the subsets.

A partition of a set *X* is a set of nonempty subsets of *X* such that every element *x* in *X* is in exactly one of these subsets^{[2]} (i.e., *X* is a disjoint union of the subsets).

Equivalently, a family of sets *P* is a partition of *X* if and only if all of the following conditions hold:^{[3]}

- The family
*P*does not contain the empty set (that is ). - The union of the sets in
*P*is equal to*X*(that is ). The sets in*P*are said to**cover***X*. - The intersection of any two distinct sets in
*P*is empty (that is ). The elements of*P*are said to be pairwise disjoint.

The sets in *P* are called the *blocks*, *parts* or *cells* of the partition.^{[4]}

The **rank** of *P* is |*X*| − |*P*|, if *X* is finite.

- Every singleton set {
*x*} has exactly one partition, namely { {*x*} }. - The empty set has exactly one partition, namely .
- For any nonempty set
*X*,*P*= {*X*} is a partition of*X*, called the**trivial partition**. - For any non-empty proper subset
*A*of a set*U*, the set*A*together with its complement form a partition of*U*, namely, {*A*,*U*\*A*}. - The set { 1, 2, 3 } has these five partitions (one partition per item):
- { {1}, {2}, {3} }, sometimes written 1|2|3.
- { {1, 2}, {3} }, or 12|3.
- { {1, 3}, {2} }, or 13|2.
- { {1}, {2, 3} }, or 1|23.
- { {1, 2, 3} }, or 123 (in contexts where there will be no confusion with the number).

- The following are not partitions of { 1, 2, 3 }:
- { {}, {1, 3}, {2} } is not a partition (of any set) because one of its elements is the empty set.
- { {1, 2}, {2, 3} } is not a partition (of any set) because the element 2 is contained in more than one block.
- { {1}, {2} } is not a partition of {1, 2, 3} because none of its blocks contains 3; however, it is a partition of {1, 2}.

For any equivalence relation on a set *X*, the set of its equivalence classes is a partition of *X*. Conversely, from any partition *P* of *X*, we can define an equivalence relation on *X* by setting *x* ~ *y* precisely when *x* and *y* are in the same part in *P*. Thus the notions of equivalence relation and partition are essentially equivalent.^{[5]}

The axiom of choice guarantees for any partition of a set *X* the existence of a subset of *X* containing exactly one element from each part of the partition. This implies that given an equivalence relation on a set one can select a canonical representative element from every equivalence class.

A partition *α* of a set *X* is a **refinement** of a partition *ρ* of *X*—and we say that *α* is *finer* than *ρ* and that *ρ* is *coarser* than *α*—if every element of *α* is a subset of some element of *ρ*. Informally, this means that *α* is a further fragmentation of *ρ*. In that case, it is written that *α* ≤ *ρ*.

This *finer-than* relation on the set of partitions of *X* is a partial order (so the notation "≤" is appropriate). Each set of elements has a least upper bound and a greatest lower bound, so that it forms a lattice, and more specifically (for partitions of a finite set) it is a geometric lattice.^{[6]} The *partition lattice* of a 4-element set has 15 elements and is depicted in the Hasse diagram on the left.

Based on the cryptomorphism between geometric lattices and matroids, this lattice of partitions of a finite set corresponds to a matroid in which the base set of the matroid consists of the atoms of the lattice, namely, the partitions with singleton sets and one two-element set. These atomic partitions correspond one-for-one with the edges of a complete graph. The matroid closure of a set of atomic partitions is the finest common coarsening of them all; in graph-theoretic terms, it is the partition of the vertices of the complete graph into the connected components of the subgraph formed by the given set of edges. In this way, the lattice of partitions corresponds to the lattice of flats of the graphic matroid of the complete graph.

Another example illustrates the refining of partitions from the perspective of equivalence relations. If *D* is the set of cards in a standard 52-card deck, the *same-color-as* relation on *D* – which can be denoted ~_{C} – has two equivalence classes: the sets {red cards} and {black cards}. The 2-part partition corresponding to ~_{C} has a refinement that yields the *same-suit-as* relation ~_{S}, which has the four equivalence classes {spades}, {diamonds}, {hearts}, and {clubs}.

A partition of the set *N* = {1, 2, ..., *n*} with corresponding equivalence relation ~ is **noncrossing**^{[clarification needed]} provided that for any two 'cells' C1 and C2, either all the elements in C1 are < than all the elements in C2 or they are all > than all the elements in C2. In other words: given distinct numbers *a*, *b*, *c* in *N*, with *a* < *b* < *c*, if *a* ~ *c* (they both are in a cell called C), it follows that also *a* ~ *b* and *b* ~ *c*, that is *b* is also in C. The lattice of noncrossing partitions of a finite set has recently taken on importance because of its role in free probability theory. These form a subset of the lattice of all partitions, but not a sublattice, since the join operations of the two lattices do not agree.

The total number of partitions of an *n*-element set is the Bell number *B _{n}*. The first several Bell numbers are

and have the exponential generating function

The Bell numbers may also be computed using the Bell triangle in which the first value in each row is copied from the end of the previous row, and subsequent values are computed by adding two numbers, the number to the left and the number to the above left of the position. The Bell numbers are repeated along both sides of this triangle. The numbers within the triangle count partitions in which a given element is the largest singleton.

The number of partitions of an *n*-element set into exactly *k* nonempty parts is the Stirling number of the second kind *S*(*n*, *k*).

The number of noncrossing partitions of an *n*-element set is the Catalan number *C _{n}*, given by

Wikimedia Commons has media related to .Set partitions |

- Exact cover
- Cluster analysis
- Weak ordering (ordered set partition)
- Equivalence relation
- Partial equivalence relation
- Partition refinement
- List of partition topics
- Lamination (topology)
- Rhyme schemes by set partition

**^**Knuth, Donald E. (2013), "Two thousand years of combinatorics", in Wilson, Robin; Watkins, John J.,*Combinatorics: Ancient and Modern*, Oxford University Press, pp. 7–37**^**Naive Set Theory (1960).*Halmos, Paul R.*Springer. p. 28. ISBN 9780387900926.**^**Lucas, John F. (1990).*Introduction to Abstract Mathematics*. Rowman & Littlefield. p. 187. ISBN 9780912675732.**^**Brualdi,*pp*. 44–45**^**Schechter,*p*. 54**^**Birkhoff, Garrett (1995),*Lattice Theory*, Colloquium Publications,**25**(3rd ed.), American Mathematical Society, p. 95, ISBN 9780821810255.

- Brualdi, Richard A. (2004).
*Introductory Combinatorics*(4th ed.). Pearson Prentice Hall. ISBN 0-13-100119-1. - Schechter, Eric (1997).
*Handbook of Analysis and Its Foundations*. Academic Press. ISBN 0-12-622760-8.

Wikipedia content is licensed under the GFDL and (CC) license