dchrisum0fmul - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dchrisum0fmul		Structured version Visualization version GIF version

Theorem dchrisum0fmul 25195

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.)

**Hypotheses**
Ref	Expression
rpvmasum.z	⊢ 𝑍 = (ℤ/nℤ‘𝑁)
rpvmasum.l	⊢ 𝐿 = (ℤRHom‘𝑍)
rpvmasum.a	⊢ (𝜑 → 𝑁 ∈ ℕ)
rpvmasum2.g	⊢ 𝐺 = (DChr‘𝑁)
rpvmasum2.d	⊢ 𝐷 = (Base‘𝐺)
rpvmasum2.1	⊢ 1 = (0_g‘𝐺)
dchrisum0f.f	⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
dchrisum0f.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
dchrisum0fmul.a	⊢ (𝜑 → 𝐴 ∈ ℕ)
dchrisum0fmul.b	⊢ (𝜑 → 𝐵 ∈ ℕ)
dchrisum0fmul.m	⊢ (𝜑 → (𝐴 gcd 𝐵) = 1)

**Assertion**
Ref	Expression
dchrisum0fmul	⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵)))

Distinct variable groups: 𝑞,𝑏,𝑣,𝐴 𝑁,𝑞 𝐵,𝑏,𝑞,𝑣 𝐿,𝑏,𝑣 𝑋,𝑏,𝑣 Allowed substitution hints: 𝜑(𝑣,𝑞,𝑏) 𝐷(𝑣,𝑞,𝑏) 1 (𝑣,𝑞,𝑏) 𝐹(𝑣,𝑞,𝑏) 𝐺(𝑣,𝑞,𝑏) 𝐿(𝑞) 𝑁(𝑣,𝑏) 𝑋(𝑞) 𝑍(𝑣,𝑞,𝑏)

Proof of Theorem dchrisum0fmul Dummy variables 𝑘 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dchrisum0fmul.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℕ)
2		dchrisum0fmul.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℕ)
3		dchrisum0fmul.m	. . 3 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1)
4		eqid 2622	. . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}
5		eqid 2622	. . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}
6		eqid 2622	. . 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 481	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑋 ∈ 𝐷)
13		elrabi 3359	. . . . . 6 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℕ)
14	13	nnzd 11481	. . . . 5 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℤ)
15	14	adantl 482	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑗 ∈ ℤ)
16	7, 8, 9, 10, 12, 15	dchrzrhcl 24970	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → (𝑋‘(𝐿‘𝑗)) ∈ ℂ)
17	11	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑋 ∈ 𝐷)
18		elrabi 3359	. . . . . 6 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℕ)
19	18	nnzd 11481	. . . . 5 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℤ)
20	19	adantl 482	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑘 ∈ ℤ)
21	7, 8, 9, 10, 17, 20	dchrzrhcl 24970	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑋‘(𝐿‘𝑘)) ∈ ℂ)
22	14, 19	anim12i 590	. . . 4 ⊢ ((𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ))
23	11	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑋 ∈ 𝐷)
24		simprl 794	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑗 ∈ ℤ)
25		simprr 796	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑘 ∈ ℤ)
26	7, 8, 9, 10, 23, 24, 25	dchrzrhmul 24971	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → (𝑋‘(𝐿‘(𝑗 · 𝑘))) = ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))))
27	26	eqcomd 2628	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘))))
28	22, 27	sylan2 491	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵})) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘))))
29		fveq2 6191	. . . 4 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝐿‘𝑖) = (𝐿‘(𝑗 · 𝑘)))
30	29	fveq2d 6195	. . 3 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝑋‘(𝐿‘𝑖)) = (𝑋‘(𝐿‘(𝑗 · 𝑘))))
31	1, 2, 3, 4, 5, 6, 16, 21, 28, 30	fsumdvdsmul 24921	. 2 ⊢ (𝜑 → (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖)))
32		rpvmasum.a	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ)
33		rpvmasum2.1	. . . . 5 ⊢ 1 = (0_g‘𝐺)
34		dchrisum0f.f	. . . . 5 ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
35	8, 10, 32, 7, 9, 33, 34	dchrisum0fval 25194	. . . 4 ⊢ (𝐴 ∈ ℕ → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)))
36	1, 35	syl 17	. . 3 ⊢ (𝜑 → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)))
37	8, 10, 32, 7, 9, 33, 34	dchrisum0fval 25194	. . . 4 ⊢ (𝐵 ∈ ℕ → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘)))
38	2, 37	syl 17	. . 3 ⊢ (𝜑 → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘)))
39	36, 38	oveq12d 6668	. 2 ⊢ (𝜑 → ((𝐹‘𝐴) · (𝐹‘𝐵)) = (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))))
40	1, 2	nnmulcld 11068	. . 3 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ)
41	8, 10, 32, 7, 9, 33, 34	dchrisum0fval 25194	. . 3 ⊢ ((𝐴 · 𝐵) ∈ ℕ → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖)))
42	40, 41	syl 17	. 2 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖)))
43	31, 39, 42	3eqtr4rd 2667	1 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 {crab 2916 class class class wbr 4653 ↦ cmpt 4729 ‘cfv 5888 (class class class)co 6650 1c1 9937 · cmul 9941 ℕcn 11020 ℤcz 11377 Σcsu 14416 ∥ cdvds 14983 gcd cgcd 15216 Basecbs 15857 0_gc0g 16100 ℤRHomczrh 19848 ℤ/nℤczn 19851 DChrcdchr 24957

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-tpos 7352 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-ec 7744 df-qs 7748 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-rp 11833 df-fz 12327 df-fzo 12466 df-fl 12593 df-mod 12669 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-sum 14417 df-dvds 14984 df-gcd 15217 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-starv 15956 df-sca 15957 df-vsca 15958 df-ip 15959 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-0g 16102 df-imas 16168 df-qus 16169 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-mhm 17335 df-grp 17425 df-minusg 17426 df-sbg 17427 df-mulg 17541 df-subg 17591 df-nsg 17592 df-eqg 17593 df-ghm 17658 df-cmn 18195 df-abl 18196 df-mgp 18490 df-ur 18502 df-ring 18549 df-cring 18550 df-oppr 18623 df-dvdsr 18641 df-unit 18642 df-rnghom 18715 df-subrg 18778 df-lmod 18865 df-lss 18933 df-lsp 18972 df-sra 19172 df-rgmod 19173 df-lidl 19174 df-rsp 19175 df-2idl 19232 df-cnfld 19747 df-zring 19819 df-zrh 19852 df-zn 19855 df-dchr 24958

This theorem is referenced by: dchrisum0flblem2 25198

W3C validator