Next Article in Journal
A Novel Neighborhood Granular Meanshift Clustering Algorithm
Previous Article in Journal
Variational Problems and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Higher-Order Associativity in Field Algebras

Department of Mathematics Education, Hongik University, 94 Wausan-ro, Mapo-gu, Seoul 04066, Republic of Korea
Mathematics 2023, 11(1), 206; https://doi.org/10.3390/math11010206
Submission received: 20 November 2022 / Revised: 23 December 2022 / Accepted: 26 December 2022 / Published: 31 December 2022

Abstract

:
Field algebras were defined by Bakalov and Kac as an associative analogue of vertex algebras. We define the notion of higher-order associativity for field algebras and construct examples to show that higher-order associativity imposes a strictly stronger condition on field algebras than lower-order associativity.
MSC:
17B99; 17B69; 16Y99; 16W60; 81R10

1. Introduction

Vertex algebras were defined by Borcherds in the study of the monstrous moonshine [1]. Vertex algebras, while the product map is allowed to have a meromorphic singularity, are analogous to unital commutative associative algebras with a group action [2,3]. Such an algebra of quantum fields, known as the operator product expansion, was first studied in physics [4,5], and the notion of vertex algebras gives a mathematical formulation of the chiral algebras in two-dimensional conformal field theories [6,7].
Field algebras were introduced by Bakalov and Kac as an associative analogue of vertex algebras [8], and similar notions were studied [9,10]. Examples of field algebras include quantum vertex operator algebras [11] and the smash product of a vertex algebra and its finite automorphism group [8]; they give some noncommutative generalizations of vertex algebras.
We first introduce some notation and give a definition of a field algebra. Let V be a vector space over C . Let V [ [ x ] ] and V ( ( x ) ) be the vector spaces of formal power series and the formal Laurent series in x with coefficients in V , respectively. Consider a bilinear map V × V V ( ( x ) ) , denoted by ( a , b ) a x b V ( ( x ) ) . In other words, for a , b V ,
a x b = n Z x 1 n a ( n ) b , with a ( n ) b V ,
where each map · ( n ) · : V × V V is bilinear, and for each a , b V , a ( n ) b = 0 eventually n . By abuse of notation, a linear map is understood to act on a formal series by acting on the coefficients. For example,
a x ( b y c ) = m , n Z x 1 m y 1 n a ( m ) ( b ( n ) c ) V ( ( x ) ) ( ( y ) ) , ( a x y b ) y c = m , n Z ( x y ) 1 m y 1 n ( a ( m ) b ) ( n ) c V ( ( y ) ) ( ( x y ) ) .
Note V ( ( x ) ) ( ( y ) ) and V ( ( y ) ) ( ( x y ) ) are both modules over C [ [ x , y ] ] and contain a common submodule V [ [ x , y ] ] . If a x b V [ [ x ] ] for some a , b V ; then a x b | x = 0 V denotes the evaluation at x = 0 , namely, the constant term a ( 1 ) b .
Definition 1.
A field algebra is a vector space V over C with an identity 1 V and a bilinear map V × V V ( ( x ) ) ,   ( a , b ) a x b V ( ( x ) ) , satisfying the following properties:
(i)
(identity) For every a V , 1 x a = a , and a x 1 V [ [ x ] ] with a x 1 | x = 0 = a .
(ii)
(associativity) For every a , b , c V , there exists N N (depending on a , b , c ) , such that the equality
( x y ( x y ) ) N a x ( b y c ) = ( x y ( x y ) ) N ( a x y b ) y c
holds in V [ [ x , y ] ] .
The notation is chosen so that it expresses the analogy between field algebras and the unital associative algebras with a group action a a x , as first suggested by Borcherds for vertex algebras. The fact that Definition 1 is equivalent to the definition in [8] is explained in [12]. We use Definition 1 in order to make the present article self contained.
We now give one aspect of the associativity of field algebras that differs from the usual associative algebras: it is the general associative law. For example, consider replacing condition (ii) in Definition 1 by condition
(ii′)
(4-associativity) For every a , b , c , d V , the following elements
a x ( b y ( c z d ) ) V ( ( x ) ) ( ( y ) ) ( ( z ) ) a x ( ( b y z c ) z d ) V ( ( x ) ) ( ( z ) ) ( ( y z ) ) ( a x y b ) y ( c z d ) V ( ( y ) ) ( ( x y , z ) ) ( a x z ( b y z c ) ) z d V ( ( z ) ) ( ( x z ) ) ( ( y z ) ) ( ( a x y b ) y z c ) z d V ( ( z ) ) ( ( y z ) ) ( ( x y ) ) ,
if multiplied by x y z ( x y ) ( y z ) ( x z ) N for sufficiently large N N , belong to the subspace V [ [ x , y , z ] ] and are equal.
More generally, we can define
(ii″)
(n-associativity) For every a 1 , , a n V , the formal expressions corresponding to all binary bracketings of a 1 , , a n satisfy the analogous condition.
We can define -associativity” to mean that n-associativity holds for all n 3 . If we let F n denote the class of field algebras that are n-associative, then we have
F 3 F 4 F 5 with F = n 3 F n .
For the usual associative algebras as well as vertex algebras, 3-associativity automatically implies -associativity. A natural question that arises in the case of field algebras is whether the higher-order associativity conditions are strictly stronger for higher n . With the restrictions imposed by the formal calculus, one may wonder whether requiring n-associativity for high enough n implies -associativity. Although F n + 1 is heuristically stronger than F n , no concrete example of field algebras showing their difference has been rigorously written down.
The main result of this study is the formulation of n-associativity (Section 3) and the construction of examples (Theorem 2) to show that unlike the ordinary associative algebras or vertex algebras, we indeed have proper inclusions
F n F n + 1
for all n 3 .

2. Prefield Algebras

In this section, we fix notations and introduce some terminology.
Lemma 1.
Let V be a field algebra. Then, there exists a linear map T : V V , called the translation operator, with the following properties for every a , b V .
(i)
a x 1 = e x T a = k 0 x k T ( k ) a , with the notation T ( k ) = T k / k ! .
(ii)
( T a ) x b = x ( a x b ) .
(iii)
T ( a x b ) = ( T a ) x b + a x ( T b ) .
Proof. 
We define the map T : V V by
T a = x ( a x 1 ) | x = 0 = a ( 2 ) 1
when a ( n ) b is given by (1). In particular, T 1 = 0 . If (ii) and (iii) hold, then a x 1 V [ [ x ] ] should satisfy T ( a x 1 ) = x ( a x 1 ) with a x 1 | x = 0 = a , and thus (i) follows. Hence, it suffices to show (ii) and (iii). Let a , b V . By Definition 1, there exists N N , such that
( t x ( t + x ) ) N ( a t 1 ) x b = ( t x ( t + x ) ) N a t + x ( 1 x b ) = ( t x ( t + x ) ) N a t + x b
in V [ [ t , x ] ] with ( t + x ) N a t + x b V [ [ t + x ] ] . Hence, both sides of (3) belong to ( t x ) N V [ [ t , x ] ] , and we must have
( t + x ) N ( a t 1 ) x b = ( t + x ) N a t + x b
in V [ [ t , x ] ] . By applying ( t + x ) t to (4), we obtain
N ( t + x ) N ( a t 1 ) x b + ( t + x ) N + 1 t ( a t 1 ) x b = N ( t + x ) N a t + x b + ( t + x ) N + 1 t ( a t + x b ) ,
where the first terms cancel by (4). Hence,
( t + x ) N + 1 t ( a t 1 ) x b = ( t + x ) N + 1 t ( a t + x b ) ,
and setting t = 0 , we obtain x N + 1 ( T a ) x b = x N + 1 t ( a t + x b ) | t = 0 = x N + 1 x ( a x b ) , and, therefore, ( T a ) x b = x ( a x b ) . Similarly, we have M N , such that
( t x ( t + x ) ) M ( a x b ) t 1 = ( t x ( t + x ) ) M a t + x ( b t 1 )
in V [ [ t , x ] ] with x M a x b V [ [ x ] ] , and, thus, x M ( a x b ) t 1 V [ [ t , x ] ] . Hence,
x M ( a x b ) t 1 = x M a t + x ( b t 1 )
in V [ [ t , x ] ] , and applying t to both sides, we obtain
x M t ( ( a x b ) t 1 ) = x M t ( a t + x ( b t 1 ) ) = x M x ( a t + x ( b t 1 ) ) + a t + x t ( b t 1 ) .
Setting t = 0 , we have T ( a x b ) = x ( a x b ) + a x ( T b ) = ( T a ) x b + a x ( T b ) .
We define the following notion for later convenience:
Definition 2.
A prefield algebra is a vector space V over C with an identity 1 V , a translation operator T : V V , and a bilinear map · x · : V × V V ( ( x ) ) satisfying the following properties.
(i)
(identity) For every a V , 1 x a = a , and a x 1 = e x T a .
(ii)
(translation covariance) For every a , b V ,
( T a ) x b = T ( a x b ) a x ( T b ) = x ( a x b ) .
By Lemma 1, a field algebra is a prefield algebra. A prefield algebra is a field algebra if it satisfies the associativity axiom in Definition 1.

3. n-Associativity

The associative axiom in Definition 1 can be generalized to the associativity of n vectors. We define some notations that are used throughout the paper.

3.1. Notation B n

We denote by B n the set of all binary bracketings of length n, for n 1 . For example, for n = 4 , we have
( ( ) ) , ( ( ) ) , ( ) ( ) , ( ( ) ) , ( ( ) ) .
It is well known that the cardinality of B n is given by the Catalan number C n 1 [13]. For B B n , let B ( x 1 , , x n ) denote the corresponding bracketing of the n letters x 1 , , x n . For example, if B = ( ( ) ) , then B ( x 1 , x 2 , x 3 , x 4 ) = x 1 ( ( x 2 x 3 ) x 4 ) . We denote by B n ( x 1 , , x n ) the set of B ( x 1 , , x n ) for all B B n .
If B ( x 1 , , x n ) B n ( x 1 , , x n ) , it can be represented by an ordered full binary tree [14], which has n nodes (leaves) x 1 , , x n having no children, and every other node has both a left child and a right child. There exists a unique node (the root) that has no parent, having the rest of the nodes as its descendants. (When n = 1 , the single node is both the root and a leaf). We label the nodes as follows: When a node w has the left child u and the right child v, we write
w = u v
and say that u and v are siblings. Hence, every node is expressed as a product of leaves, and this notation for a node coincides with the subtree spanned by the node and its descendants. We identify the two concepts. For example, in x 1 ( ( x 2 x 3 ) x 4 ) B 4 ( x 1 , , x 4 ) , the node ( x 2 x 3 ) x 4 having descendants x 2 x 3 , x 2 ,   x 3 , x 4 can be considered as the subtree ( x 2 x 3 ) x 4 B 3 ( x 2 , x 3 , x 4 ) . In particular, the root of a tree is considered to be the tree itself, and we can regard (5) as defining the product w of two trees u and v having disjointed sets of leaves.
Let B ( x 1 , , x n ) B n ( x 1 , , x n ) . Suppose we have a set of nodes u 1 , , u m in B ( x 1 , , x n ) that are disjoint as subtrees. The contraction of B ( x 1 , , x n ) by the nodes u 1 , , u m is the tree obtained by replacing each subtree u j by the last leaf x i j of u j . For example, the contraction of ( x 1 x 2 ) ( x 3 ( x 4 x 5 ) ) by the nodes x 1 x 2 and x 3 ( x 4 x 5 ) is the tree x 2 x 5 B 2 ( x 2 , x 5 ) . In defining the contraction, we do not lose any generality if we assume that the leaves corresponding to u 1 , , u m give a partition of the set { x 1 , , x n } , as we can assume some of the u j are leaves themselves without affecting the contraction.

3.2. Maps X B and Y B

Let V be a prefield algebra, and let B B n . We now consider x 1 , , x n as formal variables, and define X B ( x 1 , , x n ) and Y B ( x 1 , , x n ) as multilinear maps on V × n depending on the formal variables x 1 , , x n , with the following properties:
(i)
For x 1 B 1 ( x 1 ) ,
X x 1 ( a 1 ) = a 1
for all a 1 V .
(ii)
When the trees u and v have disjoint sets of leaves x 1 , , x m and x m + 1 , , x n , respectively, then
X u v ( a 1 , , a n ) = X u ( a 1 , , a m ) x m x n X v ( a m + 1 , , a n )
for all a 1 , , a n V , where x m and x n are the last leaves of u and v , respectively. Here, we regard u B m ( x 1 , , x m ) , v B n m ( x m + 1 , , x n ) and u v B n ( x 1 , , x n ) .
(iii)
For a 1 , , a n V and B B n , we define
Y B ( x 1 , , x n ) ( a 1 , , a n ) = X B ( x 1 , , x n ) ( a 1 , , a n ) x n 1 = e x n T X B ( x 1 , , x n ) ( a 1 , , a n ) .
The result of setting x n = 0 in (7) is denoted by
Y B ( x 1 , , x n 1 , 0 ) ( a 1 , , a n ) = X B ( x 1 , , x n 1 , 0 ) ( a 1 , , a n ) .
Example 1.
Let B = ( ) ( ) . Let a 1 , , a 4 be vectors in a prefield algebra V . We have
X x 1 ( a 1 ) = a 1 , , X x 4 ( a 4 ) = a 4 ,
and by (6),
X x 1 x 2 ( a 1 , a 2 ) = a 1 x 1 x 2 a 2 X x 3 x 4 ( a 3 , a 4 ) = a 3 x 3 x 4 a 4 ,
and
X ( x 1 x 2 ) ( x 3 x 4 ) ( a 1 , a 2 , a 3 , a 4 ) = ( a 1 x 1 x 2 a 2 ) x 2 x 4 ( a 3 x 3 x 4 a 4 ) , Y ( x 1 x 2 ) ( x 3 x 4 ) ( a 1 , a 2 , a 3 , a 4 ) = ( a 1 x 1 x 2 a 2 ) x 2 x 4 ( a 3 x 3 x 4 a 4 ) x 4 1 .
Setting x 4 = 0 , we have
Y ( x 1 x 2 ) ( x 3 0 ) ( a 1 , a 2 , a 3 , a 4 ) = ( a 1 x 1 x 2 a 2 ) x 2 ( a 3 x 3 a 4 ) .
Proceeding in the same way for the other elements in B 4 , we obtain
Y x 1 ( x 2 ( x 3 0 ) ) ( a 1 , a 2 , a 3 , a 4 ) = a 1 x 1 ( a 2 x 2 ( a 3 x 3 a 4 ) ) Y x 1 ( ( x 2 x 3 ) 0 ) ( a 1 , a 2 , a 3 , a 4 ) = a 1 x 1 ( ( a 2 x 2 x 3 a 3 ) x 3 a 4 ) Y ( x 1 ( x 2 x 3 ) ) 0 ( a 1 , a 2 , a 3 , a 4 ) = ( a 1 x 1 x 3 ( a 2 x 2 x 3 a 3 ) ) x 3 a 4 Y ( ( x 1 x 2 ) x 3 ) 0 ( a 1 , a 2 , a 3 , a 4 ) = ( ( a 1 x 1 x 2 a 2 ) x 2 x 3 a 3 ) x 3 a 4 .
When n 2 , we have Y x 1 ( a 1 ) = a 1 x 1 1 and Y x 1 x 2 ( a 1 , a 2 ) = ( a 1 x 1 x 2 a 2 ) x 2 1 , and thus Y 0 ( a 1 ) = a 1 and Y x 1 0 ( a 1 , a 2 ) = a 1 x 1 a 2 .
The dependency of X B ( x 1 , , x n ) ( a 1 , , a n ) on the formal variables x 1 , , x n is only through their differences x i x j for 1 i < j n , and we can thus recover X B ( x 1 , , x n ) ( a 1 , , a n ) from X B ( x 1 , , x n 1 , 0 ) ( a 1 , , a n ) by replacing x i with x i x n for 1 i n 1 . We thus write (7) in the form
Y B ( x 1 , , x n ) ( a 1 , , a n ) = e x n T Y B ( x 1 x n , , x n 1 x n , 0 ) ( a 1 , , a n ) .
Lemma 2.
Let V be a prefield algebra. Let B B n , and let u 1 , , u m be nodes in B ( x 1 , , x n ) whose leaves give a partition of { x 1 , , x n } . Let x i 1 , , x i m be the last leaves of u 1 , , u m , respectively, with i m = n . Let B ¯ ( x i 1 , , x i m ) B m ( x i 1 , , x i m ) be the contraction of B ( x 1 , , x n ) by the nodes u 1 , , u m . Then, we have
X B ( x 1 , , x n ) ( a 1 , , a n ) = X B ¯ ( x i 1 , , x i m ) X u 1 ( a 1 , , a i 1 ) , , X u m ( a ( i m 1 + 1 ) , , a i m )
for all a 1 , , a n V .
Proof. 
We can recursively define any function f on the set of all nodes of an ordered full binary tree by defining its values on the leaves and by defining the value f ( w ) on a node w from the values f ( u ) and f ( v ) on its children u and v . Let a 1 , , a n V and B B n . We define a function F = ( F 1 , F 2 ) on the set of nodes of B ( x 1 , , x n ) in such a way. The value F ( u ) = ( F 1 ( u ) , F 2 ( u ) ) on each node is a tuple, where F 1 ( u ) is some formal expression involving elements a 1 , , a n V , and F 2 ( u ) is always one of the formal variables x 1 , , x n . For one of the leaves, let
F ( x 1 ) = ( a 1 , x 1 ) , , F ( x n ) = ( a n , x n ) .
For every node w = u v with children u and v , if F ( u ) = ( L , x l ) and F ( v ) = ( R , x r ) , let
F ( w ) = ( L x l x r R , x r ) .
It follows that for every node w of B ( x 1 , , x n ) with leaves { x j , , x k } , we have F 1 ( w ) = X w ( a j , , a k ) , and F 2 ( w ) = x k . In particular, F 1 ( o ) = X B ( x 1 , , x n ) ( a 1 , , a n ) where o is the root of B ( x 1 , , x n ) . From the recursive definition, F 1 ( o ) is equivalently computed starting from
F ( u 1 ) = ( X u 1 ( a 1 , , a i 1 ) , x i 1 ) , , F ( u m ) = ( X u m ( a ( i m 1 + 1 ) , , a i m ) , x i m )
on the new tree B ¯ ( x i 1 , , x i m ) having x i 1 , , x i m as leaves, and the lemma follows. □
From Lemma 2, it follows that we have
Y B ( x 1 , , x n ) ( a 1 , , a n ) = Y B ¯ ( x i 1 , , x i m ) ( X u 1 ( a 1 , , a i 1 ) , , X u m ( a ( i m 1 + 1 ) , , a i m ) )
in the same notation, by applying ( · ) x n 1 on both sides of (9).
Let B ( x 1 , , x n ) B n ( x 1 , , x n ) for n 2 . Suppose leaves x l and x l + 1 are siblings for some 1 l n 1 . Let B l ( x 1 , , x ^ l , , x n ) be the contraction of B ( x 1 , , x n ) by the node x l x l + 1 , where x ^ l means x l is omitted. By (9) and (10),
X B ( x 1 , , x n ) ( a 1 , , a n ) = X B l ( x 1 , , x ^ l , , x n ) ( a 1 , , X x l x l + 1 ( a l , a l + 1 ) , , a n ) , Y B ( x 1 , , x n ) ( a 1 , , a n ) = Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , X x l x l + 1 ( a l , a l + 1 ) , , a n ) .
The relationships (11) give another recursive description of the maps X B and Y B for B B n starting with X x 1 ( a 1 ) = a 1 , X x 1 x 2 ( a 1 , a 2 ) = a 1 x 1 x 2 a 2 and Y x 1 ( a 1 ) = e x 1 T a 1 for all a 1 , a 2 V , because every tree B ( x 1 , , x n ) B n ( x 1 , , x n ) for n 2 contains at least one pair of leaves x l and x l + 1 , which are siblings.
For B B n and a vector space V over C , let us define the vector spaces V B ( x 1 , , x n ) with the following properties:
(i)
For x 1 B 1 ( x 1 ) , V x 1 = V .
(ii)
For B ( x 1 , , x n ) B n ( x 1 , , x n ) , let { x l 1 , x ( l 1 + 1 ) } , , { x l m , x ( l m + 1 ) } be all pairs of siblings among the leaves of B ( x 1 , , x n ) . Let B ¯ ( x 1 , , x ^ l 1 , , x ^ l m , , x n ) be the contraction of B ( x 1 , , x n ) by the nodes x l 1 x ( l 1 + 1 ) , , x l m x ( l m + 1 ) . Then,
V B ( x 1 , , x n ) = V B ¯ ( x 1 , , x ^ l 1 , , x ^ l m , , x n ) ( ( x l 1 x ( l 1 + 1 ) , , x l m x ( l m + 1 ) ) ) .
It follows from Lemma 2 that we have
X B ( x 1 , , x n ) : V × n V B ( x 1 , , x n ) , Y B ( x 1 , , x n ) : V × n V B ( x 1 , , x n ) [ [ x n ] ] .
We can recursively verify that V B ( x 1 , , x n ) contains V [ [ x 1 x n , x 2 x n , , x n 1 x n ] ] as a subspace. In particular, C B ( x 1 , , x n ) is an algebra over C [ [ x 1 x n , x 2 x n , , x n 1 x n ] ] , and V B ( x 1 , , x n ) is a module over C B ( x 1 , , x n ) . Hence, V B ( x 1 , , x n ) [ [ x n ] ] contains V [ [ x 1 , , x n ] ] as a subspace. It is a module over C B ( x 1 , , x n ) [ [ x n ] ] that contains C [ [ x 1 , , x n ] ] as a subalgebra.
Example 2.
For a vector space V over C , we have V x 2 x 4 = V ( ( x 2 x 4 ) ) , and
V ( x 1 x 2 ) ( x 3 x 4 ) = V x 2 x 4 ( ( x 1 x 2 , x 3 x 4 ) ) = V ( ( x 2 x 4 ) ) ( ( x 1 x 2 , x 3 x 4 ) ) .
Hence, V ( x 1 x 2 ) ( x 3 x 4 ) contains V [ [ x 2 x 4 ] ] [ [ x 1 x 2 , x 3 x 4 ] ] = V [ [ x 1 x 4 , x 2 x 4 , x 3 x 4 ] ] , and it is a module over C ( x 1 x 2 ) ( x 3 x 4 ) = C ( ( x 2 x 4 ) ) ( ( x 1 x 2 , x 3 x 4 ) ) . If V is a prefield algebra and a 1 , a 2 , a 3 , a 4 V ,
X ( x 1 x 2 ) ( x 3 x 4 ) ( a 1 , a 2 , a 3 , a 4 ) = ( a 1 x 1 x 2 a 2 ) x 2 x 4 ( a 3 x 3 x 4 a 4 ) V ( x 1 x 2 ) ( x 3 x 4 ) , Y ( x 1 x 2 ) ( x 3 x 4 ) ( a 1 , a 2 , a 3 , a 4 ) V ( x 1 x 2 ) ( x 3 x 4 ) [ [ x 4 ] ] .
V ( x 1 x 2 ) ( x 3 x 4 ) [ [ x 4 ] ] is a module over C ( x 1 x 2 ) ( x 3 x 4 ) [ [ x 4 ] ] and contains
V [ [ x 1 x 4 , x 2 x 4 , x 3 x 4 ] ] [ [ x 4 ] ] = V [ [ x 1 , x 2 , x 3 , x 4 ] ]
as a submodule over C [ [ x 1 , x 2 , x 3 , x 4 ] ] .

3.3. Definition of n-Associativity

Definition 3.
Let V be a prefield algebra. For n 1 , we say that the vectors a 1 , , a n V are n-associative if there exist Ψ ( x 1 , , x n ) V [ [ x 1 , , x n ] ] and N N such that
1 i < j n ( x i x j ) N Y B ( x 1 , , x n ) ( a 1 , , a n ) = Ψ ( x 1 , , x n )
for all B B n . We say that V is n-associative if every sequence of n vectors in V is n-associative. V is called ∞-associative if it is n-associative for every n 3 .
Every prefield algebra is automatically 1 and 2-associative. The reason that Definition 3 includes the cases n 2 is for later convenience. We use the notation s n ( x 1 , , x n ) to denote
s n ( x 1 , , x n ) = 1 i < j n ( x i x j )
with s 1 ( x 1 ) = 1 and any empty product is defined as 1 . Then,
s n ( x 1 , , x n 1 , 0 ) = k = 1 n 1 x k 1 i < j n 1 ( x i x j ) ,
and
s n ( x 1 , , x n ) = s n ( x 1 x n , , x n 1 x n , 0 ) .
The following lemma shows that we can set x n = 0 in Definition 3 for simplicity.
Lemma 3.
Let V be a prefield algebra. The vectors a 1 , , a n V , and n 1 are n-associative if and only if there exist Φ ( x 1 , , x n 1 ) V [ [ x 1 , , x n 1 ] ] ( Φ V if n = 1 ) , and N N such that
s n ( x 1 , , x n 1 , 0 ) N Y B ( x 1 , , x n 1 , 0 ) ( a 1 , , a n ) = Φ ( x 1 , , x n 1 )
for all B B n .
Proof. 
If a 1 , , a n V are n-associative, Equation (13) holds by setting x n = 0 in (12). Conversely, suppose (13) holds. By replacing x i with x i x n for 1 i n 1 , we have
s n ( x 1 , , x n ) N Y B ( x 1 x n , , x n 1 x n , 0 ) ( a 1 , , a n ) = Φ ( x 1 x n , , x n 1 x n )
for all B B n . By (8), we see that
s n ( x 1 , , x n ) N Y B ( x 1 , , x n ) ( a 1 , , a n ) = s n ( x 1 , , x n ) N e x n T Y B ( x 1 x n , , x n 1 x n , 0 ) ( a 1 , , a n ) = e x n T s n ( x 1 , , x n ) N Y B ( x 1 x n , , x n 1 x n , 0 ) ( a 1 , , a n ) = e x n T Φ ( x 1 x n , , x n 1 x n )
for all B B n , and (12) holds with Ψ ( x 1 , , x n ) = e x n T Φ ( x 1 x n , , x n 1 x n ) .
Let V be a prefield algebra. The condition (13) in Lemma 3 with n = 3 is precisely the associativity axiom in Definition 1, and (13) with n = 4 is the condition of 4-associativity stated in Section 1.
Lemma 4.
Let V be a prefield algebra. Suppose a 1 , , a n V , and n 2 are n-associative. Then, for 1 l n 1 , the elements a 1 , , a l ( m ) a l + 1 , , a n are ( n 1 ) -associative for each m Z , where · ( m ) · is given by (1).
Proof. 
For 1 l n 1 , let B n , l ( x 1 , , x n ) be the set of all B ( x 1 , , x n ) B n ( x 1 , , x n ) such that the leaves x l and x l + 1 are siblings. Let B ( x 1 , , x n ) B n , l ( x 1 , , x n ) . We have
X x l x l + 1 ( a l , a l + 1 ) = a l x l x l + 1 a l + 1 = m Z ( x l x l + 1 ) 1 m a l ( m ) a l + 1 ,
and by (11),
Y B ( x 1 , , x n ) ( a 1 , , a n ) = m Z ( x l x l + 1 ) 1 m Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , a l ( m ) a l + 1 , , a n )
where B l ( x 1 , , x ^ l , , x n ) B n 1 ( x 1 , , x ^ l , , x n ) is the contraction of B ( x 1 , , x n ) by x l x l + 1 . Suppose we have (12) for a 1 , , a n . We have Ψ ( x 1 , , x n ) V [ [ x 1 , , x n ] ] and N N such that
Ψ ( x 1 , , x n ) = s n ( x 1 , , x n ) N Y B ( x 1 , , x n ) ( a 1 , , a n ) = m Z ( x l x l + 1 ) N 1 m 1 i < l ( x i x l ) N l + 1 < j n ( x l x j ) N × s n 1 ( x 1 , , x ^ l , , x n ) N Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , a l ( m ) a l + 1 , , a n )
for all B ( x 1 , , x n ) B n , l ( x 1 , , x n ) , where N 1 m 0 in the sum. Let 1 i n be such that i { l , l + 1 } . The last line in (14) is independent of x l . By writing x l x j = ( x l x i ) + ( x i x j ) for j { i , l } in (14), we obtain an expansion of Ψ ( x 1 , , x n ) V [ [ x 1 , , x n ] ] in V [ [ x 1 , , x ^ l , , x n ] ] [ [ x l x i ] ] , which shows Ψ ( x 1 , , x n ) ( x l x i ) N V [ [ x 1 , , x n ] ] . Hence, both sides of (14) as a power series in V [ [ x 1 , , x n ] ] contain the factor 1 i < l ( x i x l ) N l + 1 < j n ( x l x j ) N . By canceling this factor in (14), we obtain
Φ ( x 1 , , x n ) = m Z ( x l x l + 1 ) N 1 m s n 1 ( x 1 , , x ^ l , , x n ) N × Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , a l ( m ) a l + 1 , , a n )
for some Φ ( x 1 , , x n ) V [ [ x 1 , , x n ] ] . Expanding
Φ ( x 1 , , x n ) = k 0 ( x l x l + 1 ) k Φ k ( x 1 , , x ^ l , , x n )
for Φ k ( x 1 , , x ^ l , , x n ) V [ [ x 1 , , x ^ l , , x n ] ] , we have
s n 1 ( x 1 , , x ^ l , , x n ) N Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , a l ( m ) a l + 1 , , a n ) = Φ N 1 m ( x 1 , , x ^ l , , x n )
for all B ( x 1 , , x n ) B n , l ( x 1 , , x n ) , and the contractions B l ( x 1 , , x ^ l , , x n ) give all elements of B n 1 ( x 1 , , x ^ l , , x n ) .
Lemma 5.
Let V be a prefield algebra. Then,
Y B ( x 1 , , x n ) ( a 1 , , T a l , , a n ) = x l Y B ( x 1 , , x n ) ( a 1 , , a n )
for a 1 , , a n V and B B n with 1 l n and n 1 .
Proof. 
Let us show the claim by induction on n . For n = 1 , Y x 1 ( T a 1 ) = ( T a 1 ) x 1 1 = x 1 ( a 1 x 1 1 ) = x 1 Y x 1 ( a 1 ) . Consider the n > 1 case. If there exist siblings x i and x i + 1 such that l { i , i + 1 } , by (11) and the inductive hypothesis,
Y B ( x 1 , , x n ) ( a 1 , , T a l , , a n ) = Y B i ( x 1 , , x ^ i , , x n ) ( a 1 , , X x i x i + 1 ( a i , a i + 1 ) , , T a l , , a n ) = x l Y B i ( x 1 , , x ^ i , , x n ) ( a 1 , , X x i x i + 1 ( a i , a i + 1 ) , , a l , , a n ) = x l Y B ( x 1 , , x n ) ( a 1 , , a l , , a n ) .
It only remains to consider the case when x l has another leaf as a sibling. If x l and x l + 1 are siblings, by translation covariance,
Y B ( x 1 , , x n ) ( a 1 , , T a l , , a n ) = Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , ( T a l ) x l x l + 1 a l + 1 , , a n ) = Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , x l ( a l x l x l + 1 a l + 1 ) , , a n ) = x l Y B l ( x 1 , , x ^ l , , x n ) ( a 1 , , a l x l x l + 1 a l + 1 , , a n ) = x l Y B ( x 1 , , x n ) ( a 1 , , a l , , a n ) .
If x l 1 and x l are siblings, by the inductive hypothesis and translation covariance,
Y B ( x 1 , , x n ) ( a 1 , , T a l , , a n ) = Y B ( l 1 ) ( x 1 , , x ^ l 1 , x l , , x n ) ( a 1 , , a l 1 x l 1 x l ( T a l ) , , a n ) = Y B ( l 1 ) ( x 1 , , x ^ l 1 , x l , , x n ) ( a 1 , , ( T x l 1 ) ( a l 1 x l 1 x l a l ) , , a n ) = ( t l x l 1 ) Y B ( l 1 ) ( x 1 , , x ^ l 1 , t l , , x n ) ( a 1 , , a l 1 x l 1 x l a l , , a n ) | t l = x l = x l Y B ( l 1 ) ( x 1 , , x ^ l 1 , x l , , x n ) ( a 1 , , a l 1 x l 1 x l a l , , a n ) = x l Y B ( x 1 , , x n ) ( a 1 , , a l , , a n ) ,
and the lemma follows. □
Lemma 6.
Let V be a prefield algebra, and suppose a 1 , , a n V and n 1 are n-associative. Then, a 1 , , T a l , , a n are n-associative, for any 1 l n .
Proof. 
Suppose we have Ψ ( x 1 , , x n ) V [ [ x 1 , , x n ] ] and N N such that
Ψ ( x 1 , , x n ) = s n ( x 1 , , x n ) N Y B ( x 1 , , x n ) ( a 1 , , a n )
for all B B n . By applying s n ( x 1 , , x n ) x l to both sides, we get
s n ( x 1 , , x n ) x l Ψ ( x 1 , , x n ) = N ( x l s n ( x 1 , , x n ) ) s n ( x 1 , , x n ) N Y B ( x 1 , , x n ) ( a 1 , , a n ) + s n ( x 1 , , x n ) N + 1 x l Y B ( x 1 , , x n ) ( a 1 , , a n )
and by (15) and Lemma 5, we have
s n ( x 1 , , x n ) N + 1 Y B ( x 1 , , x n ) ( a 1 , , T a l , , a n ) = s n ( x 1 , , x n ) x l Ψ ( x 1 , , x n ) N ( x l s n ( x 1 , , x n ) ) Ψ ( x 1 , , x n )
for all B B n .
Lemma 7.
Let V be a prefield algebra, and suppose we have a 1 , , a n V , n 2 , with a i = 1 for some 1 i n . Then, they are n-associative if and only if a 1 , , a ^ i , , a n are ( n 1 ) -associative, where a ^ i means that a i is omitted.
Proof. 
The direct implication follows from Lemma 4 because a ( 1 ) 1 = 1 ( 1 ) a = a for any a V . Conversely, suppose a 1 , , a ^ i , , a n are ( n 1 ) -associative. We have Ψ ( x 1 , , x ^ i , , x n ) V [ [ x 1 , , x ^ i , , x n ] ] and N N such that
s n 1 ( x 1 , , x ^ i , , x n ) N Y B ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n ) = Ψ ( x 1 , , x ^ i , , x n )
for all B B n 1 . Let C ( x 1 , , x n ) B n ( x 1 , , x n ) and consider
s n 1 ( x 1 , , x ^ i , , x n ) N Y C ( x 1 , , x i , , x n ) ( a 1 , , 1 , , a n ) .
Because n 2 , x i is not the root in C ( x 1 , , x n ) ; hence, it is either a left child or a right child. If it is a left child, we have
w = x i v
for some nodes w , v in C ( x 1 , , x n ) , where v has leaves x i + 1 , , x j . Let C ¯ ( x 1 , , x i 1 , x j , , x n ) be the contraction of C ( x 1 , , x i , , x n ) by w , and let
C * ( x 1 , , x ^ i , , x n ) B n 1 ( x 1 , , x ^ i , , x n )
be the tree obtained by replacing the subtree w by the subtree v in C ( x 1 , , x n ) . Because
X w ( a i , a i + 1 , , a j ) = 1 x i x j X v ( a i + 1 , , a j ) = X v ( a i + 1 , , a j ) ,
by Lemma 2, we have
Y C ( x 1 , , x i , , x n ) ( a 1 , , 1 , , a n ) = Y C ¯ ( x 1 , , x i 1 , x j , , x n ) ( a 1 , , X w ( a i , a i + 1 , , a j ) , , a n ) = Y C ¯ ( x 1 , , x i 1 , x j , , x n ) ( a 1 , , X v ( a i + 1 , , a j ) , , a n ) = Y C * ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n )
and, therefore, Equation (17) equals
s n 1 ( x 1 , , x ^ i , , x n ) N Y C * ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n ) = Ψ ( x 1 , , x ^ i , , x n )
by (16). If x i is a right child, then
w = u x i
for some nodes w, u in C ( x 1 , , x n ) , where u has leaves x k , , x i 1 . Let C ¯ ( x 1 , , x k 1 , x i , , x n ) be the contraction of C ( x 1 , , x i , , x n ) by w , and let C * ( x 1 , , x ^ i , , x n ) be the tree obtained by replacing the subtree w by the subtree u in C ( x 1 , , x n ) . Because
X w ( a k , , a i 1 , a i ) = X u ( a k , , a i 1 ) x i 1 x i 1 = e ( x i 1 x i ) T X u ( a k , , a i 1 ) ,
we have, by Lemmas 2 and 5,
Y C ( x 1 , , x i , , x n ) ( a 1 , , 1 , , a n ) = Y C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , X w ( a k , , a i 1 , a i ) , , a n ) = Y C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , e ( x i 1 x i ) T X u ( a k , , a i 1 ) , , a n ) = e ( x i 1 x i ) x i Y C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , X u ( a k , , a i 1 ) , , a n ) .
Because u has leaves x k , , x i 1 , we obtain X C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , X u ( a k , , a i 1 ) , , a n ) from
X C ¯ ( x 1 , , x k 1 , x i 1 , , x n ) ( a 1 , , X u ( a k , , a i 1 ) , , a n ) = X C * ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n )
by replacing x j x i 1 to x j x i when x j is not a leaf of u. The variables x j for k j < i 1 only appear inside X u ( a k , , a i 1 ) in (18). Hence, we can replace x j to x j + x i 1 x i for all j J = { j j < k or j > i } in (18). For j , l J , x j x i 1 becomes x j x i , and x j x l is left-invariant. If n J , then
Y C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , X u ( a k , , a i 1 ) , , a n ) = e x n T X C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , X u ( a k , , a i 1 ) , , a n ) = e ( x i x i 1 ) T Y C * ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n ) | x j x j + x i 1 x i , j J ,
and if n J (if i = n ), e ( x i x i 1 ) T = e ( x n x n 1 ) T in (19). In both cases, we have
e ( x i 1 x i ) x i Y C ¯ ( x 1 , , x k 1 , x i , , x n ) ( a 1 , , X u ( a k , , a i 1 ) , , a n ) = e ( x i 1 x i ) x i Y C * ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n ) | x j x j + x i 1 x i , j J .
Because for any f ( x 1 , , x ^ i , , x n ) V [ [ x 1 , , x ^ i , , x n ] ] ,
e ( x i 1 x i ) x i f ( x 1 , , x ^ i , , x n ) | x j x j + x i 1 x i , j J = f ( x 1 , , x ^ i , , x n ) ,
Equation (17) also equals
s n 1 ( x 1 , , x ^ i , , x n ) N Y C ( x 1 , , x i , , x n ) ( a 1 , , 1 , , a n ) = e ( x i 1 x i ) x i ( ( s n 1 ( x 1 , , x ^ i , , x n ) N × Y C * ( x 1 , , x ^ i , , x n ) ( a 1 , , a ^ i , , a n ) ) | x j x j + x i 1 x i , j J ) = e ( x i 1 x i ) x i Ψ ( x 1 , , x ^ i , , x n ) | x j x j + x i 1 x i , j J = Ψ ( x 1 , , x ^ i , , x n )
and the lemma follows. □

4. F n F n + 1

Let F n be the class of prefield algebras that are n-associative. We now construct an example of a field algebra V belonging to F n but not to F n + 1 , n 3 . It is a simple example generated by a single element a .
Theorem 1.
Let n 3 . Let C [ T ] a be a free C [ T ] -module generated by an element a . Let A = T * ( C [ T ] a ) be the tensor algebra of C [ T ] a , a free associative C -algebra generated by C [ T ] a . We define a grading on A by setting deg a = 1 and deg T = 0 , so that
A = k 0 C [ T ] a k
and each A k = C [ T ] a k is a C [ T ] -module, where T acts as a derivation of A . Hence, C [ T ] acts on A k via the k-fold comultiplication map
Δ k : C [ T ] C [ T ] k
given by Δ k ( T ) = i = 1 k T i , with T i = 1 T 1 having T at the ith position, and T is the zero map on A 0 = C . We consider the ideal
I n + 2 = k n + 2 A k ,
consisting of all elements of degree n + 2 , which is closed under T , and define
V = A / I n + 2 .
V is naturally an associative C algebra with a derivation T . We define a prefield algebra structure on V as follows: We have the grading on V given by
V = k = 0 n + 1 V k
and each V k is identified with C [ T ] a k . Choose any element
G 1 ( x 1 , , x n ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x n ] ] , G k ( x 1 , , x n ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ]
for 2 k n . Let 1 C = V 0 be the identity element of the prefield algebra. To give the map
· x · : V × V V ( ( x ) ) ,
we define it for graded components of V. We have
( V × V ) k = l + m = k V l × V m , 0 l , m n + 1 .
(i)
For ( V × V ) k where k n , for all u V l and v V m with l + m n , we define
u x v = e x T u v V l + m ( ( x ) ) .
(ii)
For ( V × V ) k with k n + 2 , we let · x · : ( V × V ) k V ( ( x ) ) be the zero map. Hence, when the sum of the degrees exceeds n + 1 , the product vanishes.
(iii)
It now remains to specify · x · on
( V × V ) n + 1 = ( V 0 × V n + 1 ) ( V 1 × V n ) ( V n + 1 × V 0 ) .
For ( 1 , v ) V 0 × V n + 1 , let 1 x v = v . For ( u , 1 ) V n + 1 × V 0 , let u x 1 = e x T u .
(iv)
For the rest of V l × V m with l + m = n + 1 , l , m 1 , we define the product on the following C [ T ] -module generators and let it be generated by the relation ( T a ) x b = x ( a x b ) and a x ( T b ) = ( T x ) ( a x b ) to all of V l V m . Take
T ( j 1 ) a T ( j k 1 ) a a
with j 1 , , j k 1 0 as generators of V k . For V 1 V n , let
a x 1 T ( j 1 ) a T ( j n 1 ) a a = c j 1 j n 1 ( 1 ) ( x 1 ) ,
where c j 1 j n 1 ( 1 ) ( x 1 ) is the coefficient of x 2 j 1 x n j n 1 in
G 1 ( x 1 , , x n ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x n ] ] .
(v)
For V k × V n k + 1 for 2 k n , we define
T ( j 1 ) a T ( j k 1 ) a a x k T ( j k ) a T ( j n 1 ) a a = c j 1 j n 1 ( k ) ( x k )
where c j 1 j n 1 ( k ) ( x k ) is the coefficient of ( x 1 x k ) j 1 ( x k 1 x k ) j k 1 x k + 1 j k x n j n 1 in
G k ( x 1 , , x n ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] .
Then, V is a prefield algebra with the following properties:
(a)
The map · x · : V × V V ( ( x ) ) is degree-preserving.
(b)
If u 1 , , u j V are such that i = 1 j deg u i n , then
X B ( x 1 , , x j ) ( u 1 , u 2 , , u j ) = e ( x 1 x j ) T u 1 e ( x 2 x j ) T u 2 e ( x j 1 x j ) T u j 1 u j , Y B ( x 1 , , x j ) ( u 1 , u 2 , , u j ) = e x 1 T u 1 e x 2 T u 2 e x j T u j
for all B B j .
(c)
If u 1 , , u j V are such that i = 1 j deg u i n + 2 , then
X B ( x 1 , , x j ) ( u 1 , u 2 , , u j ) = Y B ( x 1 , , x j ) ( u 1 , u 2 , , u j ) = 0
for all B B j .
Proof. 
We check that V is a prefield algebra. By (i) and (ii), the prefield algebra axioms in Definition 2 are seen to hold on
( V × V ) k = l + m = k V l × V m , 0 l , m n + 1 ,
for k n or k n + 2 , and it follows from (i) and (ii) that (b) and (c) hold. On ( V × V ) n + 1 = ( V 0 × V n + 1 ) ( V 1 × V n ) ( V n + 1 × V 0 ) , consider the most general degree-preserving map · x · : ( V × V ) n + 1 V n + 1 ( ( x ) ) that satisfies the prefield algebra axioms. The product · x · on V 0 × V n + 1 and V n + 1 × V 0 is dictated by the identity axiom, and thus must be defined as above, as in (iii). Consider V l × V m with l + m = n + 1 , l , m 1 . Because each V l and V m are free C [ T ] -modules, the translation covariance is satisfied if we define · x · on the generators u i of V l and v j of V m and let the translation covariance determine · x · uniquely on the rest of V l V m by the formula
i f i ( T ) u i x j g j ( T ) v j = i , j f i ( x ) g j ( T x ) ( u i x v j )
for any f i ( T ) , g j ( T ) C [ T ] . We take
T ( j 1 ) a T ( j l 1 ) a a V l T ( j l ) a T ( j n 1 ) a a V m
for j 1 , , j n 1 0 as the generators of V l and V m , respectively, with l + m = n + 1 and l , m 1 . Hence, we are free to choose, for each T ( j 1 ) a T ( j l 1 ) a a and T ( j l ) a T ( j n 1 ) a a , an element
( T ( j 1 ) a T ( j l 1 ) a a ) x ( T ( j l ) a T ( j n 1 ) a a ) V n + 1 ( ( x ) ) .
The choices that we make are best organized by generating functions. For V 1 × V n , replacing x with x 1 , we let
G 1 ( x 1 , , x n ) = j 1 , , j n 1 0 x 2 j 1 x n j n 1 a x 1 ( T ( j 1 ) a T ( j n 1 ) a a ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x n ] ] .
It also follows that
G 1 ( x 1 , , x n ) = a x 1 e x 2 T a e x n T a a = a x 1 ( a x 2 ( ( a x n a ) ) ) .
For V k × V n k + 1 for 2 k n , we collect the products into generating functions as
G k ( x 1 , , x n ) = j 1 , , j n 1 0 ( x 1 x k ) j 1 ( x k 1 x k ) j k 1 x k + 1 j k x n j n 1 × ( T ( j 1 ) a T ( j k 1 ) a a ) x k ( T ( j k ) a T ( j n 1 ) a a ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] .
Then we have
G k ( x 1 , , x n ) = ( e ( x 1 x k ) T a e ( x k 1 x k ) T a a ) x k ( e x k + 1 T a e x n T a a ) .
In summary, these generating functions determine the product · x · completely on the generators, and we have freedom to choose any functions
G 1 ( x 1 , , x n ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x n ] ] G k ( x 1 , , x n ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ]
for 2 k n , so that the theorem holds. □

Formal Expansion ι x y

For a formal expression f ( x , y , z , ) , we use the notation ι x y to denote
ι x y f ( x , y , z , ) = e ( x y ) t f ( t , y , z , ) | t = y = j 0 ( x y ) j t ( j ) f ( t , y , z , ) | t = y ,
if the latter expression is well defined. Because the specific domain of the map ι x y varies according to the given situation, it is convenient to have a general discussion first. The following properties hold when a suitable domain is specified.
(i)
If f ( x , y , z , ) is a power series in x , then it is invariant under ι x y , because
ι x y f ( x , y , z , ) = e ( x y ) t f ( t , y , z , ) | t = y = f ( x y + t , y , z , ) | t = y = f ( x , y , z , )
if each step of the argument is well defined.
(ii)
If the product f ( x , y , z , ) g ( x , y , z , ) is defined, then ι x y respects the product, because
ι x y f ( x , y , z , ) g ( x , y , z , ) = e ( x y ) t ( f ( t , y , z , ) g ( t , y , z , ) ) | t = y = e ( x y ) t f ( t , y , z , ) | t = y e ( x y ) t g ( t , y , z , ) | t = y = ι x y f ( x , y , z , ) ι x y g ( x , y , z , ) ,
if each step of the argument is well defined.
(iii)
If the compositions of the expansions are defined, then ι y z ι x y = ι x z ι y z , because
ι y z ι x y f ( x , y , z , ) = e ( y z ) s e ( x s ) t f ( t , s , z , ) | t = s | s = z = e ( y z ) s e ( x y ) t f ( t , s , z , ) | t = s | s = z = e ( y z ) ( t + s ) e ( x y ) t f ( t , s , z , ) | t = z , s = z = e ( x z ) t e ( y z ) s f ( t , s , z , ) | t = z , s = z = ι x z ι y z f ( x , y , z , ) ,
if each step of the argument is well defined. In particular, if f ( x , y , z , ) is a power series in y , then we have
ι y z ι x y f ( x , y , z , ) = ι x z f ( x , y , z , ) .
Example 3.
The map
ι x y : C ( ( x ) ) C ( ( y ) ) ( ( x y ) )
gives a field map which is identity on the common subspace C [ [ x ] ] . In particular,
ι x y ( x 1 ) = j 0 ( 1 ) j y 1 j ( x y ) j
is the reciprocal of x = y + ( x y ) in C ( ( y ) ) ( ( x y ) ) , and it is the formal expansion of x 1 = ( y + ( x y ) ) 1 in the domain | x y | < | y | [15]. The image ι x y C ( ( x ) ) is a subfield of C ( ( y ) ) ( ( x y ) ) isomorphic to C ( ( x ) ) .
Lemma 8.
Let V be a vector space over C . For m 0 , we have a well-defined map
ι x y : V [ [ x , y , z 1 , , z m ] ] [ x 1 ] V ( ( y ) ) [ [ x y , z 1 y , , z m y ] ]
given by(23).
Proof. 
Suppose f ( x , y , z 1 , , z m ) V [ [ x , y , z 1 , , z m ] ] [ x 1 ] . Then,
f ( x , y , z 1 , , z m ) = x N ϕ ( x , y , z 1 , , z m )
for ϕ ( x , y , z 1 , , z m ) V [ [ x , y , z 1 , , z m ] ] . Hence,
ι x y f ( x , y , z , ) = ( e ( x y ) y ( y N ) ) ϕ ( x , y , z 1 , , z m ) .
By writing x = ( x y ) + y and z i = ( z i y ) + y for 1 i m , we see that ϕ ( x , y , z 1 , , z m ) belongs to V [ [ x , y , z 1 , , z m ] ] = V [ [ y , x y , z 1 y , , z m y ] ] , and (25) belongs to V ( ( y ) ) [ [ x y , z 1 y , , z m y ] ] . Equivalently, because
ϕ ( x , y , z 1 , , z m ) = e ( x y ) s e ( z 1 y ) t 1 e ( z m y ) t m ϕ ( s , y , t 1 , , t m ) | s = t 1 = = t m = y ,
we can write
ι x y f ( x , y , z , ) = e ( x y ) s e ( z 1 y ) t 1 e ( z m y ) t m f ( s , y , t 1 , , t m ) | s = t 1 = = t m = y
which is clear in V ( ( y ) ) [ [ x y , z 1 y , , z m y ] ] .
Lemma 8 shows that we have a well-defined map
ι x y : V [ [ x , y , z 1 , , z m ] ] [ x 1 ] V ( ( y ) ) [ [ x y , z 1 y , , z l y , z l + 1 , , z m ] ]
for 0 l m , because V [ [ x , y , z 1 , , z m ] ] [ x 1 ] V [ [ x , y , z 1 , , z l ] ] [ x 1 ] [ [ z l + 1 , , z m ] ] .
Lemma 9.
Let V be a vector space over C . Two elements
f ( x , y , z 1 , , z m ) V [ [ x , y , z 1 , , z m ] ] [ x 1 ] , g ( x , y , z 1 , , z m ) V ( ( y ) ) [ [ x y , z 1 y , , z l y , z l + 1 , , z m ] ]
satisfy
x N f ( x , y , z 1 , , z m ) = x N g ( x , y , z 1 , , z m )
for some N N if and only if
g ( x , y , z 1 , , z m ) = ι x y f ( x , y , z 1 , , z m ) .
Proof. 
V = V [ [ x , y , z 1 , , z m ] ] [ x 1 ] and W = V ( ( y ) ) [ [ x y , z 1 y , , z l y , z l + 1 , , z m ] ] are vector spaces over C ( ( x ) ) and ι x y C ( ( x ) ) , respectively. If
Ψ ( x , y , z 1 , z m ) = x N f ( x , y , z 1 , z m ) = x N g ( x , y , z 1 , z m )
for Ψ ( x , y , z 1 , z m ) V [ [ x , y , z 1 , z m ] ] , multiplying Ψ ( x , y , z 1 , , z m ) = x N f ( x , y , z 1 , , z m ) by x N in V gives
f ( x , y , z 1 , , z m ) = x N Ψ ( x , y , z 1 , , z m ) .
Multiplying Ψ ( x , y , z 1 , , z m ) = x N g ( x , y , z 1 , , z m ) by ι x y ( x N ) in W gives
g ( x , y , z 1 , , z m ) = ι x y ( x N ) Ψ ( x , y , z 1 , , z m )
and (26) follows. Conversely, if (26) holds, then writing
f ( x , y , z 1 , z m ) = x N Ψ ( x , y , z 1 , z m )
for Ψ ( x , y , z 1 , z m ) V [ [ x , y , z 1 , z m ] ] , we have
g ( x , y , z 1 , z m ) = ι x y ( x N ) Ψ ( x , y , z 1 , z m ) ,
and multiplying by x N gives
x N g ( x , y , z 1 , z m ) = Ψ ( x , y , z 1 , z m ) = x N f ( x , y , z 1 , z m )
and the lemma follows. □
Lemma 10.
Let n 3 . The prefield algebra V defined in Theorem 1 is n-associative if and only if all of the following conditions are satisfied for the generating functions in (20).
(i)
For 2 i n 1 ,
G 1 ( x 1 , , x n ) V n + 1 [ [ x 1 , , x ^ i , x n ] ] [ x 1 1 ] [ [ x i x i + 1 ] ] , G 1 ( x 1 , , x n ) V n + 1 [ [ x 1 , , x n 1 ] ] [ x 1 1 ] [ [ x n ] ] , G 2 ( x 1 , , x n ) V n + 1 [ [ x 2 , , x n ] ] [ x 2 1 ] [ [ x 1 x 2 ] ] .
(ii)
For 2 k n ,
G k ( x 1 , , x n ) = ι x 1 x k G 1 ( x 1 , , x n ) .
(iii)
For 3 k n ,
G k ( x 1 , , x n ) = ι x 2 x k G 2 ( x 1 , , x n ) .
where ι x 1 x k and ι x 2 x k are the maps given by the Formula (23).
Proof. 
By Theorem 1, it is only nontrivial to check the n-associativity of the vectors in V when the sum of the degrees is n + 1 . By Lemma 6, it is enough to consider the n-associativity of the generators of V as a C [ T ] module. We can take the generators to be
1 , a , T ( j 1 ) a a , T ( j 1 ) a T ( j 2 ) a a ,
with j i 0 and consider the cases where the sum of the degrees is n + 1 . It is easy to see that considering the n-associativity of the n vectors
a , , a , T ( j ) a a , a , , a
suffices, where the element T ( j ) a a is at the ith position for 1 i n , j 0 . Indeed, if (27) are n-associative, then by Lemma 4, the n 1 vectors given by
a , , a , T ( j 1 ) a T ( j 2 ) a a , a , , a , or
a , , a , T ( j 1 ) a a , , T ( j 2 ) a a , a , , a
are ( n 1 ) -associative, and by Lemma 7, the n vectors
a , , a , T ( j 1 ) a T ( j 2 ) a a , a , , 1 , , a
a , , a , T ( j 1 ) a a , , T ( j 2 ) a a , a , , 1 , , a
are n-associative. Continuing this way, we obtain all possible combinations of generators whose degrees sum to n + 1 involving more 1s.
Let B ( x 1 , , x n ) B n ( x 1 , , x n ) . Let o always denote the root, with children u and v . We have a partition of the set of leaves into { x 1 , , x s } { x s + 1 , , x n } consisting of the leaves of u and v , respectively, for 1 s n 1 . In this case, we say that B splits at s . We define B n ( s ) to be the subset of B n consisting of those that split at s . Hence, we have a partition of B n into 1 s n 1 B n ( s ) .
Let i be the position of the vector T ( j ) a a in (27) for a fixed j 0 . First, we consider the case i = 1 , namely, the n-associativity of
T ( j ) a a , a , , a .
For each j 0 , the expression Y B ( x 1 , , x n ) ( T ( j ) a a , a , , a ) for B B n only depends on 1 s n 1 where B splits.
(i)
Case i = 1 and s = 1 .
Suppose B splits at s = 1 . Then, for o = u v in B ( x 1 , , x n ) , we have
X u ( T ( j ) a a ) = T ( j ) a a , X v ( a , , a ) = e ( x 2 x n ) T a e ( x 3 x n ) T a e ( x n 1 x n ) T a a ,
and, therefore,
Y B ( x 1 , , x n 1 , 0 ) ( T ( j ) a a , a , , a ) = ( T ( j ) a a ) x 1 ( e x 2 T a e x 3 T a e x n 1 T a a ) .
By a change in variables,
Y B ( x 2 , , x n , 0 ) ( T ( j ) a a , a , , a ) = ( T ( j ) a a ) x 2 ( e x 3 T a e x 4 T a e x n T a a ) .
By (22), this is the coefficient of ( x 1 x 2 ) j of
G 2 ( x 1 , x 2 , , x n ) = ( e ( x 1 x 2 ) T a a ) x 2 ( e x 3 T a e x 4 T a e x n T a a )
which is an element in
V n + 1 ( ( x 2 ) ) [ [ x 1 x 2 , x 3 , , x n ] ] .
Writing G 2 ( x 1 , x 2 , , x n ) = j 0 ( x 1 x 2 ) j G 2 , j ( x 2 , , x n ) , we have
G 2 , j ( x 2 , , x n ) V n + 1 ( ( x 2 ) ) [ [ x 3 , , x n ] ] .
(ii)
Case i = 1 and 2 s n 1 .
Suppose now B B n ( s ) for 2 s n 1 . Let k = s + 1 , 3 k n . For o = u v , we have
X u ( T ( j ) a a , a , , a ) = e ( x 1 x k 1 ) T ( T ( j ) a a ) e ( x 2 x k 1 ) T a e ( x k 2 x k 1 ) T a a , X v ( a , , a ) = e ( x k x n ) T a e ( x k + 1 x n ) T a e ( x n 1 x n ) T a a .
Thus,
Y B ( x 1 , , x n 1 , 0 ) ( T ( j ) a a , a , , a ) = ( e ( x 1 x k 1 ) T ( T ( j ) a a ) e ( x 2 x k 1 ) T a e ( x k 2 x k 1 ) T a a ) x k 1 × ( e x k T a e x k + 1 T a e x n 1 T a a ) ,
and with a change in variables,
Y B ( x 2 , , x n , 0 ) ( T ( j ) a a , a , , a ) = ( e ( x 2 x k ) T ( T ( j ) a a ) e ( x 3 x k ) T a e ( x k 1 x k ) T a a ) x k × ( e x k + 1 T a e x k + 2 T a e x n T a a ) .
Hence, it is obtained as the ( x 1 x 2 ) j coefficient of
G k ( x 1 , x 2 , x n ) = ( e ( x 1 x k ) T a e ( x 2 x k ) T a e ( x k 1 x k ) T a a ) x k × ( e x k + 1 T a e x k + 2 T a e x n T a a ) = ( e ( x 2 x k ) T ( e ( x 1 x 2 ) T a a ) e ( x 3 x k ) T a e ( x k 1 x k ) T a a ) x k × ( e x k + 1 T a e x k + 2 T a e x n T a a )
which belongs to
V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] = V n + 1 ( ( x k ) ) [ [ x 2 x k , , x k 1 x k , x k + 1 , , x n ] ] [ [ x 1 x 2 ] ]
by writing x 1 x k as ( x 1 x 2 ) + ( x 2 x k ) . Writing G k ( x 1 , , x n ) = j 0 ( x 1 x 2 ) j G k , j ( x 2 , , x n ) , we have
G k , j ( x 2 , , x n ) V n + 1 ( ( x k ) ) [ [ x 2 x k , , x k 1 x k , x k + 1 , , x n ] ] .
We now combine the cases (i) and (ii). Suppose the vectors in (28) are n-associative. We have Ψ j ( x 2 , , x n ) V n + 1 [ [ x 2 , , x n ] ] and N j N such that
Ψ j ( x 2 , , x n ) = s n ( x 2 , , x n , 0 ) N j G k , j ( x 2 , , x n )
for all 2 k n . Because G 2 , j ( x 2 , , x n ) V n + 1 ( ( x 2 ) ) [ [ x 3 , , x n ] ] ,   Ψ j ( x 2 , , x n ) must have a factor
x 3 x n 3 p < q n ( x p x q ) N j .
Because G k , j ( x 2 , , x n ) V ( ( x k ) ) [ [ x 2 x k , , x k 1 x k , x k + 1 , , x n ] ] ,   Ψ j ( x 2 , , x n ) must also have a factor ( x 2 x k ) N j for all 3 k n . Canceling these factors in (30) for k = 2 , we conclude that
x 2 N j G 2 , j ( x 2 , , x n ) V n + 1 [ [ x 2 , , x n ] ] ,
and thus
G 2 , j ( x 2 , , x n ) V n + 1 [ [ x 2 , , x n ] ] [ x 2 1 ] ,
and
x 2 N j G 2 , j ( x 2 , , x n ) = x 2 N j G k , j ( x 2 , , x n )
for all 3 k n . Therefore, by Lemma 9, we must have
G k , j ( x 2 , , x n ) = ι x 2 x k G 2 , j ( x 2 , , x n )
for all 3 k n . Conversely, if (31) and (33) hold, it follows from Lemma 9 that (29) and (32) hold, and the vectors in (28) are n-associative. The conditions for all j 0 can equivalently be written as
G 2 ( x 1 , , x n ) V n + 1 [ [ x 2 , , x n ] ] [ x 2 1 ] [ [ x 1 x 2 ] ] G k ( x 1 , , x n ) = ι x 2 x k G 2 ( x 1 , , x n )
for all 3 k n .
Now consider the n-associativity of
a , , a , T ( j ) a a , a , , a
where T ( j ) a a is at the ith position, for a fixed 2 i n and j 0 .
(iii)
Case 2 i < n and s = 1 .
Suppose B splits at s = 1 . For o = u v ,
X u ( a ) = a , X v ( a , , T ( j ) a a , , a ) = e ( x 2 x n ) T a e ( x i x n ) T ( T ( j ) a a ) e ( x n 1 x n ) T a a .
By changing variables to x 1 , , x ^ i , , x n , 0 , we obtain
Y B ( x 1 , , x ^ i , , x n , 0 ) ( a , , a , T ( j ) a a , a , , a ) = a x 1 ( e x 2 T a e x i 1 T a e x i + 1 T ( T ( j ) a a ) e x n T a a ) .
We obtain this by taking ( x i x i + 1 ) j coefficient of
G 1 ( x 1 , , x n ) = a x 1 ( e x 2 T a e x i T a e x i + 1 T a e x n T a a ) = a x 1 ( e x 2 T a e x i + 1 T ( e ( x i x i + 1 ) T a a ) e x n T a a ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x n ] ]
where we have
V n + 1 ( ( x 1 ) ) [ [ x 2 , , x n ] ] = V n + 1 ( ( x 1 ) ) [ [ x 2 , , x ^ i , , x n ] ] [ [ x i x i + 1 ] ] .
We write
G 1 ( x 1 , , x n ) = j 0 ( x i x i + 1 ) j G 1 , j [ i ] ( x 1 , , x ^ i , , x n )
where
G 1 , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x ^ i , , x n ] ] .
(iv)
Case 3 i < n and 2 s i 1 .
Here, we have, for o = u v ,
X u ( a , , a ) = e ( x 1 x s ) T a e ( x s 1 x s ) T a a , X v ( a , , T ( j ) a a , , a ) = e ( x s + 1 x n ) T a e ( x i 1 x n ) T a e ( x i x n ) T ( T ( j ) a a ) × e ( x n 1 x n ) T a a .
By a change in variables,
Y B ( x 1 , , x ^ i , , x n , 0 ) ( a , , a , T ( j ) a a , a , , a ) = ( e ( x 1 x s ) T a e ( x s 1 x s ) T a a ) x s × ( e x s + 1 T a e x i 1 T a e x i + 1 T ( T ( j ) a a ) e x n T a a ) .
With k = s , this is obtained as the ( x i x i + 1 ) j coefficient of
G k ( x 1 , , x n ) = ( e ( x 1 x k ) T a e ( x k 1 x k ) T a a ) x k ( e x k + 1 T a e x n T a a ) = ( e ( x 1 x k ) T a e ( x k 1 x k ) T a a ) x k × ( e x k + 1 T a e x i + 1 T ( e ( x i x i + 1 ) T a a ) e x n T a a )
which is in
V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] = V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x ^ i , , x n ] ] [ [ x i x i + 1 ] ] .
Expanding G k ( x 1 , , x n ) = j 0 ( x i x i + 1 ) j G k , j [ i ] ( x 1 , , x ^ i , , x n ) , we have
G k , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x ^ i , , x n ] ] .
(v)
Case i = n and 1 s i 1 .
Here, we have, for o = u v ,
X u ( a , , a ) = e ( x 1 x s ) T a e ( x s 1 x s ) T a a , X v ( a , , a , T ( j ) a a ) = e ( x s + 1 x n ) T a e ( x n 1 x n ) T a ( T ( j ) a a ) .
By a change in variables to x 1 , , x ^ i , , x n , 0 , which is x 1 , , x n 1 , 0 because i = n ,
Y B ( x 1 , , x n 1 , 0 ) ( a , , a , T ( j ) a a ) = ( e ( x 1 x s ) T a e ( x s 1 x s ) T a a ) x s × ( e x s + 1 T a e x n 1 T a ( T ( j ) a a ) ) .
With k = s , this is obtained as the x n j coefficient of
G k ( x 1 , , x n ) = ( e ( x 1 x k ) a e ( x k 1 x k ) T a a ) x k ( e x k + 1 T a e x n T a a ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] = V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n 1 ] ] [ [ x n ] ] .
Expanding G k ( x 1 , , x n ) = j 0 x n j G k , j [ n ] ( x 1 , , x n 1 ) , we have
G k , j [ n ] ( x 1 , , x n 1 ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n 1 ] ] .
(vi)
Case 2 i n 1 and s = i .
In this case, for o = u v , we have
X u ( a , , a , T ( j ) a a ) = e ( x 1 x s ) T a e ( x s 1 x s ) T a ( T ( j ) a a ) , X v ( a , , a ) = e ( x s + 1 x n ) T a e ( x n 1 x n ) T a a .
By a change in variables,
Y B ( x 1 , , x ^ i , , x n , 0 ) ( a , , a , T ( j ) a a , a , , a ) = ( e ( x 1 x s + 1 ) T a e ( x s 1 x s + 1 ) T a ( T ( j ) a a ) ) x s + 1 × ( e x s + 2 T a e x n T a a ) .
With k = s + 1 = i + 1 , this is obtained as the ( x i x i + 1 ) j coefficient of
G k ( x 1 , , x n ) = ( e ( x 1 x k ) T a e ( x k 1 x k ) T a a ) x k ( e x k + 1 T a e x n T a a ) = ( e ( x 1 x k ) T a e ( x i x i + 1 ) T a a ) x k ( e x k + 1 T a e x n T a a ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] = V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 2 x k , x k + 1 , , x n ] ] [ [ x i x i + 1 ] ] .
We write G k ( x 1 , , x n ) = j 0 ( x i x i + 1 ) j G k , j [ i ] ( x 1 , , x ^ i , , x n ) , with
G k , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 2 x k , x k + 1 , , x n ] ] .
(vii)
Case 2 i n 2 and i + 1 s n 1 .
In this case, for o = u v , we have
X u ( a , , T ( j ) a a , , a ) = e ( x 1 x s ) T a e ( x i x s ) T ( T ( j ) a a ) e ( x s 1 x s ) T a a , X v ( a , , a ) = e ( x s + 1 x n ) T a e ( x n 1 x n ) T a a .
By a change in variables,
Y B ( x 1 , , x ^ i , , x n , 0 ) ( a , , a , T ( j ) a a , a , , a ) = ( e ( x 1 x s + 1 ) T a e ( x i 1 x s + 1 ) T a e ( x i + 1 x s + 1 ) T ( T ( j ) a a ) e ( x s x s + 1 ) T a a ) x s + 1 ( e x s + 2 T a e x n T a a ) .
With k = s + 1 , this is obtained as the ( x i x i + 1 ) j coefficient of
G k ( x 1 , , x n ) = ( e ( x 1 x k ) T a e ( x k 1 x k ) T a a ) x k ( e x k + 1 T a e x n T a a ) = ( e ( x 1 x k ) T a e ( x i + 1 x k ) T ( e ( x i x i + 1 ) T a a ) e ( x k 1 x k ) T a a ) x k × ( e x k + 1 T a e x n T a a ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x n ] ] = V n + 1 ( ( x k ) ) [ [ x 1 x k , , x i x k ^ , , x k 1 x k , x k + 1 , , x n ] ] [ [ x i x i + 1 ] ] .
We write G k ( x 1 , , x n ) = j 0 ( x i x i + 1 ) j G k , j [ i ] ( x 1 , , x ^ i , , x n ) , with
G k , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 ( ( x k ) ) [ [ x 1 x k , , x i x k ^ , , x k 1 x k , x k + 1 , , x n ] ] .
Cases (iii)–(vii) cover all points in the rectangle 2 i n and 1 s n 1 . Cases (iii)–(v) cover all the cases s < i ; in this case, with k = s , Y B ( x 1 , , x ^ i , , x n , 0 ) ( a , , a , T ( j ) a a , a , , a ) is obtained from the ( x i x i + 1 ) j coefficient of G k ( x 1 , , x n ) , with the understanding that x i x i + 1 = x n if i = n . Cases (vi) and (vii) cover all cases s i , and in this case, the same is true except we should take k = s + 1 . Hence, for a fixed 2 i n , we have 1 k n with k i .
Suppose (27) is n-associative for a fixed 2 i n and j 0 . We have Ψ i j ( x 1 , , x ^ i , , x n ) V n + 1 [ [ x 1 , , x ^ i , , x n ] ] and N i j N such that
Ψ i j ( x 1 , , x ^ i , , x n ) = s n ( x 1 , , x ^ i , , x n , 0 ) N i j G k , j [ i ] ( x 1 , , x ^ i , , x n )
for all 1 k n with k i . Because G 1 , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 ( ( x 1 ) ) [ [ x 2 , , x ^ i , , x n ] ] , Ψ i j ( x 1 , , x ^ i , , x n ) must have a factor
x 2 x ^ i x n 2 p < q n p , q i ( x p x q ) N i j .
Because G k , j [ i ] ( x 1 , , x ^ i , , x n ) belongs to V n + 1 ( ( x k ) ) [ [ x 1 x k , , x i x k ^ , , x k 1 x k , x k + 1 , , x n ] ] for k > i and to V n + 1 ( ( x k ) ) [ [ x 1 x k , , x k 1 x k , x k + 1 , , x ^ i , , x n ] ] for k < i , we see that Ψ i j ( x 1 , , x ^ i , , x n ) must also have a factor ( x 1 x k ) N i j for all 2 k n ,   k i . Canceling these factors for k = 1 , we conclude that
x 1 N i j G 1 , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 [ [ x 1 , , x ^ i , , x n ] ]
and thus
G 1 , j [ i ] ( x 1 , , x ^ i , , x n ) V n + 1 [ [ x 1 , , x ^ i , , x n ] ] [ x 1 1 ]
and
x 1 N i j G 1 , j [ i ] ( x 1 , , x ^ i , , x n ) = x 1 N i j G k , j [ i ] ( x 1 , , x ^ i , , x n )
for all 2 k n , k i . Therefore, by Lemma 9, we must have
G k , j [ i ] ( x 1 , , x ^ i , , x n ) = ι x 1 x k G 1 , j [ i ] ( x 1 , , x ^ i , , x n )
for all 2 k n , k i . Conversely, if (35) and (36) hold, it also follows from Lemma 9 that (27) are n-associative. Because G 1 , j [ i ] ( x 1 , , x ^ i , , x n ) for j 0 are obtained as the ( x i x i + 1 ) j coefficient of G 1 ( x 1 , , x n ) , the conditions for n-associativity for all j 0 can be written as
G 1 ( x 1 , , x n ) V n + 1 [ [ x 1 , , x ^ i , x n ] ] [ x 1 1 ] [ [ x i x i + 1 ] ] G k ( x 1 , , x n ) = ι x 1 x k G 1 ( x 1 , , x n )
for all 2 k n with k i , with x i x i + 1 = x n if i = n . Requiring these conditions for all 2 i n implies that (37) should hold for all 2 k n . Combining with (34), the lemma follows. □
Theorem 2.
Let n 3 . Let V be a prefield algebra in Theorem 1 defined with the functions
G 1 ( x 1 , , x n ) = exp ( x 1 x 2 ) ( x 2 x 3 ) ( x n 1 x n ) x n x 1 a ( n + 1 ) , G k ( x 1 , , x n ) = ι x 1 x k exp ( x 1 x 2 ) ( x 2 x 3 ) ( x n 1 x n ) x n x 1 a ( n + 1 )
for 2 k n . Then, V is n-associative, but it is not ( n + 1 ) -associative. Hence, the condition of ( n + 1 ) -associativity is strictly stronger than n-associativity for all n 3 .
Proof. 
We use the fact that for any commutative associative C -algebra A , if u ( x 1 , , x k ) A [ [ x 1 , , x k ] ] has the vanishing constant term, then for any f ( x ) C [ [ x ] ] , the composition f ( u ( x 1 , , x k ) ) is well defined as an element of A [ [ x 1 , , x k ] ] . We verify that G k ( x 1 , , x n ) , 1 k n , satisfy the conditions for n-associativity of V given in Lemma 10. Let
P ( x 1 , , x n ) = ( x 1 x 2 ) ( x 2 x 3 ) ( x n 1 x n ) x n x 1 .
With the understanding that x n + 1 = 0 , we have
P ( x 1 , , x n ) = ( x 1 x 2 ) ( x i 1 x i + 1 ) ( x i x i + 1 ) ( x i x i + 1 ) ( x n 1 x n ) x n x 1 C [ [ x 1 , , x ^ i , , x n ] ] [ x 1 1 ] [ [ x i x i + 1 ] ]
in the ideal generated by x i x i + 1 for all 2 i n . Hence,
G 1 ( x 1 , , x n ) = ( exp P ( x 1 , , x n ) ) a ( n + 1 ) V n + 1 [ [ x i , , x ^ i , x n ] ] [ x 1 1 ] [ [ x i x i + 1 ] ]
for all 2 i n , and the identities
G k ( x 1 , , x n ) = ι x 1 x k G 1 ( x 1 , , x n )
for all 2 k n in Lemma 10 are satisfied by definition. We also need to verify
G 2 ( x 1 , , x n ) V n + 1 [ [ x 2 , , x n ] ] [ x 2 1 ] [ [ x 1 x 2 ] ] .
This follows because we have G 2 ( x 1 , , x n ) = exp ι x 1 x 2 P ( x 1 , , x n ) a ( n + 1 ) , where
ι x 1 x 2 P ( x 1 , , x n ) = j 0 ( 1 ) j x 2 1 j ( x 1 x 2 ) j ( x 1 x 2 ) ( x 2 x 3 ) ( x n 1 x n ) x n
which belongs to the ideal generated by x 1 x 2 in C [ [ x 2 , x n ] ] [ x 2 1 ] [ [ x 1 x 2 ] ] . Finally, the identities
G k ( x 1 , , x n ) = ι x 2 x k G 2 ( x 1 , , x n )
for 3 k n are the consequences of the fact that ι x 2 x k ι x 1 x 2 P ( x 1 , , x n ) = ι x 1 x k P ( x 1 , , x n ) , which holds by (24). Hence, V is n-associative. By (21), we have
G 1 ( x 1 , , x n ) = a x 1 ( a x 2 ( ( a x n a ) ) ) = Y x 1 ( x 2 ( ( x n 0 ) ) ) ( a , a , a )
for the n + 1 vectors a , a , , a V . They do not satisfy ( n + 1 ) -associativity because the presence of an “essential singularity” along x 1 in G 1 ( x 1 , , x n ) shows
s n + 1 ( x 1 , , x n , 0 ) N Y x 1 ( x 2 ( ( x n 0 ) ) ) ( a , a , a ) V [ [ x 1 , , x n ] ]
for any N N .

5. Conclusions

Vertex algebras are analogous to the commutative and associative algebras, and field algebras generalize vertex algebras by only requiring the associative properties. We defined the notion of higher-order associativity of field algebras. If F n is the class of field algebras that are n-associative, then by Theorem 2, the inclusions (2) can be written as proper inclusions
F 3 F 4 F 5 F .
We may phrase this phenomenon by saying that even if the product of every n fields is associative and has only meromorphic operator product expansion, the product of more fields may develop an essential singularity. One may wonder if this can be used to an advantage to find some strange but interesting examples.
On the other hand, we may want to specify the class F in an efficient way. We can certainly require the -associativity in Definition 3. The notion of meromorphic field algebras was given in [12] with an equivalent definition as a formally rational deformation operad. Whether there exists a simpler description remains a question.

Funding

This work was supported by the Hongik University Research Fund.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Borcherds, R.E. Vertex algebras, Kac-Moody algebras, and the Monster. Proc. Natl. Acad. Sci. USA 1986, 83, 3068–3071. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Borcherds, R.E. Vertex algebras. In Topological Field Theory, Primitive Forms and Related Topics (Kyoto, 1996); Birkhäuser Boston: Boston, MA, USA, 1998; Volume 160, pp. 35–77. [Google Scholar] [CrossRef]
  3. Borcherds, R.E. Quantum vertex algebras. In Taniguchi Conference on Mathematics Nara ’98; Math. Soc. Japan: Tokyo, Japan, 2001; Volume 31, pp. 51–74. [Google Scholar] [CrossRef]
  4. Wilson, K.G. Non-Lagrangian Models of Current Algebra. Phys. Rev. 1969, 179, 1499–1512. [Google Scholar] [CrossRef]
  5. Wilson, K.G. Operator-Product Expansions and Anomalous Dimensions in the Thirring Model. Phys. Rev. D 1970, 2, 1473–1477. [Google Scholar] [CrossRef]
  6. Belavin, A.A.; Polyakov, A.M.; Zamolodchikov, A.B. Infinite conformal symmetry in two-dimensional quantum field theory. Nucl. Phys. B 1984, 241, 333–380. [Google Scholar] [CrossRef] [Green Version]
  7. Zamolodchikov, A.B. Infinite additional symmetries in two-dimensional conformal quantum field theory. Theor. Math. Phys. 1985, 65, 1205–1213. [Google Scholar] [CrossRef]
  8. Bakalov, B.; Kac, V.G. Field algebras. Int. Math. Res. Not. 2003, 3, 123–159. [Google Scholar] [CrossRef]
  9. Li, H. Axiomatic G1-vertex algebras. Commun. Contemp. Math. 2003, 5, 281–327. [Google Scholar] [CrossRef] [Green Version]
  10. Li, H. Nonlocal vertex algebras generated by formal vertex operators. Sel. Math. 2005, 11, 349–397. [Google Scholar] [CrossRef]
  11. Etingof, P.; Kazhdan, D. Quantization of Lie bialgebras. V. Quantum vertex operator algebras. Sel. Math. 2000, 6, 105–130. [Google Scholar] [CrossRef]
  12. Kim, N. Associativity of field algebras. Ann. Henri Poincaré 2011, 12, 1145–1168. [Google Scholar] [CrossRef]
  13. Stanley, R.P. Hipparchus, Plutarch, Schröder, and Hough. Am. Math. Mon. 1997, 104, 344–350. [Google Scholar] [CrossRef]
  14. Rosen, K.H. Discrete Mathematics and Its Applications, 5th ed.; McGraw-Hill Higher Education: New York, NY, USA, 2002. [Google Scholar]
  15. Kac, V. Vertex Algebras for Beginners, 2nd ed.; University Lecture Series; American Mathematical Society: Providence, RI, USA, 1998; Volume 10, p. vi+201. [Google Scholar] [CrossRef]
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

Kim, N. Higher-Order Associativity in Field Algebras. Mathematics 2023, 11, 206. https://doi.org/10.3390/math11010206

AMA Style

Kim N. Higher-Order Associativity in Field Algebras. Mathematics. 2023; 11(1):206. https://doi.org/10.3390/math11010206

Chicago/Turabian Style

Kim, Namhoon. 2023. "Higher-Order Associativity in Field Algebras" Mathematics 11, no. 1: 206. https://doi.org/10.3390/math11010206

APA Style

Kim, N. (2023). Higher-Order Associativity in Field Algebras. Mathematics, 11(1), 206. https://doi.org/10.3390/math11010206

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