Namespaces
Variants
Actions

Partition

From Encyclopedia of Mathematics
Jump to: navigation, search

2010 Mathematics Subject Classification: Primary: 54B [MSN][ZBL]

Of a topological space

A closed set $E$ in a topological space $X$ that partitions $X$ between two given sets $P$ and $Q$ (or, in other words, separates $P$ and $Q$ in $X$), i.e. such that $X \setminus E = H_1 \cup H_2$, where $H_1$ and $H_2$ are disjoint and open in $X \setminus E$, $P \subseteq H_1$, $Q \subseteq H_2$ ($P$ and $Q$ are open in all of $X$). A partition is called fine if its interior is empty. Any binary decomposition (i.e. a partition consisting of two elements) $\alpha = (A_1,A_2)$ of a space $X$ defines a fine partition in $X$: $B$ is the boundary of $A_1$, which is the boundary of $A_2$, where $X\setminus B = O_1 \cup O_2$, in which $O_i$ is the open kernel (cf. Kernel of a set) of $A_i$, $i=1,2$. The converse is also true. In essence, the concept of a partition between sets leads to the concept of connectedness. The converse also applies: A space $X$ is disconnected if $\emptyset$ is a partition between non-empty sets.


Comments

Related notions in this context are those of a separator and of a cut.

If $A$ and $B$ are disjoint subsets of a space $X$, then a separator between$A$ and $B$ is a set $S$ such that $X \setminus S = V \cup W$ with $V$ and $WW$ disjoint and open in $X \setminus S$, and $A \subseteq V$ and $B \subseteq W$. So a partition is a closed separator.

A set $C$ is a cut between $A$ and $B$ if $C$ intersects every continuum that intersects both $A$ and $B$.

One readily sees that every partition is a separator and that every separator is a cut, and the following examples show that the notions are in general distinct: the open interval $(0,1)$ is a separator between $\{0\}$ and $\{1\}$ in the interval $[0,1]$, but not a partition; in the well-known subspace $\{0\} \times [-1,1] \cup \{ (x,\sin(1/x)) : 0 < x \le 1 \}$ of the Euclidean space, the point $(0,0)$ is a cut but not a separator between the points $(0,1)$ and $(1,\sin 1)$.

2010 Mathematics Subject Classification: Primary: 11P [MSN][ZBL]

Of a positive integer

A partition of a positive integer is a decomposition of as a sum of positive integers. For example, the partitions of 4 read: , , , , . The number of different partitions of is denoted by . So, . L. Euler gave a non-trivial recurrence relation for (see [a1]) and Ramanujan discovered the surprising congruences (), (), (), and others. He also found the asymptotic relation

where . Later this was completed to an exact series expansion by H. Rademacher (see [a2]).

One can also distinguish other partitions, having particular properties, such as the numbers in the decomposition being distinct (see [a3]). See also Additive number theory; Additive problems.

References

[a1] G.H. Hardy, E.M. Wright, "An introduction to the theory of numbers" , Oxford Univ. Press (1979) pp. Chapt. XVI
[a2] T.M. Apostol, "Modular functions and Dirichlet series in number theory" , Springer (1976)
[a3] G.E. Andrews, "The theory of partitions" , Addison-Wesley (1976)
[a4] R. Engelking, "Dimension theory" , North-Holland & PWN (1978) pp. 19; 50

Of a set

Expression of a set $Y$ as a disjoint union of subsets: a family of subsets $X_\lambda \subseteq Y$ for $\lambda \in \Lambda$, for some index set $\Lambda$, which are pairwise disjoint, $\lambda \neq \mu \Rightarrow X_\lambda \cap X_\mu = \emptyset$ and such that the union $\bigcup_{\lambda \in \Lambda} X_\lambda = Y$. The classes of an equivalence relation on $Y$ form a partition of $Y$, as does the kernel of a function; conversely a partition defines an equivalence relation and a function giving rise to that partition. See also Decomposition.

References

[b1] P. R. Halmos, Naive Set Theory, Undergraduate Texts in Mathematics, Springer (1960) ISBN 0-387-90092-6
How to Cite This Entry:
Partition. Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Partition&oldid=35402
This article was adapted from an original article by M.I. Voitsekhovskii (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article