Re: On convergence of sequences of sets. Was Re: 1-1/2+1/3-1/4+1/5-1/6+1/7



On Wed, 13 Feb 2008 02:00:52 +0000, Gonçalo Rodrigues <nospam@xxxxxxxxxxxx>
wrote:


[Theorem:] Using the above formulas we can readily prove that if the
sequence (E_n) is decreasing than it is convergent and the limit is
/\_n E_n. Similarly, if (E_n) is increasing than it converges to \/_n
E_n.


Halmos:

"If the sequence is such that

E_n ( E_n+1, for n = 1, 2, ...,

it is called /increasing/; if

E_n ) E_n+1, for n = 1, 2, ...,

it is called /decreasing/. Both increasing and decreasing sequences
will be referred to as /monotone/. It is easy to verify that if (E_n)
is a monotone sequence, then lim E_n exists and is equal to
n
_
U E_n or | | E_n
n n

according as the sequence is increasing or decreasing."

"It is easy to verify"? Ok, let's try. (Just for an increasing sequence of
sets.)

Claim:

If E_n c E_n+1 for n = 1, 2, ..., then E^* = U En and E_* = U En.
n n
Hence lim E_n = U E_n.
n n

Proof:

x e E^* -> x e E_n for infinitely many values of n

-> En e N: x e E_n

-> x e U E_n.
n

x e U E_n -> En e N: x e E_n
n
-> Let n0 e N: x e E_n0

-> x e E_n0+1, x e E_n0+2, ... (since E_n c E_n+1 for all n e N)

-> x e E_n for infinitely many values of n

-> x e E^*.

Hence E^* = U E_n.
n

x e E_* -> x !e E_n (only) for finitely many values of n

-> En e N: x e E_n

-> x e U E_n.
n

x e U E_n -> En e N: x e E_n
n
-> Let n0 e N: x e E_n0

-> x e E_n0+1, x e E_n0+2, ... (since E_n c E_n+1 for all n e N)

-> x !e E_n (only) for finitely many values of n

-> x e E_*.

Hence E_* = U E_n. []
n


F.

--

E-mail: info<at>simple-line<dot>de
.



Relevant Pages

  • w32tm
    ... I would like to verify a sequence of execution. ... Since I have never used w32tm before I would like to verify its use before I ... then exit. ...
    (microsoft.public.win2000.general)
  • [PATCH] Re: Kernel oops when clearing bgp neighbor info with TCP MD5SUM enabled
    ... Could you verify this? ... The call sequence is: ... in all other TCP IPV4 cases, it is called from net/ipv4/tcp_ipv4.c from ...
    (Linux-Kernel)
  • Re: Random Sequence Generator
    ... Henrick Hellström wrote: ... > To verify such a code, simply let the PRNG generate the single value ... Without the sequence number you would have to run the ... > PRNG millions of times before the code could be accepted or rejected. ...
    (borland.public.delphi.thirdpartytools.general)
  • Re: Kernel oops when clearing bgp neighbor info with TCP MD5SUM enabled
    ... Could you verify this? ... The call sequence is: ... More majordomo info at http://vger.kernel.org/majordomo-info.html ... Please read the FAQ at http://www.tux.org/lkml/ ...
    (Linux-Kernel)
  • Re: Object Model feedback requested
    ... then sketched an object model, wrote sequence ... diagrams, ... If you are asking "please verify my design before I carve it in granite", ...
    (comp.object)

Quantcast