| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > asclcom | Structured version Visualization version GIF version | ||
| Description: Scalars are commutative
after being lifted.
However, the scalars themselves are not necessarily commutative if the algebra is not a faithful module. For example, Let 𝐹 be the 2 by 2 upper triangular matrix algebra over a commutative ring 𝑊. It is provable that 𝐹 is in general non-commutative. Define scalar multiplication 𝐶 · 𝑋 as multipying the top-left entry, which is a "vector" element of 𝑊, of the "scalar" 𝐶, which is now an upper triangular matrix, with the "vector" 𝑋 ∈ (Base‘𝑊). Equivalently, the algebra scalar lifting function is not necessarily injective unless the algebra is faithful. Therefore, all "scalar injection" was renamed. Alternate proof involves assa2ass 21895, assa2ass2 21896, and asclval 21911, by setting 𝑋 and 𝑌 the multiplicative identity of the algebra. (Contributed by Zhi Wang, 11-Sep-2025.) |
| Ref | Expression |
|---|---|
| asclelbasALT.a | ⊢ 𝐴 = (algSc‘𝑊) |
| asclelbasALT.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| asclelbasALT.b | ⊢ 𝐵 = (Base‘𝐹) |
| asclelbasALT.w | ⊢ (𝜑 → 𝑊 ∈ AssAlg) |
| asclelbasALT.c | ⊢ (𝜑 → 𝐶 ∈ 𝐵) |
| asclcom.m | ⊢ ∗ = (.r‘𝐹) |
| asclcom.d | ⊢ (𝜑 → 𝐷 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| asclcom | ⊢ (𝜑 → (𝐴‘(𝐶 ∗ 𝐷)) = (𝐴‘(𝐷 ∗ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | asclelbasALT.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ AssAlg) | |
| 2 | asclelbasALT.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 3 | asclelbasALT.a | . . . 4 ⊢ 𝐴 = (algSc‘𝑊) | |
| 4 | asclelbasALT.f | . . . 4 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | asclelbasALT.b | . . . 4 ⊢ 𝐵 = (Base‘𝐹) | |
| 6 | asclcom.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐵) | |
| 7 | 3, 4, 5, 1, 6 | asclelbas 21915 | . . 3 ⊢ (𝜑 → (𝐴‘𝐷) ∈ (Base‘𝑊)) |
| 8 | eqid 2761 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 9 | eqid 2761 | . . . . 5 ⊢ (.r‘𝑊) = (.r‘𝑊) | |
| 10 | eqid 2761 | . . . . 5 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊) | |
| 11 | 3, 4, 5, 8, 9, 10 | asclmul1 21918 | . . . 4 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ (𝐴‘𝐷) ∈ (Base‘𝑊)) → ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)) = (𝐶( ·𝑠 ‘𝑊)(𝐴‘𝐷))) |
| 12 | 3, 4, 5, 8, 9, 10 | asclmul2 21919 | . . . 4 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ (𝐴‘𝐷) ∈ (Base‘𝑊)) → ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶)) = (𝐶( ·𝑠 ‘𝑊)(𝐴‘𝐷))) |
| 13 | 11, 12 | eqtr4d 2799 | . . 3 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ (𝐴‘𝐷) ∈ (Base‘𝑊)) → ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶))) |
| 14 | 1, 2, 7, 13 | syl3anc 1389 | . 2 ⊢ (𝜑 → ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶))) |
| 15 | asclcom.m | . . . 4 ⊢ ∗ = (.r‘𝐹) | |
| 16 | 3, 4, 5, 9, 15 | ascldimul 21920 | . . 3 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (𝐴‘(𝐶 ∗ 𝐷)) = ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷))) |
| 17 | 1, 2, 6, 16 | syl3anc 1389 | . 2 ⊢ (𝜑 → (𝐴‘(𝐶 ∗ 𝐷)) = ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷))) |
| 18 | 3, 4, 5, 9, 15 | ascldimul 21920 | . . 3 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐷 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵) → (𝐴‘(𝐷 ∗ 𝐶)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶))) |
| 19 | 1, 6, 2, 18 | syl3anc 1389 | . 2 ⊢ (𝜑 → (𝐴‘(𝐷 ∗ 𝐶)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶))) |
| 20 | 14, 17, 19 | 3eqtr4d 2806 | 1 ⊢ (𝜑 → (𝐴‘(𝐶 ∗ 𝐷)) = (𝐴‘(𝐷 ∗ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ‘cfv 6517 (class class class)co 7392 Basecbs 17228 .rcmulr 17270 Scalarcsca 17272 ·𝑠 cvsca 17273 AssAlgcasa 21882 algSccascl 21884 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-plusg 17282 df-0g 17453 df-mgm 18657 df-sgrp 18736 df-mnd 18752 df-mgp 20170 df-ur 20211 df-ring 20264 df-lmod 20909 df-assa 21885 df-ascl 21887 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |