• A is a subset of B. inf A >= inf B, sup A sup B. sequence of suprema form weakly decreasing sequence, and the sequence of infima form a weakly increasing sequence.
    Quick exercise: show that for all .
    .
  • Note that means that every is .
  • proof: liminf limsup
    Pick any . for all . Thus, is an upper bound for the set of all infima. Thus, . Since was arbitrary, the preceding statement is valid for all . Thus, is a lower bound for the set of all suprema. Thus, .
  • proof that liminf = limsup only when the sequence converges.

Claim: converges limsup = liminf

Suppose .
pf of
Cases:

Case 1:
Let .
There exists a such that for all , .
Thus, and and must lie in .
Thus, and must also lie in the same interval.
Since was arbitrary, this proves that .

pf of
same cases.

Case 1:
limsup = liminf = p
i.e, sequence of suprema of tails converges to p (from above monotonically)
sequence of infima of tails converges to p (from below monotonically)
We have to show that .
let .
Find such that for all

.
.

Proof of theorem 3.19

Reconciling Rudin and Kulkarni