Timings for ConstructiveLimits.v
- /home/gitlab-runner/builds/v6HyzL39/0/coq/coq/_bench/opam.OLD/ocaml-OLD/.opam-switch/build/coq-stdlib.dev/_build/default/theories//./Reals/Abstract/ConstructiveLimits.timing
- /home/gitlab-runner/builds/v6HyzL39/0/coq/coq/_bench/opam.NEW/ocaml-NEW/.opam-switch/build/coq-stdlib.dev/_build/default/theories//./Reals/Abstract/ConstructiveLimits.timing
(************************************************************************)
(* * The Coq Proof Assistant / The Coq Development Team *)
(* v * INRIA, CNRS and contributors - Copyright 1999-2019 *)
(* <O___,, * (see CREDITS file for the list of authors) *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(* * (see LICENSE file for the text of the license) *)
(************************************************************************)
Require Import QArith Qabs.
Require Import ConstructiveReals.
Require Import ConstructiveAbs.
Local Open Scope ConstructiveReals.
(** Definitions and basic properties of limits of real sequences
and series.
WARNING: this file is experimental and likely to change in future releases.
*)
Lemma CR_cv_extens
: forall {R : ConstructiveReals} (xn yn : nat -> CRcarrier R) (l : CRcarrier R),
(forall n:nat, xn n == yn n)
-> CR_cv R xn l
-> CR_cv R yn l.
specialize (H0 p) as [n nmaj].
apply (CRle_trans _ (CRabs R (CRminus R (xn i) l))).
apply (CRle_trans _ (CRminus R (xn i) l)).
apply CRplus_le_compat_r.
specialize (H i) as [H _].
pose proof (CRabs_def R (CRminus R (xn i) l) (CRabs R (CRminus R (xn i) l)))
as [_ H1].
apply (CRle_trans _ (CRopp R (CRminus R (xn i) l))).
apply CRopp_lt_cancel, CRplus_lt_reg_r in abs.
specialize (H i) as [_ H].
pose proof (CRabs_def R (CRminus R (xn i) l) (CRabs R (CRminus R (xn i) l)))
as [_ H1].
Lemma CR_cv_opp : forall {R : ConstructiveReals} (xn : nat -> CRcarrier R) (l : CRcarrier R),
CR_cv R xn l
-> CR_cv R (fun n => - xn n) (- l).
specialize (H p) as [n nmaj].
apply (CRle_trans _ (CRabs R (CRminus R (xn i) l))).
rewrite <- CRopp_plus_distr, CRabs_opp.
Lemma CR_cv_plus : forall {R : ConstructiveReals} (xn yn : nat -> CRcarrier R) (a b : CRcarrier R),
CR_cv R xn a
-> CR_cv R yn b
-> CR_cv R (fun n => xn n + yn n) (a + b).
specialize (H (2*p)%positive) as [i imaj].
specialize (H0 (2*p)%positive) as [j jmaj].
apply (CRle_trans
_ (CRabs R (CRplus R (CRminus R (xn i0) a) (CRminus R (yn i0) b)))).
do 2 rewrite <- (Radd_assoc (CRisRing R)).
rewrite CRopp_plus_distr.
rewrite Radd_comm, <- Radd_assoc.
apply (CRle_trans _ _ _ (CRabs_triang _ _)).
apply (CRle_trans _ (CRplus R (CR_of_Q R (1 # 2*p)) (CR_of_Q R (1 # 2*p)))).
apply imaj, (Nat.le_trans _ _ _ (Nat.le_max_l _ _) H).
apply jmaj, (Nat.le_trans _ _ _ (Nat.le_max_r _ _) H).
apply (CRle_trans _ (CR_of_Q R ((1 # 2 * p) + (1 # 2 * p)))).
setoid_replace (1 + 1 # 2 * p) with (1 # p).
Lemma CR_cv_unique : forall {R : ConstructiveReals} (xn : nat -> CRcarrier R)
(a b : CRcarrier R),
CR_cv R xn a
-> CR_cv R xn b
-> a == b.
assert (CR_cv R (fun _ => 0) (CRminus R b a)).
apply (CR_cv_extens (fun n => CRminus R (xn n) (xn n))).
assert (forall q r : Q, 0 < q -> / q < r -> 1 < q * r)%Q.
apply (Qmult_lt_l _ _ q) in H3.
rewrite Qmult_inv_r in H3.
remember (CRminus R b a) as z.
destruct (CR_Q_dense R _ _ abs) as [q [H0 H]].
destruct (Qarchimedean (/(-q))) as [p pmaj].
specialize (H1 p) as [n nmaj].
specialize (nmaj n (Nat.le_refl n)).
apply (CRlt_trans _ (CR_of_Q R (-q))).
apply (Qmult_lt_r _ _ (1#p)) in pmaj.
rewrite Qmult_1_l, <- Qmult_assoc in pmaj.
setoid_replace ((Z.pos p # 1) * (1 # p))%Q with 1%Q in pmaj.
rewrite Qmult_1_r in pmaj.
unfold Qeq, Qnum, Qden; simpl.
do 2 rewrite Pos.mul_1_r.
apply (Qplus_lt_l _ _ q).
apply (lt_CR_of_Q R q 0).
apply (CRlt_le_trans _ (CRopp R z)).
apply (CRle_lt_trans _ (CRopp R (CR_of_Q R q))).
apply CRopp_gt_lt_contravar, H0.
apply (CRle_trans _ (CRabs R (CRopp R z))).
pose proof (CRabs_def R (CRopp R z) (CRabs R (CRopp R z))) as [_ H1].
destruct (CR_Q_dense R _ _ abs) as [q [H0 H]].
destruct (Qarchimedean (/q)) as [p pmaj].
specialize (H1 p) as [n nmaj].
specialize (nmaj n (Nat.le_refl n)).
apply (CRlt_trans _ (CR_of_Q R q)).
apply (Qmult_lt_r _ _ (1#p)) in pmaj.
rewrite Qmult_1_l, <- Qmult_assoc in pmaj.
setoid_replace ((Z.pos p # 1) * (1 # p))%Q with 1%Q in pmaj.
rewrite Qmult_1_r in pmaj.
unfold Qeq, Qnum, Qden; simpl.
do 2 rewrite Pos.mul_1_r.
apply (lt_CR_of_Q R 0 q).
apply (CRlt_le_trans _ _ _ H).
apply (CRle_trans _ (CRabs R (CRopp R z))).
apply (CRle_trans _ (CRabs R z)).
pose proof (CRabs_def R z (CRabs R z)) as [_ H1].
apply (CRplus_eq_reg_l (CRopp R a)).
rewrite CRplus_opp_l, CRplus_comm.
Lemma CR_cv_eq : forall {R : ConstructiveReals}
(v u : nat -> CRcarrier R) (s : CRcarrier R),
(forall n:nat, u n == v n)
-> CR_cv R u s
-> CR_cv R v s.
specialize (H1 p) as [N H0].
Lemma CR_cauchy_eq : forall {R : ConstructiveReals}
(un vn : nat -> CRcarrier R),
(forall n:nat, un n == vn n)
-> CR_cauchy R un
-> CR_cauchy R vn.
specialize (H0 p) as [n H0].
specialize (H0 i j H1 H2).
rewrite <- CRabs_def in H0.
Lemma CR_cv_proper : forall {R : ConstructiveReals}
(un : nat -> CRcarrier R) (a b : CRcarrier R),
CR_cv R un a
-> a == b
-> CR_cv R un b.
specialize (H p) as [n H].
#[global]
Instance CR_cv_morph
: forall {R : ConstructiveReals} (un : nat -> CRcarrier R), CMorphisms.Proper
(CMorphisms.respectful (CReq R) CRelationClasses.iffT) (CR_cv R un).
apply (CR_cv_proper un x).
apply (CR_cv_proper un y).
Lemma Un_cv_nat_real : forall {R : ConstructiveReals}
(un : nat -> CRcarrier R) (l : CRcarrier R),
CR_cv R un l
-> forall eps : CRcarrier R,
0 < eps
-> { p : nat & forall i:nat, le p i -> CRabs R (un i - l) < eps }.
destruct (CR_archimedean R (CRinv R eps (inr H0))) as [k kmaj].
assert (0 < CR_of_Q R (Z.pos k # 1)).
specialize (H k) as [p pmaj].
apply (CRle_lt_trans _ (CR_of_Q R (1 # k))).
apply (CRmult_lt_reg_l (CR_of_Q R (Z.pos k # 1))).
apply (CRle_lt_trans _ 1).
do 2 rewrite Pos.mul_1_r.
apply (CRmult_lt_reg_r (CRinv R eps (inr H0))).
apply CRinv_0_lt_compat, H0.
rewrite CRmult_1_l, CRmult_assoc.
rewrite CRinv_r, CRmult_1_r.
Lemma Un_cv_real_nat : forall {R : ConstructiveReals}
(un : nat -> CRcarrier R) (l : CRcarrier R),
(forall eps : CRcarrier R,
0 < eps
-> { p : nat & forall i:nat, le p i -> CRabs R (un i - l) < eps })
-> CR_cv R un l.
specialize (H (CR_of_Q R (1#n))) as [p pmaj].
Lemma CR_cv_minus :
forall {R : ConstructiveReals}
(An Bn:nat -> CRcarrier R) (l1 l2:CRcarrier R),
CR_cv R An l1 -> CR_cv R Bn l2
-> CR_cv R (fun i:nat => An i - Bn i) (l1 - l2).
specialize (H0 p) as [n H0].
setoid_replace (- Bn i - - l2) with (- (Bn i - l2)).
rewrite CRopp_plus_distr, CRopp_involutive.
Lemma CR_cv_nonneg :
forall {R : ConstructiveReals} (An:nat -> CRcarrier R) (l:CRcarrier R),
CR_cv R An l
-> (forall n:nat, 0 <= An n)
-> 0 <= l.
destruct (Un_cv_nat_real _ l H (-l)) as [N H1].
apply CRopp_gt_lt_contravar.
specialize (H1 N (Nat.le_refl N)).
pose proof (CRabs_def R (An N - l) (CRabs R (An N - l))) as [_ H2].
apply (CRle_lt_trans _ _ _ (CRle_abs _)) in H1.
apply (CRplus_lt_reg_r (-l)).
Lemma CR_cv_scale : forall {R : ConstructiveReals} (u : nat -> CRcarrier R)
(a : CRcarrier R) (s : CRcarrier R),
CR_cv R u s -> CR_cv R (fun n => u n * a) (s * a).
destruct (CR_archimedean R (1 + CRabs R a)).
destruct (H (n * x)%positive).
rewrite CRopp_mult_distr_l.
rewrite <- CRmult_plus_distr_r.
apply (CRle_trans _ ((CR_of_Q R (1 # n * x)) * CRabs R a)).
apply CRmult_le_compat_r.
setoid_replace (1 # n * x)%Q with ((1 # n) *(1# x))%Q.
rewrite <- (CRmult_1_r (CR_of_Q R (1#n))).
rewrite CR_of_Q_mult, CRmult_assoc.
apply CRmult_le_compat_l.
apply (CRmult_lt_compat_l (CR_of_Q R (Z.pos x #1))) in abs.
rewrite CRmult_1_r, <- CRmult_assoc, <- CR_of_Q_mult in abs.
rewrite (CR_of_Q_morph R ((Z.pos x # 1) * (1 # x))%Q 1%Q) in abs.
rewrite CRmult_1_l in abs.
apply (CRlt_asym _ _ abs), (CRlt_trans _ (1 + CRabs R a)).
rewrite <- CRplus_0_l, <- CRplus_assoc.
apply CRplus_lt_compat_r.
unfold Qmult, Qeq, Qnum, Qden.
apply (CRlt_trans _ (1+CRabs R a)).
rewrite <- (CRplus_0_r 0).
apply CRplus_le_lt_compat.
Lemma CR_cv_const : forall {R : ConstructiveReals} (a : CRcarrier R),
CR_cv R (fun n => a) a.
Lemma Rcv_cauchy_mod : forall {R : ConstructiveReals}
(un : nat -> CRcarrier R) (l : CRcarrier R),
CR_cv R un l -> CR_cauchy R un.
specialize (H (2*p)%positive) as [k H].
setoid_replace (1#p)%Q with ((1#2*p) + (1#2*p))%Q.
setoid_replace (un n - un q) with ((un n - l) - (un q - l)).
apply (CRle_trans _ _ _ (CRabs_triang _ _)).
rewrite CRplus_comm, CRopp_plus_distr, CRopp_involutive.
rewrite CRplus_assoc, CRplus_opp_r, CRplus_0_r.
Lemma CR_growing_transit : forall {R : ConstructiveReals} (un : nat -> CRcarrier R),
(forall n:nat, un n <= un (S n))
-> forall n p : nat, le n p -> un n <= un p.
apply Nat.le_succ_r in H0.
apply (CRle_trans _ (un p)).
Lemma growing_ineq :
forall {R : ConstructiveReals} (Un:nat -> CRcarrier R) (l:CRcarrier R),
(forall n:nat, Un n <= Un (S n))
-> CR_cv R Un l -> forall n:nat, Un n <= l.
destruct (Un_cv_nat_real _ l H0 (Un n - l)) as [N H1].
rewrite <- (CRplus_opp_r l).
apply CRplus_lt_compat_r.
specialize (H1 (max n N) (Nat.le_max_r _ _)).
apply (CRle_lt_trans _ _ _ (CRle_abs _)) in H1.
apply CRplus_lt_reg_r in H1.
apply (CR_growing_transit Un H n (max n N)).
Lemma CR_cv_open_below
: forall {R : ConstructiveReals}
(un : nat -> CRcarrier R) (m l : CRcarrier R),
CR_cv R un l
-> m < l
-> { n : nat & forall i:nat, le n i -> m < un i }.
pose proof (Un_cv_nat_real _ l H (l-m) H0) as [n nmaj].
destruct nmaj as [_ nmaj].
rewrite CRopp_plus_distr, CRopp_involutive, CRplus_comm in nmaj.
apply CRplus_lt_reg_l in nmaj.
apply (CRplus_lt_reg_l R (-m)).
apply (CRplus_lt_reg_r (-un i)).
rewrite CRplus_assoc, CRplus_opp_r, CRplus_0_r.
Lemma CR_cv_open_above
: forall {R : ConstructiveReals}
(un : nat -> CRcarrier R) (m l : CRcarrier R),
CR_cv R un l
-> l < m
-> { n : nat & forall i:nat, le n i -> un i < m }.
pose proof (Un_cv_nat_real _ l H (m-l) H0) as [n nmaj].
destruct nmaj as [nmaj _].
apply CRplus_lt_reg_r in nmaj.
Lemma CR_cv_bound_down : forall {R : ConstructiveReals}
(u : nat -> CRcarrier R) (A l : CRcarrier R) (N : nat),
(forall n:nat, le N n -> A <= u n)
-> CR_cv R u l
-> A <= l.
apply (CRplus_lt_compat_r (-l)) in r.
rewrite CRplus_opp_r in r.
destruct (Un_cv_nat_real _ l H0 (A - l) r) as [n H1].
rewrite <- (Nat.add_0_l N), Nat.add_assoc.
apply Nat.add_le_mono_r, Nat.le_0_l.
specialize (H1 (n+N)%nat).
apply (CRplus_lt_reg_r (-l)).
rewrite <- (Nat.add_0_r n), <- Nat.add_assoc.
apply Nat.add_le_mono_l, Nat.le_0_l.
apply (CRle_lt_trans _ (CRabs R (u (n + N)%nat - l))).
Lemma CR_cv_bound_up : forall {R : ConstructiveReals}
(u : nat -> CRcarrier R) (A l : CRcarrier R) (N : nat),
(forall n:nat, le N n -> u n <= A)
-> CR_cv R u l
-> l <= A.
apply (CRplus_lt_compat_r (-A)) in r.
rewrite CRplus_opp_r in r.
destruct (Un_cv_nat_real _ l H0 (l-A) r) as [n H1].
rewrite <- (Nat.add_0_l N).
apply Nat.add_le_mono_r, Nat.le_0_l.
specialize (H1 (n+N)%nat).
apply (CRplus_lt_reg_l R (l - A - u (n+N)%nat)).
repeat rewrite CRplus_assoc.
rewrite CRplus_opp_l, CRplus_0_r, (CRplus_comm (-A)).
rewrite CRplus_assoc, CRplus_opp_r, CRplus_0_r.
apply (CRle_lt_trans _ _ _ (CRle_abs _)).
rewrite <- (Nat.add_0_r n), <- Nat.add_assoc.
apply Nat.add_le_mono_l, Nat.le_0_l.
Lemma CR_cv_le : forall {R : ConstructiveReals}
(u v : nat -> CRcarrier R) (a b : CRcarrier R),
(forall n:nat, u n <= v n)
-> CR_cv R u a
-> CR_cv R v b
-> a <= b.
apply (CRplus_le_reg_r (-a)).
apply (CR_cv_bound_down (fun i:nat => v i - u i) _ _ 0).
rewrite <- (CRplus_opp_l (u n)).
rewrite (CRplus_comm (v n)).
apply CRplus_le_compat_l.
Lemma CR_cv_abs_cont : forall {R : ConstructiveReals}
(u : nat -> CRcarrier R) (s : CRcarrier R),
CR_cv R u s
-> CR_cv R (fun n => CRabs R (u n)) (CRabs R s).
specialize (H eps) as [N lim].
apply (CRle_trans _ (CRabs R (u n - s))).
Lemma CR_cv_dist_cont : forall {R : ConstructiveReals}
(u : nat -> CRcarrier R) (a s : CRcarrier R),
CR_cv R u s
-> CR_cv R (fun n => CRabs R (a - u n)) (CRabs R (a - s)).
specialize (H eps) as [N lim].
setoid_replace (a - u n - (a - s)) with (s - (u n)).
rewrite CRopp_plus_distr, CRopp_involutive.
rewrite (CRplus_comm a), (CRplus_comm s).
rewrite <- CRplus_assoc, CRplus_opp_r, CRplus_0_l.
Lemma CR_cv_shift :
forall {R : ConstructiveReals} f k l,
CR_cv R (fun n => f (n + k)%nat) l -> CR_cv R f l.
specialize (H eps) as [N Nmaj].
destruct (Nat.le_exists_sub k n).
apply (Nat.le_trans _ (N + k)).
apply (Nat.le_trans _ (0 + k)).
rewrite <- Nat.add_le_mono_r.
rewrite <- Nat.add_le_mono_r in H.
Lemma CR_cv_shift' :
forall {R : ConstructiveReals} f k l,
CR_cv R f l -> CR_cv R (fun n => f (n + k)%nat) l.
intros R f' k l cvf eps; destruct (cvf eps) as [N Pn].
exists N; intros n nN; apply Pn; auto.
apply Nat.le_trans with n; [ assumption | apply Nat.le_add_r ].