Theorem asclcom 50216

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 22177, assa2ass2 22178, and asclval 22193, by setting 𝑋 and 𝑌 the multiplicative identity of the algebra.

(Contributed by Zhi Wang, 11-Sep-2025.)

Hypotheses

Ref	Expression
asclelbasALT.a	⊢ 𝐴 = (algSc‘𝑊)
asclelbasALT.f	⊢ 𝐹 = (Scalar‘𝑊)
asclelbasALT.b	⊢ 𝐵 = (Base‘𝐹)
asclelbasALT.w	⊢ (𝜑 → 𝑊 ∈ AssAlg)
asclelbasALT.c	⊢ (𝜑 → 𝐶 ∈ 𝐵)
asclcom.m	⊢ ∗ = (.r‘𝐹)
asclcom.d	⊢ (𝜑 → 𝐷 ∈ 𝐵)

Assertion

Ref	Expression
asclcom	⊢ (𝜑 → (𝐴‘(𝐶 ∗ 𝐷)) = (𝐴‘(𝐷 ∗ 𝐶)))

Proof of Theorem 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 22197	. . 3 ⊢ (𝜑 → (𝐴‘𝐷) ∈ (Base‘𝑊))
8		eqid 2760	. . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊)
9		eqid 2760	. . . . 5 ⊢ (.r‘𝑊) = (.r‘𝑊)
10		eqid 2760	. . . . 5 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
11	3, 4, 5, 8, 9, 10	asclmul1 22200	. . . 4 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ (𝐴‘𝐷) ∈ (Base‘𝑊)) → ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)) = (𝐶( ·𝑠 ‘𝑊)(𝐴‘𝐷)))
12	3, 4, 5, 8, 9, 10	asclmul2 22201	. . . 4 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ (𝐴‘𝐷) ∈ (Base‘𝑊)) → ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶)) = (𝐶( ·𝑠 ‘𝑊)(𝐴‘𝐷)))
13	11, 12	eqtr4d 2798	. . 3 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ (𝐴‘𝐷) ∈ (Base‘𝑊)) → ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶)))
14	1, 2, 7, 13	syl3anc 1398	. 2 ⊢ (𝜑 → ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶)))
15		asclcom.m	. . . 4 ⊢ ∗ = (.r‘𝐹)
16	3, 4, 5, 9, 15	ascldimul 22202	. . 3 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (𝐴‘(𝐶 ∗ 𝐷)) = ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)))
17	1, 2, 6, 16	syl3anc 1398	. 2 ⊢ (𝜑 → (𝐴‘(𝐶 ∗ 𝐷)) = ((𝐴‘𝐶)(.r‘𝑊)(𝐴‘𝐷)))
18	3, 4, 5, 9, 15	ascldimul 22202	. . 3 ⊢ ((𝑊 ∈ AssAlg ∧ 𝐷 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵) → (𝐴‘(𝐷 ∗ 𝐶)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶)))
19	1, 6, 2, 18	syl3anc 1398	. 2 ⊢ (𝜑 → (𝐴‘(𝐷 ∗ 𝐶)) = ((𝐴‘𝐷)(.r‘𝑊)(𝐴‘𝐶)))
20	14, 17, 19	3eqtr4d 2805	1 ⊢ (𝜑 → (𝐴‘(𝐶 ∗ 𝐷)) = (𝐴‘(𝐷 ∗ 𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  ._rcmulr 17435  Scalarcsca 17437   ·_𝑠 cvsca 17438  AssAlgcasa 22164  algSccascl 22166

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-cnex 11260  ax-resscn 11261  ax-1cn 11262  ax-icn 11263  ax-addcl 11264  ax-addrcl 11265  ax-mulcl 11266  ax-mulrcl 11267  ax-mulcom 11268  ax-addass 11269  ax-mulass 11270  ax-distr 11271  ax-i2m1 11272  ax-1ne0 11273  ax-1rid 11274  ax-rnegex 11275  ax-rrecex 11276  ax-cnre 11277  ax-pre-lttri 11278  ax-pre-lttrn 11279  ax-pre-ltadd 11280  ax-pre-mulgt0 11281

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-er 8721  df-en 8978  df-dom 8979  df-sdom 8980  df-pnf 11349  df-mnf 11350  df-xr 11351  df-ltxr 11352  df-le 11353  df-sub 11547  df-neg 11548  df-nn 12340  df-2 12409  df-sets 17348  df-slot 17366  df-ndx 17378  df-base 17394  df-plusg 17447  df-0g 17618  df-mgm 18822  df-sgrp 18914  df-mnd 18930  df-mgp 20367  df-ur 20414  df-ring 20467  df-lmod 21143  df-assa 22167  df-ascl 22169

This theorem is used by: (None)