See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/371500302
σ-Algebra on Finite Set
Experiment Findings · June 2023
CITATIONS READS
0 282
1 author:
Elmar Constant Lasa
African Institute for Mathematical Sciences South Africa
2 PUBLICATIONS 0 CITATIONS
SEE PROFILE
All content following this page was uploaded by Elmar Constant Lasa on 12 June 2023.
The user has requested enhancement of the downloaded file.
σ-Algebra on Finite Set
Hmj
June 12, 2023
In the following, X is a finite set.
Theorem 1 Let A be a σ-algebra on X. Then A ' 2Ω for some Ω.
Lemma 2 Let S ⊂ A be the set of all singletons in A. Then S ' S for some S ⊂ X, i.e. S is
equipotent to some subset of X.
To prove this, let A be a σ-algebra with S = {{s1 }, . . . , {sk }} being the set of all singletons in A.
Immediately k ≤ card(X). Then, the correspondence:
{s1 } −→ s1 ;
...
{sk } −→ sk .
is a bijection between S and S := {s1 , . . . , sk } ⊂ X.
Now, we use the notations in lemma 2.
(1) Assume that k ≥ n − 1. We can find sj1 , . . . , sjn−1 ∈ S with
{sj1 }, . . . , {sjn−1 } ∈ S ⊂ A
S
The singleton {sjn } := X \ 1≤m≤n−1 {sjm } is an element of A as complement of countable
(finite!) unions of elements of A. Hence, all the possible
S singletons (on X) are elements of A.
Since any element A ∈ A can be written as A = j {aj }, it follows
A = 2X
(2) Now, we deal with k ≤ n − 2. We have 2S ⊂ A and each element of 2S is associated
to its
S
complement in X which is also an element of A. This implies that 2 × Card 2 ≤ Card (A),
that is card (A) ≥ 2k+1 .
Consider X = {s1 , . . . , sk , sk+1 , . . . , sn }. The following elements do not belong to A:
{sj }, for j = k + 1, . . . , n;
{sj1 , sj2 } for k + 1 ≤ j1 < j2 ≤ n;
···
1
{sj1 , . . . , sjn−k−1 } for k + 1 ≤ j1 < · · · < jn−k−1 ≤ n
Denote by N the set of all these elements.
There are 2n−k − 2 elements. For each A taken among these elements, and for any B ∈ 2S ,
the disjoint union C = A ∪ B does not belong to A (otherwise, because of disjointness,
A = C \ B = X \ (X \ C ∪ X \ (X \ B)) would belong to A which implies contradiction).
Therefore
∀A ∈ 2S , ∀b ∈ N , A ∪ B ∈
/ A.
Consequently,
Card (A) ≤ 2n − 2k × 2n−k − 2 = 2k+1
Hence Card (A) = 2k+1 which ends the proof.
View publication stats
