Ascending subset sequence with axiom of choice

  • Context: Undergrad 
  • Thread starter Thread starter jostpuur
  • Start date Start date
  • Tags Tags
    Axiom Choice Sequence
Click For Summary
SUMMARY

The discussion centers on the use of the Axiom of Choice (AoC) to establish the existence of an ascending sequence of subsets \( (A_n)_{n=1,2,3,\ldots} \) of the real numbers \( \mathbb{R} \) that satisfies specific properties regarding Lebesgue outer measure \( \lambda^* \). It is concluded that if the sets \( A_n \) are Lebesgue measurable, the limit of their measures equals the measure of their union. However, without the measurability assumption, the continuity from below of \( \lambda^* \) does not hold, preventing the construction of such a sequence. The discussion references a proof from Math Stack Exchange, highlighting a critical oversight regarding the dependence of sets on epsilon.

PREREQUISITES
  • Understanding of the Axiom of Choice in set theory
  • Familiarity with Lebesgue outer measure \( \lambda^* \)
  • Knowledge of measure theory, particularly Lebesgue measure
  • Basic principles of mathematical induction
NEXT STEPS
  • Study the implications of the Axiom of Choice in topology and measure theory
  • Explore Lebesgue outer measure continuity properties
  • Review proofs related to non-measurable sets and their measures
  • Investigate the relationship between measurable sets and the Axiom of Choice
USEFUL FOR

Mathematicians, particularly those specializing in set theory, measure theory, and real analysis, will benefit from this discussion. It is also relevant for students seeking to understand the complexities of Lebesgue measure and the implications of the Axiom of Choice.

jostpuur
Messages
2,112
Reaction score
19
Is it possible to use Axiom of Choice to prove that there would exist a sequence (A_n)_{n=1,2,3,\ldots} with the properties: A_n\subset\mathbb{R} for all n=1,2,3,\ldots,

<br /> A_1\subset A_2\subset A_3\subset\cdots<br />

and

<br /> \lim_{k\to\infty} \lambda^*(A_k) &lt; \lambda^*\Big(\bigcup_{k=1}^{\infty} A_k\Big)<br />

where \lambda^* is the Lebesgue outer measure?

If we assume that all sets A_1,A_2,A_3,\ldots are Lebesgue measurable, then it is known that

<br /> \lim_{k\to\infty} \lambda(A_k) = \lambda\Big(\bigcup_{k=1}^{\infty} A_k\Big)<br />

If we don't assume that the sets are measurable, the direction "\leq" can still be proven easily, but the direction "\geq" is more difficult.
 
Physics news on Phys.org
Sorry if this comes from a place of ignorance, but I notice something and I wonder if you'd comment on it.

Since every ##A_n \subset A_{n+1}##, it seems that it follows by induction that ##A_n = \bigcup_{k=0}^n A_k##. If this is the case, it seems that ##\lim_{k\to \infty}A_k=\bigcup_{k=0}^\infty A_k## and so naturally ##\lim_{k\to \infty}\lambda(A_k)=\lambda(\bigcup_{k=0}^\infty A_k)##. If this is true, how would the AoC avoid this?
 
The proof on math stack exchange contains a little mistake, but I got a feeling that the proof works anyway, and the little mistake can be fixed. The mistake is that the guy forgets that the sets G_k depend on epsilon, so they are like sets G_k(\epsilon). He first proves that

<br /> m\Big(\bigcup_{k=1}^n G_k\Big) &lt; m^*(E_n) + \Big(1 - \frac{1}{2^n}\Big)\epsilon<br />

and then states that because the epsilon is arbitrary, also

<br /> m\Big(\bigcup_{k=1}^n G_k\Big) \leq m^*(E_n)<br />

would be true, but that does not make sense.

I did not find any mistake before the point where the (1-\frac{1}{2^n})\epsilon spread is present, so I believe that it is true. That inequality implies

<br /> m\Big(\bigcup_{k=1}^{\infty} G_k\Big) \leq \lim_{n\to\infty}m^*(E_n) + \epsilon<br />

and this is sufficient to complete the proof.
 
Last edited:

Similar threads

  • · Replies 44 ·
2
Replies
44
Views
7K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K