The Setting
The even-index bound concerns the parity of the indices in the elimination expansion of a Lie polynomial over . Its selected component is compared with a component of a quadratic expression in and .
For a commutative ring and an alphabet , write for the ordinary free Lie algebra on ✦ and for the free associative algebra, whose basis consists of the words on .✦ A letter and its one-letter associative monomial are written with the same symbol. The universal associative embedding is the Lie homomorphism sending every free generator to its associative monomial, with commutator bracket in the target.✦
Associative evaluation is the algebra homomorphism extending an assignment of letters to a -algebra✦; Lie evaluation is the Lie homomorphism extending an assignment to a Lie algebra over . Renaming along an alphabet map is the homomorphism of free Lie algebras or free associative algebras that sends each free generator to the generator bearing its new name.
For a letter weight , the weight of a word is the sum of its letter weights.✦ The prescribed word span and word support projection , for a condition on words, are the submodule and linear map in (1): (1) The homogeneous component and filtration submodule of the free associative algebra on are the submodules, and the homogeneous projection is the linear map on that algebra, specified by (2): (2)
Elimination and Quadratic Substitution
For an alphabet , the indexed free Lie algebra has one free generator for each pair .✦ The index shift on is the unique derivation with , obtained by free derivation extension.✦ The scalar shift action of the abelian Lie algebra on is the Lie algebra action sending to .✦ Let be the free Lie algebra with distinguished generator and generators .✦
The elimination expansion is the Lie homomorphism to the semidirect sum determined by (3): (3) The iterated commutator substitution is the associative evaluation homomorphism in (4): (4)✦ Here denotes successive brackets with , starting from .✦
Take and , and write . The binary alphabet identification sends to and to ; let denote its Lie renaming map. The elimination fiber of is the associative polynomial defined by (5), where the subscript selects the coordinate: (5) On the elimination alphabet, length and even-index weight are the letter weights in (6), so zero is an even index: (6)
The binary commutator substitution is the associative algebra homomorphism obtained by following with associative renaming , .✦ The binary swap is associative evaluation at ✦, and the swapped input substitution is specified with in (7): (7) The antisymmetry defect of a binary Lie polynomial is the Lie polynomial given by , with the second term obtained by Lie evaluation at .
The quadratic alphabet consists of the slots .✦ The quadratic substitution and quadratic Lie evaluation are the homomorphisms in (8): (8) The slots have weights , respectively. The -degree and -count on the quadratic alphabet are the letter weights in (9): (9) The -count differs from ordinary -depth: has depth one and -count zero. Write for the constant letter weight one on .
The Claim
Theorem 1 (Even-index bound and swapped component). Let , and let satisfy . Let satisfy . For a nonnegative integer with , the even-index filtration bound is (10): (10)✦ When , for each nonnegative integer the swapped selected component satisfies (11): (11)✦
In the paper, the result reads: for , in the paper’s filtered weight- space , and , the original -bidegree- component of is an associative linear combination of products with at least even indices, including zero as even, its image under is exactly the projected leading part , and if .
What Is Checked
The statements are over ordinary free Lie algebras over , the elimination expansion into the semidirect sum defined by the shift derivation, and the word spans and projections in their free associative algebras.