Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cpmidg2sum | Structured version Visualization version GIF version |
Description: Equality of two sums representing the identity matrix multiplied with the characteristic polynomial of a matrix. (Contributed by AV, 11-Nov-2019.) |
Ref | Expression |
---|---|
cpmadugsum.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
cpmadugsum.b | ⊢ 𝐵 = (Base‘𝐴) |
cpmadugsum.p | ⊢ 𝑃 = (Poly1‘𝑅) |
cpmadugsum.y | ⊢ 𝑌 = (𝑁 Mat 𝑃) |
cpmadugsum.t | ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) |
cpmadugsum.x | ⊢ 𝑋 = (var1‘𝑅) |
cpmadugsum.e | ⊢ ↑ = (.g‘(mulGrp‘𝑃)) |
cpmadugsum.m | ⊢ · = ( ·𝑠 ‘𝑌) |
cpmadugsum.r | ⊢ × = (.r‘𝑌) |
cpmadugsum.1 | ⊢ 1 = (1r‘𝑌) |
cpmadugsum.g | ⊢ + = (+g‘𝑌) |
cpmadugsum.s | ⊢ − = (-g‘𝑌) |
cpmadugsum.i | ⊢ 𝐼 = ((𝑋 · 1 ) − (𝑇‘𝑀)) |
cpmadugsum.j | ⊢ 𝐽 = (𝑁 maAdju 𝑃) |
cpmadugsum.0 | ⊢ 0 = (0g‘𝑌) |
cpmadugsum.g2 | ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏‘𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑛)))))))) |
cpmidgsum2.c | ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅) |
cpmidgsum2.k | ⊢ 𝐾 = (𝐶‘𝑀) |
cpmidg2sum.u | ⊢ 𝑈 = (algSc‘𝑃) |
Ref | Expression |
---|---|
cpmidg2sum | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · ((𝑈‘((coe1‘𝐾)‘𝑖)) · 1 )))) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cpmadugsum.a | . . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | cpmadugsum.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐴) | |
3 | cpmadugsum.p | . . . . . 6 ⊢ 𝑃 = (Poly1‘𝑅) | |
4 | cpmadugsum.y | . . . . . 6 ⊢ 𝑌 = (𝑁 Mat 𝑃) | |
5 | cpmadugsum.x | . . . . . 6 ⊢ 𝑋 = (var1‘𝑅) | |
6 | cpmadugsum.e | . . . . . 6 ⊢ ↑ = (.g‘(mulGrp‘𝑃)) | |
7 | cpmadugsum.m | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑌) | |
8 | cpmadugsum.1 | . . . . . 6 ⊢ 1 = (1r‘𝑌) | |
9 | cpmidg2sum.u | . . . . . 6 ⊢ 𝑈 = (algSc‘𝑃) | |
10 | cpmidgsum2.c | . . . . . 6 ⊢ 𝐶 = (𝑁 CharPlyMat 𝑅) | |
11 | cpmidgsum2.k | . . . . . 6 ⊢ 𝐾 = (𝐶‘𝑀) | |
12 | eqid 2821 | . . . . . 6 ⊢ (𝐾 · 1 ) = (𝐾 · 1 ) | |
13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | cpmidgsum 21476 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝐾 · 1 ) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · ((𝑈‘((coe1‘𝐾)‘𝑖)) · 1 ))))) |
14 | 13 | eqcomd 2827 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · ((𝑈‘((coe1‘𝐾)‘𝑖)) · 1 )))) = (𝐾 · 1 )) |
15 | 14 | ad3antrrr 728 | . . 3 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) ∧ (𝐾 · 1 ) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) → (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · ((𝑈‘((coe1‘𝐾)‘𝑖)) · 1 )))) = (𝐾 · 1 )) |
16 | simpr 487 | . . 3 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) ∧ (𝐾 · 1 ) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) → (𝐾 · 1 ) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) | |
17 | 15, 16 | eqtrd 2856 | . 2 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ) ∧ 𝑏 ∈ (𝐵 ↑m (0...𝑠))) ∧ (𝐾 · 1 ) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) → (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · ((𝑈‘((coe1‘𝐾)‘𝑖)) · 1 )))) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
18 | cpmadugsum.t | . . 3 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) | |
19 | cpmadugsum.r | . . 3 ⊢ × = (.r‘𝑌) | |
20 | cpmadugsum.g | . . 3 ⊢ + = (+g‘𝑌) | |
21 | cpmadugsum.s | . . 3 ⊢ − = (-g‘𝑌) | |
22 | cpmadugsum.i | . . 3 ⊢ 𝐼 = ((𝑋 · 1 ) − (𝑇‘𝑀)) | |
23 | cpmadugsum.j | . . 3 ⊢ 𝐽 = (𝑁 maAdju 𝑃) | |
24 | cpmadugsum.0 | . . 3 ⊢ 0 = (0g‘𝑌) | |
25 | cpmadugsum.g2 | . . 3 ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 − ((𝑇‘𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏‘𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) − ((𝑇‘𝑀) × (𝑇‘(𝑏‘𝑛)))))))) | |
26 | 1, 2, 3, 4, 18, 5, 6, 7, 19, 8, 20, 21, 22, 23, 24, 25, 10, 11, 12 | cpmidgsum2 21487 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝐾 · 1 ) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
27 | 17, 26 | reximddv2 3278 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵 ↑m (0...𝑠))(𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · ((𝑈‘((coe1‘𝐾)‘𝑖)) · 1 )))) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 ↑ 𝑋) · (𝐺‘𝑖))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 ifcif 4467 class class class wbr 5066 ↦ cmpt 5146 ‘cfv 6355 (class class class)co 7156 ↑m cmap 8406 Fincfn 8509 0cc0 10537 1c1 10538 + caddc 10540 < clt 10675 − cmin 10870 ℕcn 11638 ℕ0cn0 11898 ...cfz 12893 Basecbs 16483 +gcplusg 16565 .rcmulr 16566 ·𝑠 cvsca 16569 0gc0g 16713 Σg cgsu 16714 -gcsg 18105 .gcmg 18224 mulGrpcmgp 19239 1rcur 19251 CRingccrg 19298 algSccascl 20084 var1cv1 20344 Poly1cpl1 20345 coe1cco1 20346 Mat cmat 21016 maAdju cmadu 21241 matToPolyMat cmat2pmat 21312 CharPlyMat cchpmat 21434 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-addf 10616 ax-mulf 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-xor 1502 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-ot 4576 df-uni 4839 df-int 4877 df-iun 4921 df-iin 4922 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-se 5515 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-isom 6364 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-of 7409 df-ofr 7410 df-om 7581 df-1st 7689 df-2nd 7690 df-supp 7831 df-tpos 7892 df-cur 7933 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-2o 8103 df-oadd 8106 df-er 8289 df-map 8408 df-pm 8409 df-ixp 8462 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-fsupp 8834 df-sup 8906 df-oi 8974 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-xnn0 11969 df-z 11983 df-dec 12100 df-uz 12245 df-rp 12391 df-fz 12894 df-fzo 13035 df-seq 13371 df-exp 13431 df-hash 13692 df-word 13863 df-lsw 13915 df-concat 13923 df-s1 13950 df-substr 14003 df-pfx 14033 df-splice 14112 df-reverse 14121 df-s2 14210 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-mulr 16579 df-starv 16580 df-sca 16581 df-vsca 16582 df-ip 16583 df-tset 16584 df-ple 16585 df-ds 16587 df-unif 16588 df-hom 16589 df-cco 16590 df-0g 16715 df-gsum 16716 df-prds 16721 df-pws 16723 df-mre 16857 df-mrc 16858 df-acs 16860 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-mhm 17956 df-submnd 17957 df-efmnd 18034 df-grp 18106 df-minusg 18107 df-sbg 18108 df-mulg 18225 df-subg 18276 df-ghm 18356 df-gim 18399 df-cntz 18447 df-oppg 18474 df-symg 18496 df-pmtr 18570 df-psgn 18619 df-evpm 18620 df-cmn 18908 df-abl 18909 df-mgp 19240 df-ur 19252 df-srg 19256 df-ring 19299 df-cring 19300 df-oppr 19373 df-dvdsr 19391 df-unit 19392 df-invr 19422 df-dvr 19433 df-rnghom 19467 df-drng 19504 df-subrg 19533 df-lmod 19636 df-lss 19704 df-sra 19944 df-rgmod 19945 df-assa 20085 df-ascl 20087 df-psr 20136 df-mvr 20137 df-mpl 20138 df-opsr 20140 df-psr1 20348 df-vr1 20349 df-ply1 20350 df-coe1 20351 df-cnfld 20546 df-zring 20618 df-zrh 20651 df-dsmm 20876 df-frlm 20891 df-mamu 20995 df-mat 21017 df-mdet 21194 df-madu 21243 df-mat2pmat 21315 df-decpmat 21371 df-chpmat 21435 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |