🔢 mathematics

-Jordan-type maps on alternative -algebras

This paper characterizes multiplicative *-Jordan-type maps on alternative *-algebras containing nontrivial symmetric idempotents.

Original authors: Aline J. O. Andrade, Bruno L. M. Ferreira, Liudmila Sabinina

Published 2026-03-12

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Aline J. O. Andrade, Bruno L. M. Ferreira, Liudmila Sabinina

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 are a master architect working with two very strange, non-standard building materials. In the normal world, if you stack bricks, the order doesn't matter much (associativity), and if you flip a brick over, it stays the same shape. But in this paper, the authors are working with "Alternative Algebras."

Think of these as Lego sets that have a mind of their own.

Non-associative: If you stack Brick A on Brick B, and then put Brick C on top, the result might be different than if you put B and C together first, then A. The order of operations changes the structure.
Involution (*): Every brick has a "mirror image" or a "flip side" (denoted by the star symbol $*$ ).

The Big Question

The authors, Aline, Bruno, and Liudmila, are asking a detective-style question:

"If I have a mysterious machine (a map called $\phi$ ) that takes these weird bricks from Building A and turns them into bricks for Building A', and this machine preserves a specific, complex 'recipe' for combining bricks, does that mean the machine is actually just a perfect, honest translator?"

The "Recipe" (The $q_n^*$ Product)

In normal math, we usually check if a machine preserves simple addition ( $a+b$ ) or multiplication ( $a \times b$ ). But here, the machine is only required to preserve a very specific, multi-step recipe called a multiplicative $\ast$ -Jordan-type map.

Think of this recipe like a secret handshake or a complex dance move involving $n$ dancers.

The recipe involves taking elements, flipping some of them (the star operation), and mixing them in a specific sequence.
The machine $\phi$ promises: "If you give me a group of bricks doing this secret dance, I will output the corresponding bricks in the new building doing the exact same dance."

The authors want to know: If the machine preserves this complex dance, does it automatically preserve the basic rules of the building (addition and multiplication)? In other words, is the machine a "Ring Isomorphism" (a perfect structural copy)?

The Tools: The "Peirce Decomposition"

To solve this, the authors use a clever trick. They take the main building block (the identity brick, $1_A$ ) and split it into two special, non-trivial pieces called idempotents ( $e_1$ and $e_2$ ).

Imagine the building is a house. $e_1$ is the Left Wing and $e_2$ is the Right Wing.

Any brick in the house can be sorted into four categories:
1. Left Wing only ( $A_{11}$ )
2. Right Wing only ( $A_{22}$ )
3. The hallway connecting them ( $A_{12}$ )
4. The hallway connecting them the other way ( $A_{21}$ )

The authors prove that if the machine respects the "dance recipe" when applied to these specific wings, it forces the machine to behave nicely with the whole house.

The Detective Work (The Proofs)

The paper is a step-by-step logical deduction, like solving a puzzle:

Zero Check: First, they prove the machine sends "nothing" to "nothing."
Splitting the House: They show that if you have a brick from the Left Wing and a brick from the Right Wing, the machine handles them separately. It doesn't mix them up.
The Hallway: They prove that the machine handles the "hallway" bricks (the connections between wings) correctly.
The Mirror: They prove that if the machine flips a brick (the star operation), it flips the output brick correctly too.
The Final Reveal: By combining all these small pieces, they prove that the machine isn't just doing the "secret dance" by accident. It is actually preserving addition (putting bricks side-by-side) and multiplication (stacking bricks).

The Conclusion

The paper concludes that yes, the machine is a perfect translator.

If a map between these strange, non-associative buildings preserves this complex "Jordan-type" dance, it must be a perfect structural copy (a $\ast$ -ring isomorphism). It implies that the complex dance contains all the information needed to reconstruct the basic rules of the building.

Why Does This Matter? (The Application)

The authors apply this to Alternative $W^*$ -factors.

Analogy: Think of these as the "ultimate, perfect versions" of these weird Lego sets, used in advanced physics and mathematics (like quantum mechanics).
The Result: They show that for these perfect structures, you don't need to check if the machine preserves every single basic rule. You only need to check if it preserves this one specific, complex "dance." If it does, you know for a fact it's a perfect copy of the structure.

Summary in One Sentence

The paper proves that for a specific type of weird, non-standard mathematical building, if a machine preserves a complex, multi-step "dance" involving flipping and mixing parts, that machine is guaranteed to be a perfect, honest copy of the entire building's structure.

1. Problem Statement

The paper addresses the characterization of maps between non-associative algebraic structures, specifically alternative $\ast$ -algebras. While the characterization of isomorphisms via Jordan-type products is well-established in associative settings (e.g., von Neumann algebras and $C^*$ -algebras), the non-associative nature of alternative algebras (where the associator $(x,y,z) = (xy)z - x(yz)$ is not necessarily zero, though it satisfies the flexible law and the alternative laws) presents significant challenges.

The central problem is to determine under what conditions a multiplicative $\ast$ -Jordan-type map $\phi: A \to A'$ is actually a $\ast$ -ring isomorphism.

The Map: A map $\phi$ is defined as a multiplicative $\ast$ -Jordan $n$ -map if it preserves a specific sequence of polynomials $q_n^\ast$ constructed from the $\ast$ -Jordan product $\{a, b\}^\ast = ab + ba^\ast$ .
The Goal: Prove that such a map, which is initially only assumed to be multiplicative (not necessarily additive) and bijective, must be additive and preserve the full algebraic structure (multiplication and involution).

2. Methodology

The authors employ a structural approach based on Peirce decomposition and a step-by-step verification of additivity and multiplicativity.

A. Structural Setup

Peirce Decomposition: The algebra $A$ is decomposed using a nontrivial symmetric idempotent $e_1$ (where $e_2 = 1_A - e_1$ ) into four subspaces: $A = A_{11} \oplus A_{12} \oplus A_{21} \oplus A_{22}$ , where $A_{ij} = e_i A e_j$ .
Key Properties: The authors utilize specific multiplication rules inherent to alternative algebras (e.g., $A_{ij}A_{jl} \subseteq A_{il}$ , $A_{ij}A_{ij} \subseteq A_{ji}$ , and $x_{ij}^2 = 0$ for $i \neq j$ ).
Involution Properties: They establish that $(A_{ij})^\ast \subseteq A_{ji}$ .

B. The Sequence of Polynomials

The authors define a recursive sequence of polynomials $q_n^\ast$ :

$q_1^\ast(x) = x$
$q_n^\ast(x_1, \dots, x_n) = \{q_{n-1}^\ast(x_1, \dots, x_{n-1}), x_n\}^\ast$
The map $\phi$ satisfies: $\phi(q_n^\ast(\xi, \dots, \xi, a, b)) = q_n^\ast(\phi(\xi), \dots, \phi(\xi), \phi(a), \phi(b))$ for $\xi \in \{1_A, e_1, e_2\}$ .

C. Proof Strategy

The proof proceeds in two major phases:

Establishing $\ast$ -Additivity: The authors prove that $\phi$ $ϕ$ is additive ( $\phi(a+b) = \phi(a) + \phi(b)$ $ϕ (a + b) = ϕ (a) + ϕ (b)$ ) and preserves the involution ( $\phi(a^\ast) = \phi(a)^\ast$ $ϕ (a^{*}) = ϕ (a)^{*}$ ). This is done by:
- Showing $\phi(0)=0$ .
- Proving additivity on specific Peirce components (e.g., $A_{11} + A_{22}$ , $A_{12} + A_{21}$ , and mixed sums).
- Utilizing the non-degeneracy condition $(\spadesuit)$ : $x(A e_i) = \{0\} \implies x = 0$ .
- Using the surjectivity of $\phi$ and the injectivity of the polynomial maps to isolate components.
Establishing Multiplicativity: Once additivity is proven, the authors show $\phi(ab) = \phi(a)\phi(b)$ $ϕ (ab) = ϕ (a) ϕ (b)$ . This involves:
- Proving $\phi(e_i)$ are idempotents in $A'$ .
- Showing $\phi$ maps Peirce components $A_{ij}$ to $A'_{ij}$ .
- Verifying the product preservation for various combinations of Peirce components (e.g., $A_{ii}A_{ij}$ , $A_{ij}A_{ji}$ , $A_{ij}A_{ij}$ ).
- Using a second non-degeneracy condition $(\clubsuit)$ on the target algebra $A'$ .

3. Key Contributions and Results

Main Theorems

Theorem 2.1 ( $\ast$ -Additivity): Let $A$ $A$ and $A'$ $A^{'}$ be alternative $\ast$ $*$ -algebras with identities. If $A$ $A$ satisfies the non-degeneracy condition $(\spadesuit)$ $(♠)$ and $\phi$ $ϕ$ is a bijective unital map preserving the $q_n^\ast$ $q_{n}^{*}$ structure, then $\phi$ is $\ast$ -additive.
- Corollary: This holds for any prime alternative $\ast$ -algebra over a field of characteristic $\neq 2, 3$ .
Theorem 2.2 ( $\ast$ -Ring Isomorphism): If both $A$ $A$ and $A'$ $A^{'}$ satisfy conditions $(\spadesuit)$ $(♠)$ and $(\clubsuit)$ $(♣)$ , and $\phi$ $ϕ$ is a bijective unital map preserving the $q_n^\ast$ $q_{n}^{*}$ structure, then $\phi$ is a $\ast$ -ring isomorphism.
- Corollary: This result applies to prime alternative $\ast$ -algebras (characteristic $\neq 2, 3$ ).

Technical Lemmas

The paper provides a rigorous chain of lemmas (2.1–2.15) that systematically dismantle the non-additive nature of the map:

Lemma 2.2 & 2.3: Prove additivity for sums of diagonal elements ( $A_{11}+A_{22}$ ) and off-diagonal elements ( $A_{12}+A_{21}$ ).
Lemma 2.6 & 2.7: Handle mixed products and sums involving involution to prove additivity within specific Peirce subspaces.
Lemma 2.10: Crucial for showing that $\phi$ respects the Peirce decomposition structure ( $\phi(A_{ij}) \subseteq A'_{ij}$ ).
Lemma 2.12, 2.13, 2.14, 2.15: Prove that $\phi$ preserves multiplication across all combinations of Peirce components, overcoming the non-associative obstacles (specifically the case where $A_{ij}A_{ij} \neq 0$ in alternative algebras, unlike in associative ones).

Application to $W^\ast$ -Factors

Theorem 3.1: The results are applied to Alternative $W^\ast$ -factors (dual Banach spaces that are prime alternative $W^\ast$ -algebras).
Corollary 3.1: For Alternative $W^\ast$ -factors, a map is a nonlinear multiplicative $\ast$ -Jordan-type map if and only if it is an additive $\ast$ -ring isomorphism.

4. Significance

Extension to Non-Associative Structures: This work significantly extends the theory of Jordan-type maps, previously dominated by associative $C^*$ -algebras and von Neumann algebras, to the more complex realm of alternative algebras (which include octonions and their generalizations).
Resolution of Non-Additivity: A major contribution is proving that a map defined only by a multiplicative condition on a specific polynomial sequence is necessarily additive. This bridges the gap between "multiplicative" and "linear" maps in non-associative settings.
Handling Non-Associativity: The paper explicitly addresses the unique challenges of alternative algebras, such as the fact that $A_{ij}A_{ij}$ is not necessarily zero (unlike in associative algebras), requiring novel proof techniques involving the flexible law and specific Peirce relations.
Foundation for Operator Theory: By characterizing isomorphisms on Alternative $W^\ast$ -factors, the paper provides a foundational tool for the study of symmetries and structural mappings in non-associative operator algebras, which are relevant in mathematical physics and quantum mechanics.

In summary, the paper successfully generalizes the characterization of $\ast$ -ring isomorphisms to alternative $\ast$ -algebras, proving that preserving the $\ast$ -Jordan-type product structure is sufficient to guarantee that a bijective map is a full algebraic isomorphism.