| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dchrisum0fmul | Structured version Visualization version GIF version | ||
| Description: The function 𝐹, the divisor sum of a Dirichlet character, is a multiplicative function (but not completely multiplicative). Equation 9.4.27 of [Shapiro], p. 382. (Contributed by Mario Carneiro, 5-May-2016.) |
| Ref | Expression |
|---|---|
| rpvmasum.z | ⊢ 𝑍 = (ℤ/nℤ‘𝑁) |
| rpvmasum.l | ⊢ 𝐿 = (ℤRHom‘𝑍) |
| rpvmasum.a | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| rpvmasum2.g | ⊢ 𝐺 = (DChr‘𝑁) |
| rpvmasum2.d | ⊢ 𝐷 = (Base‘𝐺) |
| rpvmasum2.1 | ⊢ 1 = (0g‘𝐺) |
| dchrisum0f.f | ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣))) |
| dchrisum0f.x | ⊢ (𝜑 → 𝑋 ∈ 𝐷) |
| dchrisum0fmul.a | ⊢ (𝜑 → 𝐴 ∈ ℕ) |
| dchrisum0fmul.b | ⊢ (𝜑 → 𝐵 ∈ ℕ) |
| dchrisum0fmul.m | ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) |
| Ref | Expression |
|---|---|
| dchrisum0fmul | ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dchrisum0fmul.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℕ) | |
| 2 | dchrisum0fmul.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℕ) | |
| 3 | dchrisum0fmul.m | . . 3 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) | |
| 4 | eqid 2765 | . . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} | |
| 5 | eqid 2765 | . . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} | |
| 6 | eqid 2765 | . . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} | |
| 7 | rpvmasum2.g | . . . 4 ⊢ 𝐺 = (DChr‘𝑁) | |
| 8 | rpvmasum.z | . . . 4 ⊢ 𝑍 = (ℤ/nℤ‘𝑁) | |
| 9 | rpvmasum2.d | . . . 4 ⊢ 𝐷 = (Base‘𝐺) | |
| 10 | rpvmasum.l | . . . 4 ⊢ 𝐿 = (ℤRHom‘𝑍) | |
| 11 | dchrisum0f.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐷) | |
| 12 | 11 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑋 ∈ 𝐷) |
| 13 | elrabi 3649 | . . . . . 6 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℕ) | |
| 14 | 13 | nnzd 12608 | . . . . 5 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℤ) |
| 15 | 14 | adantl 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑗 ∈ ℤ) |
| 16 | 7, 8, 9, 10, 12, 15 | dchrzrhcl 27367 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → (𝑋‘(𝐿‘𝑗)) ∈ ℂ) |
| 17 | 11 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑋 ∈ 𝐷) |
| 18 | elrabi 3649 | . . . . . 6 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℕ) | |
| 19 | 18 | nnzd 12608 | . . . . 5 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℤ) |
| 20 | 19 | adantl 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑘 ∈ ℤ) |
| 21 | 7, 8, 9, 10, 17, 20 | dchrzrhcl 27367 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑋‘(𝐿‘𝑘)) ∈ ℂ) |
| 22 | 14, 19 | anim12i 624 | . . . 4 ⊢ ((𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) |
| 23 | 11 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑋 ∈ 𝐷) |
| 24 | simprl 782 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑗 ∈ ℤ) | |
| 25 | simprr 784 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑘 ∈ ℤ) | |
| 26 | 7, 8, 9, 10, 23, 24, 25 | dchrzrhmul 27368 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → (𝑋‘(𝐿‘(𝑗 · 𝑘))) = ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘)))) |
| 27 | 26 | eqcomd 2771 | . . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘)))) |
| 28 | 22, 27 | sylan2 604 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵})) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘)))) |
| 29 | 2fveq3 6876 | . . 3 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝑋‘(𝐿‘𝑖)) = (𝑋‘(𝐿‘(𝑗 · 𝑘)))) | |
| 30 | 1, 2, 3, 4, 5, 6, 16, 21, 28, 29 | fsumdvdsmul 27317 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖))) |
| 31 | rpvmasum.a | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 32 | rpvmasum2.1 | . . . . 5 ⊢ 1 = (0g‘𝐺) | |
| 33 | dchrisum0f.f | . . . . 5 ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣))) | |
| 34 | 8, 10, 31, 7, 9, 32, 33 | dchrisum0fval 27627 | . . . 4 ⊢ (𝐴 ∈ ℕ → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗))) |
| 35 | 1, 34 | syl 18 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗))) |
| 36 | 8, 10, 31, 7, 9, 32, 33 | dchrisum0fval 27627 | . . . 4 ⊢ (𝐵 ∈ ℕ → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) |
| 37 | 2, 36 | syl 18 | . . 3 ⊢ (𝜑 → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) |
| 38 | 35, 37 | oveq12d 7418 | . 2 ⊢ (𝜑 → ((𝐹‘𝐴) · (𝐹‘𝐵)) = (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘)))) |
| 39 | 1, 2 | nnmulcld 12280 | . . 3 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ) |
| 40 | 8, 10, 31, 7, 9, 32, 33 | dchrisum0fval 27627 | . . 3 ⊢ ((𝐴 · 𝐵) ∈ ℕ → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖))) |
| 41 | 39, 40 | syl 18 | . 2 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖))) |
| 42 | 30, 38, 41 | 3eqtr4rd 2811 | 1 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 {crab 3417 class class class wbr 5105 ↦ cmpt 5186 ‘cfv 6525 (class class class)co 7400 1c1 11089 · cmul 11093 ℕcn 12224 ℤcz 12582 Σcsu 15727 ∥ cdvds 16300 gcd cgcd 16542 Basecbs 17259 0gc0g 17482 ℤRHomczrh 21609 ℤ/nℤczn 21612 DChrcdchr 27354 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-inf2 9598 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 ax-addf 11167 ax-mulf 11168 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-tpos 8210 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-ec 8684 df-qs 8688 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-inf 9391 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-uz 12854 df-rp 13008 df-fz 13527 df-fzo 13674 df-fl 13816 df-mod 13894 df-seq 14029 df-exp 14089 df-hash 14358 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-clim 15529 df-sum 15728 df-dvds 16301 df-gcd 16543 df-struct 17197 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-ress 17281 df-plusg 17313 df-mulr 17314 df-starv 17315 df-sca 17316 df-vsca 17317 df-ip 17318 df-tset 17319 df-ple 17320 df-ds 17322 df-unif 17323 df-0g 17484 df-imas 17552 df-qus 17553 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-mhm 18831 df-grp 18993 df-minusg 18994 df-sbg 18995 df-mulg 19125 df-subg 19180 df-nsg 19181 df-eqg 19182 df-ghm 19275 df-cmn 19843 df-abl 19844 df-mgp 20208 df-rng 20222 df-ur 20255 df-ring 20308 df-cring 20309 df-oppr 20410 df-dvdsr 20430 df-unit 20431 df-rhm 20545 df-subrng 20622 df-subrg 20646 df-lmod 20952 df-lss 21022 df-lsp 21062 df-sra 21263 df-rgmod 21264 df-lidl 21301 df-rsp 21302 df-2idl 21351 df-cnfld 21483 df-zring 21557 df-zrh 21613 df-zn 21616 df-dchr 27355 |
| This theorem is referenced by: dchrisum0flblem2 27631 |
| Copyright terms: Public domain | W3C validator |