A = \(\begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix}\), B = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\), C = \(\begin{bmatrix} 2 & 0 \\ 1 & 3 \end{bmatrix}\)
Associativity: For matrices A (m×n), B (n×p), C (p×q): \((AB)C = A(BC)\)
- Calculate AB first, then multiply by C to get (AB)C
- Calculate BC first, then multiply by A to get A(BC)
- Compare the results
AB = \(\begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
Row 1, Col 1: (1×0) + (2×1) = 0 + 2 = 2
Row 1, Col 2: (1×1) + (2×0) = 1 + 0 = 1
Row 2, Col 1: (3×0) + (4×1) = 0 + 4 = 4
Row 2, Col 2: (3×1) + (4×0) = 3 + 0 = 3
(AB)C = \(\begin{bmatrix} 2 & 1 \\ 4 & 3 \end{bmatrix} \begin{bmatrix} 2 & 0 \\ 1 & 3 \end{bmatrix}\)
Row 1, Col 1: (2×2) + (1×1) = 4 + 1 = 5
Row 1, Col 2: (2×0) + (1×3) = 0 + 3 = 3
Row 2, Col 1: (4×2) + (3×1) = 8 + 3 = 11
Row 2, Col 2: (4×0) + (3×3) = 0 + 9 = 9
BC = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 2 & 0 \\ 1 & 3 \end{bmatrix}\)
Row 1, Col 1: (0×2) + (1×1) = 0 + 1 = 1
Row 1, Col 2: (0×0) + (1×3) = 0 + 3 = 3
Row 2, Col 1: (1×2) + (0×1) = 2 + 0 = 2
Row 2, Col 2: (1×0) + (0×3) = 0 + 0 = 0
A(BC) = \(\begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \begin{bmatrix} 1 & 3 \\ 2 & 0 \end{bmatrix}\)
Row 1, Col 1: (1×1) + (2×2) = 1 + 4 = 5
Row 1, Col 2: (1×3) + (2×0) = 3 + 0 = 3
Row 2, Col 1: (3×1) + (4×2) = 3 + 8 = 11
Row 2, Col 2: (3×3) + (4×0) = 9 + 0 = 9
Associativity verified: (AB)C = A(BC)
• Matrix multiplication: (AB)_{ij} = Σ A_{ik}B_{kj}
• Associativity: Order of grouping doesn't matter
• Dimension compatibility: A(m×n)B(n×p)C(p×q)
A = \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}\), B = \(\begin{bmatrix} 2 & 1 \\ 1 & 0 \end{bmatrix}\), C = \(\begin{bmatrix} 0 & 1 \\ 1 & 2 \end{bmatrix}\)
Distributivity: A(B + C) = AB + AC and (A + B)C = AC + BC
B + C = \(\begin{bmatrix} 2 & 1 \\ 1 & 0 \end{bmatrix} + \begin{bmatrix} 0 & 1 \\ 1 & 2 \end{bmatrix} = \begin{bmatrix} 2 & 2 \\ 2 & 2 \end{bmatrix}\)
A(B + C) = \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 2 & 2 \\ 2 & 2 \end{bmatrix}\)
Row 1, Col 1: (1×2) + (2×2) = 2 + 4 = 6
Wait, let me recalculate this correctly:
Row 1, Col 1: (1×2) + (2×2) = 2 + 4 = 6
Actually, Row 1, Col 1: (1×2) + (2×2) = 2 + 4 = 6
Let me recalculate carefully:
Row 1, Col 1: (1×2) + (2×2) = 2 + 4 = 6
Row 1, Col 2: (1×2) + (2×2) = 2 + 4 = 6
Row 2, Col 1: (0×2) + (1×2) = 0 + 2 = 2
Row 2, Col 2: (0×2) + (1×2) = 0 + 2 = 2
So A(B + C) = \(\begin{bmatrix} 6 & 6 \\ 2 & 2 \end{bmatrix}\)
AB = \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 2 & 1 \\ 1 & 0 \end{bmatrix}\)
Row 1, Col 1: (1×2) + (2×1) = 2 + 2 = 4
Row 1, Col 2: (1×1) + (2×0) = 1 + 0 = 1
Row 2, Col 1: (0×2) + (1×1) = 0 + 1 = 1
Row 2, Col 2: (0×1) + (1×0) = 0 + 0 = 0
So AB = \(\begin{bmatrix} 4 & 1 \\ 1 & 0 \end{bmatrix}\)
AC = \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 0 & 1 \\ 1 & 2 \end{bmatrix}\)
Row 1, Col 1: (1×0) + (2×1) = 0 + 2 = 2
Row 1, Col 2: (1×1) + (2×2) = 1 + 4 = 5
Row 2, Col 1: (0×0) + (1×1) = 0 + 1 = 1
Row 2, Col 2: (0×1) + (1×2) = 0 + 2 = 2
So AC = \(\begin{bmatrix} 2 & 5 \\ 1 & 2 \end{bmatrix}\)
AB + AC = \(\begin{bmatrix} 4 & 1 \\ 1 & 0 \end{bmatrix} + \begin{bmatrix} 2 & 5 \\ 1 & 2 \end{bmatrix} = \begin{bmatrix} 6 & 6 \\ 2 & 2 \end{bmatrix}\)
Distributivity verified: A(B + C) = AB + AC
• Distributivity: Matrix multiplication distributes over addition
• Matrix addition: Add corresponding elements
• Matrix multiplication: Standard algorithm
A = \(\begin{bmatrix} 1 & 0 \\ 2 & 1 \end{bmatrix}\), B = \(\begin{bmatrix} 0 & 2 \\ 1 & 1 \end{bmatrix}\)
Scalar multiplication: c(AB) = (cA)B = A(cB) for scalar c
AB = \(\begin{bmatrix} 1 & 0 \\ 2 & 1 \end{bmatrix} \begin{bmatrix} 0 & 2 \\ 1 & 1 \end{bmatrix}\)
Row 1, Col 1: (1×0) + (0×1) = 0
Row 1, Col 2: (1×2) + (0×1) = 2
Row 2, Col 1: (2×0) + (1×1) = 1
Row 2, Col 2: (2×2) + (1×1) = 5
So AB = \(\begin{bmatrix} 0 & 2 \\ 1 & 5 \end{bmatrix}\)
c(AB) = 3 × \(\begin{bmatrix} 0 & 2 \\ 1 & 5 \end{bmatrix} = \begin{bmatrix} 0 & 6 \\ 3 & 15 \end{bmatrix}\)
cA = 3 × \(\begin{bmatrix} 1 & 0 \\ 2 & 1 \end{bmatrix} = \begin{bmatrix} 3 & 0 \\ 6 & 3 \end{bmatrix}\)
(cA)B = \(\begin{bmatrix} 3 & 0 \\ 6 & 3 \end{bmatrix} \begin{bmatrix} 0 & 2 \\ 1 & 1 \end{bmatrix}\)
Row 1, Col 1: (3×0) + (0×1) = 0
Row 1, Col 2: (3×2) + (0×1) = 6
Row 2, Col 1: (6×0) + (3×1) = 3
Row 2, Col 2: (6×2) + (3×1) = 15
So (cA)B = \(\begin{bmatrix} 0 & 6 \\ 3 & 15 \end{bmatrix}\)
cB = 3 × \(\begin{bmatrix} 0 & 2 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} 0 & 6 \\ 3 & 3 \end{bmatrix}\)
A(cB) = \(\begin{bmatrix} 1 & 0 \\ 2 & 1 \end{bmatrix} \begin{bmatrix} 0 & 6 \\ 3 & 3 \end{bmatrix}\)
Row 1, Col 1: (1×0) + (0×3) = 0
Row 1, Col 2: (1×6) + (0×3) = 6
Row 2, Col 1: (2×0) + (1×3) = 3
Row 2, Col 2: (2×6) + (1×3) = 15
So A(cB) = \(\begin{bmatrix} 0 & 6 \\ 3 & 15 \end{bmatrix}\)
Scalar multiplication property verified: c(AB) = (cA)B = A(cB)
• Scalar multiplication: Multiply each element by the scalar
• Commutativity with scalars: Scalars can be moved freely
• Matrix multiplication: Standard algorithm
Identity matrix: I = \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\), AI = IA = A for any square matrix A
AI = \(\begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\)
Row 1, Col 1: (2×1) + (3×0) = 2
Row 1, Col 2: (2×0) + (3×1) = 3
Row 2, Col 1: (1×1) + (4×0) = 1
Row 2, Col 2: (1×0) + (4×1) = 4
So AI = \(\begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix}\) = A ✓
IA = \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix}\)
Row 1, Col 1: (1×2) + (0×1) = 2
Row 1, Col 2: (1×3) + (0×4) = 3
Row 2, Col 1: (0×2) + (1×1) = 1
Row 2, Col 2: (0×3) + (1×4) = 4
So IA = \(\begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix}\) = A ✓
Both AI and IA equal the original matrix A, confirming the identity property
Identity matrix property verified: AI = IA = A
• Identity matrix: Acts as multiplicative identity
• Matrix multiplication: Standard algorithm
• Dimension compatibility: Identity matrix must match dimensions
Non-commutativity: In general, AB ≠ BA for matrices A and B
AB = \(\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
Row 1, Col 1: (1×0) + (2×1) = 0 + 2 = 2
Row 1, Col 2: (1×1) + (2×0) = 1 + 0 = 1
Row 2, Col 1: (0×0) + (1×1) = 0 + 1 = 1
Row 2, Col 2: (0×1) + (1×0) = 0 + 0 = 0
So AB = \(\begin{bmatrix} 2 & 1 \\ 1 & 0 \end{bmatrix}\)
BA = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}\)
Row 1, Col 1: (0×1) + (1×0) = 0 + 0 = 0
Row 1, Col 2: (0×2) + (1×1) = 0 + 1 = 1
Row 2, Col 1: (1×1) + (0×0) = 1 + 0 = 1
Row 2, Col 2: (1×2) + (0×1) = 2 + 0 = 2
So BA = \(\begin{bmatrix} 0 & 1 \\ 1 & 2 \end{bmatrix}\)
AB = \(\begin{bmatrix} 2 & 1 \\ 1 & 0 \end{bmatrix}\) ≠ BA = \(\begin{bmatrix} 0 & 1 \\ 1 & 2 \end{bmatrix}\)
Since AB ≠ BA, matrix multiplication is not commutative
This demonstrates that the order of matrix multiplication matters
Matrix multiplication is non-commutative: AB ≠ BA
• Non-commutativity: Order matters in matrix multiplication
• Matrix multiplication: Standard algorithm
• Comparison: Check if matrices are equal element-wise
Matrix multiplication: For A(m×n) and B(n×p), result C has dimension (m×p)
Associativity: (AB)C = A(BC) for compatible matrices
Distributivity: A(B + C) = AB + AC and (A + B)C = AC + BC
- Check dimensions: Verify A(m×n) and B(n×p) can be multiplied
- Apply formula: (AB)_{ij} = Σ A_{ik}B_{kj} for each element
- Verify properties: Check if associative, distributive, etc.
- Special cases: Consider identity, zero, and scalar matrices
• Associativity: (AB)C = A(BC)
• Left distributivity: A(B + C) = AB + AC
• Right distributivity: (A + B)C = AC + BC
• Scalar multiplication: c(AB) = (cA)B = A(cB)
• Identity matrix: AI = IA = A
• Zero matrix: A0 = 0A = 0
• Not commutative: AB ≠ BA in general
• Associativity: (AB)C vs A(BC)
• Distributivity: A(B + C) vs AB + AC
• Scalar multiplication: c(AB) vs (cA)B
Analysis: The visualization shows how different matrix operations behave under various properties.
- Associativity maintains equality regardless of grouping
- Distributivity allows distribution of multiplication over addition
- Scalar multiplication can be applied to any factor