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-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12229

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-9062)
  Hilbert Space Explorer  Hilbert Space Explorer
(9063-10650)
  Users' Mathboxes  Users' Mathboxes
(10651-12229)
 

Statement List for Metamath Proof Explorer - 7301-7400 - Page 74 of 123
TypeLabelDescription
Statement
 
Theoremclimunii 7301 An infinite sequence of complex numbers converges to at most one limit.
|- A e. V   &   |- B e. V   &   |- (F ~~> A /\ F ~~> B)   =>   |- A = B
 
Theoremclimuni 7302 An infinite sequence of complex numbers converges to at most one limit.
|- A e. V   &   |- B e. V   =>   |- ((F ~~> A /\ F ~~> B) -> A = B)
 
Theoremclimeu 7303 An infinite sequence of complex numbers converges to at most one limit.
|- A e. V   =>   |- (F ~~> A -> E!x F ~~> x)
 
Theoremclimreu 7304 An infinite sequence of complex numbers converges to at most one limit.
|- A e. V   =>   |- (F ~~> A -> E!x e. CC F ~~> x)
 
Theorem2climnn 7305 If two sequences converge to each other, they converge to the same limit.
|- G e. V   =>   |- (((A e. CC /\ A.k e. NN ((F` k) e. CC /\ (G` k) e. CC)) /\ (A.x e. RR (0 < x -> E.j e. NN A.k e. NN (j <_ k -> (abs` ((G` k) - (F` k))) < x)) /\ F ~~> A)) -> G ~~> A)
 
Theorem2climnn0 7306 If two sequences converge to each other, they converge to the same limit.
|- G e. V   =>   |- (((A e. CC /\ A.k e. NN0 ((F` k) e. CC /\ (G` k) e. CC)) /\ (A.x e. RR (0 < x -> E.j e. NN0 A.k e. NN0 (j <_ k -> (abs` ((G` k) - (F` k))) < x)) /\ F ~~> A)) -> G ~~> A)
 
Theoremclimshfti 7307 A shifted function converges iff the original function converges.
|- F e. V   &   |- M e. ZZ   =>   |- (A e. CC -> ((F shift M) ~~> A <-> F ~~> A))
 
Theoremclimresi 7308 A function restricted to upper integers converges iff the original function converges.
|- F e. V   &   |- M e. ZZ   =>   |- (A e. B -> ((F |` (ZZ>=` M)) ~~> A <-> F ~~> A))
 
Theoremclimshft2i 7309 A shifted function converges iff the original function converges. (Contributed by Paul Chapman, 19-Nov-2007.)
|- F e. V   &   |- G e. V   &   |- M e. ZZ   &   |- K e. ZZ   =>   |- ((A e. B /\ A.k e. (ZZ>=` M)(G` (k + K)) = (F` k)) -> (F ~~> A <-> G ~~> A))
 
Theoremiserzshft2i 7310 Index shift of an infinite series. (Contributed by Paul Chapman, 19-Nov-2007.)
|- F e. V   &   |- G e. V   &   |- M e. ZZ   &   |- K e. ZZ   =>   |- ((A e. B /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` (k + K)) = (F` k))) -> ((<.M, + >. seq F) ~~> A <-> (<.(M + K), + >. seq G) ~~> A))
 
Theoremclimuz0i 7311 A zero sequence converges to zero.
|- M e. ZZ   =>   |- ((ZZ>=` M) X. {0}) ~~> 0
 
Theoremserzclim0 7312 The zero series converges to zero. (Contributed by Paul Chapman, 9-Feb-2007.)
|- (M e. ZZ -> (<.M, + >. seq ((ZZ>=` M) X. {0})) ~~> 0)
 
Theoremclimrecl 7313 The limit of a convergent real sequence is real. Corollary 12-2.5 of [Gleason] p. 172.
|- A e. V   =>   |- ((M e. ZZ /\ F ~~> A /\ A.k e. (ZZ>=` M)(F` k) e. RR) -> A e. RR)
 
Theoremclimfnrcli 7314 The limit of a convergent real sequence on natural numbers is real. Corollary 12-2.5 of [Gleason] p. 172.
|- A e. V   &   |- F:NN-->RR   &   |- F ~~> A   =>   |- A e. RR
 
Theoremclimge0 7315 A nonnegative sequence converges to a nonnegative number.
|- A e. V   =>   |- ((M e. ZZ /\ F ~~> A /\ A.k e. (ZZ>=` M)((F` k) e. RR /\ 0 <_ (F` k))) -> 0 <_ A)
 
Theoremclimabs0i 7316 Convergence to zero of the absolute value is equivalent to convergence to zero.
|- F e. V   &   |- G e. V   &   |- (k e. NN -> (G` k) = (abs` (F` k)))   =>   |- (A.k e. NN (F` k) e. CC -> (F ~~> 0 <-> G ~~> 0))
 
Theoremclimaddlem1 7317 Lemma for climadd 7320.
 
Theoremclimaddlem2 7318 Lemma for climadd 7320.
 
Theoremclimaddlem3 7319 Lemma for climadd 7320. Warning: The HTML proof page is 3/4 megabyte in size.
 
Theoremclimadd 7320 Limit of the sum of two converging sequences. Proposition 12-2.1(a) of [Gleason] p. 168.
|- F e. V   &   |- G e. V   &   |- H e. V   &   |- A e. V   &   |- B e. V   =>   |- (((F ~~> A /\ G ~~> B) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) e. CC /\ (H` k) = ((F` k) + (G` k))))) -> H ~~> (A + B))
 
Theoremclimaddc1 7321 Limit of a constant C added to each term of a sequence.
|- F e. V   &   |- G e. V   &   |- A e. V   &   |- C e. V   =>   |- (((F ~~> A /\ C e. CC) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) = ((F` k) + C)))) -> G ~~> (A + C))
 
Theoremclimaddc2 7322 Limit of a constant C added to each term of a sequence.
|- F e. V   &   |- G e. V   &   |- A e. V   &   |- C e. V   =>   |- (((F ~~> A /\ C e. CC) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) = (C + (F` k))))) -> G ~~> (C + A))
 
Theoremclimmullem1 7323 Lemma for climmul 7331.
 
Theoremclimmullem2 7324 Lemma for climmul 7331.
 
Theoremclimmullem3 7325 Lemma for climmul 7331.
 
Theoremclimmullem4 7326 Lemma for climmul 7331.
 
Theoremclimmullem5 7327 Lemma for climmul 7331. Instead of the infimum that Gleason uses (bottom of p. 170), we use recreclt 6047 to give us a number smaller than both a given number and 1. Warning: The HTML proof page is 1/2 megabyte in size.
 
Theoremclimmullem6 7328 Lemma for climmul 7331.
 
Theoremclimmullem7 7329 Lemma for climmul 7331.
 
Theoremclimmullem8 7330 Lemma for climmul 7331. Warning: The HTML proof page is 3/4 megabyte in size.
 
Theoremclimmul 7331 Limit of the product of two converging sequences. Proposition 12-2.1(c) of [Gleason] p. 168.
|- F e. V   &   |- G e. V   &   |- H e. V   &   |- A e. V   &   |- B e. V   =>   |- (((F ~~> A /\ G ~~> B) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) e. CC /\ (H` k) = ((F` k) x. (G` k))))) -> H ~~> (A x. B))
 
Theoremclimmulc2 7332 Limit of a sequence multiplied by a constant C. Corollary 12-2.2 of [Gleason] p. 171.
|- F e. V   &   |- G e. V   &   |- A e. V   =>   |- (((C e. CC /\ F ~~> A) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) = (C x. (F` k))))) -> G ~~> (C x. A))
 
Theoremclimsub 7333 Limit of the difference of two converging sequences. Proposition 12-2.1(b) of [Gleason] p. 168.
|- F e. V   &   |- G e. V   &   |- H e. V   &   |- A e. V   &   |- B e. V   =>   |- (((F ~~> A /\ G ~~> B) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) e. CC /\ (H` k) = ((F` k) - (G` k))))) -> H ~~> (A - B))
 
Theoremclimsubc2 7334 Limit of a constant C minus each term of a sequence.
|- F e. V   &   |- G e. V   &   |- A e. V   &   |- C e. V   =>   |- (((F ~~> A /\ C e. CC) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) = (C - (F` k))))) -> G ~~> (C - A))
 
Theoremclimaddci 7335 Limit of a constant A added to a sequence.
|- A e. CC   &   |- B e. V   &   |- F ~~> B   &   |- G Fn NN   &   |- (k e. NN -> ((F` k) e. CC /\ (G` k) = (A + (F` k))))   =>   |- G ~~> (A + B)
 
Theoremclimmulci 7336 Limit of a sequence multiplied by a constant A. Corollary 12-2.2 of [Gleason] p. 171.
|- A e. CC   &   |- B e. V   &   |- F ~~> B   &   |- G Fn NN   &   |- (k e. NN -> ((F` k) e. CC /\ (G` k) = (A x. (F` k))))   =>   |- G ~~> (A x. B)
 
Theoremclim2serz 7337 The limit of an infinite series with an initial segment removed. (Contributed by Paul Chapman, 9-Feb-2007.)
|- A e. V   &   |- F e. V   =>   |- (((<.M, + >. seq F) ~~> A /\ N e. (ZZ>=` M) /\ A.k e. (ZZ>=` M)(F` k) e. CC) -> (<.(N + 1), + >. seq F) ~~> (A - ((<.M, + >. seq F)` N)))
 
Theoremiserzex 7338 If an infinite series converges, so does the series with initial terms removed. (Contributed by Paul Chapman, 9-Feb-2007.)
|- F e. V   =>   |- ((N e. (ZZ>=` M) /\ A.k e. (ZZ>=` M)(F` k) e. CC /\ E.x(<.M, + >. seq F) ~~> x) -> E.x(<.(N + 1), + >. seq F) ~~> x)
 
Theoremiserzmulc1 7339 Multiplication of an infinite series by a constant. (Contributed by Paul Chapman, 14-Nov-2007.)
|- A e. V   &   |- F e. V   &   |- G e. V   =>   |- ((M e. ZZ /\ C e. CC /\ A.k e. (ZZ>=` M)((F` k) e. CC /\ (G` k) = (C x. (F` k)))) -> ((<.M, + >. seq F) ~~> A -> (<.M, + >. seq G) ~~> (C x. A)))
 
Theoremclimcmplem 7340 Lemma for climcmp 7341.
 
Theoremclimcmp 7341 Comparison of the limits of two sequences. (Contributed by Paul Chapman, 10-Sep-2007.)
|- F e. V   &   |- G e. V   &   |- A e. V   &   |- B e. V   =>   |- (((F ~~> A /\ G ~~> B) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. RR /\ (G` k) e. RR /\ (F` k) <_ (G` k)))) -> A <_ B)
 
Theoremclimcmpc1 7342 Comparison of a constant to the limit of a sequence.
|- F e. V   &   |- A e. V   &   |- B e. V   =>   |- (((A e. RR /\ F ~~> B) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. RR /\ A <_ (F` k)))) -> A <_ B)
 
Theoremclimsqueeze 7343 Convergence of a sequence sandwiched between another converging sequence and its limit.
|- F e. V   &   |- G e. V   &   |- A e. V   =>   |- ((F ~~> A /\ M e. ZZ /\ A.k e. (ZZ>=` M)(((F` k) e. RR /\ (G` k) e. RR) /\ ((F` k) <_ (G` k) /\ (G` k) <_ A))) -> G ~~> A)
 
Theoremclimsqueeze2 7344 Convergence of a sequence sandwiched between another converging sequence and its limit.
|- F e. V   &   |- G e. V   &   |- A e. V   =>   |- ((F ~~> A /\ M e. ZZ /\ A.k e. (ZZ>=` M)(((F` k) e. RR /\ (G` k) e. RR) /\ (A <_ (G` k) /\ (G` k) <_ (F` k)))) -> G ~~> A)
 
Theoremiserzcmp 7345 Comparison of the limits of two infinite series. (Contributed by Paul Chapman, 12-Nov-2007.)
|- A e. V   &   |- B e. V   &   |- F e. V   &   |- G e. V   =>   |- ((((<.M, + >. seq F) ~~> A /\ (<.M, + >. seq G) ~~> B) /\ (M e. ZZ /\ A.k e. (ZZ>=` M)((F` k) e. RR /\ (G` k) e. RR /\ (F` k) <_ (G` k)))) -> A <_ B)
 
Theoremiserzcmp0 7346 The limit of an infinite series of nonnegative reals is nonnegative. (Contributed by Paul Chapman, 9-Feb-2007.)
|- A e. V   &   |- F e. V   =>   |- ((M e. ZZ /\ (<.M, + >. seq F) ~~> A /\ A.k e. (ZZ>=` M)((F` k) e. RR /\ 0 <_ (F` k))) -> 0 <_ A)
 
Theoremiserzshfti 7347 Index shift of an infinite series. (Contributed by Paul Chapman, 31-Oct-2007.)
|- F e. V   &   |- M e. ZZ   &   |- K e. ZZ   &   |- N = (M + K)   &   |- G = (F shift K)   =>   |- (A e. B -> ((<.M, + >. seq F) ~~> A <-> (<.N, + >. seq G) ~~> A))
 
Theoremclim2serzi 7348 Limit of an infinite series with an initial segment removed.
|- F e. V   &   |- A e. V   &   |- (<.M, + >. seq F) ~~> A   &   |- F:(ZZ>=` M)-->CC   =>   |- (N e. (ZZ>=` M) -> (<.(N + 1), + >. seq F) ~~> (A - ((<.M, + >. seq F)` N)))
 
Theoremiserzexi 7349 If an infinite series converges, so does the series with initial terms removed. (Contributed by Paul Chapman, 23-Nov-2007.)
|- F e. V   &   |- A e. V   &   |- M e. ZZ   &   |- F:(ZZ>=` M)-->CC   &   |- (<.M, + >. seq F) ~~> A   =>   |- ((N e. ZZ /\ M < N) -> E.x(<.N, + >. seq F) ~~> x)
 
Theoremclimserzlei 7350 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 7351 Lemma for climabsi 7352, climcji 7353, climrei 7354, and climimi 7355.
 
Theoremclimabsi 7352 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)
 
Theoremclimcji 7353 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)
 
Theoremclimrei 7354 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)
 
Theoremclimimi 7355 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)
 
Theoremclimubii 7356 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
 
Theoremclimubi 7357 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)
 
Theoremclimsupi 7358 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, < )
 
Theoremclimcaui 7359 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 7360 Lemma for caucvgi 7366. This lemma shows the membership relation for S.
 
Theoremcaucvglem2 7361 Lemma for caucvgi 7366. S is a nonempty bounded subset of RR.
 
Theoremcaucvglem3 7362 Lemma for caucvgi 7366. The supremum of S is a real number.
 
Theoremcaucvglem4 7363 Lemma for caucvgi 7366. Anything less that the supremum of S belongs to S.
 
Theoremcaucvglem5 7364 Lemma for caucvgi 7366.
 
Theoremcaucvglem6 7365 Lemma for caucvgi 7366.
 
Theoremcaucvgi 7366 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, < )
 
Theoremcaucvg3ai 7367 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, < )))
 
Theoremcaucvg2i 7368 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 7369 Lemma for caucvg3i 7370.
 
Theoremcaucvg3i 7370 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
 
Theoremcaucvg3 7371 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)
 
Theoremserzf0i 7372 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
 
Theoremser1f0i 7373 If an infinite series converges, its underlying sequence converges to zero. (Proof shortened by Eric Schmidt, 31-Oct-2009.)
|- F:NN-->CC   &   |- A e. CC   &   |- ( + seq1 F) ~~> A   =>   |- F ~~> 0
 
Theoremser1consti 7374 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 7375 The value of the zero series.
|- (N e. NN -> (( + seq1 (NN X. {0}))` N) = 0)
 
Theoremser1clim0 7376 The zero series converges to zero.
|- ( + seq1 (NN X. {0})) ~~> 0
 
Theoremser1cmpi 7377 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))
 
Theoremser1cmp0i 7378 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 7379 Lemma for ser1cmp2i 7380.
 
Theoremser1cmp2i 7380 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 7381 Lemma for iserzabsi 7382.
 
Theoremiserzabsi 7382 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 7383 Lemma for cvgcmp2i 7384.
 
Theoremcvgcmp2i 7384 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), RR, < )
 
Theoremcvgcmp2clem 7385 Lemma for cvgcmp2ci 7387.
 
Theoremcvgcmp2clemOLD 7386 Lemma for cvgcmp2ci 7387.
 
Theoremcvgcmp2ci 7387 A comparison test for convergence of a real infinite series. This version of cvgcmp2i 7384 allows the reference sequence F (whose infinite series converges) to be multiplied by a nonnegative constant C before the comparison.
|- 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   &   |- C e. RR   &   |- 0 <_ C   &   |- ((x e. NN /\ B < x) -> (G` x) <_ (C x. (F` x)))   =>   |- ( + seq1 G) ~~> sup(ran ( + seq1 G), RR, < )
 
Theoremcvgcmpi 7388 A comparison test for convergence of a real infinite series. Similar to Exercise 3 of [Gleason] p. 182, except that we show the explicit limit rather than just its existence.
|- A e. V   &   |- F:NN-->RR   &   |- G:NN-->RR   &   |- (x e. NN -> (0 <_ (G` x) /\ (G` x) <_ (F` x)))   &   |- ( + seq1 F) ~~> A   =>   |- ( + seq1 G) ~~> sup(ran ( + seq1 G), RR, < )
 
Theoremcvgcmpubi 7389 An upper bound for the limit of a real infinite series. This theorem can also be used to compare two infinite series.
|- A e. V   &   |- F:NN-->RR   &   |- G:NN-->RR   &   |- (x e. NN -> (0 <_ (G` x) /\ (G` x) <_ (F` x)))   &   |- ( + seq1 F) ~~> A   &   |- B e. V   &   |- ( + seq1 G) ~~> B   =>   |- B <_ A
 
Theoremcvgcmp3ci 7390 A comparison test for convergence of a complex infinite series, where the reference sequence is multiplied by a constant. This version of cvgcmp3cei 7391 shows the explicit value of the limit (which is why we need all the hypotheses).
|- F:NN-->RR   &   |- T:NN-->CC   &   |- (x e. NN -> 0 <_ (F` x))   &   |- A e. V   &   |- ( + seq1 F) ~~> A   &   |- H Fn NN   &   |- (x e. NN -> (H` x) = (abs` (T` x)))   &   |- G Fn NN   &   |- (x e. NN -> (G` x) = (Re` (( + seq1 T)` x)))   &   |- R = {u e. RR | E.y e. NN A.v e. NN (y <_ v -> u < (G` v))}   &   |- C Fn NN   &   |- (x e. NN -> (C` x) = (Im` (( + seq1 T)` x)))   &   |- S = {u e. RR | E.y e. NN A.v e. NN (y <_ v -> u < (C` v))}   &   |- D Fn NN   &   |- (x e. NN -> (D` x) = (i x. (C` x)))   &   |- B e. NN   &   |- Q e. RR   &   |- 0 <_ Q   &   |- ((x e. NN /\ B < x) -> (abs` (T` x)) <_ (Q x. (F` x)))   =>   |- ( + seq1 T) ~~> (sup(R, RR, < ) + (i x. sup(S, RR, < )))
 
Theoremcvgcmp3cei 7391 A comparison test for convergence of a complex infinite series. If, beyond a certain index B, the absolute value of sequence G is smaller than a constant C times a convergent reference sequence F, then G converges to a complex number. This version of cvgcmp3ci 7390 shows just the existence of the limit rather than its explicit value.
|- A e. V   &   |- B e. NN   &   |- F:NN-->RR   &   |- (x e. NN -> 0 <_ (F` x))   &   |- ( + seq1 F) ~~> A   &   |- C e. RR   &   |- 0 <_ C   &   |- G:NN-->CC   &   |- ((x e. NN /\ B < x) -> (abs` (G` x)) <_ (C x. (F` x)))   =>   |- E.y( + seq1 G) ~~> y
 
Theoremcvgcmp3cetlem1 7392 Lemma for cvgcmp3ce 7394.
 
Theoremcvgcmp3cetlem2 7393 Lemma for cvgcmp3ce 7394.
 
Theoremcvgcmp3ce 7394 A comparison test for convergence of a complex infinite series. Closed theorem form of cvgcmp3cei 7391.
|- A e. V   =>   |- ((B e. NN /\ (((F:NN-->RR /\ A.x e. NN 0 <_ (F` x)) /\ ( + seq1 F) ~~> A) /\ ((C e. RR /\ 0 <_ C) /\ (G:NN-->CC /\ A.x e. NN (B < x -> (abs` (G` x)) <_ (C x. (F` x))))))) -> E.y( + seq1 G) ~~> y)
 
Infinite sums (cont.)
 
Theoremdfisum 7395 Series sum with an infinite index set (i.e. an infinite series).
|- (M e. ZZ -> sum_k e. (ZZ>=` M)A = U.{x | (<.M, + >. seq ({<.k, y>. | y = A} |` ZZ)) ~~> x})
 
Theoremisumval 7396 The value of the sum of a series F from M to infinity is the unique (by climuni 7302) value it converges to (if it converges). The sum evaluates to the empty set when it doesn't converge, but this shouldn't be depended on to indicate non-convergence (because it would presuppose a construction-dependent property of complex numbers, i.e. that no complex number equals the empty set, which, although by 0ncn 5405 is true for our specific construction, is not specified by their axioms and may fail for some other construction). Instead, use -. E.x e. CC(<.M, + >. seq F) ~~> x to indicate non-convergence.
|- F e. V   =>   |- (M e. ZZ -> sum_k e. (ZZ>=` M)(F` k) = U.{x | (<.M, + >. seq F) ~~> x})
 
Theoremisumvaltfi 7397 Version of isumval 7396 with a bound-variable hypothesis instead of a distinct variable condition.
|- F e. V   &   |- (y e. F -> A.k y e. F)   =>   |- (M e. ZZ -> sum_k e. (ZZ>=` M)(F` k) = U.{x | (<.M, + >. seq F) ~~> x})
 
Theoremisumval2 7398 Sum of A(k) from M to infinity.
|- A e. V   &   |- F = {<.k, y>. | (k e. (ZZ>=` M) /\ y = A)}   =>   |- (M e. ZZ -> sum_k e. (ZZ>=` M)A = U.{x | (<.M, + >. seq F) ~~> x})
 
Theoremisumclimtfi 7399 Version of isumclim 7400 with a bound-variable hypothesis instead of a distinct variable condition.
|- (y e. F -> A.k y e. F)   &   |- F e. V   &   |- A e. V   =>   |- ((M e. ZZ /\ (<.M, + >. seq F) ~~> A) -> sum_k e. (ZZ>=` M)(F` k) = A)
 
Theoremisumclim 7400 An infinite sum equals the value its series converges to.
|- F e. V   &   |- A e. V   =>   |- ((M e. ZZ /\ (<.M, + >. seq F) ~~> A) -> sum_k e. (ZZ>=` M)(F` k) = A)

MPE Home   Contents Copyright terms: Public domain < Previous  Next >