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-10676

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

Statement List for Metamath Proof Explorer - 7201-7300 - Page 73 of 107
TypeLabelDescription
Statement
 
Theoremcvgratlem2ALT 7201 Lemma for cvgrat 7208. Using expsubt 6544, restate cvgratlem1ALT 7200 with an absolute index C instead of just an offset from the starting index B.
 
Theoremcvgratlem3ALT 7202 Lemma for cvgrat 7208. Restate cvgratlem2ALT 7201 (which was for a real function) in terms of the absolute values of the terms of a complex function F, with the help of an auxiliary function G.
 
Theoremcvgratlem1 7203 Lemma for cvgrat 7208. Establish, by induction, an exponential upper bound for the terms of a real series, given that the ratio of successive terms is less than some positive constant A beyond a starting index B.
 
Theoremcvgratlem2 7204 Lemma for cvgrat 7208. Using expsubt 6544, restate cvgratlem1 7203 with an absolute index C instead of just an offset from the starting index B.
 
Theoremcvgratlem3 7205 Lemma for cvgrat 7208. Restate cvgratlem2 7204 (which was for a real function) in terms of the absolute values of the terms of a complex function F, with the help of an auxiliary function G.
 
Theoremcvgratlem4 7206 Lemma for cvgrat 7208. The ratio of successive terms meeting the ratio test criterion is positive.
 
Theoremcvgratlem5 7207 Lemma for cvgrat 7208. A complex infinite series F meeting the ratio test criterion converges. We show that the partial sums of F are smaller than the partial sums of a geometric series (which converges by geolimi 7189), so by the comparison test cvgcmp3cet 7144, F also converges.
 
Theoremcvgrat 7208 Ratio test for convergence of a complex infinite series. If the ratio A of the absolute values of of successive terms in an infinite sequence F is less than 1 for all terms beyond some index B, then the infinite sum of the terms of F converges to a complex number. Equivalent to first part of Exercise 4 of [Gleason] p. 182.
|- F:NN-->CC   =>   |- (((A e. RR /\ A < 1) /\ (B e. NN /\ A.x e. NN (B <_ x -> (abs` (F` (x + 1))) < (A x. (abs` (F` x)))))) -> E.y( + seq1 F) ~~> y)
 
The product of two finite sums
 
Theoremfsum0diaglem1 7209 Lemma for fsum0diag 7211.
 
Theoremfsum0diaglem2 7210 Lemma for fsum0diag 7211 that provides its induction hypothesis. Warning: The HTML proof page is 0.8 megabyte in size.
 
Theoremfsum0diag 7211 Two ways to express "the sum of A(j) x. B(k) where j + k <_ N."
|- ((N e. NN0 /\ A.j e. (0...N)A e. CC /\ A.k e. (0...N)B e. CC) -> sum_j e. (0...N)sum_k e. (0...(N - j))(A x. B) = sum_k e. (0...N)sum_j e. (0...k)(A x. [_(k - j) / k]_B))
 
Theoremfsum0diag2 7212 Two ways to express "the sum of A(j) x. B(k) where j + k <_ N."
|- ((N e. NN0 /\ A.j e. (0...N)A e. CC /\ A.k e. (0...N)B e. CC) -> sum_j e. (0...N)sum_k e. (0...(N - j))(A x. B) = sum_j e. (0...N)sum_k e. (0...j)([_(j - k) / j]_A x. B))
 
Theoremfsum0diag3 7213 Two ways to express "the sum of A(j) x. B(k) where j + k <_ N."
|- ((N e. NN0 /\ A.j e. (0...N)A e. CC /\ A.k e. (0...N)B e. CC) -> sum_j e. (0...N)sum_k e. (0...(N - j))(A x. B) = sum_j e. (0...N)(A x. sum_k e. (0...(N - j))B))
 
Theoremfsum0diag4 7214 Two ways to express "the sum of A(j) x. B(k) where j + k <_ N."
|- ((N e. NN0 /\ A.j e. (0...N)A e. CC /\ A.k e. (0...N)B e. CC) -> sum_j e. (0...N)sum_k e. (0...(N - j))(A x. B) = sum_k e. (0...N)(B x. sum_j e. (0...(N - k))A))
 
Continuous complex functions
 
Syntaxccncf 7215 Extend class notation to include the operation which returns a class of continuous complex functions.
class -cn->
 
Definitiondf-cncf 7216 Define the operation whose value is a class of continuous complex functions.
|- -cn-> = {<.<.a, b>., s>. | ((a (_ CC /\ b (_ CC) /\ s = {f | (f:a-->b /\ A.x e. a A.y e. RR+ E.z e. RR+ A.w e. a ((abs` (x - w)) < z -> (abs` ((f` x) - (f` w))) < y))})}
 
Theoremcncfval 7217 The value of the continuous complex function operation is the set of continuous functions from A to B. (Contributed by Paul Chapman, 11-Oct-2007.)
|- ((A (_ CC /\ B (_ CC) -> (A-cn->B) = {f | (f:A-->B /\ A.x e. A A.y e. RR+ E.z e. RR+ A.w e. A ((abs`
 (x - w)) < z -> (abs`
 ((f` x) - (f` w))) < y))})
 
Theoremelcncf 7218 Membership in the set of continuous complex functions from A to B. (Contributed by Paul Chapman, 11-Oct-2007.)
|- ((A (_ CC /\ B (_ CC) -> (F e. (A-cn->B) <-> (F:A-->B /\ A.x e. A A.y e. RR+ E.z e. RR+ A.w e. A ((abs`
 (x - w)) < z -> (abs`
 ((F` x) - (F` w))) < y))))
 
Theoremcncff 7219 A continuous complex function's domain and codomain. (Contributed by Paul Chapman, 17-Jan-2008.)
|- ((P (_ CC /\ Q (_ CC /\ F e. (P-cn->Q)) -> F:P-->Q)
 
TheoremcncffvelrnOLD 7220 A continuous complex function's value belongs to its codomain. (Contributed by Paul Chapman, 21-Jan-2008.)
|- ((A (_ CC /\ B (_ CC /\ F e. (A-cn->B)) -> (C e. A -> (F` C) e. B))
 
Theoremcncffvelrn 7221 A continuous complex function's value belongs to its codomain. (Contributed by Paul Chapman, 21-Jan-2008.)
|- ((A (_ CC /\ B (_ CC /\ F e. (A-cn->B)) -> (C e. A -> (F` C) e. B))
 
Theoremnegfcncf 7222 The negative of a continuous complex function is continuous. (Contributed by Paul Chapman, 21-Jan-2008.)
|- A (_ CC   &   |- F e. (A-cn->CC)   &   |- G = {<.a, b>. | (a e. A /\ b = -u(F` a))}   =>   |- G e. (A-cn->CC)
 
Theoremelcncf1d 7223 Membership in the set of continuous complex functions from A to B. (Contributed by Paul Chapman, 26-Nov-2007.)
|- (ph -> F:A-->B)   &   |- (ph -> ((x e. A /\ y e. RR+) -> Z e. RR+))   &   |- (ph -> (((x e. A /\ w e. A) /\ y e. RR+) -> ((abs` (x - w)) < Z -> (abs` ((F` x) - (F` w))) < y)))   =>   |- (ph -> ((A (_ CC /\ B (_ CC) -> F e. (A-cn->B)))
 
Theoremelcncf1i 7224 Membership in the set of continuous complex functions from A to B. (Contributed by Paul Chapman, 26-Nov-2007.)
|- F:A-->B   &   |- ((x e. A /\ y e. RR+) -> Z e. RR+)   &   |- (((x e. A /\ w e. A) /\ y e. RR+) -> ((abs` (x - w)) < Z -> (abs` ((F` x) - (F` w))) < y))   =>   |- ((A (_ CC /\ B (_ CC) -> F e. (A-cn->B))
 
Theoremrescncf 7225 A continuous complex function restricted to a subset is continuous. (Contributed by Paul Chapman, 18-Oct-2007.)
|- ((A (_ CC /\ B (_ CC /\ C (_ A) -> (F e. (A-cn->B) -> (F |` C) e. (C-cn->B)))
 
Theoremcncffvrn 7226 Change the codomain of a continuous complex function. (Contributed by Paul Chapman, 18-Oct-2007.)
|- (((A (_ CC /\ B (_ CC /\ C (_ CC) /\ A.x e. A (F` x) e. C) -> (F e. (A-cn->B) -> F e. (A-cn->C)))
 
Theoremabscncflem 7227 Lemma for abscncf 7228, recncf 7229, imcncf 7230, and cjcncf 7231.
 
Theoremabscncf 7228 Absolute value is continuous. (Contributed by Paul Chapman, 21-Oct-2007.)
|- abs e. (CC-cn->RR)
 
Theoremrecncf 7229 Real part is continuous. (Contributed by Paul Chapman, 21-Oct-2007.)
|- Re e. (CC-cn->RR)
 
Theoremimcncf 7230 Imaginary part is continuous. (Contributed by Paul Chapman, 21-Oct-2007.)
|- Im e. (CC-cn->RR)
 
Theoremcjcncf 7231 Complex conjugate is continuous. (Contributed by Paul Chapman, 21-Oct-2007.)
|- * e. (CC-cn->CC)
 
Theoremmulc1cncf 7232 Multiplication by a constant is continuous. (Contributed by Paul Chapman, 28-Nov-2007.)
|- F = {<.x, y>. | (x e. CC /\ y = (A x. x))}   =>   |- (A e. CC -> F e. (CC-cn->CC))
 
Theoremdivccncf 7233 Division by a constant is continuous. (Contributed by Paul Chapman, 28-Nov-2007.)
|- F = {<.x, y>. | (x e. CC /\ y = (x / A))}   =>   |- ((A e. CC /\ A =/= 0) -> F e. (CC-cn->CC))
 
Intermediate value theorem
 
Theoremivthlem1 7234 Lemma for isupivth 7243.
 
Theoremivthlem2 7235 Lemma for isupivth 7243.
 
Theoremivthlem3 7236 Lemma for isupivth 7243.
 
Theoremivthlem4 7237 Lemma for isupivth 7243.
 
Theoremivthlem5 7238 Lemma for isupivth 7243.
 
Theoremivthlem6 7239 Lemma for isupivth 7243: modus tollens case 1.
 
Theoremivthlem7 7240 Lemma for isupivth 7243: modus tollens case 2.
 
Theoremivthlem8 7241 Lemma for isupivth 7243.
 
Theoremivthlem9 7242 Lemma for isupivth 7243.
 
Theoremisupivth 7243 The intermediate value theorem, increasing case with supremum solution. (Contributed by Paul Chapman, 22-Jan-2008.)
|- A e. RR   &   |- B e. RR   &   |- U e. RR   &   |- A < B   &   |- (A[,]B) (_ D   &   |- D (_ CC   &   |- F e. (D-cn->CC)   &   |- (x e. (A[,]B) -> (F` x) e. RR)   &   |- S = {x e. (A[,]B) | (F` x) = U}   &   |- ((F` A) < U /\ U < (F` B))   &   |- C = sup(S, RR, < )   =>   |- (C e. (A(,)B) /\ (F` C) = U)
 
Theoremdsupivthlem 7244 Lemma for dsupivth 7245.
 
Theoremdsupivth 7245 The intermediate value theorem, decreasing case with supremum solution. (Contributed by Paul Chapman, 22-Jan-2008.)
|- A e. RR   &   |- B e. RR   &   |- U e. RR   &   |- A < B   &   |- (A[,]B) (_ D   &   |- D (_ CC   &   |- F e. (D-cn->CC)   &   |- (x e. (A[,]B) -> (F` x) e. RR)   &   |- S = {x e. (A[,]B) | (F` x) = U}   &   |- ((F` B) < U /\ U < (F` A))   &   |- C = sup(S, RR, < )   =>   |- (C e. (A(,)B) /\ (F` C) = U)
 
Theoremivthlem4OLD 7246 Lemma for ivthOLD 7251.
 
Theoremivthlem5OLD 7247 Lemma for ivthOLD 7251.
 
Theoremivthlem6OLD 7248 Lemma for ivthOLD 7251: modus tollens case 1.
 
Theoremivthlem7OLD 7249 Lemma for ivthOLD 7251: modus tollens case 2.
 
Theoremivthlem8OLD 7250