partitions form a lattice
Let S be a set. Let Part(S) be the set of all partitions on S. Since each partition is a cover of S, Part(S) is partially ordered by covering
refinement relation
, so that P1⪯P2 if for every a∈P1, there is a b∈P2 such that a⊆b. We say that a partition P is finer than a partition Q if P⪯Q, and coarser than Q if Q⪯P.
Proposition 1.
Part(S) is a complete lattice
Proof.
For any set 𝒫 of partitions Pi of S, the intersection ⋂𝒫 is a partition of S. Take the meet of Pi to be this intersection. Next, let 𝒬 be the set of those partitions of S such that each Q∈𝒬 is coarser than each Pi. This set is non-empty because S×S∈𝒬. Take the meet P′ of all these partitions which is again coarser than all partitions Pi. Define the join of Pi to be P′ and the proof is complete
.
∎
Remarks.
-
•
The top element of Part(S) is S×S and the bottom is the diagonal relation on S.
-
•
Correspondingly, the partition lattice of S also defines the lattice of equivalence relations Δ on S.
-
•
Given a family {Ei∣i∈I} of equvialence relations on S, we can explicitly describe the join E:= of , as follows: iff there is a finite sequence
such that
(1) It is easy to see this definition makes an equivalence relation
. To see that is the supremum
of the , first note that each . Suppose now is an equivalence relation on such that and . Then we get a finite sequence as described by (1) above, so for each . Hence also.
Title | partitions form a lattice![]() |
---|---|
Canonical name | PartitionsFormALattice |
Date of creation | 2013-03-22 16:45:22 |
Last modified on | 2013-03-22 16:45:22 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 6 |
Author | CWoo (3771) |
Entry type | Derivation |
Classification | msc 06B20 |
Defines | lattice of equivalence relations |