What are the most general conditions for which the commutation relations $[A,BC] = 0$ and $[AB,C] = 0$ equivalent? Alternatively, can it at least be shown to hold if $A$, $B$, and $C$ are all involutant? If $A$, $B$, and $C$ are involutant permutation matrices? I am particularly interested in cases for which none of the commutators $[A,B]$, $[B,C]$, and $[C,A]$ are zero.
2026-03-25 20:36:39.1774470999
Conditions for equivalence of $[A,BC] = 0$ and $[AB,C] = 0$
136 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PERMUTATION-MATRICES
- Storing permutation matrix in a vector form
- Prove that the determinant of a swap matrix is $-1$
- How to find a $3\times 3$ permutation matrix?
- Can you completely permute the elements of a matrix by applying permutation matrices?
- Finding eigenvalues and there properties of permutation matrix
- How do you find all solutions to the matrix equation $XAX=A^T$?
- Project an orthogonal matrix onto the Birkhoff Polytope
- Nearest signed permutation matrix to a given matrix $A$
- Permutation and permutation matrices
- Diagonalize the cyclic shift operator
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
For involutant matricies in $M_n$ lets take
$$[A,BC] = ABC - BCA = 0$$
and
$$[AB,C] = ABC - CBA = 0$$
Which holds iff
$$BCA = CBA = ABC$$
If $A,B,C$ are all involutant, this is equivalent to $BC = CB = ABCA$.We also have that $ABCA = BC \iff ABC = BCA$. This can be rewritten as:
$$[A,BC] = 0, [B,C]=0$$
Take for example the pauli matricies. They are involutary but no two pauli matricies commute, therefore it is not the case that for involutary matricies we necessarily have that $[A,BC] = [AB,C]=0$.
What about for involutant matricies coming from a group? We can say more.
Let's take our matricies to lie in the representation of a group $\langle a,b,c \rangle \subseteq G \to M_n$ as involutions $a,b,c \mapsto A,B,C$.
Assume for now that $\langle a \rangle, \langle b \rangle, \langle c \rangle$ are normal. We have that $\langle b \rangle \cap \langle c \rangle = \{1\}$, so $\langle b , c \rangle$ is a commutative subgroup of $G$, since both elements are of order two. Likewise $\langle a, b,c \rangle$ is commutative.
What if $\langle a \rangle$ is not normal? For the following let's just assume that $ \langle b,c \rangle$ is commutative and that $ \langle a \rangle$ is not normal.
We know that $\langle bc \rangle$ is of order two. By orbit-stabilizer, $|G:C_G(bc)|=|Cl(bc)|$, where Cl is the conjugacy class of $bc$. If $a \in C_G(bc)$ then the above commutator identity is satisfied. If $a \notin C_G(bc)$ then $a$ is in $gbcg^{-1}C_g(bc)$ for some $g$, in which case, we use the fact that $gbg^{-1}$ is also involutive, and so $a,gbg^{-1},gcg^{-1}$ satisfy your commutator relation.
When $\langle b,c \rangle$ is commutative we have two cases:
(1) $\langle a \rangle$ is normal in $G$, so your commutator identity is satisfied with $[A,B] = [B,C]=0$.
(2) $a, gbg^{-1}, gcg^{-1}$ satisfies your identity for some $g \in G$.
Now you can use the fact that permutation matricies are representations of $S_n \ .$ You can also take $G = \langle a,b,c \rangle$ so that its easier to find those elements $g$.