🔢 mathematics

Commutator-based Solutions to $AXA = XAX$ when $A^n = tA^2$

This paper introduces a novel commutator-based analytical method to derive non-commuting solutions for the Yang-Baxter-like equation $AXA=XAX$ under the condition $A^n=tA^2$ , while simultaneously generalizing existing results and solving the previously unstudied inhomogeneous case $AXA=XAX+B$ for invertible or nilpotent matrices.

Original authors: Bogdan D. Djordjevic, Nebojsa C. Dincic, Mihailo Djuric

Published 2026-07-14

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Bogdan D. Djordjevic, Nebojsa C. Dincic, Mihailo Djuric

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a magical, multi-layered puzzle box. This box is governed by a strict rule called the Yang-Baxter equation (let's call it the "Swap Rule"). The rule says: if you take a special key (Matrix $A$ ), slide it through a hidden compartment (Matrix $X$ ), and then slide it back, the result should be the same as if you had slid the compartment through the key first. In math-speak: $AXA = XAX$.

For a long time, mathematicians could only solve this puzzle if the key was very simple—like a straight stick (diagonal), a flat sheet (idempotent), or a spinning top (unitary). But what if the key is weird? What if it's a squiggly, twisting shape that doesn't fit into those neat categories?

This paper introduces a brand-new way to crack the puzzle, even when the key is a strange, twisting shape. The authors, Bogdan, Nebojša, and Mihailo, discovered that if the key follows a specific "square-cyclic" rhythm (meaning if you twist it enough times, it eventually loops back to a scaled version of itself, written as $A^n = tA^2$ ), you can solve the puzzle by introducing a secret handshake.

The Secret Handshake (The Commutator)

Instead of trying to force the key and the compartment to fit perfectly, the authors say: "Let's measure how badly they don't fit." They call this mismatch the commutator ( $Y$ ). Think of $Y$ as a "difference score" that tells you exactly how much the key and the compartment clash when you swap them ($Y = AX - XA$).

The big breakthrough here is that by fixing this "difference score" first, you can actually build a solution ( $X$ ) that works. It's like saying, "I know exactly how much the gears grind against each other; now let's build a machine that uses that grinding to run perfectly."

The Two-Part Machine

To solve the puzzle, the authors break the big, scary matrix $A$ into two smaller, friendlier parts using a trick called Core-Nilpotent Decomposition:

The "Dead" Part ( $A_1$ ): This part is like a sponge that soaks up everything and then stops. If you press it twice, it does nothing ( $A_1^2 = 0$ ). It's the "nilpotent" part.
The "Alive" Part ( $A_2$ ): This part is a sturdy, invertible engine that never gets stuck. It keeps spinning and follows the square-cyclic rhythm perfectly.

The paper proves that you can solve the puzzle for the "Dead" part and the "Alive" part separately, and then stitch the solutions together.

What They Actually Solved

The authors didn't just find one answer; they found a whole family of answers.

The Non-Commuting Solutions: Most previous methods only found solutions where the key and compartment got along perfectly (commuting). This paper finds the "rebellious" solutions where they clash ( $Y \neq 0$ ) but still satisfy the Swap Rule.
The "Plus B" Puzzle: They even solved a harder version of the puzzle: $AXA = XAX + B$. Imagine someone throwing a random rock ( $B$ ) into the machine. The authors showed how to find a solution even with that rock inside, provided the key is either invertible or the "Dead" part is totally flat ( $A^2=0$ ).

What They Ruled Out

It's important to know what this method doesn't do. The authors explicitly state that you cannot just pick any difference score ( $Y$ ) you want.

The "Identity" Rule: You cannot choose $Y$ to be the "Identity" matrix (the matrix that does nothing but swap things perfectly). The paper proves that the "difference score" can never be the identity operator. It's a physical impossibility in this math world.
Arbitrary Keys: This method relies on the key having that specific "square-cyclic" rhythm ( $A^n = tA^2$ ). If your key is totally random and doesn't follow this loop, this specific recipe doesn't apply.

How Sure Are They?

The authors are 100% certain. They didn't run simulations or guess; they provided rigorous mathematical proofs.

They proved that if you follow their steps, the solution must exist under the conditions they listed.
They proved exactly what conditions the "difference score" ( $Y$ ) must meet for a solution to exist (like the condition $A_1Y_1 + Y_1A_1 = 0$ ).
They demonstrated their theory with worked examples (like a 3x3 matrix and a 5x5 matrix) where they calculated the exact numbers step-by-step, showing that the math holds up in real, concrete cases.

The Bottom Line

Think of this paper as a new instruction manual for a very complex, glitchy machine. Before, if the machine had a weird, twisting gear, engineers would just give up. Now, the authors say: "Don't worry about the twist. Measure the glitch, split the machine into a 'dead' part and a 'live' part, and use the glitch to build a working solution."

They have generalized many old, specific tricks into one powerful, flexible method. And while they haven't solved every possible puzzle in the universe, they have cracked open a huge new category of puzzles that were previously considered too weird to touch. The door is now open for anyone to find these "rebellious" solutions, provided they can measure the handshake correctly.

Technical Summary: Commutator-based Solutions to $AXA = XAX$ when $A^n = tA^2$

Problem Statement
The paper addresses the Yang-Baxter-like matrix equation (YBME):
$AXA = XAX$
where $A \in \mathbb{C}^{N \times N}$ is a given coefficient matrix and $X \in \mathbb{C}^{N \times N}$ is the unknown solution. While commuting solutions ($AX=XA$) are well-understood, non-commuting solutions are more complex and less explored. The authors focus on the case where $A$ satisfies a "square-cyclic" condition:
$A^n = tA^2, \quad n > 2, \quad t \neq 0.$
This condition generalizes several existing cases in the literature (e.g., $A$ being idempotent, nilpotent, or $m$ -potent) and includes new scenarios such as skew-symmetric matrices. The paper also extends this framework to the inhomogeneous equation $AXA = XAX + B$ under specific constraints on $A$ .

Methodology
The core methodological innovation is a commutator-based approach. Instead of solving for $X$ directly, the authors introduce an auxiliary matrix $Y$ defined by the commutator relation:
$Y = AX - XA.$
The problem is reformulated as finding pairs $(X, Y)$ that simultaneously satisfy the YBME and the commutator relation. The authors do not assume $Y \neq 0$ a priori, though the primary interest lies in non-commuting solutions where $Y \neq 0$ .

The solution process relies on the Core-Nilpotent Decomposition of the matrix $A$ . Given $A^n = tA^2$ , the space $\mathbb{C}^N$ decomposes into $\mathbb{C}^N = \mathcal{N}(A^2) \oplus \mathcal{R}(A^2)$ . In a suitable basis, $A$ takes the block-diagonal form:
$Q^{-1}AQ = \begin{bmatrix} A_1 & 0 \\ 0 & A_2 \end{bmatrix},$
where:

$A_1$ is nilpotent with index at most 2 ( $A_1^2 = 0$ ).
$A_2$ is invertible and satisfies $A_2^{n-2} = tI$ .

The unknown matrix $X$ and the commutator $Y$ are partitioned conformally into blocks ( $X_1, X_2, X_3, X_4$ and $Y_1, Y_2, Y_3, Y_4$ ). This decomposition reduces the original nonlinear matrix equation into a system of coupled equations:

Linear Sylvester Equations: The off-diagonal blocks $X_2$ and $X_3$ are uniquely determined by $Y_2$ and $Y_3$ via regular Sylvester equations, as the spectra of $A_1$ and $A_2$ are disjoint.
Nonlinear Inhomogeneous YBMEs: The diagonal blocks $X_1$ and $X_4$ must satisfy inhomogeneous equations of the form $A_i X_i A_i = X_i A_i X_i + B_i$ , where the inhomogeneity terms depend on the off-diagonal blocks.
Consistency Conditions: The system imposes necessary algebraic constraints on the commutator blocks $Y_i$ (e.g., $A_1 Y_1 + Y_1 A_1 = 0$ ) and coupling conditions between the diagonal and off-diagonal blocks.

Key Contributions and Results

Generalized Framework for Square-Cyclic Matrices: The paper provides a unified analytical method for solving the YBME when $A^n = tA^2$ . This framework encompasses previously studied special cases (diagonalizable, nilpotent, idempotent) while extending to new classes of matrices.
Solution of Inhomogeneous YBMEs: A significant contribution is the derivation of solutions for the previously unstudied inhomogeneous equation $AXA = XAX + B$.
- Nilpotent Case ( $A_1^2=0$ ): Theorem 3.3 establishes necessary and sufficient conditions for the existence of solutions to $A_1 X_1 A_1 - X_1 A_1 X_1 = B_1$ . The solvability depends on the existence of a matrix square root for a specific block of $B_1$ and specific range conditions involving inner inverses.
- Invertible Case ( $A_2$ ): Theorem 4.2 reduces the inhomogeneous problem for the invertible block $A_2$ to a linear Sylvester equation. If the associated Sylvester equation is unsolvable, the original system is inconsistent.
Commutator Consistency Criteria: The paper derives necessary conditions for the commutator matrix $Y$ to exist. Specifically, Lemma 2.1 and Lemma 2.2 provide polynomial constraints on $Y$ derived from the square-cyclic property of $A$ . For instance, $Y$ must satisfy $tAYA = \sum_{s=1}^{n-1} A^s Y A^{n-s}$ .
Parametric Families of Non-Commuting Solutions: The authors demonstrate that finding a single non-commuting solution allows for the generation of entire classes of solutions via holomorphic functions of $A$ (Corollary 2.1). The method explicitly constructs these solutions by varying the commutator $Y$ .
Special Cases Analysis:
- Block-Diagonal $Y$ : Reduces the problem to two independent YBMEs for $X_1$ and $X_4$ .
- Commuting Solutions ( $Y=0$ ): Confirms that all commuting solutions are singular if $A$ is invertible.
- Anti-diagonal $Y$ : Provides specific algebraic constraints for solutions where the diagonal blocks of $Y$ vanish.

Significance and Claims
The paper claims to offer a "novel analytical method" that avoids the restrictive assumptions (such as $A$ being diagonalizable or nilpotent of a specific index) found in previous literature. By utilizing the square-cyclic property $A^n = tA^2$ , the authors generalize existing results and provide a systematic procedure for finding non-commuting solutions.

A primary claim of significance is the successful formulation and solution of the inhomogeneous Yang-Baxter matrix equation ($AXA = XAX + B$) for matrices satisfying $A^2=0$ or $A$ being invertible. The authors state that, to their knowledge, this specific inhomogeneous problem has not been analyzed or solved in the literature prior to this work. The results are demonstrated through worked examples, including cases with non-trivial Jordan blocks and specific spectral properties, validating the consistency criteria and solution construction techniques.

The methodology is presented as robust, relying on operator theory, generalized inverses, and Sylvester equations, with the authors noting that the principles hold for any polynomially-cyclic condition imposed on $A$ .