Ascending subset sequence with axiom of choice

  • Level: Undergrad 
  • Thread starter Thread starter jostpuur
  • Start date Start date
  • Tags Tags
    Axiom Choice Sequence
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
3 replies · 2K views
jostpuur
Messages
2,112
Reaction score
19
Is it possible to use Axiom of Choice to prove that there would exist a sequence [itex](A_n)_{n=1,2,3,\ldots}[/itex] with the properties: [itex]A_n\subset\mathbb{R}[/itex] for all [itex]n=1,2,3,\ldots[/itex],

[tex] A_1\subset A_2\subset A_3\subset\cdots[/tex]

and

[tex] \lim_{k\to\infty} \lambda^*(A_k) < \lambda^*\Big(\bigcup_{k=1}^{\infty} A_k\Big)[/tex]

where [itex]\lambda^*[/itex] is the Lebesgue outer measure?

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

[tex] \lim_{k\to\infty} \lambda(A_k) = \lambda\Big(\bigcup_{k=1}^{\infty} A_k\Big)[/tex]

If we don't assume that the sets are measurable, the direction "[itex]\leq[/itex]" can still be proven easily, but the direction "[itex]\geq[/itex]" 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 [itex]G_k[/itex] depend on epsilon, so they are like sets [itex]G_k(\epsilon)[/itex]. He first proves that

[tex] m\Big(\bigcup_{k=1}^n G_k\Big) < m^*(E_n) + \Big(1 - \frac{1}{2^n}\Big)\epsilon[/tex]

and then states that because the epsilon is arbitrary, also

[tex] m\Big(\bigcup_{k=1}^n G_k\Big) \leq m^*(E_n)[/tex]

would be true, but that does not make sense.

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

[tex] m\Big(\bigcup_{k=1}^{\infty} G_k\Big) \leq \lim_{n\to\infty}m^*(E_n) + \epsilon[/tex]

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