Next Article in Journal
A Binary-State Continuous-Time Markov Chain Model for Offshoring and Reshoring
Previous Article in Journal
Using Genetic Algorithms and Core Values of Cooperative Games to Solve Fuzzy Multiobjective Optimization Problems
Previous Article in Special Issue
Ideals and Filters on Neutrosophic Topologies Generated by Neutrosophic Relations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Generalization of the First Tits Construction

1
Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, Ottawa, ON K1N 7N5, Canada
2
School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7 2RD, UK
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(5), 299; https://doi.org/10.3390/axioms13050299
Submission received: 26 March 2024 / Revised: 22 April 2024 / Accepted: 24 April 2024 / Published: 29 April 2024
(This article belongs to the Special Issue Advances in Classical and Applied Mathematics)

Abstract

:
Let F be a field of characteristic, not 2 or 3. The first Tits construction is a well-known tripling process to construct separable cubic Jordan algebras, especially Albert algebras. We generalize the first Tits construction by choosing the scalar employed in the tripling process outside of the base field. This yields a new family of non-associative unital algebras which carry a cubic map, and maps that can be viewed as generalized adjoint and generalized trace maps. These maps display properties often similar to the ones in the classical setup. In particular, the cubic norm map permits some kind of weak Jordan composition law.

1. Introduction

Let F be a field of characteristic, not 2 or 3. Separable cubic Jordan algebras over F play an important role in Jordan theory (where separable means that their trace defines a non-degenerate bilinear form). It is well known that every separable cubic Jordan algebra can be obtained by either a first or a second Tits construction [1] (IX, Section 39). In particular, exceptional simple Jordan algebras, also called Albert algebras, are separable cubic Jordan algebras. The role of Albert algebras in the structure theory of Jordan algebras is similar to the role of octonion algebras in the structure theory of alternative algebras. Moreover, their automorphism group is an exceptional algebraic group of type F 4 , and their cubic norms have isometry groups of type E 6 . For some recent developments, see [2,3,4,5,6].
In this paper, we canonically generalize the first Tits construction J ( A , μ ) . The first Tits construction starts with a separable associative cubic algebra A and uses a scalar μ F × in its definition. Our construction also starts with A and employs the same algebra multiplication as that used for the classical first Tits construction, but now allows also μ A × .
We obtain a new class of non-associative unital algebras which we again denote by J ( A , μ ) . They carry a cubic map N : J ( A , μ ) A that generalizes the classical norm, a map T : J ( A , μ ) F that generalizes the classical trace, and a map : J ( A , μ ) J ( A , μ ) that generalizes the classical adjoint of a Jordan algebra. Starting with a cubic étale algebra E, the algebras obtained this way can be viewed as generalizations of special nine-dimensional Jordan algebras. Starting with a central simple algebra A of degree three, the algebras obtained this way can be viewed as generalizations of Albert algebras.
Cubic Jordan algebras carry a cubic norm that satisfies some Jordan composition law involving the U-operator. Curiously, the cubic map N : J ( A , μ ) A of our generalized construction still allows some sort of generalized weak Jordan composition law, and some of the known identities of cubic Jordan algebras involving a generalized trace map and adjoint can be at least partially recovered.
We point out that there already exists a canonical non-associative generalization of associative central simple cyclic algebras of degree three, involving skew polynomials: the non-associative cyclic algebras ( K / F , σ , μ ) , where K / F is a cubic separable field extension or a C 3 -Galois algebra, and μ K F , were first studied over finite fields [7], and then later over arbitrary base fields and rings [8,9,10,11] and applied in space-time block coding [12,13]. Their “norm maps” reflect some of the properties of the non-associative cyclic algebra ( K / F , σ , μ ) and are isometric to the “norm maps” N : J ( K , μ ) K of the generalized Tits construction J ( K , μ ) . We show that these algebras are not related, however.
Some obvious questions like if and when the algebras obtained through a generalized first Tits construction are division algebras seem to be very difficult to answer. We will not address these here and only discuss some straightforward implications.
The contents of the paper are as follows: After introducing the terminology in Section 2 and reviewing the classical first Tits construction, we generalize the classical construction in Section 3 and obtain unital non-associative algebras J ( A , μ ) , where μ A × . The algebras J ( A , μ ) carry maps that satisfy some of the same identities we know from the classical setup. If A F , then Nuc l ( J ( A , μ ) ) = Nuc r ( J ( A , μ ) ) = F for all μ A × . If A is a central simple associative division algebra of degree three, then Nuc m ( J ( A , μ ) ) = F (Theorems 3 and 4). Some necessary conditions on when J ( A , μ ) is a division algebra are listed in Theorem 6: If J ( A , μ ) is a division algebra, then μ N A ( A × ) and A must be a division algebra. If N is anisotropic, then A is a division algebra and μ N A ( A × ) . If there exist elements 0 x = ( x 0 , x 1 , x 2 ) J ( A , μ ) such that x = 0 , we show that either A must have zero divisors, or A is a division algebra and μ N A ( A × ) . Moreover, if A is a division algebra over F and 1, μ , and μ 2 are linearly independent over F, then N must be anisotropic.
We investigate in which special cases several classical identities carry over in Section 4.
In Section 5, we compare the algebras obtained from a generalized first Tits construction starting with a cyclic field extension with the algebras ( K / F , σ , μ ) + , where ( K / F , σ , μ ) is a non-associative cyclic algebra over F of degree three. If μ F × , then it is well known that these algebras are isomorphic. For μ K F , they are not isomorphic, but their norms are isometric.
This construction was briefly investigated for the first time in Andrew Steele’s PhD thesis [11]. We improved and corrected most of their results, and added many new ones.

2. Preliminaries

2.1. Non-Associative Algebras

Throughout the paper, F is a field of characteristic, not 2 or 3. An algebra over F is an F-vector space A together with an F-bilinear map A × A A , ( x , y ) x · y , denoted simply by juxtaposition of x y , the multiplication of A. An algebra A is unital if there exists an element in A, denoted by 1, such that 1 x = x 1 = x for all x A .
A non-associative algebra A 0 is called a division algebra if for any a A , a 0 , the left multiplication with a, L a ( x ) = a x , and the right multiplication with a, R a ( x ) = x a , are bijective. We will only consider unital finite-dimensional algebras, which implies that A is a division algebra if and only if A has no zero divisors. Define [ x , y , z ] = ( x y ) z x ( y z ) . The subalgebras Nuc l ( A ) = { x A | [ x , A , A ] = 0 } , Nuc m ( A ) = { x A | [ A , x , A ] = 0 } , and Nuc r ( A ) = { x A | [ A , A , x ] = 0 } of A are called the left, middle, and right nuclei of A, Nuc ( A ) = { x A | [ x , A , A ] = [ A , x , A ] = [ A , A , x ] = 0 } is called the nucleus of A. The center of A is defined as C ( A ) = { x A | x y = y x for all y A } Nuc ( A ) [14]. All algebras we consider will be unital.
A non-associative unital algebra J is called a cubic Jordan algebra over F, if J is a Jordan algebra, i.e., x y = y x and ( x 2 y ) x = x 2 ( y x ) for all x , y J , and if its generic minimal polynomial has degree three. Given an associative algebra A over F, its multiplication written simply by juxtaposition, we can define a Jordan algebra over F denoted by A + on the F-vector space underlying the algebra A via x · y = 1 2 ( x y + y x ) . A Jordan algebra J is called special, if it is a subalgebra of A + for some associative algebra A over F; otherwise, J is exceptional. An exceptional Jordan algebra is called an Albert algebra.
The following easy observation is included for the sake of the reader:
Lemma 1. 
Let A be an associative algebra over F such that A + is a division algebra. Then, A is a divison algebra.
Proof. 
Suppose that x y = 0 for some x , y A . Then, ( y x ) · ( y x ) = y ( x y ) x = 0 , and since A + is a division algebra, we obtain y x = 0 . This implies that x · y = 1 2 ( x y + y x ) = 0 . Using again that A + is a division algebra, we deduce that x = 0 or y = 0 . □
A non-associative cyclic algebra  ( K / F , σ , c ) of degree m over F is an m-dimensional K-vector space ( K / F , σ , c ) = K K z K z 2 K z m 1 , with multiplication given by the relations z m = c , z l = σ ( l ) z for all l K . The algebra ( K / F , σ , c ) is a unital F-central algebra and associative if and only if c F × . The algebra ( K / F , σ , c ) is a division algebra for all c F × , such that c s N K / F ( K × ) for all s which are prime divisors of m, 1 s m 1 . If c K F , then ( K / F , σ , c ) is a division algebra for all c K F such that 1, c , , c m 1 are linearly independent over F [10]. If m is prime, then ( K / F , σ , c ) is a division algebra for all c K F .

2.2. Cubic Maps

Let V and W be two finite-dimensional vector spaces over F. A trilinear map M : V × V × V W is called symmetric if M ( x , y , z ) is invariant under all permutations of its variables. A map M : V W is called a cubic map over F, if M ( a x ) = a 3 M ( x ) for all a F , x V , and if the associated map M : V × V × V W defined by
M ( x , y , z ) = 1 6 ( M ( x + y + z ) M ( x + y ) M ( x + z ) M ( y + z ) + M ( x ) + M ( y ) + M ( z ) )
is a (symmetric) F-trilinear map. We canonically identify symmetric trilinear maps M : V × V × V W with the corresponding cubic maps M : V W .
A cubic map M : V F is called a cubic form and a trilinear map M : V × V × V F a trilinear form over F. A cubic map is called non-degenerate if v = 0 is the only vector such that M ( v , v 2 , , v 3 ) = 0 for all v i V . A cubic map M is called anisotropic if M ( x ) = 0 implies that x = 0 ; otherwise, it is isotropic. For a non-associative algebra A over F together with a non-degenerate cubic form M : A F , M is called multiplicative, if M ( v w ) = M ( v ) M ( w ) for all v , w A .

2.3. Associative Cubic Algebras

(cf. for Instance [1,15] (Chapter C.4)) Let A be a unital separable associative algebra over F with cubic norm N A : A F . Let x , y A and let Z be an indeterminate. The linearization N A ( x + Z y ) = N A ( x ) + Z N A ( x ; y ) + Z 2 N A ( y ; x ) + Z 3 N A ( y ) of N A , i.e., the coefficient of Z in the above expansion, is quadratic in x and linear in y, and is denoted by N A ( x ; y ) . Indeed, we have
N A ( x + Z x ) = N A ( ( 1 + Z ) x ) = ( 1 + Z ) 3 N A ( x ) = ( 1 + 3 Z + 3 Z 2 + Z 3 ) N A ( x ) ,
so N A ( 1 ; 1 ) = 3 N A ( 1 ) = 3 . Linearize N A ( x ; y ) to obtain a symmetric trilinear map N A : A × A × A F , N A ( x , y , z ) = N A ( x + z ; y ) N A ( x ; y ) N A ( z ; y ) . We define
T A ( x ) = N A ( 1 ; x ) , T A ( x , y ) = T A ( x ) T A ( y ) N A ( 1 , x , y ) , S A ( x ) = N A ( x ; 1 ) , x = x 2 T A ( x ) x + S A ( x ) 1 ,
for all x , y A . We call x the adjoint of x, and define the sharp map : A × A A , x y = ( x + y ) x y as the linearization of the adjoint. We observe that T A ( 1 ) = S A ( 1 ) = 3 . Since the trilinear map N A ( x , y , z ) is symmetric,
T A ( x , y ) = T A ( y , x )
for all x , y A .
The algebra A is called an (associative) cubic algebra (respectively, called an algebra of degree three in [15] (p. 490)), if the following three axioms are satisfied for all x , y A :
x 3 T A ( x ) x 2 + S A ( x ) x N A ( x ) 1 = 0 ( d e g r e e   3   i d e n t i t y ) ,
T A ( x , y ) = N A ( x ; y ) ( t r a c e - s h a r p   f o r m u l a ) ,
T A ( x , y ) = T A ( x y ) ( t r a c e - p r o d u c t   f o r m u l a ) .
For the rest of Section 2.3, we assume that A is a separable cubic algebra over F with cubic norm N A : A F . Note that (2) is equivalent to the condition that
x x = x x = N A ( x ) 1 ,
and combining (1) with (4) gives
T A ( x y ) = T A ( y x ) .
An element x A is invertible if and only if N A ( x ) 0 . The inverse of x A is x 1 = N A ( x ) 1 x . It can be shown that
( x y ) = y x
for all x , y A . Notice that
T A ( x ) = T A ( x , 1 ) = N A ( x ; 1 ) = S A ( x ) ,
using (3) and (4). We also have S A ( x ) = T A ( x ) = T A ( x 2 ) T A ( x ) 2 + 3 S A ( x ) , so
2 S A ( x ) = T A ( x ) 2 T A ( x 2 ) .
A straightforward calculation shows that
x y = 2 ( x · y ) T A ( x ) y T A ( y ) x + ( T A ( x ) T A ( y ) T A ( x · y ) ) 1
for all x , y A . In particular,
x · y = 1 2 ( x y + y x ) = 1 2 ( x y + T A ( x ) y + T A ( y ) x ( T A ( x ) T A ( y ) T A ( x , y ) ) 1 )
for all x , y A and by employing (5) and the adjoint identity in A, we see that the norm N A satisfies the relation
N A ( x ) = N A ( x ) 2 .
A + satisfies the adjoint identity
( x ) = N A ( x ) x
for all x A . By (11), we have N A ( x ) 1 = x ( x ) = x N A ( x ) x = N A ( x ) 2 1 . For x , y A , we define the operators U x : A A , U x ( y ) = T A ( x , y ) x x y and U x , y : A A , U x , y ( z ) = U x + y ( z ) U x ( z ) U y ( z ) . Then, we have x · y = 1 2 U x , y ( 1 ) for all x , y A and
x y x = T A ( x , y ) x x y ,
Hence, U x ( y ) = x y x for all x , y A × .
Define
x × y = 1 2 ( x y ) ,
and
x ¯ = 1 2 ( T A ( x ) 1 x )
for x , y A . (Note that some literature does not include the factor 1 2 in the definition of ×, e.g., [16]). By (10), we then have
x × y = x · y 1 2 T A ( x ) y 1 2 T A ( y ) x + 1 2 ( T A ( x ) T A ( y ) T A ( x · y ) ) 1
for all x , y A ; hence,
x × x = x 2 T A ( x ) x + 1 2 ( T A ( x ) 2 T A ( x 2 ) ) = x ,
using (9).

2.4. The First Tits Construction

Let A be a separable cubic associative algebra over F with norm N A , trace T A and adjoint map ♯. Let μ F × and define the F-vector space J = J ( A , μ ) = A 0 A 1 A 2 , where A i = A for i = 0 , 1 , 2 . Then, J ( A , μ ) together with the multiplication
( x 0 , x 1 , x 2 ) ( y 0 , y 1 , y 2 ) = ( x 0 · y 0 + x 1 y 2 ¯ + y 1 x 2 ¯ , x 0 ¯ y 1 + y 0 ¯ x 1 + μ 1 ( x 2 × y 2 ) , x 2 y 0 ¯ + y 2 x 0 ¯ + μ ( x 1 × y 1 ) )
becomes a separable cubic Jordan algebra over F. J ( A , μ ) is called a first Tits construction. A + is a subalgebra of J ( A , μ ) by canonically identifying it with A 0 . If A is a cubic etale algebra, then J ( A , μ ) D + for with D an associative cyclic algebra D of degree three. If A is a central simple algebra of degree three then J ( A , μ ) is an Albert algebra.
We define the cubic norm form  N : J ( A , μ ) F , the trace T : J ( A , μ ) F , and the quadratic map : J ( A , μ ) J ( A , μ ) (the adjoint) by
N ( ( x 0 , x 1 , x 2 ) ) = N A ( x 0 ) + μ N A ( x 1 ) + μ 1 N A ( x 2 ) T A ( x 0 x 1 x 2 ) T ( ( x 0 , x 1 , x 2 ) ) = T A ( x 0 ) , ( x 0 , x 1 , x 2 ) = ( x 0 x 1 x 2 , μ 1 x 2 x 0 x 1 , μ x 1 x 2 x 0 ) .
The intermediate quadratic form  S : J ( A , μ ) F , S ( x 0 ) = N ( x ; 1 ) , linearizes to a map S : J ( A , μ ) × J ( A , μ ) F . The sharp map  : J ( A , μ ) × J ( A , μ ) J ( A , μ ) is the linearization x y = ( x + y ) x y of the adjoint. For every x = ( x 0 , x 1 , x 2 ) J ( A , μ ) , we have x 1 = T ( x ) 1 x and
x y = ( x 0 y 0 x 1 y 2 y 1 x 2 , μ 1 ( x 2 y 2 ) x 0 y 1 y 0 x 1 , μ ( x 1 y 1 ) x 2 y 0 y 2 x 0 )
for all x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) J ( A , μ ) . We define the trace symmetric bilinear form  T : J ( A , μ ) × J ( A , μ ) F , T ( x , y ) = T A ( x 0 y 0 ) + T A ( x 1 y 2 ) + T A ( x 2 y 1 ) . Then, for all x , y J ( A , μ ) , we have
T ( x , y ) = T ( x y ) .
Remark 1. 
( N , , 1 ) is a cubic form with adjoint and base point ( 1 , 0 , 0 ) on J ( A , μ ) which makes J ( A , μ ) into a cubic Jordan algebra J ( N , , 1 ) .

3. The Generalized First Tits Construction J ( A , μ )

Let A be a separable associative cubic algebra over F with norm N A , trace T A and adjoint map ♯.
We now generalize the first Tits construction by choosing the scalar μ A × . Then, the F-vector space J ( A , μ ) = A 0 A 1 A 2 , where again A i = A for i = 0 , 1 , 2 , becomes a unital non-associative algebra over F together with the multiplication given by
( x 0 , x 1 , x 2 ) ( y 0 , y 1 , y 2 ) = ( x 0 · y 0 + x 1 y 2 ¯ + y 1 x 2 ¯ , x 0 ¯ y 1 + y 0 ¯ x 1 + μ 1 ( x 2 × y 2 ) , x 2 y 0 ¯ + y 2 x 0 ¯ + μ ( x 1 × y 1 ) ) .
The algebra J ( A , μ ) is called a generalized first Tits construction. The special Jordan algebra A + is a subalgebra of J ( A , μ ) by canonically identifying it with A 0 . If μ F × , then J ( A , μ ) is the first Tits construction from Section 2.4.
We define a (generalized) cubic norm map  N : J ( A , μ ) A , a (generalized) trace T : J ( A , μ ) F , and a quadratic map : J ( A , μ ) J ( A , μ ) via
N ( ( x 0 , x 1 , x 2 ) ) = N A ( x 0 ) + μ N A ( x 1 ) + μ 1 N A ( x 2 ) T A ( x 0 x 1 x 2 )
T ( ( x 0 , x 1 , x 2 ) ) = T A ( x 0 ) ,
( x 0 , x 1 , x 2 ) = ( x 0 x 1 x 2 , μ 1 x 2 x 0 x 1 , μ x 1 x 2 x 0 ) .
Put : J ( A , μ ) × J ( A , μ ) J ( A , μ ) , x y = ( x + y ) x y ; then, it can be verified by a direct computation that
x y = ( x 0 y 0 x 1 y 2 y 1 x 2 , μ 1 ( x 2 y 2 ) x 0 y 1 y 0 x 1 , μ ( x 1 y 1 ) x 2 y 0 y 2 x 0 )
for all x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) J ( A , μ ) . We also define a symmetric F-bilinear form T : J ( A , μ ) × J ( A , μ ) F via T ( x , y ) = T A ( x 0 y 0 ) + T A ( x 1 y 2 ) + T A ( x 2 y 1 ) .
The quadratic form S A : A F , S A ( x 0 ) = N A ( x ; 1 ) , linearizes to S A : A × A F , and we have S A ( x 0 ) = T A ( x 0 ) for all x 0 A . We extend S A to J ( A , μ ) by defining the quadratic map S : J ( A , a ) A , S ( x ) = N ( x ; 1 ) . As in the classical case, we obtain:
Theorem 1. 
(i) 
[11] (Proposition 5.2.2) For all x J ( A , μ ) , we have S ( x ) = T ( x ) and the linearization S : J ( A , μ ) × J ( A , μ ) A satisfies
S ( x , y ) = T ( x ) T ( y ) T ( x , y )
for all y J ( A , μ ) .
(ii) 
[11] (Lemma 5.2.3) For all x , y J ( A , μ ) , we have T ( x , Y ) = T ( x y ) .
(iii) 
[11] (Lemma 5.2.3) For all x J ( A , μ ) , we have x 1 = T ( x ) 1 x .
Proof. 
(i)
Let x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) J ( A , a ) , then
N ( x ; y ) = N A ( x 0 ; y 0 ) + μ N A ( x 1 ; y 1 ) + μ 1 N A ( x 2 ; y 2 ) T A ( x 0 x 1 y 2 ) T A ( x 0 y 1 x 2 ) T A ( y 0 x 1 x 2 ) ,
and since S ( x ) = N ( x ; 1 ) we obtain S ( x ) = N A ( x 0 ; 1 ) T A ( x 1 x 2 ) = S A ( x 0 ) T A ( x 1 x 2 ) . On the other hand,
T ( x ) = T A ( x 0 x 1 x 2 ) = T A ( x 0 ) T A ( x 1 x 2 ) = S A ( x 0 ) T A ( x 1 x 2 ) = S ( x ) .
We have S A ( x 0 , y 0 ) = T A ( x 0 ) T A ( y 0 ) T A ( x 0 , y 0 ) for all x 0 , y 0 A . Linearizing S gives S ( x , y ) = S A ( x 0 , y 0 ) T A ( x 1 y 2 ) T A ( y 1 x 2 ) = T A ( x 0 ) T A ( y 0 ) T A ( x 0 , y 0 ) T A ( x 1 y 2 ) T A ( y 1 x 2 ) = T ( x ) T ( y ) T ( x , y ) using the definitions of T A ( x i ) and T A ( x i , y i ) and the fact that T A ( x 0 , y 0 ) = T A ( x 0 y 0 ) .
(ii)
Let x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) J ( A , μ ) . Since T A is linear, we obtain
T ( x y ) = T A ( x 0 · y 0 ) + T A ( x 1 y 2 ¯ ) + T A ( y 1 x 2 ¯ ) = 1 2 ( T A ( x 0 y 0 ) + T A ( y 0 x 0 ) ) + 1 2 ( T A ( x 1 y 2 ) T A ( 1 ) T A ( x 1 y 2 ) ) + 1 2 ( T A ( y 1 x 2 ) T A ( 1 ) T A ( y 1 x 2 ) ) .
By (6) we obtain T A ( x 0 y 0 ) = T A ( y 0 x 0 ) and T A ( y 1 x 2 ) = T A ( x 2 y 1 ) . Since we have T A ( 1 ) = 3 we obtain T ( x y ) = T A ( x 0 y 0 ) + T A ( x 1 y 2 ) + T A ( x 2 y 1 ) = T ( x , y ) .
(iii)
Let x = ( x 0 , x 1 , x 2 ) J ( A , μ ) . By (10), we have x 0 1 = T A ( x 0 ) 1 x 0 . Thus, x 1 = ( x 0 1 , x 1 , x 2 ) = T ( x ) 1 x .
Theorem 2. 
Let μ A × , and let x , y J ( A , μ ) . Then,
(i) 
x = x 2 T ( x ) x + S ( x ) 1 ,
(ii) 
S ( x ) = T ( x ) ,
(iii) 
T ( x × y ) = 1 2 ( T ( x ) T ( y ) T ( x y ) ) .
Note that these are relations that also hold for a cubic form with adjoint and base point ( N , , 1 ) [15,17].
Proof. 
Let x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) J ( A , μ ) .
(i)
We have that x 2 T ( x ) x + S ( x ) 1 = ( x 0 , x 1 , x 2 ) 2 T A ( x 0 ) ( x 0 , x 1 , x 2 ) + ( S A ( x 0 ) 1 T A ( x 1 x 2 ) 1 , 0 , 0 ) = ( x 0 2 T A ( x 0 ) x 0 + S A ( x 0 ) 1 + 2 x 1 x 2 ¯ T A ( x 1 x 2 ) 1 , μ 1 x 2 + 2 x 0 ¯ x 1 T A ( x 0 ) x 1 , μ x 1 + 2 x 2 x 0 ¯ T A ( x 0 ) x 2 ) = ( x 0 x 1 x 2 , μ 1 x 2 x 0 x 1 , μ x 1 x 2 x 0 ¯ ) = x .
(ii)
As for the classical construction,
T ( x ) = T A ( x 0 x 1 x 2 ) = T A ( x 0 ) T A ( x 1 x 2 ) = S A ( x 0 ) T A ( x 1 x 2 ) = S ( x ) .
(iii)
Since x × y = 1 2 ( x y ) = 1 2 ( x 0 y 0 x 1 y 2 y 1 x 2 , μ 1 ( x 2 y 2 ) x 0 y 1 y 0 x 1 , μ ( x 1 y 1 ) x 2 y 0 y 2 x 0 ) , we obtain T ( x × y ) = T A ( x 0 × y 0 ) 1 2 T A ( x 1 y 2 ) 1 2 T A ( y 1 x 2 ) = 1 2 ( T A ( x 0 ) T A ( y 0 ) T A ( x 0 y 0 ) T A ( x 1 y 2 ) T A ( y 1 x 2 ) ) = 1 2 ( T ( x ) T ( y ) T ( x y ) ) .
Define operators U x , U x , y : J ( A , μ ) J ( A , μ ) via
U x ( y ) = T ( x , y ) x x y , U x , y ( z ) = U x + y ( z ) U x ( z ) U y ( z )
for all z J ( A , μ ) .
Proposition 1. 
(cf. [11] (Proposition 5.2.4) without factor 1 2 because of slightly different terminology) For all x , y J ( A , μ ) , we have x y = 1 2 U x , y ( 1 ) .
This generalizes the classical setup. Our proof is different to the one of [11] (Proposition 5.2.4), which also proves this result without the factor 1 2 because of the slightly different definition of the multiplication.
Proof. 
We find that U x ( 1 ) = T ( x , 1 ) x x 1 = T ( x ) x T ( x ) 1 + x ; in the second equality, we have used Theorem 1 and the fact that T ( x , 1 ) = T ( x ) by Theorem 1. So
U x , y ( 1 ) = U x + y ( 1 ) U x ( 1 ) U y ( 1 ) = T ( x + y ) ( x + y ) T ( ( x + y ) ) 1 + ( x + y ) T ( x ) x + T ( x ) 1 x T ( y ) y + T ( y ) 1 y = T ( x ) y + T ( y ) x + x y T ( x y ) 1 .
We look at the first component of x y and U x , y ( 1 ) : let x = ( x 0 , x 1 , x 2 ) and y = ( y 0 , y 1 , y 2 ) . Then, the first component of U x , y ( 1 ) = T ( x ) y + T ( y ) x + x y T ( x y ) 1 is
T A ( x 0 ) y 0 + T A ( y 0 ) x 0 + x 0 y 0 x 1 y 2 y 1 x 2 T A ( x 0 y 0 x 1 y 2 y 1 x 2 ) 1 .
Using (10), the linearity of T A and (6), we obtain—after some simplification—that (19) is equal to
2 ( x 0 · y 0 ) + T A ( x 1 y 2 ) x 1 y 2 + T A ( y 1 x 2 ) y 1 x 2 = 2 ( x 0 · y 0 ) + 2 x 1 y 2 ¯ + 2 y 1 x 2 ¯ .
This is equal to 2 times the first component of x y . Now, we look at the second component of x y and U x , y ( 1 ) : the second component of U x , y ( 1 ) = T ( x ) y + T ( y ) x + x y T ( x y ) 1 is
T A ( x 0 ) y 1 + T A ( y 0 ) x 1 + μ 1 ( x 2 y 2 ) x 0 y 1 y 0 x 1 = 2 x 0 ¯ y 1 + 2 y 0 ¯ x 1 + 2 μ 1 ( x 2 × y 2 ) .
This is precisely equal to 2 times the second component of x y . Finally, the third component of 2 x y and U x , y ( 1 ) are equal, too. The third component of U x , y ( 1 ) = T ( x ) y + T ( y ) x + x y T ( x y ) 1 is
T A ( x 0 ) y 2 + T A ( y 0 ) x 2 + μ ( x 1 y 1 ) x 2 y 0 y 2 x 0 = 2 x 2 y 0 ¯ + 2 y 2 x 0 ¯ + 2 μ ( x 1 × y 1 ) .
This is precisely equal to 2 times the third component of x y . □
Theorem 3. 
If μ A × and A F , then Nuc l ( J ( A , μ ) ) = Nuc r ( J ( A , μ ) ) = F .
Proof. 
Let ( x 0 , x 1 , x 2 ) Nuc l ( J ( A , μ ) ) , then
( x 0 , x 1 , x 2 ) [ ( 0 , 1 , 0 ) ( 0 , 0 , 1 ) ] = [ ( x 0 , x 1 , x 2 ) ( 0 , 1 , 0 ) ] ( 0 , 0 , 1 )
implies that
( x 0 , x 1 , x 2 ) = ( x 0 ¯ ¯ , μ 1 ( μ x 1 ¯ ¯ ) , x 2 ¯ ¯ ) ,
that means x 0 = x 0 ¯ ¯ and x 2 = x 2 ¯ ¯ . Using the definition of x 0 ¯ ¯ , we obtain x 0 ¯ ¯ = 1 4 ( T A ( x 0 ) + x 0 ) , so x 0 = 1 4 ( T A ( x 0 ) + x 0 ) . Thus, x 0 = 1 3 T A ( x 0 ) F . Furthermore, since x 2 = x 2 ¯ ¯ , we find in a similar way that x 2 = 1 3 T A ( x 2 ) F . Next, since x = ( x 0 , x 1 , x 2 ) Nuc l ( J ( A , μ ) ) , we have that
( x 0 , x 1 , x 2 ) [ ( 0 , 0 , 1 ) ( 0 , 1 , 0 ) ] = [ ( x 0 , x 1 , x 2 ) ( 0 , 0 , 1 ) ] ( 0 , 1 , 0 ) .
This implies that
( x 0 , x 1 , x 2 ) = ( x 0 ¯ ¯ , x 1 ¯ ¯ , μ ( μ 1 x 2 ¯ ¯ ) ) ,
and so x 1 = x 1 ¯ ¯ . We now find in a similar way that x 1 = 1 3 T A ( x 1 ) F , thus Nuc l ( J ( A , μ ) ) { ( x 0 , x 1 , x 2 ) J | x 0 , x 1 , x 2 F } . Let x = ( x 0 , x 1 , x 2 ) Nuc l ( J ( A , μ ) ) , and let a A F . Then
( x 0 , x 1 , x 2 ) [ ( 0 , 0 , 1 ) ( 0 , a , 0 ) ] = [ ( x 0 , x 1 , x 2 ) ( 0 , 0 , 1 ) ] ( 0 , a , 0 )
which implies that
( x 0 · a ¯ , a ¯ ¯ x 1 , x 2 a ¯ ¯ ) = ( a x 0 ¯ ¯ , x 1 ¯ ¯ a , μ ( μ 1 x 2 ¯ × a ) ) ,
and so a ¯ ¯ x 1 = x 1 ¯ ¯ a . Assume towards a contradiction that x 1 0 . Since x 1 F , this implies that x 1 is invertible and x 1 ¯ ¯ = x 1 . Thus, the condition a ¯ ¯ x 1 = x 1 ¯ ¯ a yields a = a ¯ ¯ , and so a = 1 3 T A ( a ) F which is a contradiction. Next, since ( x 0 , x 1 , x 2 ) Nuc l ( J ( A , μ ) ) , we know that
( x 0 , x 1 , x 2 ) [ ( 0 , 1 , 0 ) ( 0 , 0 , a ) ] = [ ( x 0 , x 1 , x 2 ) ( 0 , 1 , 0 ) ] ( 0 , 0 , a )
which implies that
( x 0 · a ¯ , a ¯ ¯ x 1 , x 2 a ¯ ¯ ) = ( x 0 ¯ a ¯ , μ 1 ( μ x 1 ¯ × a ) , a x 2 ¯ ¯ ) ,
and so x 2 a ¯ ¯ = a x 2 ¯ ¯ . Assume towards a contradiction that x 2 0 . Then, since x 2 F , x 2 is invertible and x 2 ¯ ¯ = x 2 . Thus, the condition x 2 a ¯ ¯ = a x 2 ¯ ¯ yields a = a ¯ ¯ , and so a = 1 3 T A ( a ) F which is a contradiction. Therefore, x = ( x 0 , 0 , 0 ) , x 0 1 F which shows that Nuc l ( J ( A , μ ) ) = F .
Let ( x 0 , x 1 , x 2 ) Nuc r ( J ( A , μ ) ) . Then,
( 0 , 0 , 1 ) [ ( 0 , 1 , 0 ) ( x 0 , x 1 , x 2 ) ] = [ ( 0 , 0 , 1 ) ( 0 , 1 , 0 ) ] ( x 0 , x 1 , x 2 )
implies that
( x 0 ¯ ¯ , μ 1 ( μ x 1 ¯ ¯ ) , x 2 ¯ ¯ ) = ( x 0 , x 1 , x 2 ) .
Hence, x 0 = x 0 ¯ ¯ and x 2 = x 2 ¯ ¯ . Using the definition of x 0 ¯ ¯ , we find that x 0 ¯ ¯ = 1 4 ( T A ( x 0 ) + x 0 ) , so the condition x 0 = x 0 ¯ ¯ gives that x 0 = 1 4 ( T A ( x 0 ) + x 0 ) . Thus, x 0 = 1 3 T A ( x 0 ) F . Furthermore, since x 2 = x 2 ¯ ¯ , we find in a similar way that x 2 = 1 3 T A ( x 2 ) F . Next, since x = ( x 0 , x 1 , x 2 ) Nuc r ( J ( A , μ ) ) , we have that
( 0 , 1 , 0 ) [ ( 0 , 0 , 1 ) ( x 0 , x 1 , x 2 ) ] = [ ( 0 , 1 , 0 ) ( 0 , 0 , 1 ) ] ( x 0 , x 1 , x 2 ) .
This implies that
( x 0 ¯ ¯ , x 1 ¯ ¯ , μ ( μ 1 x 2 ¯ ¯ ) ) = ( x 0 , x 1 , x 2 ) ,
and thus x 1 = x 1 ¯ ¯ . We find in a similar way that x 1 = 1 3 T A ( x 1 ) F , i.e. Nuc r ( J ( A , μ ) ) { ( x 0 , x 1 , x 2 ) J | x 0 , x 1 , x 2 F } .
Let x = ( x 0 , x 1 , x 2 ) Nuc r ( J ( A , μ ) ) , and let a A F . Then, ( 0 , a , 0 ) [ ( 0 , 0 , 1 ) ( x 0 , x 1 , x 2 ) ] = [ ( 0 , a , 0 ) ( 0 , 0 , 1 ) ] ( x 0 , x 1 , x 2 ) which implies that
( a x 0 ¯ ¯ , x 1 ¯ ¯ a , μ ( a × μ 1 x 2 ¯ ) ) = ( a ¯ · x 0 , a ¯ ¯ x 1 , x 2 a ¯ ¯ ) ;
therefore, a ¯ ¯ x 1 = x 1 ¯ ¯ a . Assume towards a contradiction that x 1 0 . Then, since x 1 F , x 1 is invertible and x 1 ¯ ¯ = x 1 . Thus, the condition a ¯ ¯ x 1 = x 1 ¯ ¯ a yields a = a ¯ ¯ , and so a = 1 3 T A ( a ) F which is a contradiction. Next, since ( x 0 , x 1 , x 2 ) Nuc r ( J ( A , μ ) ) , we know that
( 0 , 0 , a ) [ ( 0 , 1 , 0 ) ( x 0 , x 1 , x 2 ) ] = [ ( 0 , 0 , a ) ( 0 , 1 , 0 ) ] ( x 0 , x 1 , x 2 )
which implies that
( x 0 ¯ a ¯ , μ 1 ( a × μ x 1 ¯ ) , a x 2 ¯ ¯ ) = ( a ¯ · x 0 , a ¯ ¯ x 1 , x 2 a ¯ ¯ ) ,
and so x 2 a ¯ ¯ = a x 2 ¯ ¯ . Assume towards a contradiction that x 2 0 . Then, since x 2 F , x 2 is invertible and x 2 ¯ ¯ = x 2 . Thus, the condition x 2 a ¯ ¯ = a x 2 ¯ ¯ yields a = a ¯ ¯ , and so a = 1 3 T A ( a ) F which is a contradiction. Therefore, x = ( x 0 , 0 , 0 ) = x 0 1 F which shows the assertion. □
Theorem 4. 
Let A F be a central simple division algebra of degree three and μ A × . Then, Nuc m ( J ( A , μ ) ) = F .
Proof. 
Let x = ( x 0 , x 1 , x 2 ) Nuc m ( J ( A , μ ) ) , and let y 0 C ( A ) . Then, there exists z 0 A such that y 0 z 0 z 0 y 0 . Since ( x 0 , x 1 , x 2 ) Nuc m ( J ( A , μ ) ) , we know that
( y 0 , 0 , 0 ) [ ( x 0 , x 1 , x 2 ) ( z 0 , 0 , 0 ) ] = [ ( y 0 , 0 , 0 ) ( x 0 , x 1 , x 2 ) ] ( z 0 , 0 , 0 )
which implies that
( y 0 · ( x 0 · z 0 ) , y 0 ¯ ( z 0 ¯ x 1 ) , ( x 2 z 0 ¯ ) y 0 ¯ ) = ( ( y 0 · x 0 ) · z 0 , z 0 ¯ ( y 0 ¯ x 1 ) , ( x 2 y 0 ¯ ) z 0 ¯ ) .
Comparing the second and third components yields
y 0 ¯ ( z 0 ¯ x 1 ) = z 0 ¯ ( y 0 ¯ x 1 ) ,
( x 2 z 0 ¯ ) y 0 ¯ = ( x 2 y 0 ¯ ) z 0 ¯ .
Now, assume towards a contradiction that x 1 0 . Since A is a division algebra, x 1 is invertible. Since A is associative, (20) implies that y 0 ¯ z 0 ¯ = z 0 ¯ y 0 ¯ . By definition, this yields
( T A ( y 0 ) 1 y 0 ) ( T A ( z 0 ) 1 z 0 ) = ( T A ( z 0 ) 1 z 0 ) ( T A ( y 0 ) 1 y 0 ) .
Hence, y 0 z 0 = z 0 y 0 which is a contradiction. Now, in a similar way we assume towards a contradiction that x 2 0 . Then, since A is a division algebra, x 2 is invertible. Since A is associative, (21) implies again that y 0 ¯ z 0 ¯ = z 0 ¯ y 0 ¯ . Hence, y 0 z 0 = z 0 y 0 which is a contradiction. Next, since x = ( x 0 , 0 , 0 ) Nuc m ( J ( A , μ ) ) , we also have that
( 0 , 1 , 0 ) [ ( x 0 , 0 , 0 ) ( 0 , 0 , y 2 ) ] = [ ( 0 , 1 , 0 ) ( x 0 , 0 , 0 ) ] ( 0 , 0 , y 2 )
for each y 2 A . This implies ( y 2 x 0 ¯ ¯ , 0 , 0 ) = ( x 0 ¯ y 2 ¯ , 0 , 0 ) , and so y 2 x 0 ¯ ¯ = x 0 ¯ y 2 ¯ . By definition, this means that
1 2 T A ( y 2 ¯ x 0 ) 1 1 2 y 2 ¯ x 0 = 1 2 T A ( x 0 y 2 ¯ ) 1 1 2 x 0 y 2 ¯ .
We know that T A ( y 2 ¯ x 0 ) = T A ( x 0 y 2 ¯ ) (see (6)), and so (22) gives that y 2 ¯ x 0 = x 0 y 2 ¯ . By using the definition of y 2 ¯ , this implies that y 2 x 0 = x 0 y 2 . Hence, x 0 C ( A ) . Therefore, x = ( x 0 , 0 , 0 ) = x 0 1 C ( A ) . Since F Nuc m ( J ( A , μ ) ) this implies the assertion if A is a central simple division algebra. □
Theorem 5. 
([18] (Chapter IX, Section 12), [15] (Chapter C.5)) For μ F × , J ( A , μ ) is a division algebra if and only if μ N A ( A × ) and A is a division algebra, if and only if N is anisotropic.
The general situation is much harder to figure out and we were only able to obtain some obvious necessary conditions:
Theorem 6. 
Let μ A × .
(i) 
If J ( A , μ ) is a division algebra, then μ N A ( A × ) and A is a division algebra.
(ii) 
Let A be a division algebra over F. If 1, μ, μ 2 are linearly independent over F then N is anisotropic.
(iii) 
If N is anisotropic then A is a division algebra and μ N A ( A × ) .
(iv) 
Let 0 x = ( x 0 , x 1 , x 2 ) J ( A , μ ) . Then, x = 0 implies that A has zero divisors, or A is a division algebra and μ N A ( A × ) .
Proof. 
(i)
Suppose that J ( A , μ ) is a division algebra, then so is A + and thus A (Lemma 1). Assume towards a contradiction that μ = N A ( x 0 ) 1 for some x 0 A × . Then, μ F × and J ( A , μ ) is not a division algebra by Theorem 5. Hence, μ N A ( A ) 1 .
(ii)
Since A is a division algebra, N A is anisotropic. So, let N ( ( x 0 , x 1 , x 2 ) ) = 0 ; then, the assumption means that N ( x 0 ) = 0 , which implies that x 0 = 0 . This immediately means that x 1 = x 2 = 0 , too.
(iii)
If N is anisotropic, then so is N A ; so, A is clearly a division algebra. Moreover, μ N A ( A × ) by Theorem 5.
(iv)
Let 0 x = ( x 0 , x 1 , x 2 ) J ( A , μ ) . Then, x = 0 implies that
x 0 = x 1 x 2
μ 1 x 2 = x 0 x 1
μ x 1 = x 2 x 0 .
We can now multiply (23) (resp. (24), (25)) by x 0 (resp. x 2 , x 1 ) on the right and left to obtain two new equations. Additionally, using the fact that N A ( x i ) = x i x i = x i x i for all i = 0 , 1 , 2 , we obtain the following six equations:
N A ( x 0 ) = x 1 x 2 x 0 μ 1 N A ( x 2 ) = x 0 x 1 x 2 μ N A ( x 1 ) = x 2 x 0 x 1 N A ( x 0 ) = x 0 x 1 x 2 μ 1 N A ( x 2 ) = x 2 x 0 x 1 μ N A ( x 1 ) = x 1 x 2 x 0 .
These imply that N A ( x 0 ) = μ 1 N A ( x 2 ) = μ N A ( x 1 ) . This means that either N A ( x 0 ) = μ 1 N A ( x 2 ) = μ N A ( x 1 ) = 0 and so N A is isotropic, or N A ( x 0 ) = μ 1 N A ( x 2 ) = μ N A ( x 1 ) 0 and N A is anisotropic. In the later case, x 0 , x 1 , x 2 are all invertible in A, N A ( x i ) 0 for all i = 0 , 1 , 2 and it follows that μ N A ( A × ) . This proves the assertion.
In other words: If A is a division algebra and μ N A ( A × ) , 0 x = ( x 0 , x 1 , x 2 ) J ( A , μ ) , then x 0 . Note that (iv) was a substantial part of the classical result that if μ F × , μ N A ( A × ) and A is a division algebra, then N is anisotropic. What is missing in order to generalize this result to the generalized first Tits construction is the adjoint identity ( x ) = N ( x ) x . This identity only holds in very special cases—see Lemma 4 below. It would be of course desirable to have conditions on when (or if at all) J ( A , μ ) is a division algebra.

4. Some More Identities

Lemma 2. 
Let x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) , z = ( z 0 , z 1 , z 2 ) J ( A , μ ) be such that one of x 1 , y 1 , z 1 is equal to zero and one of x 2 , y 2 , z 2 is equal to zero. Then, T ( x × y , z ) = T ( x , y × z ) .
Proof. 
We find that
T ( x × y , z ) = 1 2 T A ( ( x 0 y 0 ) z 0 x 1 y 2 z 0 y 1 x 2 z 0 ) + 1 2 T A ( μ 1 ( x 2 y 2 ) z 2 x 0 y 1 z 2 y 0 x 1 z 2 ) + 1 2 T A ( μ ( x 1 y 1 ) z 1 x 2 y 0 z 1 y 2 x 0 z 1 )
and
T ( x , y × z ) = 1 2 T A ( x 0 ( y 0 z 0 ) x 0 y 1 z 2 x 0 z 1 y 2 ) + 1 2 T A ( x 1 μ ( y 1 z 1 ) x 1 y 2 z 0 x 1 z 2 y 0 ) + 1 2 T A ( x 2 μ 1 ( y 2 z 2 ) x 2 y 0 z 1 x 2 z 0 y 1 ) .
Using the definitions, we can show that T A ( ( x 0 y 0 ) z 0 ) = T A ( x 0 ( y 0 z 0 ) ) . Furthermore, since one of x 1 , y 1 , z 1 is equal to zero, we have that T A ( μ ( x 1 y 1 ) z 1 ) = 0 = T A ( x 1 μ ( y 1 z 1 ) ) . Finally, since one of x 2 , y 2 , z 2 is equal to zero, T A ( μ 1 ( x 2 y 2 ) z 2 ) = 0 = T A ( x 2 μ 1 ( y 2 z 2 ) ) . Therefore, applying these equalities and using (6), we deduce that (27) and (28) are equal, so T ( x × y , z ) = T ( x , y × z ) . □
We know that x x = x x = N ( x ) 1 holds for all x J ( A , μ ) if μ F × . We now show for which x J ( A , μ ) we still obtain x x = x x = N ( x ) 1 :
Lemma 3. 
Let μ A × and suppose that x J ( A , μ ) , such that one of the following holds:
(i) 
x = ( x 0 , 0 , x 2 ) J ( A , μ ) , x 0 μ = μ x 0 and N A ( x 2 ) = 0 .
(ii) 
x = ( x 0 , x 1 , 0 ) J ( A , μ ) , x 1 μ = μ x 1 and N A ( x 1 ) = 0 .
Then, we have
x x = x x = N ( x ) 1 .
Moreover, assume that one of the following holds:
(iii) 
x = ( x 0 , 0 , x 2 ) J ( A , μ ) , x 0 μ = μ x 0 and N A ( x 2 ) 0 .
(iv) 
x = ( x 0 , x 1 , 0 ) J ( A , μ ) , x 1 μ = μ x 1 and N A ( x 1 ) 0 .
Then, x x = x x = N ( x ) 1 if and only if μ F × .
Proof. 
Let x = ( x 0 , x 1 , x 2 ) J ( A , μ ) , and let x x = ( a 0 , a 1 , a 2 ) ; then, x = ( x 0 x 1 x 2 , μ 1 x 2 x 0 x 1 , μ x 1 x 2 x 0 ) . Thus, we have
a 0 = 1 2 ( x 0 x 0 x 0 x 1 x 2 + x 0 x 0 x 1 x 2 x 0 ) + 1 2 ( T A ( x 1 μ x 1 x 1 x 2 x 0 ) 1 x 1 μ x 1 + x 1 x 2 x 0 ) + 1 2 ( T A ( μ 1 x 2 x 2 x 0 x 1 x 2 ) 1 μ 1 x 2 x 2 + x 0 x 1 x 2 ) ,
a 1 = 1 2 ( T A ( x 0 ) x 0 ) ( μ 1 x 2 x 0 x 1 ) + 1 2 ( T A ( x 0 x 1 x 2 ) x 0 + x 1 x 2 ) x 1 + μ 1 ( x 2 × ( μ x 1 x 2 x 0 ) ) ,
a 2 = 1 2 x 2 ( T A ( x 0 x 1 x 2 ) x 0 + x 1 x 2 ) + 1 2 ( μ x 1 x 2 x 0 ) ( T A ( x 0 ) x 0 ) + μ ( x 1 × ( μ 1 x 2 x 0 x 1 ) )
by the definition of the multiplication on J ( A , μ ) .
(i)
If x 1 = 0 and N A ( x 2 ) = 0 , using the fact that x i x i = x i x i = N A ( x i ) 1 for all i = 0 , 1 , 2 (see (5)), (30) simplifies to a 0 = N A ( x 0 ) 1 = N ( x ) . Since we have x 0 μ 1 = μ 1 x 0 , (31) gives that a 1 = 1 2 μ 1 ( T A ( x 0 ) x 0 ) x 2 μ 1 ( x 2 × ( x 2 x 0 ) ) . By (10),
x 2 x 0 = x 2 x 0 + x 0 x 2 T A ( x 2 ) x 0 T A ( x 0 ) x 2 + ( T A ( x 2 ) T A ( x 0 ) T A ( x 2 x 0 ) ) 1 .
Using the fact that T A ( x 2 ) = S A ( x 2 ) (by (8)) on the right-hand side of (33), we further obtain after some simplification that
x 2 x 0 = x 2 2 x 0 T A ( x 2 ) x 2 x 0 + x 0 x 2 T A ( x 0 ) x 2 T A ( x 2 2 x 0 ) 1 + T A ( x 2 x 0 ) 1 .
Now, combining (13) with (34) yields T A ( x 0 ) x 2 x 0 x 2 = x 2 2 x 0 + x 2 x 0 x 2 T A ( x 2 ) x 2 x 0 T A ( x 2 x 0 ) x 2 + ( T A ( x 2 ) T A ( x 2 x 0 ) T A ( x 2 2 x 0 ) ) 1 = 2 ( x 2 × ( x 2 x 0 ) ) , so x 2 × ( x 2 x 0 ) = 1 2 ( T A ( x 0 ) x 2 x 0 x 2 ) . Hence, (4) implies a 1 = 0 . For a 2 , (32) yields a 2 = 1 2 x 2 ( T A ( x 0 ) x 0 ) 1 2 x 2 ( T A ( x 0 ) x 0 x 0 2 ) . Then, using the definition of x 0 and the fact that 2 S A ( x 0 ) = T A ( x 0 ) 2 T A ( x 0 2 ) , we find that T A ( x 0 ) x 0 = T A ( x 0 ) x 0 x 0 2 . Therefore, a 2 = 0 .
(ii)
In this case, we have x 2 = 0 , x 1 μ = μ x 1 and N A ( x 1 ) = 0 . So, (30) simplifies to a 0 = N A ( x 0 ) 1 = N ( x ) . For a 1 , (31) simplifies to a 1 = 1 2 ( T A ( x 0 ) x 0 x 0 2 ) x 1 + 1 2 ( T A ( x 0 ) x 0 ) x 1 . Then, in a similar way to how we found a 2 in (i), we find here that a 1 = 0 . For a 2 , (32) simplifies to a 2 = 1 2 μ x 1 ( T A ( x 0 ) x 0 ) μ ( x 1 × ( x 0 x 1 ) ) . We now find in a similar way to how we found a 1 in (i) that a 2 = 0 .
To prove that the claimed equivalence holds assuming (iii) or (iv), we only need to show the forward direction since we know from the classical first Tits construction that the reverse direction holds:
(iii)
Here, (30) yields a 0 = N A ( x 0 ) 1 + 1 2 ( T A ( μ 1 ) N A ( x 2 ) μ 1 N A ( x 2 ) ) ; thus, x x = N ( x ) 1 = ( N A ( x 0 ) 1 + μ 1 N A ( x 2 ) ) 1 gives that N A ( x 0 ) 1 + 1 2 ( T A ( μ 1 ) N A ( x 2 ) μ 1 N A ( x 2 ) ) = a 0 = N A ( x 0 ) 1 + μ 1 N A ( x 2 ) . Therefore, we have μ 1 = 1 3 T A ( μ 1 ) F × , so μ F × .
(iv)
In this case, (30) yields a 0 = N A ( x 0 ) 1 + 1 2 ( T A ( μ ) N A ( x 1 ) μ N A ( x 1 ) ) ; thus, x x = N ( x ) 1 = ( N A ( x 0 ) 1 + μ N A ( x 1 ) ) 1 yields N A ( x 0 ) 1 + 1 2 ( T A ( μ ) N A ( x 1 ) μ N A ( x 1 ) ) = a 0 = N A ( x 0 ) 1 + μ N A ( x 1 ) . Therefore, we obtain μ = 1 3 T A ( μ ) F × . The proof that x x = N ( x ) 1 is performed similarly.
Corollary 1. 
Let μ A × . Suppose that x J ( A , μ ) satisfies N ( x ) 0 , and assume that one of the following holds:
(i) 
x = ( x 0 , x 1 , 0 ) J ( A , μ ) , x 1 μ = μ x 1 and N A ( x 1 ) = 0 .
(ii) 
x = ( x 0 , 0 , x 2 ) J ( A , μ ) , x 0 μ = μ x 0 and N A ( x 2 ) = 0 .
Then, x is invertible in J ( A , μ ) with x 1 = N ( x ) 1 x .
Proof. 
Let μ A × and suppose that x J ( A , μ ) satisfies (i) or (ii); then, x x = x x = N ( x ) 1 . Since F = C ( J ( A , μ ) ) this yields the assertion. □
In particular, if N is anisotropic, then every 0 x x = ( x 0 , x 1 , 0 ) J ( A , μ ) in (i) or (ii) is of the type x = ( x 0 , 0 , 0 ) J ( A , μ ) , i.e., lies in A; so, this result then becomes trivial.
Corollary 2. 
Let μ A × and suppose that x J ( A , μ ) , such that one of the following holds:
(i) 
x = ( x 0 , 0 , x 2 ) J ( A , μ ) , x 0 μ = μ x 0 and N A ( x 2 ) = 0 .
(ii) 
x = ( x 0 , x 1 , 0 ) J ( A , μ ) , x 1 μ = μ x 1 and N A ( x 1 ) = 0 .
Then, we have
x 3 T ( x ) x 2 + S ( x ) x N ( x ) 1 = 0 .
Proof. 
Using the fact that x = x 2 T ( x ) x + S ( x ) 1 from Theorem 2 (i), we have that x 3 T ( x ) x 2 + S ( x ) x N ( x ) 1 = 0 if and only if x x = x x = N ( x ) 1 . Thus, the result now follows as a consequence of Lemma 3. □
Theorem 7. 
The identity x x = x x = N ( x ) 1 holds for all x J ( A , μ ) if and only if μ F × .
Proof. 
If μ F × , then x x = x x = ( N ( x ) , 0 , 0 ) for all x J ( A , μ ) . Conversely, suppose that x x = x x = ( N ( x ) , 0 , 0 ) holds for all x J ( A , μ ) . Take x = ( 0 , 1 , 0 ) . Then, x = ( 0 , 0 , μ ) , and so
x x = ( μ ¯ , 0 , 0 ) = ( 1 2 ( T A ( μ ) 1 μ ) , 0 , 0 ) .
We also know that by definition, N ( x ) = μ N A ( 1 ) = μ , so the condition x x = ( N ( x ) , 0 , 0 ) gives that μ = 1 2 ( T A ( μ ) 1 μ ) . Hence μ = 1 3 T A ( μ ) 1 F × .
We know that the adjoint identity ( x ) = N ( x ) x holds for all x J ( A , μ ) , if μ F × [15] (Chapter C.4). In the general construction, it holds only in very special cases:
Lemma 4. 
Let μ A × and suppose that x J ( A , μ ) , such that one of the following holds:
(i) 
x = ( 0 , x 1 , 0 ) J ( A , μ ) and N A ( x 1 ) = 0 .
(ii) 
x = ( x 0 , x 1 , 0 ) J ( A , μ ) and N A ( x 1 ) = 0 and x 1 μ = μ x 1 .
(iii) 
x = ( x 0 , 0 , x 2 ) J ( A , μ ) and N A ( x 2 ) = 0 and x 0 μ = μ x 0 .
Then, we have ( x ) = N ( x ) x .
Moreover, if one of the following holds:
(iv) 
x = ( x 0 , x 1 , 0 ) J ( A , μ ) , N A ( x 1 ) 0 , x 0 μ = μ x 0 and x 1 μ = μ x 1 .
(v) 
x = ( x 0 , 0 , x 2 ) J ( A , μ ) , N A ( x 2 ) 0 , x 0 μ = μ x 0 and x 2 μ = μ x 2 .
Then, ( x ) = N ( x ) x for all x J ( A , μ ) if and only if N A ( μ ) = μ 3 .
Proof. 
Let x = ( x 0 , x 1 , x 2 ) J ( A , μ ) and ( x ) = ( a 0 , a 1 , a 2 ) . By definition, x = ( x 0 x 1 x 2 , μ 1 x 2 x 0 x 1 , μ x 1 x 2 x 0 ) , so a 0 = ( x 0 x 1 x 2 ) ( μ 1 x 2 x 0 x 1 ) ( μ x 1 x 2 x 0 ) . Now, using (9) and (10), it is easy to show that
( x 0 x 1 x 2 ) = ( x 0 x 1 x 2 ) 2 T A ( x 0 x 1 x 2 ) ( x 0 x 1 x 2 ) + S A ( x 0 x 1 x 2 ) = ( x 0 ) x 0 ( x 1 x 2 ) + ( x 1 x 2 ) .
Hence,
a 0 = ( x 0 x 1 x 2 ) ( μ 1 x 2 x 0 x 1 ) ( μ x 1 x 2 x 0 ) = ( x 0 ) x 0 ( x 1 x 2 ) + ( x 1 x 2 ) μ 1 x 2 μ x 1 + μ 1 x 2 x 2 x 0 + x 0 x 1 μ x 1 x 0 x 1 x 2 x 0 .
Similarly, we find that
a 1 = μ 1 ( μ x 1 x 2 x 0 ) ( x 0 x 1 x 2 ) ( μ 1 x 2 x 0 x 1 ) = μ 1 ( ( μ x 1 ) ( μ x 1 ) ( x 2 x 0 ) + ( x 2 x 0 ) ) x 0 μ 1 x 2 + x 0 x 0 x 1 + x 1 x 2 μ 1 x 2 x 1 x 2 x 0 x 1
and
a 2 = μ ( μ 1 x 2 x 0 x 1 ) ( μ x 1 x 2 x 0 ) ( x 0 x 1 x 2 ) = μ ( ( μ 1 x 2 ) ( μ 1 x 2 ) ( x 0 x 1 ) + ( x 0 x 1 ) ) μ x 1 x 0 + μ x 1 x 1 x 2 + x 2 x 0 x 0 x 2 x 0 x 1 x 2 .
(i)
Here, x 0 = x 2 = 0 ; therefore, (35) implies a 0 = 0 and (36) gives that a 1 = μ 1 ( μ x 1 ) = μ 1 N A ( x 1 ) x 1 μ = 0 = N ( x ) x 1 . Finally, (37) gives that a 2 = 0 as required.
(ii)
Since x 2 = 0 , x 1 μ = μ x 1 and N A ( x 1 ) = 0 , we find by (35) that a 0 = ( x 0 ) + x 0 μ x 1 x 1 = N A ( x 0 ) x 0 + x 0 μ N A ( x 1 ) = N ( x ) x 0 . Now, (36) gives that a 1 = μ 1 ( μ x 1 ) + x 0 x 0 x 1 = μ 1 N A ( x 1 ) x 1 μ + N A ( x 0 ) x 1 = N ( x ) x 1 , and by (37), we obtain a 2 = μ ( x 0 x 1 ) μ x 1 x 0 = 0 = N ( x ) 0 .
(iii)
Since x 1 = 0 and N A ( x 2 ) = 0 , (35) yields a 0 = ( x 0 ) + μ 1 x 2 x 2 x 0 = N A ( x 0 ) x 0 + μ 1 N A ( x 2 ) x 0 = N ( x ) x 0 . Now, since x 0 μ 1 = μ 1 x 0 , we have that x 0 μ 1 = μ 1 x 0 , so (36) gives that a 1 = μ 1 ( x 2 x 0 ) μ 1 x 0 x 2 = 0 = N ( x ) 0 . Finally, (37) gives that a 2 = μ ( μ 1 x 2 ) + x 2 x 0 x 0 = μ N A ( x 2 ) x 2 ( μ 1 ) + N A ( x 0 ) x 2 = N ( x ) x 2 .
(iv)
Since x 2 = 0 , x 0 μ = μ x 0 and x 1 μ = μ x 1 , (35) yields a 0 = ( x 0 ) + μ x 0 x 1 x 1 = N A ( x 0 ) x 0 + μ N A ( x 1 ) x 0 = N ( x ) x 0 . Now, (37) gives that a 2 = μ ( x 0 x 1 ) μ x 1 x 0 = 0 . Finally, (36) gives that a 1 = μ 1 ( μ x 1 ) + x 0 x 0 x 1 = μ 1 N A ( x 1 ) x 1 μ + N A ( x 0 ) x 1 . Thus, a 1 = N ( x ) x 1 if and only if μ 1 N A ( x 1 ) x 1 μ + N A ( x 0 ) x 1 = N ( x ) x 1 , which occurs if and only if μ 1 N A ( x 1 ) x 1 μ = μ N A ( x 1 ) x 1 . Since N A ( x 1 ) 0 and x 1 μ = μ x 1 , this occurs if and only if μ x 1 = μ 2 x 1 . Finally, N A ( x 1 ) 0 implies that x 1 is invertible, so μ x 1 = μ 2 x 1 if and only if N A ( μ ) = μ μ = μ 3 .
(v)
Since x 1 = 0 , (35) yields a 0 = ( x 0 ) + μ 1 x 2 x 2 x 0 = N ( x ) x 0 . Furthermore, since x 0 commutes with μ , x 0 commutes with μ . So, x 0 μ 1 = μ 1 x 0 . Hence, (36) gives that a 1 = μ 1 ( x 2 x 0 ) μ 1 x 0 x 2 = 0 = N ( x ) 0 . Finally, (37) yields a 2 = μ ( μ 1 x 2 ) + x 2 x 0 x 0 = μ N A ( x 2 ) x 2 ( μ 1 ) + N A ( x 0 ) x 2 . Thus, a 2 = N ( x ) x 2 if and only if μ N A ( x 2 ) x 2 ( μ 1 ) + N A ( x 0 ) x 2 = N ( x ) x 2 , which occurs if and only if μ N A ( x 2 ) x 2 ( μ 1 ) = μ 1 N A ( x 2 ) x 2 . Since N A ( x 2 ) 0 and x 2 ( μ 1 ) = ( μ 1 ) x 2 , this occurs if and only if ( μ 1 ) x 2 = μ 2 x 2 . Finally, N A ( x 2 ) 0 implies that x 2 is invertible, so ( μ 1 ) x 2 = μ 2 x 2 if and only if N A ( μ 1 ) = μ 1 ( μ 1 ) = μ 3 . This is equivalent to N A ( μ ) = μ 3 .
Proposition 2. 
Let A be a central simple algebra over F. Then, ( x ) = N ( x ) for all x J ( A , μ ) if and only if μ F × .
Proof. 
Let μ F × then by Lemma 4, the adjoint identity holds for all x J ( A , μ ) . Suppose now that the adjoint identity holds for all x J ( A , μ ) . Let x = ( x 0 , 1 , 0 ) J ( A , μ ) for some x 0 A . Then, x = ( x 0 , x 0 , μ ) and so
( x ) = ( ( x 0 ) + x 0 μ , μ 1 μ + ( x 0 ) x 0 , 0 ) .
Furthermore, N ( x ) = N A ( x 0 ) 1 + μ . Since the adjoint identity holds by assumption, we see that by using (38),
( ( x 0 ) + x 0 μ , μ 1 μ + ( x 0 ) x 0 , 0 ) = ( N A ( x 0 ) x 0 + μ x 0 , N A ( x 0 ) + μ , 0 ) .
We know that ( x 0 ) = N A ( x 0 ) x 0 for all x 0 A by (12), and so by comparing the first components of (39), we find that x 0 μ = μ x 0 for all x 0 A . Hence, μ C ( A ) , and since A is a central simple algebra by assumption, μ F × . □
If μ F × , then the norm N permits Jordan composition, i.e. N ( U x y ) = N A ( x ) 2 N ( y ) for all x , y J ( A , a ) . The following result is a corrected version of [11] (Theorem 5.2.5), and a weak generalization of the Jordan composition for μ A × F :
Theorem 8. 
Let x = ( x 0 , 0 , 0 ) A , y = ( y 0 , y 1 , y 2 ) J ( A , μ ) and suppose that one of the following holds:
(i) 
T A ( y 0 y 1 y 2 ) = T A ( N A ( y 0 ) x 0 y 1 y 2 x 0 ) .
(ii) 
y 0 y 1 y 2 = N A ( y 0 ) x 0 y 1 y 2 x 0 .
(iii) 
y i = 0 for some i = 0 , 1 , 2 .
Then, N ( U x ( y ) ) = N ( x ) 2 N ( y ) .
Proof. 
Using the definitions, we see that T ( x , y ) = T A ( x 0 y 0 ) and x y = ( x 0 y 0 , x 0 y 1 , y 2 x 0 ) . So U x ( y ) = T ( x , y ) x x y = ( U x 0 ( y 0 ) , x 0 y 1 , y 2 x 0 ) . This yields
N ( U x ( y ) ) = N A ( U x 0 ( y 0 ) ) 1 + μ N A ( x 0 y 1 ) + μ 1 N A ( y 2 x 0 ) T A ( U x 0 ( y 0 ) x 0 y 1 y 2 x 0 ) 1 = N A ( x 0 ) 2 ( N A ( y 0 ) 1 + μ N A ( y 1 ) + μ 1 N A ( y 2 ) T A ( N A ( y 0 ) x 0 y 1 y 2 x 0 ) 1 ) = N ( x ) 2 ( N ( y ) + T A ( y 0 y 1 y 2 ) 1 T A ( N A ( y 0 ) x 0 y 1 y 2 x 0 ) 1 ) ,
where in the second equality we have used the fact that N A ( x 0 ) = N A ( x 0 ) 2 , and that N A ( U x 0 ( y 0 ) ) = N A ( x 0 ) 2 N A ( y 0 ) . Therefore, N ( U x ( y ) ) = N ( x ) 2 N ( y ) , if and only if T A ( y 0 y 1 y 2 ) 1 = T A ( N A ( y 0 ) x 0 y 1 y 2 x 0 ) .
(ii) and (iii) are examples where this is the case. □
Remark 2. 
Let f : J ( A , μ ) J ( A , μ ) be an automorphism. Then,
f ( ( x 0 , x 1 , x 2 ) ) = f ( ( x 0 , 0 , 0 ) ) + f ( ( 0 , x 1 , 0 ) ) + f ( ( 0 , 0 , x 2 ) ) .
Now, for each x A , we have f ( ( 0 , x ¯ , 0 ) ) = f ( ( x , 0 , 0 ) ) f ( ( 0 , 1 , 0 ) , and f ( ( 0 , 0 , x ¯ ) ) = f ( ( x , 0 , 0 ) ) f ( ( 0 , 0 , 1 ) ) . On the other hand, by using the definition of x ¯ ,
f ( ( 0 , x ¯ , 0 ) ) = 1 2 Tr A ( x ) f ( ( 0 , 1 , 0 ) ) 1 2 f ( ( 0 , x , 0 ) ) , f ( ( 0 , 0 , x ¯ ) ) = 1 2 Tr A ( x ) f ( ( 0 , 0 , 1 ) ) 1 2 f ( ( 0 , 0 , x ) ) .
Hence,
f ( ( 0 , x , 0 ) ) = f ( ( 0 , 1 , 0 ) ) ( Tr A ( x ) 2 f ( ( x , 0 , 0 ) ) ) ,
f ( ( 0 , 0 , x ) ) = f ( ( 0 , 0 , 1 ) ) ( Tr A ( x ) 2 f ( ( x , 0 , 0 ) ) ) .
So, by (40)–(42), we see that any automorphism of J ( A , μ ) is determined by its restriction on A + , and its value on ( 0 , 1 , 0 ) and ( 0 , 0 , 1 ) . Let f : J ( A , μ ) J ( A , μ ) be an automorphism that fixes A + ; then, f | A + = τ is either an automorphism or an anti-automorphism of A. Moreover, clearly f ( ( 1 , 0 , 0 ) ) = ( 1 , 0 , 0 ) , so
f ( ( x 0 , x 1 , x 2 ) ) = ( τ ( x 0 ) , 0 , 0 ) + ( τ ( x 1 ) , 0 , 0 ) f ( ( 0 , 1 , 0 ) ) + ( τ ( x 2 ) , 0 , 0 ) f ( ( 0 , 0 , 1 ) ) .
Calculation to try gain some deeper understanding on the automorphisms are tedious and did not lead us anywhere so far.

5. The Nine-Dimensional Non-Associative Algebras J ( K , μ )

Let K / F be a separable cubic field extension with Gal ( K / F ) = σ , norm N K , and trace T K . For all x 0 K , we have x 0 = σ ( x 0 ) σ 2 ( x 0 ) and x 0 ¯ = 1 2 ( σ ( x 0 ) + σ 2 ( x 0 ) ) . Assume μ K × .
Let us compare the first Tits construction J ( K , μ ) with the algebra D + for a (perhaps non-associative) cyclic algebra D = ( K / F , σ , μ ) over F of degree three. Consider D as a left K-vector space with basis { 1 , z , z 2 } . Write R x for the matrix of right multiplication by x = x 0 + x 1 z + x 2 z 2 , x i K , with respect to the basis { 1 , z , z 2 } , then the cubic map N D : D K , N D ( x ) = det ( R x ) (which is the reduced norm of the central simple algebra D if μ F × ), is given by
N D ( x ) = N K ( x 0 ) + μ N K ( x 1 ) + μ 2 N K ( x 2 ) μ T K ( x 0 σ ( x 1 ) σ 2 ( x 2 ) ) .
If N D is anisotropic then D is a division algebra over F. If μ K F , we obtain N D ( l x ) = N K ( l ) N D ( x ) for all x D , l K [11] (Propositions 4.2.2 and 4.2.3).
On the other hand, J ( K , μ ) is a nine-dimensional non-associative unital algebra over F with multiplication
x y = ( x 0 · y 0 + x 1 y 2 ¯ + x 2 y 1 ¯ , x 0 ¯ y 1 + y 0 ¯ x 1 + μ 1 ( x 2 × y 2 ) , x 0 ¯ y 2 + y 0 ¯ x 2 + μ ( x 1 × y 1 ) )
for x = ( x 0 , x 1 , x 2 ) , y = ( y 0 , y 1 , y 2 ) J ( K , μ ) , cubic norm map
N ( ( x 0 , x 1 , x 2 ) ) = N K ( x 0 ) + μ N K ( x 1 ) + μ 1 N K ( x 2 ) T K ( x 0 x 1 x 2 ) ,
and trace T ( x ) = T K ( x 0 ) . Moreover, we have
x = ( σ ( x 0 ) σ 2 ( x 0 ) x 1 x 2 , μ 1 σ ( x 2 ) σ 2 ( x 2 ) x 0 x 1 , μ σ ( x 1 ) σ 2 ( x 1 ) x 2 x 0 ) .
If μ F × , then D = ( K / F , σ , μ ) is an associative cyclic algebra over F of degree three and J ( K , μ ) D + is a special cubic Jordan algebra. It is well known that the isomorphism G : D + = ( K / F , σ , μ ) + J ( K , μ ) is given by
x 0 + x 1 z + x 2 z 2 ( x 0 , σ ( x 1 ) , μ σ 2 ( x 2 ) ) .
However, if μ K F , then the map G : D + J ( K , μ ) is not an algebra isomorphism between ( K / F , σ , μ ) + and J ( K , μ ) , where now ( K / F , σ , μ ) is a non-associative cyclic algebra, since σ ( μ ) μ . However, for μ K F , the map G : D + J ( K , μ ) still yields an isometry of norms, since
N ( ( x 0 , σ ( x 1 ) , μ σ 2 ( x 2 ) ) = N K ( x 0 ) + μ N K ( x 1 ) + μ 1 N K ( x 2 ) μ T K ( x 0 σ ( x 1 ) σ ( x 2 ) ) = N D ( ( x 0 , x 1 , x 2 ) ) ;
hence, the norms of the two nonisomorphic non-associative algebras D + = ( K / F , σ , μ ) + and J ( K , μ ) are isometric.

6. Conclusions

We looked at the following canonical question: “what happens if we choose the element μ that is used in the first Tits construction J ( A , μ ) in A × instead of in F × ?” We showed that the basic ingredients for an interesting theory are in place: our new algebras J ( A , μ ) carry maps that can be understood as generalizations of the classical norms and traces, and that behave surprisingly similar to the norms and traces of their classical counterparts; we have a function N on J ( A , μ ) that extends the cubic norm of A (however, it has values in A), a trace function T : J ( A , μ ) F , and a quadratic map : J ( A , μ ) J ( A , μ ) . Operations like x y can easily be defined. Some of the main identities from the classical setup hold (Theorems 1 and 2), some others hold only for some elements, e.g., Lemmas 2 and 3, Corollaries 1 and 2, but not in general, and some hold if—and only if— μ F × (Proposition 2, Theorem 7), i.e., they hold only in the classical case.
It seems a hard problem to check when the algebras J ( A , μ ) are division algebras. It would also be interesting to compute their automorphisms; however, we expect the automorphism group to be “small”. Here is one indication as to why this is the case: For Albert algebras over fields F of characteristic not 2 or 3, we know that the similarities of their norms are given either by scalar multiplications or the U operators [4]. Using Theorem 8 (iii), we see that for J ( A , μ ) with μ A × F , scalar multiplications still give similarities; the U-operators, however, do not.
Even partial results on automorphisms or similarities could give an insight on what is happening in this general context, and it would be interesting to address questions of whether there are inner automorphisms, whether there are cubic subfields fixed by automorphisms like in the classical case [2], etc.
The fact that two nonisomorphic algebras D + = ( K / F , σ , μ ) + and J ( K , μ ) have isometric norms is an example of how rich the structure theory for non-associative algebras really is (Section 4).
This is an exploratory paper, but our results show that the algebras J ( A , μ ) obtained via a generalized first Tits construction merit a closer look. As one referee pointed out, they also show the weaknesses of the language that we have at our disposal, which describes highly non-associative structures.

7. Materials and Methods

We used classical methods from algebra.

Author Contributions

Conceptualization, S.P.; Methodology, S.P. and T.M.; Investigation, S.P. and T.M.; Writing—Original Draft Preparation, S.P. and T.M.; Writing—Review and Editing, S.P.; Supervision, S.P. All authors have read and agreed to the published version of the manuscript.

Funding

This paper was written while the second author was a visitor at the University of Ottawa. The second author acknowledges support for her stay from the Centre de Recherches Mathématiques for giving a colloquium talk, and from Monica Nevins’ NSERC Discovery Grant RGPIN-2020-05020.

Data Availability Statement

The data presented in this study are available in article.

Acknowledgments

The second author would like to thank the Department of Mathematics and Statistics for its hospitality. The authors thank the anonymous referees for their valuable comments which greatly helped improve the paper and write the conclusions section.

Conflicts of Interest

The author has no relevant financial or non-financial interests to disclose.

References

  1. Knus, M.A.; Merkurjev, A.; Rost, M.; Tignol, J.-P. The Book of Involutions; AMS Colloquium Publications: Providence, RI, USA, 1998; Volume 44. [Google Scholar]
  2. Thakur, M. On R-triviality of F4. Isr. J. Math. 2021, 244, 145–161. [Google Scholar] [CrossRef]
  3. Thakur, M. On R-triviality of F4, II. Münster J. Math. 2021, 14, 497–507. [Google Scholar]
  4. Thakur, M. Automorphisms of Albert algebras and a conjecture of Tits and Weiss II. Trans. Amer. Math. Soc. 2019, 372, 4701–4728. [Google Scholar] [CrossRef]
  5. Thakur, M. The cyclicity problem for Albert algebras. Isr. J. Math. 2021, 241, 139–145. [Google Scholar] [CrossRef]
  6. Garibaldi, S.; Petersson, H.P.; Racine, M.L. Albert algebras over Z and other rings. Forum. Math. Sigma 2023, 11. [Google Scholar] [CrossRef]
  7. Sandler, R. Autotopism groups of some finite nonassociative algebras. AMS J. Math. 1962, 84, 239–264. [Google Scholar] [CrossRef]
  8. Brown, C.; Pumplün, S. Nonassociative cyclic extensions of fields and central simple algebras. J. Pure Appl. Algebra 2019, 223, 2401–2412. [Google Scholar] [CrossRef]
  9. Pumplün, S. The automorphisms of generalized cyclic Azumaya algebras. J. Pure Appl. Algebra 2021, 225, 106540. [Google Scholar] [CrossRef]
  10. Steele, A. Nonassociative cyclic algebras. Isr. J. Math. 2014, 200, 361–387. [Google Scholar] [CrossRef]
  11. Steele, A. Some New Classes of Algebras. Ph.D. Thesis, University of Nottingham, Nottingham, UK, 2013. Available online: http://eprints.nottingham.ac.uk/13934/1/PhdthesisFinal.pdf (accessed on 25 March 2024).
  12. Pumplün, S.; Unger, T. Space-time block codes from nonassociative division algebras. Adv. Math. Commun. 2011, 5, 609–629. [Google Scholar] [CrossRef]
  13. Steele, A.; Pumplün, S.; Oggier, F. MIDO space-time codes from associative and non-associative cyclic algebras. In Proceedings of the 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, 3–7 September 2012; pp. 192–196. [Google Scholar]
  14. Schafer, R.D. Forms permitting composition. Adv. Math. 1970, 4, 127–148. [Google Scholar] [CrossRef]
  15. McCrimmon, K. A Taste of Jordan Algebras; Springer: New York, NY, USA, 2004. [Google Scholar]
  16. Thakur, M. Automorphisms of Albert algebras and a conjecture of Tits and Weiss. Trans. Amer. Math. 2013, 365, 3041–3068. [Google Scholar] [CrossRef]
  17. Petersson, H.-P.; Racine, M.-L. Jordan algebras of degree 3 and the Tits process. J. Algebra 1986, 98, 211–243. [Google Scholar] [CrossRef]
  18. Jacobson, N. Structure and Representations of Jordan Algebras; AMS. Providence, AMS. Colloquium Publications: Providence, RI, USA, 1968; Volume XXXIX. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Moran, T.; Pumpluen, S. A Generalization of the First Tits Construction. Axioms 2024, 13, 299. https://doi.org/10.3390/axioms13050299

AMA Style

Moran T, Pumpluen S. A Generalization of the First Tits Construction. Axioms. 2024; 13(5):299. https://doi.org/10.3390/axioms13050299

Chicago/Turabian Style

Moran, Thomas, and Susanne Pumpluen. 2024. "A Generalization of the First Tits Construction" Axioms 13, no. 5: 299. https://doi.org/10.3390/axioms13050299

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop