HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10691

Color key:    Metamath Proof Explorer  Metamath Proof Explorer (1-8743)   Hilbert Space Explorer  Hilbert Space Explorer (8744-10691)  

Statement List for Metamath Proof Explorer - 7101-7200 - Page 72 of 107
TypeLabelDescription
Statement
 
Theoremclimserzle 7101 The partial sums of a converging infinite series with nonnegative terms are bounded by its limit.
|- F e. V   &   |- A e. V   &   |- (<.M, + >. seq F) ~~> A   &   |- F:(ZZ>` M)-->RR   =>   |- ((N e. (ZZ>` M) /\ A.k e. (ZZ>` M)0 <_ (F` k)) -> ((<.M, + >. seq F)` N) <_ A)
 
Theoremclimabslem 7102 Lemma for climabs 7103, climcj 7104, climre 7105, and climim 7106.
 
Theoremclimabs 7103 Limit of the absolute value of a sequence. (Contributed by Paul Chapman, 7-Sep-2007.)
|- A e. V   &   |- G e. V   &   |- M e. ZZ   &   |- F ~~> A   &   |- (k e. (ZZ>` M) -> ((F` k) e. CC /\ (G` k) = (abs` (F` k))))   =>   |- G ~~> (abs` A)
 
Theoremclimcj 7104 Limit of the complex conjugate of a sequence. Proposition 12-2.4(c) of [Gleason] p. 172.
|- A e. V   &   |- G e. V   &   |- M e. ZZ   &   |- F ~~> A   &   |- (k e. (ZZ>` M) -> ((F` k) e. CC /\ (G` k) = (*` (F` k))))   =>   |- G ~~> (*` A)
 
Theoremclimre 7105 Limit of the real part of a sequence. (Contributed by Paul Chapman, 24-Sep-2007.)
|- A e. V   &   |- G e. V   &   |- M e. ZZ   &   |- F ~~> A   &   |- (k e. (ZZ>` M) -> ((F` k) e. CC /\ (G` k) = (Re` (F` k))))   =>   |- G ~~> (Re` A)
 
Theoremclimim 7106 Limit of the imaginary part of a sequence. (Contributed by Paul Chapman, 7-Sep-2007.)
|- A e. V   &   |- G e. V   &   |- M e. ZZ   &   |- F ~~> A   &   |- (k e. (ZZ>` M) -> ((F` k) e. CC /\ (G` k) = (Im` (F` k))))   =>   |- G ~~> (Im` A)
 
Theoremclimubi 7107 The limit of a monotonic sequence is an upper bound.
|- A e. V   &   |- F:NN-->RR   &   |- (k e. NN -> (F` k) <_ (F` (k + 1)))   &   |- F ~~> A   &   |- N e. NN   =>   |- (F` N) <_ A
 
Theoremclimub 7108 The limit of a monotonic sequence is an upper bound.
|- A e. V   &   |- F:NN-->RR   &   |- (k e. NN -> (F` k) <_ (F` (k + 1)))   &   |- F ~~> A   =>   |- (N e. NN -> (F` N) <_ A)
 
Theoremclimsup 7109 A bounded monotonic sequence converges to the supremum of its range. Theorem 12-5.1 of [Gleason] p. 180.
|- F:NN-->RR   &   |- (k e. NN -> (F` k) <_ (F` (k + 1)))   &   |- E.x e. RR A.k e. NN (F` k) <_ x   =>   |- F ~~> sup(ran F, RR, < )
 
Theoremclimcau 7110 A converging sequence of complex numbers is a Cauchy sequence. Theorem 12-5.3 of [Gleason] p. 180 (necessity part).
|- A e. V   &   |- F ~~> A   &   |- F:NN-->CC   =>   |- A.x e. RR (0 < x -> E.y e. NN A.z e. NN (y < z -> (abs` ((F` z) - (F` y))) < x))
 
Theoremcaucvglem1 7111 Lemma for caucvg 7117. This lemma shows the membership relation for S.
 
Theoremcaucvglem2 7112 Lemma for caucvg 7117. S is a nonempty bounded subset of RR.
 
Theoremcaucvglem3 7113 Lemma for caucvg 7117. The supremum of S is a real number.
 
Theoremcaucvglem4 7114 Lemma for caucvg 7117. Anything less that the supremum of S belongs to S.
 
Theoremcaucvglem5 7115 Lemma for caucvg 7117.
 
Theoremcaucvglem6 7116 Lemma for caucvg 7117.
 
Theoremcaucvg 7117 A Cauchy sequence of real numbers converges. The second hypothesis specifies that F is a Cauchy sequence. S is the set of numbers less than all values of F except for finitely many. Reference: Bert G. Wachsmuth, http://www.shu.edu/projects/reals/numseq/proofs/cauconv.html. Request: Please contact Norm Megill if you know of a textbook reference for the version of the proof in the link above. Warning: The HTML proof page is 1/2 megabyte in size.
|- F:NN-->RR   &   |- A.z e. RR (0 < z -> E.w e. NN A.y e. NN (w < y -> (abs` ((F` y) - (F` w))) < z))   &   |- S = {u e. RR | E.v e. NN A.y e. NN (v <_ y -> u < (F` y))}   =>   |- F ~~> sup(S, RR, < )
 
Theoremcaucvg3a 7118 A Cauchy sequence of complex numbers converges to a complex number. Theorem 12-5.3 of [Gleason] p. 180 (sufficiency part). This version shows the explicit value of the limit (which is why we need all the hypotheses) rather than just its existence.
|- F:NN-->CC   &   |- A.z e. RR (0 < z -> E.w e. NN A.y e. NN (w < y -> (abs` ((F` y) - (F` w))) < z))   &   |- G Fn NN   &   |- (x e. NN -> (G` x) = (Re` (F` x)))   &   |- R = {u e. RR | E.v e. NN A.y e. NN (v <_ y -> u < (G` y))}   &   |- H Fn NN   &   |- (x e. NN -> (H` x) = (Im` (F` x)))   &   |- S = {u e. RR | E.v e. NN A.y e. NN (v <_ y -> u < (H` y))}   &   |- D Fn NN   &   |- (x e. NN -> (D` x) = (i x. (H` x)))   =>   |- F ~~> (sup(R, RR, < ) + (i x. sup(S, RR, < )))
 
Theoremcaucvg2 7119 A Cauchy sequence of real numbers converges to a real number.
|- F:NN-->RR   &   |- A.z e. RR (0 < z -> E.w e. NN A.y e. NN (w < y -> (abs` ((F` y) - (F` w))) < z))   =>   |- E.x e. RR F ~~> x
 
Theoremcaucvg3lem 7120 Lemma for caucvg3 7121.
 
Theoremcaucvg3 7121 A Cauchy sequence of complex numbers converges to a complex number. Theorem 12-5.3 of [Gleason] p. 180 (sufficiency part).
|- F:NN-->CC   &   |- A.y e. RR (0 < y -> E.j e. NN A.k e. NN (j <_ k -> (abs` ((F` k) - (F` j))) < y))   =>   |- E.x e. CC F ~~> x
 
Theoremcaucvg3t 7122 A Cauchy sequence of complex numbers converges to a complex number. Theorem 12-5.3 of [Gleason] p. 180 (sufficiency part). Warning: The HTML proof page is 0.6 megabyte in size.
|- ((F:NN-->CC /\ A.z e. RR (0 < z -> E.w e. NN A.y e. NN (w <_ y -> (abs` ((F` y) - (F` w))) < z))) -> E.x e. CC F ~~> x)
 
Theoremserzf0 7123 If an infinite series converges, its underlying sequence converges to zero. Warning: The HTML proof page is 0.6 megabyte in size.
|- F e. V   &   |- M e. ZZ   &   |- (k e. (ZZ>` M) -> (F` k) e. CC)   &   |- A e. V   &   |- (<.M, + >. seq F) ~~> A   =>   |- F ~~> 0
 
Theoremser1f0 7124 If an infinite series converges, its underlying sequence converges to zero. Warning: The HTML proof page is 1/2 megabyte in size.
|- F:NN-->CC   &   |- A e. CC   &   |- ( + seq1 F) ~~> A   =>   |- F ~~> 0
 
Theoremser1const 7125 Value of the partial series sum of a constant function.
|- A e. CC   =>   |- (N e. NN -> (( + seq1 (NN X. {A}))` N) = (N x. A))
 
Theoremser10 7126 The value of the zero series.
|- (N e. NN -> (( + seq1 (NN X. {0}))` N) = 0)
 
Theoremser1clim0 7127 The zero series converges to zero.
|- ( + seq1 (NN X. {0})) ~~> 0
 
Theoremser1cmp 7128 Comparison of partial sums of two infinite series of reals.
|- F:NN-->RR   &   |- G:NN-->RR   &   |- (x e. NN -> (G` x) <_ (F` x))   =>   |- (A e. NN -> (( + seq1 G)` A) <_ (( + seq1 F)` A))
 
Theoremser1cmp0 7129 A partial sum of an infinite series of nonnegative reals is nonnegative.
|- F:NN-->RR   &   |- (x e. NN -> 0 <_ (F` x))   =>   |- (A e. NN -> 0 <_ (( + seq1 F)` A))
 
Theoremser1cmp2lem 7130 Lemma for ser1cmp2 7131.
 
Theoremser1cmp2 7131 Comparison of partial sums of two infinite series of reals that excludes an initial segment.
|- F:NN-->RR   &   |- G:NN-->RR   &   |- (x e. NN -> 0 <_ (F` x))   &   |- ((x e. NN /\ B < x) -> (G` x) <_ (F` x))   &   |- S = sup(ran (( + seq1 G) |` {y e. NN | y <_ B}), RR, < )   =>   |- ((A e. NN /\ B e. NN) -> (( + seq1 G)` A) <_ (S + (( + seq1 F)` A)))
 
Theoremiserzabslem 7132 Lemma for iserzabs 7133.
 
Theoremiserzabs 7133 Generalized triangle inequality: the absolute value of an infinite sum is less than or equal to the sum of absolute values. (Contributed by Paul Chapman, 10-Sep-2007.)
|- A e. V   &   |- B e. V   &   |- F e. V   &   |- G e. V   &   |- M e. ZZ   &   |- (k e. (ZZ>` M) -> ((F` k) e. CC /\ (G` k) = (abs` (F` k))))   &   |- (<.M, + >. seq F) ~~> A   &   |- (<.M, + >. seq G) ~~> B   =>   |- (abs` A) <_ B
 
Theoremcvgcmp2lem 7134 Lemma for cvgcmp2 7135.
 
Theoremcvgcmp2 7135 A comparison test for convergence of a real infinite series. This version allows us to ignore the initial segment before the B -th term.
|- A e. V   &   |- F:NN-->RR   &   |- G:NN-->RR   &   |- (x e. NN -> 0 <_ (F` x))   &   |- (x e. NN -> 0 <_ (G` x))   &   |- ( + seq1 F) ~~> A   &   |- B e. NN   &   |- ((x e. NN /\ B < x) -> (G` x) <_ (F` x))   =>   |- ( + seq1 G) ~~> sup(ran ( + seq1 G