![]() |
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 2651 | . . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} | |
5 | eqid 2651 | . . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} | |
6 | eqid 2651 | . . 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 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑋 ∈ 𝐷) |
13 | elrabi 3391 | . . . . . 6 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℕ) | |
14 | 13 | nnzd 11519 | . . . . 5 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℤ) |
15 | 14 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑗 ∈ ℤ) |
16 | 7, 8, 9, 10, 12, 15 | dchrzrhcl 25015 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → (𝑋‘(𝐿‘𝑗)) ∈ ℂ) |
17 | 11 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑋 ∈ 𝐷) |
18 | elrabi 3391 | . . . . . 6 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℕ) | |
19 | 18 | nnzd 11519 | . . . . 5 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℤ) |
20 | 19 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑘 ∈ ℤ) |
21 | 7, 8, 9, 10, 17, 20 | dchrzrhcl 25015 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑋‘(𝐿‘𝑘)) ∈ ℂ) |
22 | 14, 19 | anim12i 589 | . . . 4 ⊢ ((𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) |
23 | 11 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑋 ∈ 𝐷) |
24 | simprl 809 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑗 ∈ ℤ) | |
25 | simprr 811 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑘 ∈ ℤ) | |
26 | 7, 8, 9, 10, 23, 24, 25 | dchrzrhmul 25016 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → (𝑋‘(𝐿‘(𝑗 · 𝑘))) = ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘)))) |
27 | 26 | eqcomd 2657 | . . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘)))) |
28 | 22, 27 | sylan2 490 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵})) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘)))) |
29 | fveq2 6229 | . . . 4 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝐿‘𝑖) = (𝐿‘(𝑗 · 𝑘))) | |
30 | 29 | fveq2d 6233 | . . 3 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝑋‘(𝐿‘𝑖)) = (𝑋‘(𝐿‘(𝑗 · 𝑘)))) |
31 | 1, 2, 3, 4, 5, 6, 16, 21, 28, 30 | fsumdvdsmul 24966 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖))) |
32 | rpvmasum.a | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
33 | rpvmasum2.1 | . . . . 5 ⊢ 1 = (0g‘𝐺) | |
34 | dchrisum0f.f | . . . . 5 ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣))) | |
35 | 8, 10, 32, 7, 9, 33, 34 | dchrisum0fval 25239 | . . . 4 ⊢ (𝐴 ∈ ℕ → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗))) |
36 | 1, 35 | syl 17 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗))) |
37 | 8, 10, 32, 7, 9, 33, 34 | dchrisum0fval 25239 | . . . 4 ⊢ (𝐵 ∈ ℕ → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) |
38 | 2, 37 | syl 17 | . . 3 ⊢ (𝜑 → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) |
39 | 36, 38 | oveq12d 6708 | . 2 ⊢ (𝜑 → ((𝐹‘𝐴) · (𝐹‘𝐵)) = (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘)))) |
40 | 1, 2 | nnmulcld 11106 | . . 3 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ) |
41 | 8, 10, 32, 7, 9, 33, 34 | dchrisum0fval 25239 | . . 3 ⊢ ((𝐴 · 𝐵) ∈ ℕ → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖))) |
42 | 40, 41 | syl 17 | . 2 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖))) |
43 | 31, 39, 42 | 3eqtr4rd 2696 | 1 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1523 ∈ wcel 2030 {crab 2945 class class class wbr 4685 ↦ cmpt 4762 ‘cfv 5926 (class class class)co 6690 1c1 9975 · cmul 9979 ℕcn 11058 ℤcz 11415 Σcsu 14460 ∥ cdvds 15027 gcd cgcd 15263 Basecbs 15904 0gc0g 16147 ℤRHomczrh 19896 ℤ/nℤczn 19899 DChrcdchr 25002 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-inf2 8576 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051 ax-pre-sup 10052 ax-addf 10053 ax-mulf 10054 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-fal 1529 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-se 5103 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-isom 5935 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-om 7108 df-1st 7210 df-2nd 7211 df-tpos 7397 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-1o 7605 df-oadd 7609 df-er 7787 df-ec 7789 df-qs 7793 df-map 7901 df-en 7998 df-dom 7999 df-sdom 8000 df-fin 8001 df-sup 8389 df-inf 8390 df-oi 8456 df-card 8803 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-div 10723 df-nn 11059 df-2 11117 df-3 11118 df-4 11119 df-5 11120 df-6 11121 df-7 11122 df-8 11123 df-9 11124 df-n0 11331 df-z 11416 df-dec 11532 df-uz 11726 df-rp 11871 df-fz 12365 df-fzo 12505 df-fl 12633 df-mod 12709 df-seq 12842 df-exp 12901 df-hash 13158 df-cj 13883 df-re 13884 df-im 13885 df-sqrt 14019 df-abs 14020 df-clim 14263 df-sum 14461 df-dvds 15028 df-gcd 15264 df-struct 15906 df-ndx 15907 df-slot 15908 df-base 15910 df-sets 15911 df-ress 15912 df-plusg 16001 df-mulr 16002 df-starv 16003 df-sca 16004 df-vsca 16005 df-ip 16006 df-tset 16007 df-ple 16008 df-ds 16011 df-unif 16012 df-0g 16149 df-imas 16215 df-qus 16216 df-mgm 17289 df-sgrp 17331 df-mnd 17342 df-mhm 17382 df-grp 17472 df-minusg 17473 df-sbg 17474 df-mulg 17588 df-subg 17638 df-nsg 17639 df-eqg 17640 df-ghm 17705 df-cmn 18241 df-abl 18242 df-mgp 18536 df-ur 18548 df-ring 18595 df-cring 18596 df-oppr 18669 df-dvdsr 18687 df-unit 18688 df-rnghom 18763 df-subrg 18826 df-lmod 18913 df-lss 18981 df-lsp 19020 df-sra 19220 df-rgmod 19221 df-lidl 19222 df-rsp 19223 df-2idl 19280 df-cnfld 19795 df-zring 19867 df-zrh 19900 df-zn 19903 df-dchr 25003 |
This theorem is referenced by: dchrisum0flblem2 25243 |
Copyright terms: Public domain | W3C validator |