| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > taylpfval | Structured version Visualization version GIF version | ||
| Description: Define the Taylor polynomial of a function. The constant Tayl is a function of five arguments: 𝑆 is the base set with respect to evaluate the derivatives (generally ℝ or ℂ), 𝐹 is the function we are approximating, at point 𝐵, to order 𝑁. The result is a polynomial function of 𝑥. (Contributed by Mario Carneiro, 31-Dec-2016.) |
| Ref | Expression |
|---|---|
| taylpfval.s | ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ}) |
| taylpfval.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
| taylpfval.a | ⊢ (𝜑 → 𝐴 ⊆ 𝑆) |
| taylpfval.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| taylpfval.b | ⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) |
| taylpfval.t | ⊢ 𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵) |
| Ref | Expression |
|---|---|
| taylpfval | ⊢ (𝜑 → 𝑇 = (𝑥 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | taylpfval.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ}) | |
| 2 | taylpfval.f | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
| 3 | taylpfval.a | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝑆) | |
| 4 | taylpfval.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 5 | 4 | orcd 887 | . . . 4 ⊢ (𝜑 → (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞)) |
| 6 | taylpfval.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁)) | |
| 7 | 1, 2, 3, 4, 6 | taylplem1 26695 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘)) |
| 8 | taylpfval.t | . . . 4 ⊢ 𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵) | |
| 9 | 1, 2, 3, 5, 7, 8 | taylfval 26691 | . . 3 ⊢ (𝜑 → 𝑇 = ∪ 𝑥 ∈ ℂ ({𝑥} × (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))))) |
| 10 | cnfldbas 21687 | . . . . . . 7 ⊢ ℂ = (Base‘ℂfld) | |
| 11 | cnfld0 21707 | . . . . . . 7 ⊢ 0 = (0g‘ℂfld) | |
| 12 | cnring 21705 | . . . . . . . 8 ⊢ ℂfld ∈ Ring | |
| 13 | ringcmn 20516 | . . . . . . . 8 ⊢ (ℂfld ∈ Ring → ℂfld ∈ CMnd) | |
| 14 | 12, 13 | mp1i 14 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ℂfld ∈ CMnd) |
| 15 | cnfldtps 25101 | . . . . . . . 8 ⊢ ℂfld ∈ TopSp | |
| 16 | 15 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ℂfld ∈ TopSp) |
| 17 | ovex 7453 | . . . . . . . . 9 ⊢ (0[,]𝑁) ∈ V | |
| 18 | 17 | inex1 5276 | . . . . . . . 8 ⊢ ((0[,]𝑁) ∩ ℤ) ∈ V |
| 19 | 18 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((0[,]𝑁) ∩ ℤ) ∈ V) |
| 20 | 1, 2, 3, 5, 7 | taylfvallem1 26689 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)) ∈ ℂ) |
| 21 | 20 | fmpttd 7115 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))):((0[,]𝑁) ∩ ℤ)⟶ℂ) |
| 22 | eqid 2760 | . . . . . . . 8 ⊢ (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) = (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) | |
| 23 | 0z 12707 | . . . . . . . . . . 11 ⊢ 0 ∈ ℤ | |
| 24 | 4 | nn0zd 12721 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 25 | fzval2 13645 | . . . . . . . . . . 11 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) | |
| 26 | 23, 24, 25 | sylancr 599 | . . . . . . . . . 10 ⊢ (𝜑 → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) |
| 27 | 26 | adantr 486 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (0...𝑁) = ((0[,]𝑁) ∩ ℤ)) |
| 28 | fzfid 14119 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (0...𝑁) ∈ Fin) | |
| 29 | 27, 28 | eqeltrrd 2861 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((0[,]𝑁) ∩ ℤ) ∈ Fin) |
| 30 | ovexd 7455 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)) ∈ V) | |
| 31 | c0ex 11303 | . . . . . . . . 9 ⊢ 0 ∈ V | |
| 32 | 31 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 0 ∈ V) |
| 33 | 22, 29, 30, 32 | fsuppmptdm 9371 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) finSupp 0) |
| 34 | eqid 2760 | . . . . . . 7 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 35 | 34 | cnfldhaus 25108 | . . . . . . . 8 ⊢ (TopOpen‘ℂfld) ∈ Haus |
| 36 | 35 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (TopOpen‘ℂfld) ∈ Haus) |
| 37 | 10, 11, 14, 16, 19, 21, 33, 34, 36 | haustsmsid 24465 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))) = {(ℂfld Σg (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))))}) |
| 38 | 29, 20 | gsumfsum 21745 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂfld Σg (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))) = Σ𝑘 ∈ ((0[,]𝑁) ∩ ℤ)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) |
| 39 | 27 | sumeq1d 15872 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)) = Σ𝑘 ∈ ((0[,]𝑁) ∩ ℤ)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) |
| 40 | 38, 39 | eqtr4d 2798 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂfld Σg (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))) = Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) |
| 41 | 40 | sneqd 4592 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → {(ℂfld Σg (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))))} = {Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))}) |
| 42 | 37, 41 | eqtrd 2795 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))) = {Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))}) |
| 43 | 42 | xpeq2d 5680 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ({𝑥} × (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))))) = ({𝑥} × {Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))})) |
| 44 | 43 | iuneq2dv 4975 | . . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ ℂ ({𝑥} × (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))))) = ∪ 𝑥 ∈ ℂ ({𝑥} × {Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))})) |
| 45 | 9, 44 | eqtrd 2795 | . 2 ⊢ (𝜑 → 𝑇 = ∪ 𝑥 ∈ ℂ ({𝑥} × {Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))})) |
| 46 | dfmpt3 6673 | . 2 ⊢ (𝑥 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))) = ∪ 𝑥 ∈ ℂ ({𝑥} × {Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘))}) | |
| 47 | 45, 46 | eqtr4di 2813 | 1 ⊢ (𝜑 → 𝑇 = (𝑥 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥 − 𝐵)↑𝑘)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3895 ∩ cin 4089 {csn 4584 {cpr 4586 ∪ ciun 4950 ↦ cmpt 5185 × cxp 5648 dom cdm 5650 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 Fincfn 8976 ℂcc 11201 ℝcr 11202 0cc0 11203 · cmul 11208 +∞cpnf 11343 − cmin 11544 / cdiv 11976 ℕ0cn0 12609 ℤcz 12696 [,]cicc 13482 ...cfz 13642 ↑cexp 14207 !cfa 14420 Σcsu 15858 TopOpenctopn 17597 Σg cgsu 17616 CMndccmn 19999 Ringcrg 20464 ℂfldccnfld 21683 TopSpctps 23255 Hauscha 23631 tsums ctsu 24450 D𝑛 cdvn 26189 Tayl ctayl 26685 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9645 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-pre-sup 11281 ax-addf 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-supp 8180 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-map 8852 df-pm 8853 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-fsupp 9357 df-fi 9406 df-sup 9437 df-inf 9438 df-oi 9507 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-5 12411 df-6 12412 df-7 12413 df-8 12414 df-9 12415 df-n0 12610 df-z 12697 df-dec 12818 df-uz 12969 df-q 13079 df-rp 13124 df-xneg 13244 df-xadd 13245 df-xmul 13246 df-icc 13486 df-fz 13643 df-fzo 13792 df-seq 14148 df-exp 14208 df-fac 14421 df-hash 14478 df-cj 15271 df-re 15272 df-im 15273 df-sqrt 15407 df-abs 15408 df-clim 15660 df-sum 15859 df-struct 17330 df-sets 17347 df-slot 17365 df-ndx 17377 df-base 17393 df-plusg 17446 df-mulr 17447 df-starv 17448 df-tset 17452 df-ple 17453 df-ds 17455 df-unif 17456 df-rest 17598 df-topn 17599 df-0g 17617 df-gsum 17618 df-topgen 17619 df-mgm 18821 df-sgrp 18913 df-mnd 18929 df-grp 19152 df-minusg 19153 df-cntz 19536 df-cmn 20001 df-abl 20002 df-mgp 20366 df-ur 20413 df-ring 20466 df-cring 20467 df-psmet 21675 df-xmet 21676 df-met 21677 df-bl 21678 df-mopn 21679 df-fbas 21680 df-fg 21681 df-cnfld 21684 df-top 23217 df-topon 23234 df-topsp 23256 df-bases 23269 df-cld 23342 df-ntr 23343 df-cls 23344 df-nei 23421 df-lp 23459 df-perf 23460 df-cnp 23551 df-haus 23638 df-fil 24170 df-fm 24262 df-flim 24263 df-flf 24264 df-tsms 24451 df-xms 24644 df-ms 24645 df-limc 26191 df-dv 26192 df-dvn 26193 df-tayl 26687 |
| This theorem is used by: taylpf 26698 taylpval 26699 taylply2 26700 dvtaylp 26702 |
| Copyright terms: Public domain | W3C validator |