Properly showing that uncountable sum of measures finite nonzero sets is infinite, given they are su

Pattab

Pattab

Answered question

2022-07-15

Properly showing that uncountable sum of measures finite nonzero sets is infinite, given they are subsets of X of finite measure.
In a question where ( X , , μ ) is a finite measure space, I am asked to show that the set { x | μ ( { x } > 0 ) } is countable at most.
While intuitively this has to be true, because as long as it is countable any series of nonzero measures of sets must converge and this can happen for geometric sequences of measures, but for an uncountable sum, this "can't" be the case, but how to show that- I can't seem to understand.
Firstly, is this the way to solve it? Trying to reach a contradiction, or maybe uncountable sum of elements is generally meaningless as an expression? I'm not sure, what

Answer & Explanation

Ordettyreomqu

Ordettyreomqu

Beginner2022-07-16Added 22 answers

Define A n := { x μ ( { x } ) > 1 / n } and consider B n := A n A n 1 .
Sylvia Byrd

Sylvia Byrd

Beginner2022-07-17Added 6 answers

Define A n = { x :   μ ( { x } ) 1 / n }. If A n contains at least m points, then μ ( A n ) m / n. Now μ ( A ) μ ( X ) < , so m n μ ( X ). Hence, A n contains at most n μ ( X ) elements. So A n is finite. The set in question is contained in the union of these A n , so it is countable.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?