(** This file is part of the Coquelicot formalization of real analysis in Coq: http://coquelicot.saclay.inria.fr/  Copyright (C) 2011-2015 Sylvie Boldo #<br /># Copyright (C) 2011-2015 Catherine Lelay #<br /># Copyright (C) 2011-2015 Guillaume Melquiond  This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.  This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the COPYING file for more details. *)
(** This file describes properties and definitions about limits of real sequences. This includes properties about the predicates [is_lim_seq] and [ex_lim_seq]. This file also defines several total functions using the Limited Principle of Omniscience. These total functions on [R] sequences are [Sup_seq], [Inf_seq], [LimSup_seq], [LimInf_seq] and of course [Lim_seq]. *)
Open Scope R_scope.
(** * Sup and Inf of sequences in Rbar *)
(** ** Definitions *)
Definition is_sup_seq (u : nat -> Rbar) (l : Rbar) :=
match l with
| Finite l => forall (eps : posreal), (forall n, Rbar_lt (u n) (l+eps))
/\ (exists n, Rbar_lt (l-eps) (u n))
| p_infty => forall M : R, exists n, Rbar_lt M (u n)
| m_infty => forall M : R, forall n, Rbar_lt (u n) M
end.
Definition is_inf_seq (u : nat -> Rbar) (l : Rbar) :=
match l with
| Finite l => forall (eps : posreal), (forall n, Rbar_lt (Finite (l-eps)) (u n))
/\ (exists n, Rbar_lt (u n) (Finite (l+eps)))
| p_infty => forall M : R, forall n, Rbar_lt (Finite M) (u n)
| m_infty => forall M : R, exists n, Rbar_lt (u n) (Finite M)
end.
(** Equivalent forms *)

(* Specifications: *)
Lemma is_inf_opp_sup_seq (u : nat -> Rbar) (l : Rbar) :
is_inf_seq (fun n => Rbar_opp (u n)) (Rbar_opp l)
<-> is_sup_seq u l.
Lemma is_sup_opp_inf_seq (u : nat -> Rbar) (l : Rbar) :
is_sup_seq (fun n => Rbar_opp (u n)) (Rbar_opp l)
<-> is_inf_seq u l.
Lemma is_sup_seq_lub (u : nat -> Rbar) (l : Rbar) :
is_sup_seq u l -> Rbar_is_lub (fun x => exists n, x = u n) l.
Lemma Rbar_is_lub_sup_seq (u : nat -> Rbar) (l : Rbar) :
Rbar_is_lub (fun x => exists n, x = u n) l -> is_sup_seq u l.
Lemma is_inf_seq_glb (u : nat -> Rbar) (l : Rbar) :
is_inf_seq u l -> Rbar_is_glb (fun x => exists n, x = u n) l.
Lemma Rbar_is_glb_inf_seq (u : nat -> Rbar) (l : Rbar) :
Rbar_is_glb (fun x => exists n, x = u n) l -> is_inf_seq u l.